Category: Ad Hoc

#include <iostream> #include <cstring> #include <cstdio> #include <string> #include <algorithm> using namespace std; int gcd(int a,int b) { if(a%b==0) return b; else return gcd(b,a%b); } int main() { int t,kase=1,num1,num2; string s1,s2; // cin>>num1>>num2; // cout<<gcd(num1,num2)<<"\n"; cin>>t; while(t–) { cin>>s1; cin>>s2; num1=0; num2=0; int prev=1; for(int i=s1.size()-1;i>=0;i–) { num1=num1+(s1[i]-'0')*prev; prev*=2; } prev=1; for(int i=s2.size()-1;i>=0;i–) {

Continue Reading “10193” →

#include <iostream> #include <algorithm> #include <set> using namespace std; int diameter[25000]; int main() { int n,m,a; multiset<int> mset; multiset<int>::iterator it; while(cin>>n) { cin>>m; if(n+m==0) break; mset.clear(); for(int i=0;i<n;i++) { cin>>diameter[i]; } for(int i=0;i<m;i++) { cin>>a;mset.insert(a); } if(n>m) { cout<<"Loowater is doomed!\n"; continue; } bool fail=0; int res=0; for(int i=0;i<n;i++) { if((it=mset.lower_bound(diameter[i]))==mset.end()) { fail=1; break; }

Continue Reading “11292” →

#include <iostream> #include <string> #include <cstdio> #include <cstring> using namespace std; int main() { int t,kase=1; int dd,mm,YY,dd1,mm1,yy1; int y; cin>>t; while(t–) { scanf("%d/%d/%d",&dd,&mm,&YY);//current date scanf("%d/%d/%d",&dd1,&mm1,&yy1);//birth date y=YY-yy1; if(mm-mm1<0) { y–; } else if(mm==mm1) { if(dd<dd1) y–; } if(y<0) cout<<"Case #"<<kase++<<": Invalid birth date\n"; else if(y>130) cout<<"Case #"<<kase++<<": Check birth date\n"; else cout<<"Case #"<<kase++<<": "<<y<<"\n";

Continue Reading “11219” →

#include <iostream> #include <map> #include <vector> #include <string> using namespace std; int mx=1000000000; int main() { int t,kase=1,num; string str; vector<string> vb; cin>>t; while(t–) { mx=1000000000; vb.clear(); for(int i=0;i<10;i++) { cin>>str; cin>>num; if(num<mx) { if(vb.size()==0) { vb.push_back(str); mx=num; } } else if(num==mx) { vb.push_back(str); } else if(num>mx) { vb.clear(); mx=num; vb.push_back(str); } } cout<<"Case #"<<kase++<<":\n";

Continue Reading “12015” →

#include <iostream> #include <cstdio> #include <cstring> #include <string> #include <map> using namespace std; map<char,int> mp; int main() { int t,n,k,val; char c; cin>>t; getchar(); while(t–) { cin>>n; getchar(); mp.clear(); while(n–) { scanf("%c %d",&c,&val); getchar(); mp=val; } cin>>k; getchar(); double ans=0; while(k) { c=getchar(); if(c=='\n') k–; else ans+=mp; } printf("%.2lf$\n",ans/100); } return 0; }  

#include <iostream> #include <sstream> #include <map> #include <string> #include <cstring> #include <queue> using namespace std; map<int,string> mp; int main() { int* arr; string db; int t,n; string str,s1,s2,s3; queue<int> q; getline(cin,str); stringstream ss; ss<<str; ss>>t; getline(cin,str); while(t–) { getline(cin,s1); getline(cin,s2); //q.clear(); ss.clear(); ss<<s1; int mx=0; while(ss>>n) { q.push(n); if(n>mx) mx=n; } mp.clear(); ss.clear(); ss<<s2; while(!q.empty())

Continue Reading “482” →

#include <iostream> using namespace std; int main() { int h1,h2,m1,m2; int a,b; while(cin>>h1) { cin>>m1>>h2>>m2; if(h1+h2+m1+m2==0) break; a = h1*60+m1; b = h2*60+m2; if(b<a) { cout<<(24*60)-a+b<<"\n"; } else { cout<<b-a<<"\n"; } } return 0; }  

#include <iostream> #include <cstdio> #include <sstream> #include <string> using namespace std; int main() { int tt,kase=1; double s,a,MN,avg; cin>>tt; while(tt–) { MN=25; s = 0; avg = 0; for(int i=0;i<4;i++) { cin>>a; s+=a; } for(int i=0;i<3;i++) { cin>>a; avg+=a; if(a<MN) MN=a; } avg-=MN; avg/=2; s+=avg; if(s>=90) cout<<"Case "<<kase++<<": A\n"; else if(s>=80) cout<<"Case "<<kase++<<": B\n"; else

Continue Reading “11777” →