uva122

#include 
#include 
#include 
#include 
using namespace std;
struct node{
    string num;
    string str;
}tree[1000];
mapmymap;
int cnt;
string first;
bool cmp(node a,node b){
    if(a.str.length()==b.str.length())
        return a.str>ss;
    }
}
int iscomplete()
{
    if(tree[0].str.length()!=0)
        return 0;
    string ss;
    for(int i=1;i1)
            return 0;
    }
    return 1;
}
void computing(){
    sort(tree,tree+cnt,cmp);
    if(!iscomplete())
    {
        cout<<"not complete"<>first){
        mymap.clear();
        input();
        computing();
    }
    return 0;
}

你可能感兴趣的:(acm)