#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; }
Month: June 2015
11219
#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";
12015
#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";