2017西安电子科技大学第十五届“华为杯”大学生程序设计竞赛网络赛

 1 #include <bits/stdc++.h>
 2  
 3 using namespace std;
 4  
 5 int a[26];
 6  
 7 int BKDRHash(string str)
 8 {
 9     int seed = 131; // 31 131 1313 13131 131313 etc..
10     int hash = 0;
11  
12     for(int i=0;i<str.length();i++)
13         hash = hash * seed + (str[i]-‘a‘+1);
14  
15     return (hash & 0x7FFFFFFF);
16 }
17  
18 int main()
19 {
20     int n;
21     while(scanf("%d",&n)!=EOF)
22     {
23  
24         int cnt = 0;
25         string str;
26         map<int,int> s;
27         vector<string> v[10000];
28         while(n--)
29         {
30             cin>>str;
31             string tmp = str;
32             int len = str.length();
33             sort(tmp.begin(),tmp.end());
34             int hashs= BKDRHash(tmp);
35  
36  
37             if(s.count(hashs)>0)
38             {
39                 v[s[hashs]].push_back(str);
40             }
41             else
42             {
43                 s[hashs] = cnt;
44                 v[cnt++].push_back(str);
45             }
46         }
47  
48         for(int i=0; i<cnt; i++)
49         {
50             int x = v[i].size();
51             for(int j=0; j<x-1; j++)
52             {
53                 cout<<v[i][j]<<" ";
54             }
55             cout<<v[i][x-1];
56             puts("");
57         }
58     }
59  
60  
61     return 0;
62 }
63  
64 /**************************************************************
65     Problem: 1191
66     User: 20153780
67     Language: C++
68     Result: 正确
69     Time:276 ms
70     Memory:1968 kb
71 ****************************************************************/

 1 /*
 2 #include <bits/stdc++.h>
 3 
 4 using namespace std;
 5 
 6 const int maxn = 1005;
 7 int winning[maxn][maxn];
 8 
 9 int main()
10 {
11     int a,b,c,d;
12     freopen("out.txt","w",stdout);
13     while(scanf("%d%d%d%d",&a,&b,&c,&d)!=EOF)
14     {
15         winning[0][0] = false;
16         for(int i=0; i<=a; i++)
17         {
18             for(int j=0; j<=b; j++)
19             {
20                 winning[i][j]=false;
21 
22                 bool flag = false;
23                 for(int s=1; s<=c; s++)
24                 {
25                     if(i>=s&&!winning[i-s][j]) {
26                         winning[i][j] = true;
27                         flag = true;
28                         break;
29                     }
30                 }
31 
32                 if(flag)
33                     continue;
34                 for(int t=1; t<=d; t++)
35                 {
36                     if(j>=t&&!winning[i][j-t]) {
37                         winning[i][j] = true;
38                         break;
39                     }
40                 }
41             }
42         }
43 
44         if(winning[a][b])
45             puts("NUO!");
46         else puts("NO!");
47     }
48 
49     return 0;
50 }
51 */
52 
53 
54 #include <bits/stdc++.h>
55 
56 using namespace std;
57 
58 int a,b,c,d;
59 int sg[1005];
60 bool vis[1005];
61 int SG(int x,int k)
62 {
63     memset(sg,0,sizeof(sg));
64     sg[0] = 0;
65 
66     for(int i=1; i<=x; i++)
67     {
68         memset(vis,0,sizeof(vis));
69         for(int j=1; j<=k&&j<=i;j++)
70             vis[sg[i-j]]=1;
71         for(int j=0;; j++)
72             if(!vis[j])
73             {
74                 sg[i] = j;
75                 break;
76             }
77     }
78     return sg[x];
79 }
80 
81 int main()
82 {
83     while(scanf("%d%d%d%d",&a,&b,&c,&d)!=EOF)
84     {
85         int v = 0;
86         v^=SG(a,c);
87         v^=SG(b,d);
88         if(v)
89             puts("NUO!");
90         else
91             puts("NO!");
92     }
93     return 0;
94 }