#include<iostream> #include<algorithm> using namespace std; const int maxn=1000; struct Pair{ int x; int y; }; Pair arr[maxn]; bool Compare(Pair x,Pair y){ if(x.x==y.x) return x.y<y.y; else return x.x<y.x; } int main(){ int n; while(cin>&g...

#include<iostream> #include<string> #include<algorithm> using namespace std; struct Mouse{ int weight; string color; }; bool Compare(Mouse x,Mouse y){ return x.weight>y.weight; } int main(){ int n; while(cin>>n){ Mouse arr[n]; for(int i=...

#include<iostream> #include<stdio.h> using namespace std; bool Insub(int a,int b,int sta) //判断是否在公差sta内 { int cha=0; if(a>b){ cha=a-b; return (sta-cha)>=0?true:false; } else{ cha=b-a; return (sta-cha)>=0?true:false; } } int max(int a,int b,int c){ int temp=0; if(a...

#include<iostream> #include<map> #include<string> using namespace std; int main(){ std::map<char,int> jianpan={{'a',1},{'b',1},{'c',1},{'d',2},{'e',2},{'f',2},{'g',3},{'h',3},{'i',3},{'j',4},{'k',4},{'l',4},{'m',5},{'n',5},{'o',5},{'p',6},{'q',6},{'r',6},{'s',6},{'t',7},{...

#include<iostream> using namespace std; int main(){ int L,M; cin>>L; cin>>M; int low,high; int trees[L+1]; for(int i=0;i<L+1;i++){ trees[i]=1; } while(M){ cin>>low>>high; for(int i=low;i<=high;i++){ trees[i]=0; } M--; } int sum=0; for(int i...

#include<iostream> #include<stdio.h> using namespace std; bool leapyear(int n){ return n%4==0&&n%100!=0||n%400==0; } int main(){ int m; int Y,M,D; cin>>m; while(m){ cin>>Y>>M>>D; int month[]={31,leapyear(Y)?29:28,31,30,31,30,31,31,30,31,30,31}; ...

#include<iostream> using namespace std; string week[]={"","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday","Sunday"}; string month[]={"","January","February","March&q...

#include<iostream> #include<cstdio> using namespace std; bool leapyear(int n){ if(n%4==0&&n%100!=0||n%400==0) return true; else return false; } int main(){ char str1[9],str2[9]; int Y1,M1,D1,Y2,M2,D2; while(cin>>str1>>str2){ ...

#include<iostream> #include<stdio.h> using namespace std; int main(){ int m; cin>>m; while(m){ int Y,M,N,cal; int days=0; cin>>Y>>M>>N>>cal; bool leapyear=(Y%4==0&&Y%100!=0)||(Y%400==0); int month[]={31,leapyear?29:28,31,30,31,30,31,31,3...

#include<iostream> #include<stdio.h> using namespace std; int main(){ int y,n; while(cin>>y>>n){ bool leapyear=(y%4==0&&y%100!=0)||(y%400==0); int month[]={31,leapyear?29:28,31,30,31,30,31,31,30,31,30,31}; int order=0,M,D; int i=0; while(i<12){ order...

#include<iostream> using namespace std; int main(){ int Y,M,D; while(cin>>Y>>M>>D){ bool leapyear=(Y%4==0&&Y%100!=0)||(Y%400==0); int month[]={31,leapyear?29:28,31,30,31,30,31,31,30,31,30,31}; int order=0; for(int i=0;i<M-1;i++){ order=order+month[i]; ...

#include<iostream> using namespace std; int main(){ int Y,M,D; int order; while(cin>>Y>>M>>D){ if((Y%4==0&&Y%100!=0)||(Y%400==0)){ //是闰年 switch(M){ case 1:order=D;break; case 2:order=31+D;break; case 3:order=31+29+D;break; case 4:order=31+29+3...

#include<iostream> #include<cstdio> using namespace std; int main(){ char str[81]; while(scanf("%s",&str)!=EOF){ int n=0; while(str[n]!='\0'){ //统计字符长度 n++; } int n1=n/3,n3=n/3; int n2=n-n1-n3; int x,y; if(n1==n2){ x=n1; y=n2+2; } else{ ...