重新认识三观

时间：2014-07-09 14:44:49 阅读：217 评论：0 收藏：0 [点我收藏+]

0 0

Wow! Such String! HDU 4850

西安邀请赛的D

从zzzz开始可以倒着卡值，顺着遍历能

弄出所有的符合要求的字符串

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <queue>
 4 #include <map>
 5 #include <string>
 6 #include <cmath>
 7 #include <iostream>
 8 #include <time.h>
 9 #include <algorithm>
10 #include <map>    
11 using namespace std;
12 #define ll long long
13 #define maxn 200005
14 const ll mod = 1000000007;
15 int n, m, k, s, t;
16 int a[26][26][26][26];
17 int main(){
18     int x = 0;
19     while (scanf("%d", &n) != EOF){
20         if (n >= 456980){ printf("Impossible\n"); continue; }
21         memset(a, 0, sizeof a);
22         a[25][25][25][25] = 1;
23         int z = 25, x = 25, c = 25, v = 25;
24         for (int i = 0; i < min(4,n); i++)printf("z");
25         for (int i = 4; i < n; i++)
26             for (int j = 0; j < 26; j++)
27                 if (!a[x][c][v][j]){
28                     a[x][c][v][j] = 1;
29                     printf("%c", ‘a‘ + j);
30                     x = c; c = v; v = j;
31                     break;
32                 }
33         printf("\n");
34     }
35 }