C++-POJ1016-Numbers That Count

无语，15步产生16个数，植树原理啊！

大水题，居然wa了好几次，唉，自己的问题。

略略略，就要封装成结构体，略略略。

 #include <set>
 #include <map>
 #include <cmath>
 #include <queue>
 #include <vector>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 using namespace std;
 struct String {
     char s[];
     int len_s,len_b;
     int a[],b[];
     void init() {
         memset(s,,sizeof(s));
         memset(a,,sizeof(a));
         memset(b,,sizeof(b));
         len_s=len_b=;
     }
     bool read() {
         scanf("%s",s+);
         len_s=strlen(s+);
         if(s[]=='-')return false;
         return true;
     }
     void calc() {
         for(int i=; i<=len_s; i++)a[s[i]-'']++;
         for(int i=; i<=; i++)
             if(a[i]) {
                 if(a[i]<){
                     b[++len_b]=a[i];
                     b[++len_b]=i;
                 }
                 else {
                     b[++len_b]=a[i]/;
                     b[++len_b]=a[i]%;
                     b[++len_b]=i;
                 }
             }
     }
     void get(String A) {
         len_s=A.len_b;
         for(int i=; i<=len_s; i++)
             s[i]=A.b[i]+'';
     }
     void print_s() {for(int i=; i<=len_s; i++)cout<<s[i];}
 };
 bool comp(String A,String B) {
     if(A.len_s!=B.len_s)return false;
     for(int i=; i<=A.len_b; i++)if(A.s[i]!=B.s[i])return false;
     return true;
 }
 bool self(String A) {
     if(A.len_s!=A.len_b)return false;
     for(int i=; i<=A.len_s; i++)if(A.s[i]-''!=A.b[i])return false;
     return true;
 }
 String a[],A;
 int main() {
     while(A.read()) {
         A.calc(),a[]=A;
         for(int i=; i<=; i++) a[i].get(a[i-]),a[i].calc();
         int ans,flag=;
         for(int i=; i<=; i++) {
             if(flag)break;
             if(self(a[i]))
                 {flag=;ans=i-;break;}
             for(int j=i+; j<=; j++)
                 if(comp(a[i],a[j]))
                     {ans=j-i;flag=;break;}
         }
         A.print_s();
         if(flag==)
             if(ans==)cout<<" is self-inventorying"<<endl;
             else cout<<" is self-inventorying after "<<ans<<" steps"<<endl;
         else if(flag==)cout<<" enters an inventory loop of length "<<ans<<endl;
         else cout<<" can not be classified after 15 iterations"<<endl;
         A.init();for(int i=;i<=;i++)a[i].init();
     }
     return ;
 }