cwda

#include <iostream> #include <cstdio> using namespace std; int main(){ long s[10000]={},n,p=0,nums=-1,x=0; double a=0; while(1){ if(p == -1){ break; } cin>>p; nums+=1; s[p-1]+=1; } a = nums*1.0/2; // for(int i=0;i<x;i++) // cout<<s[i]<<endl; while(1){ if(s[x]>a){ if(x==0){ cout<<"A="<<s[x]<<endl<<"B="<<s[x+1]<<endl<<"C="<<s[x+2]<<endl<<"Tot="<<nums<<endl<<"A-yes"<<endl; break; } if(x==1){ cout<<"A="<<s[x]<<endl<<"B="<<s[x+1]<<endl<<"C="<<s[x+2]<<endl<<"Tot="<<nums<<endl<<"B-yes"<<endl; break; } if(x==2){ cout<<"A="<<s[x]<<endl<<"B="<<s[x+1]<<endl<<"C="<<s[x+2]<<endl<<"Tot="<<nums<<endl<<"C-yes"<<endl; break; } } else{ cout<<"A="<<s[x]<<endl<<"B="<<s[x+1]<<endl<<"C="<<s[x+2]<<endl<<"Tot="<<nums<<endl<<"all-NO"<<endl; break; } x++; } return 0; }