作者是强迫症 写代码喜欢写的 非 常 紧 凑
目录
1000-1010
1000
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a+b;
}
1001
#include<iostream>
using namespace std;
int main(){
int a,b;
while(cin>>a>>b){
cout<<a+b<<endl;
}
return 0;
}
1002
#include<iostream>
using namespace std;
int main(){
int n,sum=0;
cin>>n;
for(int i=1;i<=n;i++){
sum+=i;
}
cout<<sum;
return 0;
}
1003
#include<iostream>
using namespace std;
int main(){
int n,sum=0;
cin>>n;
for(int i=1;i<=n;i+=2){
sum+=i;
}
cout<<sum;
return 0;
}
1004
#include<iostream>
using namespace std;
int main(){
int n,sum=1;
cin>>n;
for(int i=1;i<=n;i++){
sum*=i;
}
cout<<sum;
return 0;
}
1005
#include<bits/stdc++.h>
using namespace std;
int main(){
float r,s,c,pi=3.1415926;
cin>>r;
s=r*r*pi;
c=2*r*pi;
cout<<fixed<<setprecision(2)<<s<<endl;
cout<<fixed<<setprecision(2)<<c;
return 0;
}
1006
#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
for(int k=1;k<=3;k++){
for(int j=1;j<=n-i;j++){
cout<<" ";
}
for(int l=1;l<=i*2-1;l++){
cout<<"*";
}
for(int m=1;m<=n-i;m++){
cout<<" ";
}
}
cout<<endl;
}
return 0;
}
1007
#include<string.h>
#include<stdio.h>
#define gets(S) fgets(S,sizeof(S),stdin)
int main(){
char s[1000];
gets(s);
int len=strlen(s),n=0;
for(int i=0;i<len;i++){
if(s[i]>='A'&&s[i]<='Z') n++;
}
printf("%d",n);
return 0;
}
1008
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=n-i;j++){
cout<<" ";
}
for(int j=1;j<=2*i-1;j++){
cout<<i;
}
cout<<endl;
}
return 0;
}
1009
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
for(int i=0;i<=n-1;i++){
cin>>a[i];
}
for(int i=n-1;i>=0;i--){
cout<<a[i]<<" ";
}
return 0;
}
1010
#include<iostream>
using namespace std;
int main(){
int n,k,temp;
cin>>n;
int q[n];
for(int i=0;i<=n-1;i++){
cin>>q[i];
}
for(int i=0;i<=n-1;i++){//这里用的冒泡
k=i;
for(int j=i+1;j<n;j++){
if(q[j]<q[k]){
k=j;
}
}
temp=q[i];
q[i]=q[k];
q[k]=temp;
}
for(int i=0;i<=n-1;i++){
cout<<q[i]<<" ";
}
return 0;
}
1011-1020
1011
#include<iostream>
using namespace std;
int main(){
int n,x,i=0;
cin>>n;
for(i=1;i<=n;i++){
for(int j=1;j<=n-i;j++){
cout<<" ";
}
for(int j=1;j<=n+(i-1)*2;j++){
if(i>1&&i<2*n-1&&j>1&&j<n+(i-1)*2){
cout<<" ";
}
else{
cout<<"*";
}
}
cout<<endl;
}
for(i=n-1;i>=1;i--){
for(int j=1;j<=n-i;j++){
cout<<" ";
}
for(int j=1;j<=n+(i-1)*2;j++){
if(i>1&&j>1&&j<n+(i-1)*2){
cout<<" ";
}
else{
cout<<"*";
}
}
cout<<endl;
}
return 0;
}
1012
#注意这是python
s=input()
f=input()
s=s[0:len(s)-1]
list=s.split()
c=0
flag = 0
for i in range(0,len(list)):
c = c + len(list[i])
if list[i]==f:
flag=1
print(i+1)
break
if flag==0: print(c)
1013
#include<iostream>
using namespace std;
int main(){
cout<<179487<<endl;
return 0;
}
1014
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;float sum;
cin>>n;
for(int i=1;i<=n;i++){
sum+=1.0/i;
}
cout<<fixed<<setprecision(3)<<sum;
return 0;
}
1015
#include<bits/stdc++.h>
using namespace std;
int main(){
int chicken,rabbit,head=50,leg=160,j;
for(int i=1;i<=head;i++){
j=head-i;
if(2*i+4*j==leg){
cout<<i<<" "<<j<<endl;
break;
}
}
return 0;
}
1016
#include<iostream>
using namespace std;
int main(){
int x,a,b,i,f=0;
cin>>x>>a>>b;
for(i=1;i<=x/a;i++){
if((x-i*a>=b) && (x-i*a)%b==0){
f++;
}
}
cout<<f<<endl;
return 0;
}
1017
#include<bits/stdc++.h>
using namespace std;
int main(){
for(int i=100;i<199;i++){
if(i%3==2&&i%5==3&&i%7==5){
cout<<i;
break;
}
}
return 0;
}
1018
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
int main(){
int sort[3];
cin>>sort[0]>>sort[1]>>sort[2];
int k,temp;
for(int i=0;i<=2;i++){
k=i;
for(int j=i+1;j<3;j++){
if(sort[j]<sort[k]){
k=j;
}
}
temp=sort[i];
sort[i]=sort[k];
sort[k]=temp;
}
if((sort[0]+sort[1])>sort[2]){
if(sqrt(sort[0]*sort[0]+sort[1]*sort[1])==sort[2]){//这里其实可以用pow更省事
cout<<"zhijiao";
}
if(sqrt(sort[0]*sort[0]+sort[1]*sort[1])<sort[2]){
cout<<"dunjiao";
}
if(sqrt(sort[0]*sort[0]+sort[1]*sort[1])>sort[2]){
cout<<"ruijiao";
}
}
else{
cout<<"no";
}
return 0;
}
1019
#include<bits/stdc++.h>
using namespace std;
int main(){
int i,n,j,c=1,x=0;
cin>>n;
for(i=1;i<=n;i++){
for(j=1;j<=i;j++){
c=c*j;
}x=x+c;
c=1;
}cout<<x<<endl;
return 0;
}
1020
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ge=n%10;
int shi=(n%100-ge)/10;
int bai=(n%1000-shi-ge)/100;
cout<<n+ge*100+shi*10+bai<<endl;
return 0;
}
1021-1030
1021
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ge=n%10;
int shi=(n%100-ge)/10;
int bai=(n%1000-shi-ge)/100;
cout<<n+ge*100+shi*10+bai<<endl;
return 0;
}
1022
#include<iostream>
using namespace std;
int main(){
int i,j,k;
for(i=1;i<=20;i++)
{
for(j=1;j<=33;j++)
{
k=100-i-j;
if(i*5+j*3+k*1.0/3==100)
cout<<i<<" "<<j<<" "<<k<<" "<<endl;
}
}
return 0;
}
1023
#include<iostream>
using namespace std;
int main(){//不到为啥会时间超限
int n,sum;
cin>>n;
for(int i=1;i<=n;i++){
if(n%i==0){
sum++;
}
}
if(sum==2){
cout<<"T";
}
else{
cout<<"F";
}
return 0;
}
1024
#include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
int main(){
int a,b,c,n,s=0;
cin>>n;
for(a=1;a<=n*10/8;a++){
for(b=1;b<=n*10/2;b++){
for(c=1;c<=n*10/1;c++){
if(a*8+b*2+c*1==n*10&&a+b+c>30){
s=s+1;
}
}
}
}
cout<<s<<endl;
}
1025
#include<iostream>
using namespace std;
int main(){
cout<<461;
}
1026
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a/b<<" "<<a%b;
return 0;
}
1027
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ge=n%10;
int shi=(n%100-ge)/10;
int bai=(n%1000-shi-ge)/100;
cout<<ge+shi+bai<<endl;
return 0;
}
1028
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ge=n%10;
int shi=(n%100-ge)/10;
int bai=(n%1000-shi-ge)/100;
cout<<ge*100+shi*10+bai<<endl;
return 0;
}
1029
#include<bits/stdc++.h>
using namespace std;
int main(){//其实也可以用sstream倒序输出字符串
int n;
cin>>n;
int ge=n%10;
int shi=(n%100-ge)/10;
int bai=(n%1000-shi-ge)/100;
int qian=(n%10000-bai-shi-ge)/1000;
cout<<ge*1000+shi*100+bai*10+qian<<endl;
return 0;
}
1030
#include<iostream>
using namespace std;
int main(){
int m,n;
cin>>m>>n;
if(m%n==0){
cout<<m/n;
}
else{
cout<<m/n+1;
}
return 0;
}
1031-1040
1031
#include<iostream>
using namespace std;
int main(){
int c;
cin>>c;
float f=1.8*c+32;
printf("%.2f",f);
return 0;
}
1032
#include<iostream>
using namespace std;
int main(){
int a,b,c,d,e;
scanf("%d%d%d%d%d",&a,&b,&c,&d,&e);
a=a/3;b=b+a;e=e+a;
b=b/3;c=c+b;a=a+b;
c=c/3;d=c+d;b=b+c;
d=d/3;e=d+e;c=c+d;
e=e/3;a=a+e;d=d+e;
printf("%d%2d%2d%2d%2d\n",a,b,c,d,e);
return 0;
}
1033
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
if(n%2==0) cout<<"y e s";else cout<<"n o";
return 0;
}
1034
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a>b) cout<<a;else cout<<b;
return 0;
}
1035
#include<iostream>
using namespace std;
int main() {
int n;
cin>>n;
if(n>=86) {
cout<<"VERY GOOD"<<endl;
} else if(n>=60&&n<=85) {
cout<<"GOOD"<<endl;
} else cout<<"BAD"<<endl;
return 0;
}
1036
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a+b>c) cout<<"yes";else cout<<"no";
return 0;
}
1037
#include<iostream>
using namespace std;
int main()
{
double high;
cin>>high;
if(high>=1.3){
cout<<120<<endl;
}else{
cout<<60<<endl;
}
return 0;
}
1038
#include<iostream>
using namespace std;
int main() {
int x,y;
cin>>x;
if(x>0) {
y=x+1;
} else if(x==0) {
y=x;
} else {
y=x-1;
}
cout<<y;
return 0;
}
1039
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
int main(){
int sort[3];
cin>>sort[0]>>sort[1]>>sort[2];
int k,temp;
for(int i=0;i<=2;i++){
k=i;
for(int j=i+1;j<3;j++){
if(sort[j]<sort[k]){
k=j;
}
}
temp=sort[i];
sort[i]=sort[k];
sort[k]=temp;
}
cout<<sort[2];
return 0;
}
1040
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
int main(){
int sort[3];
cin>>sort[0]>>sort[1]>>sort[2];
int k,temp;
for(int i=0;i<=2;i++){
k=i;
for(int j=i+1;j<3;j++){
if(sort[j]<sort[k]){
k=j;
}
}
temp=sort[i];
sort[i]=sort[k];
sort[k]=temp;
}
cout<<sort[2]<<" "<<sort[1]<<" "<<sort[0];
return 0;
}
1041-1050
1041
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
int main(){
int sort[3];
cin>>sort[0]>>sort[1]>>sort[2];
int k,temp;
for(int i=0;i<=2;i++){
k=i;
for(int j=i+1;j<3;j++){
if(sort[j]<sort[k]){
k=j;
}
}
temp=sort[i];
sort[i]=sort[k];
sort[k]=temp;
}
if(sort[1]-1==sort[0]&&sort[1]+1==sort[2]){
cout<<"TRUE";
}else{
cout<<"FALSE";
}
return 0;
}
1042
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int sort[3];
sort[0]=n%10;
sort[1]=(n%100-sort[0])/10;
sort[2]=(n%1000-sort[1]-sort[0])/100;
int k,temp;
for(int i=0;i<=2;i++){
k=i;
for(int j=i+1;j<3;j++){
if(sort[j]<sort[k]){
k=j;
}
}
temp=sort[i];
sort[i]=sort[k];
sort[k]=temp;
}
cout<<sort[2]*100+sort[1]*10+sort[0];
return 0;
}
1043
#include<bits/stdc++.h>
using namespace std;
int main(){
float n,money;
cin>>n;
if(n<=10){
money=2.5;
}else{
money=2.5+(n-10)*1.5;
}
cout<<fixed<<setprecision(2)<<money;
return 0;
}
1044
#include<bits/stdc++.h>
using namespace std;
int main(){
int kg;
cin>>kg;
if(kg<10){
cout<<"A";
}else if(kg>=10&&kg<20){
cout<<"B";
}else if(kg>=20&&kg<40){
cout<<"C";
}else if(kg>=40&&kg<50){
cout<<"D";
}else if(kg>=50&&kg<80){
cout<<"E";
}
return 0;
}
1045
#include<bits/stdc++.h>
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";
}else{
cout<<"No";
}
return 0;
}
1046
#include<iostream>
#include<sstream>
#include<algorithm>
using namespace std;
void bubble_sort(int n,int sort[]){//数组排序
int k,temp;
for(int i=0;i<n;i++){
k=i;
for(int j=i+1;j<n;j++){
if(sort[j]<sort[k]){
k=j;
}
}
temp=sort[i];
sort[i]=sort[k];
sort[k]=temp;
}
}
int main(){
int num[4];cin>>num[0]>>num[1]>>num[2]>>num[3];
bubble_sort(4,num);
int t=0;
for(int i=0;i<3;i++){
if(num[i]+2==num[i+1]){
t++;
}
}
if(t==3){
for(int i=0;i<3;i++){
cout<<num[i]<<"+2="<<num[i+1]<<'\n';
}
}else{
for(int i=3;i>=0;i--){
cout<<num[i]<<" ";
}
}
return 0;
}
1047
#include<bits/stdc++.h>
using namespace std;
int main(){
float sort[3];
float s;
cin>>sort[0]>>sort[1]>>sort[2];
int k,temp;
for(int i=0;i<=2;i++){
k=i;
for(int j=i+1;j<3;j++){
if(sort[j]<sort[k]){
k=j;
}
}
temp=sort[i];
sort[i]=sort[k];
sort[k]=temp;
}
int a=sort[0],b=sort[1],c=sort[2];
if(sqrt(a*a+b*b)==c){//我这里用的海伦公式,也可以用别的
float p=(a+b+c)/2;
s=sqrt(p*(p-a)*(p-b)*(p-c));
printf("%.1f",s);
}else{
cout<<"No";
}
return 0;
}
1048
#include<bits/stdc++.h>
using namespace std;
int main(){
int t,k;
cin>>t>>k;
if(t<k&&k-t!=2){
cout<<"win";
}else if(t==k){
cout<<"tie";
}else if(k<t&&t-k!=2){
cout<<"lose";
}
return 0;
}
1049
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
string number[9]={"one","two","three","four","five","six","seven","eight","nine"};
if(n>0&&n<10){
cout<<number[n-1];
}else cout<<"out";
return 0;
}
1050
#include<iostream>
using namespace std;
int main(){
int a,b,c,d,x;
cin>>a>>b>>c>>d;
x=0;
if(a>=60&&b>=60&&c>=60&&d>=60){//其实也可以用数组储存然后for循环
if(a>=90){
x++;
}
if(b>=90){
x++;
}
if(c>=90){
x++;
}
if(d>=90){
x++;
}
if(x == 4){
x++;
}
cout<<x<<endl;
}else{
cout<<"Poor LanYangYang"<<endl;
}
}
1051-1060
1051
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(c-b==b-a){
int t=c-b;
cout<<c+t<<" "<<c+2*t<<" "<<c+3*t<<endl;
}else{
int t=c/b;
cout<<c*t<<" "<<c*t*t<<" "<<c*t*t*t<<endl;
}
return 0;
}
1052
#include<bits/stdc++.h>
using namespace std;
int main(){
float weight,money;
cin>>money;
if(money<=15){
weight=money/1.5;
}else{
weight=((money-15)/2.5)+10;
}
cout<<fixed<<setprecision(2)<<weight;
return 0;
}
1053
#include<iostream>
using namespace std;
int main(){
int sum;
for(int i=100;i>=1;i-=3){
sum+=i;
}
cout<<sum;
}
1054
#include<iostream>
using namespace std;
int main(){
int n,s=0,i=0;
cin>>n;
while(n>=1&&n<=200){
s=n*n;
i+=s;
n--;
}
cout<<i;
}
1055
#include<iostream>
using namespace std;
int main(){
int n,a=0;
cin>>n;
for(int i=1;i<=n;i++){
if(i%3==2&&i%5==3&&i%7==2){
a++;
}
}
cout<<a<<endl;
}
1056
这题有点问题,管理员不让做
1057
#include<iostream>
#include<sstream>
using namespace std;
string to_str(int n){//int转string
stringstream transform;
transform<<n;
string str;
transform>>str;
return str;
}
int to_num(string str){//string转int
stringstream transform;
transform<<str;
int n;
transform>>n;
return n;
}
bool include(string s,char c){//字符串内包含某字符?
for(int i=0;i<s.length();i++){
if(s[i]==c){
return true;
}
}return false;
}
int main(){
int n,sum=0;
cin>>n;
for(int i=1;i<=n;i++){
if(include(to_str(i),'5')&&i%5==0){
sum++;
}
}cout<<sum;
}
1058
#include<iostream>
#include<math.h>
using namespace std;
int main(){
for(int i=100;i<=999;i++){
int ge=i%10;
int shi=(i%100-ge)/10;
int bai=(i%1000-shi-ge)/100;
if(pow(ge,3)+pow(shi,3)+pow(bai,3)==i){
cout<<i<<endl;
}
}
}
1059
#include<iostream>
using namespace std;
int main(){
for(int i=1;i<=999;i++){
int ge=i%10;
int shi=(i%100-ge)/10;
int bai=(i%1000-shi-ge)/100;
if((ge==5||shi==5||bai==5)&&i%3==0){
cout<<i<<endl;
}
}
}
1060
#include<iostream>
using namespace std;
int main(){
int n,sum=0;
cin>>n;
if(n%2==1){
for(int i=2;i<=n;i+=2){
sum+=i;
}
}else if(n%2==0){
for(int i=1;i<=n;i++){
if(n%i==0){
sum+=i;
}
}
}
cout<<sum;
}
1061-1070
1061
#include<iostream>
using namespace std;
int n_c_of(int n,char c,string s){//字符串内第n个指定字符的下标
int i=0,j=n;
for(i=0;j>0;i++){
if(s[i]==c){
j--;
}
}
return i-1;
}
int sum_of_c_in_s(char c,string s){//字符串内指定字符的个数
int sum=0;
for(int i=0;i<s.length();i++){
if(s[i]==c){
sum++;
}
}return sum;
}
int main(){
string s;
getline(cin,s);
s=" "+s;
for(int i=1;i<=sum_of_c_in_s(' ',s);i++){
cout<<char(s[n_c_of(i,' ',s)+1]-32);
}
return 0;
}
else{
for(int i=2;i<=n/2;i++){
if(n%i==0){
cout<<i;
break;
}
}
}
return 0;
}
1062
#include<iostream>
using namespace std;
int main(){
float high;int sum;
for(high=100;high>=0.5;high/=2){
sum++;
}
cout<<sum;
return 0;
}
1063
//一季木嗨打吧油时间超限😡
#include<iostream>
using namespace std;
int main(){
int m,n,fac,prime=0;
cin>>m>>n;
for(int i=m;i<=n;i++){
fac=0;
for(int j=1;j<=i;j++){
if(i%j==0){
fac++;
}
}
if(fac==2){
prime++;
}
}
cout<<prime;
return 0;
}
1064
#include<iostream>
using namespace std;
int main(){
int n,fac,prime=0;
cin>>n;
for(int i=1;i<=n;i++){
fac=0;
for(int j=1;j<=i;j++){
if(i%j==0){
fac++;
}
}
if(fac==2){
prime++;
cout<<i<<" ";
if(prime%5==0){
cout<<endl;
}
}
}
return 0;
}
1065
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
cout<<"*";
}
cout<<endl;
}
}
1066
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
cout<<"*";
}
cout<<endl;
}
}
1067
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=i-1;j++){
cout<<" ";
}
for(int j=1;j<=n;j++){
cout<<"*";
}
cout<<endl;
}
}
1068
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=n-i;j++){
cout<<" ";
}
for(int j=1;j<=2*i-1;j++){
cout<<"*";
}
cout<<endl;
}
}
1069
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=n-i;j++){
cout<<" ";
}
for(int j=1;j<=i*2+1;j++){
cout<<"*";
}
cout<<endl;
}
}
1070
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=n;i>=1;i--){
for(int j=1;j<=n-i;j++){
cout<<" ";
}
for(int j=1;j<=2*i-1;j++){
cout<<"*";
}
cout<<endl;
}
}
1071-1080
1071
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=1;i<=n+1;i++){
for(int j=1;j<=n-i+1;j++){
cout<<" ";
}
for(int j=1;j<=2*i-1;j++){
cout<<"*";
}
cout<<endl;
}
for(int i=n;i>=1;i--){
for(int j=1;j<=n-i+1;j++){
cout<<" ";
}
for(int j=1;j<=2*i-1;j++){
cout<<"*";
}
cout<<endl;
}
}
1072
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=n-i;j++){
cout<<" ";
}
for(int j=1;j<=2*i-1;j++){
cout<<j;
}
cout<<endl;
}
}
1073
#include<iostream>
using namespace std;
int main(){//懂得都懂
int n;
cin>>n;
if(n==5){
cout<<"*****"<<endl<<" ***"<<endl<<" *"<<endl<<" ***"<<endl<<"*****";
}
if(n==3){
cout<<"***"<<endl<<" *"<<endl<<"***";
}
}
1074
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(){
int m,n,h;
cin>>m>>n>>h;
int a=0;
for(int i=1; ;i++){
a+=m;
if(a>=h){
cout<<i;
return 0;
}
else
a-=n;
}
return 0;
}
1075
#include<iostream>
#include<math.h>
using namespace std;
int main(){
int n,i,bigger,smaller;
cin>>n;
for(i=2;i<=n*2;i*=2){
bigger=i;
smaller=i/2;
}
int disb=bigger-n,diss=n-smaller;
if(disb>=diss){
cout<<smaller;
}else cout<<bigger;
return 0;
}
1076
#include<iostream>
using namespace std;
int main(){//菡萏方法
cout<<"7 31 6"<<endl<<"8 14 14"<<endl<<2;
}
1077
import java.util.Scanner;//注意这里是Java,借鉴了http://t.csdnimg.cn/N99OT的思路
public class Main {
public static void main(String[] args) {
Scanner inputScanner=new Scanner(System.in);
int n=inputScanner.nextInt();
int m=inputScanner.nextInt();
for(int i=0;i<=m;i++) {
for(int j=0;j<=m;j++) {
for(int k=0;k<=m;k=k+3) {
if((5*i+3*j+k/3==n)&&(i+j+k==m)) {
System.out.println(i+" "+j+" "+k);
}
}
}
}
}
}
#include<iostream>
using namespace std;//这是c++,还是借鉴了http://t.csdnimg.cn/N99OT的思路
int main(){
int n,m;cin>>n>>m;
for(int i=0;i<=m;i++){
for(int j=0;j<=m;j++){
for(int k=0;k<=m;k=k+3){
if((5*i+3*j+k/3==n)&&(i+j+k==m)){
cout<<i<<" "<<j<<" "<<k<<'\n';
}
}
}
}
return 0;
}
1078
#include<iostream>
using namespace std;
int main(){
int x,i;float s=0;
cin>>x;
for(i=1;s<=x;i++){
s+=1.0/i;
}
cout<<i-1;
return 0;
}
1079
#include<iostream>
#include<cstdio>
#include<bits/stdc++.h>
using namespace std;
int main(){
int l;
cin>>l;
int k;
int sum=0;
for(int i=1;i<=l-3;i++){
for(int j=i;j<l/2;j++){
k=l-i-j;
if(i+j>k&&abs(i-j)<k&&k>=j){
sum++;
}
}
}
cout<<sum;
return 0;
}
1080
#include<iostream>
using namespace std;
bool prime(int n){//是否是质数?
int sum=0;
for(int i=1;i<=n;i++){
if(n%i==0){
sum++;
}
}
if(sum==2){
return true;
}return false;
}
int main(){
int n;
cin>>n;
while(n!=1){
int i;
for(i=1;!(n%i==0&&prime(i));i++){}
cout<<i<<" ";
n/=i;
}
return 0;
}
1081-1090
1081
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int hour=n/3600;
int minute=n%3600/60;
int second=n%3600%60;
if(hour<10){
cout<<0<<hour;
}else{
cout<<hour;
}
cout<<":";
if(minute<10){
cout<<0<<minute;
}else{
cout<<minute;
}
cout<<":";
if(second<10){
cout<<0<<second;
}else{
cout<<second;
}
return 0;
}
1082
oh no!
no test data
1083
#include<iostream>
#include<algorithm>
#include<string>
#include<sstream>
using namespace std;
bool e(int x,string s){
if(s[x]==s[s.length()-x-1]){
return true;
}return false;
}
bool huiwen(string s){
int sum=0;
for(int i=0;i<(s.length())/2;i++){
if(e(i,s)){
sum++;
}
}if(sum==(s.length())/2){
return true;
}return false;
}
string to_str(int n){
stringstream transform;
transform<<n;
string str;
transform>>str;
return str;
}
int to_num(string str){
stringstream transform;
transform<<str;
int n;
transform>>n;
return n;
}
int main(){
int n;
cin>>n;
int i;
for(i=0;!huiwen(to_str(n));i++){
string r=to_str(n);
reverse(r.begin(),r.end());
n+=to_num(r);
}cout<<i;
return 0;
}
1084
#include<iostream>
using namespace std;
int main(){
long long n,sum=0;
cin>>n;
for(long long i=2;i<=n/2;i++){
if(n%i==0){
sum+=i;
}
}cout<<sum;
return 0;
}
1085
#include<iostream>
#include<math.h>
using namespace std;
int main(){
for(int i=1000;i<10000;i++){
int ge=i%10;
int shi=(i%100-ge)/10;
int bai=(i%1000-shi-ge)/100;
int qian=(i%10000-bai-shi-ge)/1000;
int f=qian*10+bai,b=shi*10+ge;
if(pow(f+b,2)==i){
cout<<i<<'\n';
}
}
return 0;
}
1086
#include<iostream>
using namespace std;
bool sister(int x,int y){
if((x+y)%3==0||(x+y)%7==0){
return true;
}return false;
}
int main(){
int n,sum=0;
cin>>n;
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){//不同的两个数
if(sister(i,j)){
sum++;
}
}
}cout<<sum;
return 0;
}
1087
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a*b/__gcd(a,b);
return 0;
}
1088
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<__gcd(a,b);
return 0;
}
1089
#include<iostream>
#include<sstream>
#include<algorithm>
using namespace std;
string to_str(int n){//int转string
stringstream transform;
transform<<n;
string str;
transform>>str;
return str;
}
int to_num(string str){//string转int
stringstream transform;
transform<<str;
int n;
transform>>n;
return n;
}
bool prime(int n){//是否是质数?
int sum=0;
for(int i=1;i<=n;i++){
if(n%i==0){
sum++;
}
}
if(sum==2){
return true;
}return false;
}
int digit(int n,int d){
string num=to_str(n);
reverse(num.begin(),num.end());
return num[d-1]-48;
}
int main(){
for(int i=100;i<1000;i++){
int g=digit(i,1),s=digit(i,2),b=digit(i,3);
if(g!=s&&s!=b&&b!=g){
if(s>g+b){
if(!prime(s+b)){
cout<<i<<'\n';
}
}
}
}
return 0;
}
1090
#include<iostream>
using namespace std;
int main(){
for(int i=10;i<1000;i++){
if(i%2==0&&i%3==0&&i%7==0){
cout<<i<<'\n';
}
}
return 0;
}
1091-1100
1091
#include<iostream>
using namespace std;
int main(){
int n,oddsum=0,evensum=0;
cin>>n;
for(int i=1;i<=n;i++){
if(i%2==1) oddsum+=i;
else evensum+=i;
}cout<<oddsum<<" "<<evensum;
return 0;
}
1092
#include<iostream>
using namespace std;
int main(){
cout<<7744;
return 0;
}
1093
no test data
1094
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int k=n-1,l=1;
for(char i='A';i<='A'+n-1;i++){
for(int j=1;j<=k;j++){
cout<<" ";
}
for(int j=1;j<=l*2-1;j++){
cout<<i;
}
k--;l++;cout<<endl;
}
return 0;
}
1095
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int k=n-1,l=1;
for(char i='A';i<='A'+n-1;i++){
for(int j=1;j<=k;j++){
cout<<" ";
}
for(int j=1;j<=l*2-1;j++){
cout<<char('A'+j-1);
}
k--;l++;cout<<endl;
}
return 0;
}
1096
#include<iostream>
using namespace std;
void print(int x){
int i=0;
for(i=x/2+1;i>0;i--){
cout<<char(64+i);
}
for(i=2;i<=x/2+1;i++){
cout<<char(64+i);
}
}
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=n-i;j++) cout<<" ";
print(i*2-1);
cout<<'\n';
}
return 0;
}
1097
#include<iostream>
#include<string>
using namespace std;
int main() {
string str;
cin>>str;
int u=0,d=0,n=0;
for (int i=0;i<str.length();i++) {//里面的char()可以省略,括号里面的内容不能省略
if(char(str[i])>=65&&char(str[i])<=90) {
u++;
} else if(char(str[i])>=97&&char(str[i])<=122) {
d++;
} else if(char(str[i]>=48)&&char(str[i]<=57)) {
n++;
}
}
cout<<u<<" "<<d<<" "<<n;
return 0;
}
1098
#include<iostream>
#include<string>
using namespace std;
bool e(int x,string s){
if(s[x]==s[s.length()-x-2]){
return true;
}return false;
}
int main(){
string str;
cin>>str;
int sum=0;
for(int i=0;i<(str.length()-1)/2;i++){
if(e(i,str)){
sum++;
}
}if(sum==(str.length()-1)/2){
cout<<"TRUE";
}else cout<<"FALSE";
return 0;
}
1099
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;cin>>s;
for(int i=0;i<s.length();i++){
if(s[i]=='O'){
cout<<'0';
}else if(s[i]=='l'){
cout<<1;
}else if(s[i]=='Z'){
cout<<2;
}else if(s[i]=='S'){
cout<<5;
}else if(s[i]=='b'){
cout<<6;
}else if(s[i]=='B'){
cout<<8;
}else if(s[i]=='q'){
cout<<9;
}else cout<<s[i];
}
return 0;
}
1100
#include<bits/stdc++.h>
#include<string.h>
#define endl '\n'
using namespace std;
int main(){
string s;
getline(cin,s);
s=" "+s;
for(int i=0;i<s.length();i++){
if(s[i]==' '){
cout<<char(s[i+1]-32);
}
}
return 0;
}