由于我太弱了,所以只AC了大约350题,可能帮不到一些大神的忙
话不多说,先发20题(没账号看最后)
1. A+B Problem
#include<iostream>
using namespace std;
int a,b; //定义整数类型变量a,b
int main(){
cin>>a>>b; //输入a和b数值
cout<<a+b; //输出a+b
return 0;
}
太简单了我都不知道要不要写
2. 删除最大和最小
#include<bits/stdc++.h>
using namespace std;
int main(){
int a;
cin>>a;
int arr[a];
for(int i=0;i<a;i++){
cin>>arr[i];
}
int MAX=*max_element(arr,arr+a);
int MIN=*min_element(arr,arr+a);
for(int i=0;i<a;i++){
if(arr[i]!=MAX&&arr[i]!=MIN){
cout<<arr[i]<<" ";
}
}
return 0;
}
3. lester大帅哥
#include<iostream>
using namespace std;
int main(){
cout<<"lester大帅哥";
return 0;
}
//太简单了
4. 三连击
#include<bits/stdc++.h>
using namespace std;
int main(){
cout<<"192 384 576"<<endl;
cout<<"219 438 657"<<endl;
cout<<"273 546 819"<<endl;
cout<<"327 654 981"<<endl;
return 0;
}
炒鸡偷鸡大法
5. 凑和
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int arr[a];
int c = 0;
for(int i = 0;i<a;i++){
cin>>arr[i];
}
for(int i = 0;i<a;i++){
for(int j = i+1;j<a;j++){
if(arr[j]+arr[i]==b){
c = 1;
}
}
}
if(c==0)cout<<"No";
else cout<<"Yes";
return 0;
}
6. 病毒扩散(BestAC by燕子何)
#include<bits/stdc++.h>
using namespace std;
char a[7][7];
int main(){
for(int i=1;i<=5;i++)
for(int j=1;j<=5;j++)
cin>>a[i][j];
for(int i=1;i<=5;i++)
for(int j=1;j<=5;j++)
if(a[i][j]=='A'){
if(i-1>=1&&a[i-1][j]!='A') a[i-1][j]='a';
if(i+1<=5&&a[i+1][j]!='A') a[i+1][j]='a';
if(j-1>=1&&a[i][j-1]!='A') a[i][j-1]='a';
if(j+1<=5&&a[i][j+1]!='A') a[i][j+1]='a';
}
for(int i=1;i<=5;i++)
for(int j=1;j<=5;j++)
if(a[i][j]=='a')
a[i][j]='A';
cout<<endl;
for(int i=1;i<=5;i++){
for(int j=1;j<=5;j++)
cout<<a[i][j];
cout<<endl;
}
return 0;
}
这一期中较难的一题
7. 大小写转换
#include<bits/stdc++.h>
using namespace std;
int main(){
string a;
cin>>a;
for(int i=0;i<a.size();i++){
if(a[i]<='Z'&&a[i]>='A'){
a[i]+=32;
}else if(a[i]<='z'&&a[i]>='a'){
a[i]-=32;
}
}
cout<<a;
return 0;
}
8. 三数凑和
#include<bits/stdc++.h>
using namespace std;
int a[1000],b[2001],n,m;
bool cnt=0;
int main(){
cin>>n>>m;
for(int i=0;i<n;i++)cin>>a[i],b[a[i]]=1;
for(int j=0;j<n;j++)
for(int k=0;k<n;k++){
if(m-a[j]-a[k]>2000||m-a[j]-a[k]<0) continue;
if(b[m-a[j]-a[k]]==1){cnt=1;break;}
}
cout<<(cnt?"Yes":"No")<<endl;
return 0;
}
9. 一个菱形2
#include<bits/stdc++.h>
using namespace std;
int main(){
cout<<" *"<<endl;
cout<<" ***"<<endl;
cout<<" *****"<<endl;
cout<<"*******"<<endl;
cout<<" *****"<<endl;
cout<<" ***"<<endl;
cout<<" *"<<endl;
return 0;
}
炒鸡简单
10. ASCII码破密
#include<bits/stdc++.h>
using namespace std;
int main(){
cout<<"C++ runs fast";
return 0;
}
继续偷鸡
11. A+B
和第一题一模一样
12. 长方体体积
#include<iostream>
#include<iomanip>
using namespace std;
double a,b,h;
int main(){
cin>>a>>b>>h;
cout<<fixed<<setprecision(2)<<a*b*h;
return 0;
}
13. 凯撒加密字符
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("ceasar.in","r",stdin);
freopen("ceasar.out","w",stdout);
char a,b,c,d,e,f;
cin>>a>>b>>c;
if(a=='z') d='a';
else d=a+1;
if(b=='z') e='a';
else e=b+1;
if(c=='z') f='a';
else f=c+1;
cout<<d<<" "<<e<<" "<<f<<endl;
return 0;
}
14. 打折
#include<iostream>
using namespace std;
int main(){
int a;
cin>>a;
if(a>=100)
cout<<a*10*0.7<<endl;
if(a>=50&&a<100)
cout<<a*10*0.8<<endl;
if(a<50)
cout<<a*10<<endl;
return 0;
}
15. 含k个3的数
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,flag=0;
cin>>a>>b;
int c=a;
while(a){
int temp=a%10;
a/=10;
if(temp==3){
flag++;
}
}
if(c%19==0&&flag==b){
cout<<"YES";
}else{
cout<<"NO";
}
return 0;
}
16. 最大值
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if (a>=b&&a>=c)
cout<<a<<endl;
if(b>a&&b>c)
cout<<b<<endl;
if(c>a&&c>b)
cout<<c<<endl;
return 0;
}
17. 含k个3的数
同15
18. 三角形判定
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if (a+b>c&&a+c>b&&b+c>a)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
19. 谁考了第k名
#include<bits/stdc++.h>
using namespace std;
struct stu{string id;double mark;};
stu a[103];
int n,k;
bool cmp(const stu&a,const stu&b){return a.mark>b.mark;}
int main(){
cin>>n>>k;
for(int i=1; i<=n; i++) cin>>a[i].id>>a[i].mark;
sort(a+1,a+1+n,cmp);
cout<<a[k].id<<" "<<a[k].mark<<endl;
return 0;
}
20. 菱形变形
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
for (int i=0; i<n; i++){
for (int j=0; j<(n-1-i); j++) cout<<" ";
for (int j=0; j<2*i+1; j++) cout<<"*" ;
cout<<endl;
}
for (int i=0; i<n-1; i++){
for (int j=0; j<i+1; j++) cout<<" ";
for (int j=0; j<2*(n-1)-(1+2*i); j++) cout<<"*";
cout<<endl;
}
return 0;
}
没账号的看这里
1
#include<iostream>
using namespace std;
int a,b; //定义整数类型变量a,b
int main(){
cin>>a>>b; //输入a和b数值
cout<<a+b; //输出a+b
return 0;
}
2
#include<bits/stdc++.h>
using namespace std;
int main(){
int a;
cin>>a;
int arr[a];
for(int i=0;i<a;i++){
cin>>arr[i];
}
int MAX=*max_element(arr,arr+a);
int MIN=*min_element(arr,arr+a);
for(int i=0;i<a;i++){
if(arr[i]!=MAX&&arr[i]!=MIN){
cout<<arr[i]<<" ";
}
}
return 0;
}
3
#include<iostream>
using namespace std;
int main(){
cout<<"lester大帅哥";
return 0;
}
4
#include<bits/stdc++.h>
using namespace std;
int main(){
cout<<"192 384 576"<<endl;
cout<<"219 438 657"<<endl;
cout<<"273 546 819"<<endl;
cout<<"327 654 981"<<endl;
return 0;
}
5
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int arr[a];
int c = 0;
for(int i = 0;i<a;i++){
cin>>arr[i];
}
for(int i = 0;i<a;i++){
for(int j = i+1;j<a;j++){
if(arr[j]+arr[i]==b){
c = 1;
}
}
}
if(c==0)cout<<"No";
else cout<<"Yes";
return 0;
}
6
#include<bits/stdc++.h>
using namespace std;
char a[7][7];
int main(){
for(int i=1;i<=5;i++)
for(int j=1;j<=5;j++)
cin>>a[i][j];
for(int i=1;i<=5;i++)
for(int j=1;j<=5;j++)
if(a[i][j]=='A'){
if(i-1>=1&&a[i-1][j]!='A') a[i-1][j]='a';
if(i+1<=5&&a[i+1][j]!='A') a[i+1][j]='a';
if(j-1>=1&&a[i][j-1]!='A') a[i][j-1]='a';
if(j+1<=5&&a[i][j+1]!='A') a[i][j+1]='a';
}
for(int i=1;i<=5;i++)
for(int j=1;j<=5;j++)
if(a[i][j]=='a')
a[i][j]='A';
cout<<endl;
for(int i=1;i<=5;i++){
for(int j=1;j<=5;j++)
cout<<a[i][j];
cout<<endl;
}
return 0;
}
7
#include<bits/stdc++.h>
using namespace std;
int main(){
string a;
cin>>a;
for(int i=0;i<a.size();i++){
if(a[i]<='Z'&&a[i]>='A'){
a[i]+=32;
}else if(a[i]<='z'&&a[i]>='a'){
a[i]-=32;
}
}
cout<<a;
return 0;
}
8
#include<bits/stdc++.h>
using namespace std;
int a[1000],b[2001],n,m;
bool cnt=0;
int main(){
cin>>n>>m;
for(int i=0;i<n;i++)cin>>a[i],b[a[i]]=1;
for(int j=0;j<n;j++)
for(int k=0;k<n;k++){
if(m-a[j]-a[k]>2000||m-a[j]-a[k]<0) continue;
if(b[m-a[j]-a[k]]==1){cnt=1;break;}
}
cout<<(cnt?"Yes":"No")<<endl;
return 0;
}
9
#include<bits/stdc++.h>
using namespace std;
int main(){
cout<<" *"<<endl;
cout<<" ***"<<endl;
cout<<" *****"<<endl;
cout<<"*******"<<endl;
cout<<" *****"<<endl;
cout<<" ***"<<endl;
cout<<" *"<<endl;
return 0;
}
10
#include<bits/stdc++.h>
using namespace std;
int main(){
cout<<"C++ runs fast";
return 0;
}
11同第一题
12
#include<iostream>
#include<iomanip>
using namespace std;
double a,b,h;
int main(){
cin>>a>>b>>h;
cout<<fixed<<setprecision(2)<<a*b*h;
return 0;
}
13
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("ceasar.in","r",stdin);
freopen("ceasar.out","w",stdout);
char a,b,c,d,e,f;
cin>>a>>b>>c;
if(a=='z') d='a';
else d=a+1;
if(b=='z') e='a';
else e=b+1;
if(c=='z') f='a';
else f=c+1;
cout<<d<<" "<<e<<" "<<f<<endl;
return 0;
}
14
#include<iostream>
using namespace std;
int main(){
int a;
cin>>a;
if(a>=100)
cout<<a*10*0.7<<endl;
if(a>=50&&a<100)
cout<<a*10*0.8<<endl;
if(a<50)
cout<<a*10<<endl;
return 0;
}
15
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,flag=0;
cin>>a>>b;
int c=a;
while(a){
int temp=a%10;
a/=10;
if(temp==3){
flag++;
}
}
if(c%19==0&&flag==b){
cout<<"YES";
}else{
cout<<"NO";
}
return 0;
}
16
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if (a>=b&&a>=c)
cout<<a<<endl;
if(b>a&&b>c)
cout<<b<<endl;
if(c>a&&c>b)
cout<<c<<endl;
return 0;
}
17同第十五题
18
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if (a+b>c&&a+c>b&&b+c>a)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
19
#include<bits/stdc++.h>
using namespace std;
struct stu{string id;double mark;};
stu a[103];
int n,k;
bool cmp(const stu&a,const stu&b){return a.mark>b.mark;}
int main(){
cin>>n>>k;
for(int i=1; i<=n; i++) cin>>a[i].id>>a[i].mark;
sort(a+1,a+1+n,cmp);
cout<<a[k].id<<" "<<a[k].mark<<endl;
return 0;
}
20
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
for (int i=0; i<n; i++){
for (int j=0; j<(n-1-i); j++) cout<<" ";
for (int j=0; j<2*i+1; j++) cout<<"*" ;
cout<<endl;
}
for (int i=0; i<n-1; i++){
for (int j=0; j<i+1; j++) cout<<" ";
for (int j=0; j<2*(n-1)-(1+2*i); j++) cout<<"*";
cout<<endl;
}
return 0;
}