#include <iostream> #include <string> #include <string.h> #include <map> using namespace std; map<char,int> mp; int main() { string str; while(cin>>str) { if(str=="#") break; mp.clear(); for(int i=0;i<str.size();i++) { mp[str[i]]+=1; } if(mp.size()==1) { cout<<"\n"; continue; } int k=0; map<char,int> m; for(map<char,int>::iterator i=mp.begin();i!=mp.end();++i) { if((i->second)%2!=0) { k++; m[i->first]=1; } } int s=0; for(map<char,int>::iterator i=m.begin();i!=m.end();++i) { if(s==k-1) break; s++; cout<<i->first;
Category: Ad Hoc
10334
Its a fibonicci series solution. I dont know why….But found that it shows the similiarity. #include <iostream> #include <vector> using namespace std; int fib[2000][5000]; vector<int> vb[2001]; int main() { fib[0][0]=1; fib[1][0]=2; fib[2][0]=3; int c=0; for(int i=3;i<2000;i++) { for(int j=0;j<5000;j++) { int t=fib[i-1][j]+fib[i-2][j]+c; fib[i][j]=t%10; c=t/10; } } //cout<<fib[3][0]; vb[0].push_back(1); vb[1].push_back(2); vb[2].push_back(3); for(int i=3;i<2000;i++) { int f=0;
12289
#include <iostream> #include <string> #include <vector> #include <string.h> using namespace std; int main() { int n; string str; cin>>n; while(n–) { cin>>str; if(str.size()==5) { cout<<"3"<<"\n"; continue; } int cnt=0; if(str[0]=='o'|| str[0]=='n' || str[0]=='e') { cnt++; } if((str[1]=='o'|| str[1]=='n' || str[1]=='e') && str[1]!=str[0]) { cnt++; } if((str[2]=='o'|| str[2]=='n' || str[2]=='e') && str[1]!=str[2] && str[2]!=str[0]) { cnt++;
846
#include <iostream> #include <math.h> using namespace std; //long long diff[10001]; long long int m,n,d; int main() { int t; cin>>t; while(t–) { cin>>m>>n; d= m-n; if(d<0) d=d*(-1); if(d==0) { cout<<0<<"\n"; continue; } if(d==1) { cout<<1<<"\n"; continue; } if(d==2) { cout<<2<<"\n"; continue; } if(d==3) { cout<<3<<"\n"; continue; } long long int r= sqrt(d); if(r<0) r*=-1; if(d==r*r)