CCPC吉林站

A.The Fool

 #include <bits/stdc++.h>
 using namespace std;

 inline int read()
 {
     int x=,f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
     return x*f;
 }

 /********************************************************************/

 int main(){
     int t; t = read();
     int cnt = ;
     while(t--){
         cnt++;
         int n; n = read();
         int last = ;
         int ans = ;
         for(int i = ;i <= n;i = last){
             int j = n/(n/i);
             ans += (j-i+)*(n/i);
             last = j+;
         }
         if(n&) printf("Case %d: odd\n", cnt);
         else printf("Case %d: even\n", cnt);
     }
     return ;
 }

B.The World

模拟

C.Justice

 //似乎卡过去了,可能需要更优化

 #include <bits/stdc++.h>
 using namespace std;

 inline int read()
 {
     int x=,f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
     return x*f;
 }

 /********************************************************************/

 const int maxn = 1e5+;

 struct node{
     int id;
     int val;
     vector<int>son;
 }now;

 vector<node>a;
 int num[maxn];

 bool cmp(node x, node y){
     return x.val < y.val;
 }

 int main(){
     int t = read();
     int cnt = ;
     while(t--){

     memset(num, , sizeof(num));
     a.clear();
     cnt++;
     int n = read();
     for(int i = ;i <= n;i++){
         now.val = read();
         now.id = i;
         now.son.clear();
         a.push_back(now);
     }

     printf("Case %d: ", cnt);
     if(n == ){ printf("NO\n"); continue;}
     bool ok = true;
     sort(a.begin(), a.end(), cmp);
     while(ok){
         //sort(a.begin(), a.end(), cmp);
         if(a.size() == ) break;
         if(a[].val ==  && a[].val == ) break;
         ok = false;
         vector<node>::iterator it = a.end()-;
         for(;it != a.begin();it--){
             if((*it).val == ) continue;
             if((*it).val == (*(it-)).val){
                 ok = true;
                 vector<node>::iterator it1 = it-;
                 int itlen = (*it).son.size();
                 for(int j = ;j < itlen;j++){
                     (*it1).son.push_back((*it).son[j]);
                 }
                 (*it1).son.push_back((*it).id);
                 (*it1).val--;
                 /*
                 sort((*it1).son.begin(), (*it1).son.end());
                 (*it1).son.erase(unique((*it1).son.begin(), (*it1).son.end()), (*it1).son.end());
                 */
                 a.erase(it);
                 it++;
             }
             if(a.size() == ) break;
         }
         sort(a.begin(), a.end(), cmp);
     }
 /*
     for(int i = 0; i<a.size();i++){
         cout << i+1 << " : " << a[i].val << endl;
     }
 */
     if(a[].val ==  && a[].val == ){
         printf("YES\n");
         int valen = a[].son.size();
         num[a[].id] = ;
         for(int i = ;i < valen;i++){
             num[a[].son[i]] = ;
         }
         for(int i = ;i <= n;i++)
             printf("%d", num[i]);
         printf("\n");
     }
     else printf("NO\n");

     }
     return ;
 }