P2955 [USACO09OCT] Even? Odd? G - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){int n;string s;//数据太大，整数存不了，选择字符串存储，判断最后一位的奇偶性cin>>n;for(int i=0;i<n;i++){cin>>s;if(s[s.size()-1]%2==0) cout<<"even"<<endl;else cout<<"odd"<<endl;}return 0;
}P2956 [USACO09OCT] The Robot Plow G - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int f[250][250];
int main(){int x,y,z,ans=0;int a,b,c,d;cin>>x>>y>>z;for(int i=0;i<z;i++){cin>>a>>b>>c>>d;for(int j=a;j<=c;j++){for(int k=b;k<=d;k++){if(!f[j][k]) ans++,f[j][k]++;}}}cout<<ans;return 0;
}P3156 【深基15.例1】询问学号 - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
long long a[2000010];
int main(){int n,m,x;scanf("%d %d",&n,&m);for(int i=0;i<n;i++) scanf("%lld",&a[i]);for(int i=0;i<m;i++){scanf("%d",&x);printf("%lld\n",a[x-1]);}return 0;
}P3717 [AHOI2017初中组] cover - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int a[110][110];
int main(){int n,m,r,x,y,ans=0;double dis;scanf("%d %d %d",&n,&m,&r);for(int i=0;i<m;i++){scanf("%d %d",&x,&y);for(int j=1;j<=n;j++){for(int k=1;k<=n;k++){dis=sqrt((x-j)*(x-j)+(y-k)*(y-k));if(dis<=r&&!a[j][k]) ans++,a[j][k]=1;}}}cout<<ans;return 0;
}P3741 小果的键盘 - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int a[110];
int main(){int n,ans=0;string s;cin>>n;cin>>s;for(int i=0;i<n-1;i++){if(s[i]=='V'&&s[i+1]=='K') ans++,a[i]=a[i+1]=1;}for(int i=0;i<n-1;i++){if(s[i]==s[i+1]&&!a[i]&&!a[i+1]){ans++;break;}}cout<<ans;return 0;
}P3742 umi的函数 - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){int n,flag=-1;string x,y,z;cin>>n>>x>>y;for(int i=0;i<n;i++){if(x[i]>y[i]){z+=y[i],flag=1;}else if(x[i]==y[i]){z+=y[i]+1,flag=1;}else{cout<<-1;return 0;}}if(flag) cout<<z;return 0;
}B2146 Hermite 多项式 - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int h(int n,int x){if(n==0) return 1;else if(n==1) return 2*x;else if(n>1){return 2*x*h(n-1,x)-2*(n-1)*h(n-2,x);}
}
int main(){int n,x;cin>>n>>x;cout<<h(n,x);return 0;
}B2147 求 f(x,n) - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
double f(double x,double n){if(n==1) return sqrt(1+x);else return sqrt(n+f(x,n-1));
}
int main(){double n,x;scanf("%lf %lf",&x,&n);printf("%0.2lf",f(x,n));return 0;
}B2148 再求 f(x,n) - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
double f(double x,double n){if(n==1) return x/(1+x);else return x/(n+f(x,n-1));
}
int main(){double n,x;scanf("%lf\n%lf",&x,&n);printf("%0.2lf",f(x,n));return 0;
}B3638 T1 三角形面积 - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){int x1,y1,x2,y2,x3,y3;double a,b,c,s,ans;cin>>x1>>y1>>x2>>y2>>x3>>y3;a=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));b=sqrt((x2-x3)*(x2-x3)+(y2-y3)*(y2-y3));c=sqrt((x1-x3)*(x1-x3)+(y1-y3)*(y1-y3));s=1.0*(a+b+c)/2;ans=sqrt(s*(s-a)*(s-b)*(s-c));printf("%.lf",ans);return 0;
}B3639 T2 点亮灯笼 - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
bool d[1010];
int main(){int n,m,x;cin>>n>>m;for(int i=0;i<m;i++){cin>>x;if(x==1) d[n]=!d[n],d[x]=!d[x],d[x+1]=!d[x+1];else if(x==n) d[x-1]=!d[x-1],d[x]=!d[x],d[1]=!d[1];else d[x-1]=!d[x-1],d[x]=!d[x],d[x+1]=!d[x+1];}for(int i=1;i<=n;i++)cout<<d[i]<<" ";return 0;
}错题重练
B2112 石头剪子布 - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){int n;string a,b;cin>>n;for(int i=0;i<n;i++){cin>>a>>b;if(a=="Rock"){if(b=="Rock") cout<<"Tie"<<endl;else if(b=="Scissors") cout<<"Player1"<<endl;else cout<<"Player2"<<endl;}else if(a=="Scissors"){if(b=="Rock") cout<<"Player2"<<endl;else if(b=="Scissors") cout<<"Tie"<<endl;else cout<<"Player1"<<endl;}else{if(b=="Rock") cout<<"Player1"<<endl;else if(b=="Scissors") cout<<"Player2"<<endl;else cout<<"Tie"<<endl;}}return 0;
}
B2118 验证子串 - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){string a,b;cin>>a>>b;if(a.find(b)!=a.npos) cout<<b<<" is substring of "<<a;else if(b.find(a)!=b.npos) cout<<a<<" is substring of "<<b;else cout<<"No substring";return 0;
}
P1851 好朋友 - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int yueshuhe(int n){int sum=0;for(int i=1;i<n;i++){if(n%i==0) sum+=i;}return sum;
}
int main(){int s,i,b;cin>>s;for(i=s;;i++){b=yueshuhe(i);if(i==yueshuhe(b)&&i!=b) break;}cout<<i<<" "<<b;return 0;
}
P1867 【Mc生存】经验值 - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){int n,m=0,t=0;double x,a,life=10;cin>>n;for(int i=0;i<n;i++){cin>>x>>a;if(life-x<=0) break;else{life=min(10.0,life-x);t+=a;while(t>=pow(2,m)){t-=pow(2,m),m++;}}}cout<<m<<" "<<t;return 0;
}
P1876 开灯 - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){//完全平方数的因子有奇数个，其他有偶数个long long n;cin>>n;//初始为关，问开灯的编号，需要进行奇数次的操作for(int i=1;i*i<=n;i++){cout<<i*i<<" ";}return 0;
}
P1482 Cantor表（升级版） - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int zuidagongyueshu(int a,int b){if(b==0) return a;else{return zuidagongyueshu(b,a%b);}
}
int main(){int a,b,c,d,yue;scanf("%d/%d\n%d/%d",&a,&b,&c,&d);yue=zuidagongyueshu(a*c,b*d);cout<<b*d/yue<<" "<<a*c/yue;return 0;
}
B2119 删除单词后缀 - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){string s;cin>>s;int len=s.size();reverse(s.begin(),s.end());if(s[0]=='r'&&s[1]=='e') s.erase(0,2);else if(s[0]=='y'&&s[1]=='l') s.erase(0,2);else if(s[0]=='g'&&s[1]=='n'&&s[2]=='i') s.erase(0,3);reverse(s.begin(),s.end());cout<<s;return 0;
}
B2121 最长最短单词 - 洛谷
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){string x;int max_l=0,min_l=INT_MAX,max_b,min_b,max_e,min_e,b=0;getline(cin,x);for(int i=0;i<x.size();i++){if(x[i]==' '||x[i]==','||x[i]=='.'){if(i-1-b>max_l) max_l=i-1-b,max_b=b,max_e=i-1;if(i-1-b<min_l) min_l=i-1-b,min_b=b,min_e=i-1;b=i+1;}}for(int i=max_b;i<=max_e;i++) cout<<x[i];cout<<endl;for(int i=min_b;i<=min_e;i++) cout<<x[i];return 0;
}
