东方博宜oj答案1000——1050(终极奥义集合版本）这个真的花费了我很多心血，点个赞吧呜呜呜呜好好干活

TOBEON

已于 2024-02-22 20:24:50 修改

阅读量1.4k

点赞数 24

文章标签：算法 c++ 数据结构

于 2024-02-21 21:00:27 首次发布

本文链接：https://blog.csdn.net/webber_lu/article/details/136220141

版权

me的版本

1000: 【入门】熟悉一下Online Judge的环境

#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a+b;
return 0;
}

1001: A+B 输入输出练习I

<button οnclick="copyText()">复制文本</button>
<input type="text" id="textToCopy" value="要复制的文本">

#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
while(cin>>a>>b){
cout<<a+b<<endl;
}
system("pause");
return 0;
}

1002: 【入门】编程求解1+2+3+...+n

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int n;
int i=1;
int max=n;
cin>>n;
while(i<=n){
max=i+max;
i=i+1;
}cout<<max;
return 0;
}

1003: 【入门】编程求1+3+5+...+n

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int n;
int i=1;
int max=n;
cin>>n;
while(i<=n){
max=i+max;
i=i+2;
}cout<<max;
return 0;
}

1004: 【入门】编程求123...n

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int n,i=1;
cin>>n;
int max=n;
while(i<n){
max=i*max;
i=i+1;
}
cout<<max;
return 0;
}

1005: 已知一个圆的半径，求解该圆的面积和周长

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
double pi=3.1415926;
double a;
cin>>a;
cout<<fixed<<setprecision(2)<<a*a*pi<<endl;
cout<<fixed<<setprecision(2)<<2*pi*a<<endl;
return 0;
}

1006: 【入门】打印星号三角形

#include<iostream>
#include<cstring>
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 k=1;k<=2*i-1;k++){
cout<<"*";
}
cout<<endl;
}
return 0;
}

1007: 【入门】统计大写英文字母的个数

#include<bits/stdc++.h>
using namespace std;
int main(){
int cnt=0;
char a[105];
cin.getline(a,105);
for(int i=0;i<strlen(a);i++){
if(a[i]>='A'&&a[i]<='Z'){
cnt++;
}
}
cout<<cnt;
return 0;
}

1008: 【入门】字符图形9-数字正三角

1009: 【入门】数组逆序

#include<bits/stdc++.h>
using namespace std;
int main(){
int a[110];
int m;
cin>>m;
for(int i=1;i<=m;i++){
cin>>a[i];
}
for(int i=m;i>=1;i--){
cout<<a[i]<<" ";
}
return 0;
}

1010: 数组元素的排序

#include<bits/stdc++.h>
using namespace std;
int a[10005];
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n-1;i++){
for(int j=1;j<=n-1;j++){
if(a[j]>a[j+1]){
swap(a[j],a[j+1]);
}
}
}
for(int i=1;i<=n;i++)cout<<a[i]<<" ";
return 0;
}

1011: 【基础】空心六边形

#include<bits/stdc++.h>
using namespace std;
int main()
{
int i,j,n;
cin>>n;
for(i=1;i<n;i++){
cout<<" ";
}
for(i=1;i<=n;i++){
cout<<"*";
}
cout<<endl;
for(i=2;i<=n;i++){
for(j=1;j<=n-i;j++){
cout<<" ";
}
cout<<"*";
for(j=1;j<=n+(i-2)*2;j++){
cout<<" ";
}
cout<<"*"<<endl;
}
for(i=n-1;i>=2;i--){
for(j=1;j<=n-i;j++){
cout<<" ";
}
cout<<"*";
for(j=1;j<=n+(i-2)*2;j++){
cout<<" ";
}
cout<<"*"<<endl;
}
for(i=1;i<n;i++){
cout<<" ";
}
for(i=1;i<=n;i++){
cout<<"*";
}
cout<<endl;
return 0;
}

1012: 【基础】我是第几个单词

#include<iostream>
#include<string>
using namespace std;

int main() {
string str, word;
int count = 0;
getline(cin, str, '.');
cin >> word;
for (int i = 0; i < str.size(); i++) {
int j = i;
while (j < str.size() && str[j] != ' ') {
j++;
}
count++;
if (str.substr(i, j - i) == word) {
cout << count << endl;
return 0;
}
i = j;
}
cout << str.size() - 1 << endl;
return 0;
}

1013: 【入门】一个六位数

#include<iostream>
using namespace std;
int main(){

cout<<179487<<endl;
}

1014: 【入门】编程求1+1/2+1/3+...+1/n

#include<bits/stdc++.h>
using namespace std;
int main(){
double n,a,o;
cin>>a;
n=1;
o=0;
while(n!=a+1){
o=o+1/n;
n++;
}
cout<<fixed<<setprecision(3)<<o;
system("pause");
return 0;
}

1015: 鸡兔同笼问题

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
for(int i=0;i<=50;i++){
for(int j=0;j<=40;j++){
if(i+j==50&&i+j*4==160){
cout<<i<<" "<<j<<endl;
}
}
}
return 0;
}

1016: 【入门】买小狗小猫

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int x,a,b,cnt=0;
cin>>x>>a>>b;
for(int i=1;i<=x/a;i++){
for(int j=1;j<=x/b;j++){
if(i*a+j*b==x&&a!=0&&b!=0){
cnt++;
}
}
}
cout<<cnt;
return 0;
}

1017: 【入门】求零件个数

#include<bits/stdc++.h>
using namespace std;
int main(){
for(int i=1;i<=99999;i++){
if(i%3==2&&i%5==3&&i%7==5){
cout<<i;
break;
}
}
return 0;
}

1018: 【入门】三角形类别

#include<iostream>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c;
if(a>b)swap(a,b);
if(a>c)swap(a,c);
if(b>c)swap(b,c);

//cout<<a<<b<<c;
if(a+b<=c){
cout<<"no";
}else if(a*a+b*b==c*c){
cout<<"zhijiao";
}else if(a*a+b*b<c*c){
cout<<"dunjiao";
}
else {
cout<<"ruijiao";
}
return 0;
}

1019: 【入门】求1!+2!+...+N!

#include<bits/stdc++.h>
using namespace std;
int main(){
int n,sum=0;
cin>>n;
for(int i=1;i<=n;i++){
int x=1;
for(int j=1;j<=i;j++){
x*=j;
}
sum+=x;
}
cout<<sum;
return 0;
}

1020: 【入门】算算和是多少

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int x,g,s,b;
cin>>x;
g=x%10;
s=x/10%10;
b=x/100%10;
cout<<(g+s*10+b*100)+(b+s*10+g*100);
return 0;
}

1021: 【入门】求数II

#include<bits/stdc++.h>
using namespace std;
int main(){
for(int i=1;i<=500;i++){
if(i%3==2&&i%5==3&&i%7==2){
cout<<i<<endl;
}
}
return 0;
}

1022: 【入门】百钱百鸡问题

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
for(int a=0;a<=20;a++){
for(int b=0;b<=33;b++){
for(int c=0;c<=100;c++){
if(a+b+c==100&&a*5+b*3+c/3.0==100){
cout<<a<<" "<<b<<" "<<c<<endl;
}
}
}
}
return 0;
}

1023: 【入门】判断素数

#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
bool flag=0;
for(int i=2;i<n;++i)
{
if(n%i==0)
{
flag=1;
}
}
if(flag==1||n==1) cout<<"F";
else cout<<"T";
return 0;
}

1024: 【入门】购买文具

#include<bits/stdc++.h>
using namespace std;
float n,a,b,c;
int main()
{
cin>>n;
n=n*10;
int m=0;
for(a=1;a<n/8;a++)
for(b=1;b<n/2;b++)
for(c=1;c<n/1;c++)
{
if(a*8+b*2+c*1==n&&a+b+c>30)
m++;
}
cout<<m;
return 0;
}

1025: 【入门】兑换硬币

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int cnt=0;
for(int i=1;i<=100;i++){
for(int j=1;j<=50;j++){
for(int n=1;n<=20;n++){
if(i*1+j*2+n*5==100){
cnt++;
}
}
}
}
cout<<cnt;
return 0;
}

1026: 求商数和余数

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a/b<<" "<<a%b;
return 0;
}

1027: 【入门】求任意三位数各个数位上数字的和

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int x,g,s,b;
cin>>x;
g=x%10;
s=x/10%10;
b=x/100%10;
cout<<g+s+b;
return 0;
}

1028: 【入门】输入一个三位数，把个位和百位对调后输出

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int x,g,s,b;
cin>>x;
g=x%10;
s=x/10%10;
b=x/100%10;
cout<<b<<s<<g<<g<<s<<b;
return 0;
}

1029: 倒序输出一个四位整数

#include<bits/stdc++.h>
using namespace std;
int main(){
int n,g,s,b,q;
cin>>n;
g=n%10;
s=n/10%10;
b=n/100%10;
q=n/1000%10;
cout<<q+b*10+s*100+g*1000;
return 0;
}

1030: 【入门】心系南方灾区

#include <iostream>
#include <string>
using namespace std;
int main()
{
string a;
getline(cin, a);
int num1 = 0;
int num2 = 0;
int work = 0;
for (int i = 0; i < a.size(); i++)
{
if (a[i] >= 48 && a[i] <= 57&&work==0)
{
num1 = num1 * 10 + a[i] - 48;
}
if (a[i] >= 48 && a[i] <= 57 && work == 1)
{
num2 = num2 * 10 + a[i] - 48;
}
if (a[i] == '+')
{
work = 1;
}
}
cout << num1+num2;
return 0;
}

1031: 温度转换

#include<bits/stdc++.h>
using namespace std;
int main(){
double n,c=9,v=5;
cin>>n;
cout<<fixed<<setprecision(2)<<c/v*n+32;
return 0;
}

1032: 【入门】分糖果

#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int a,b,c,d,e;
cin>>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=d+c;b=b+c;
d=d/3;e=e+d;c=c+d;
e=e/3;a=a+e;d=d+e;
cout<<a<<" "<<b<<" "<<c<<" "<<d<<" "<<e;
return 0;
}

1033: 【入门】判断奇偶数

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int a;
cin>>a;
if(a%2==0){
cout<<"y e s";
}else{
cout<<"n o";
}

return 0;
}

1034: 【入门】两数比大小

#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a>b){
cout<<a;
}
if(b>a){
cout<<b;
}
return 0;
}

1035: 【入门】判断成绩等级

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int a;
cin>>a;
if(a>85){
cout<<"VERY GOOD";
}else if(a<86&&a>=60){
cout<<"GOOD";
}else{
cout<<"BAD" ;
}
return 0;
}

1036: 简单判断

#include<bits/stdc++.h>
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>
#include<iomanip>
using namespace std;
int main(){
double a;
cin>>a;
if(a<=1.3){
cout<<"60";
}else{
cout<<"120";
}
return 0;
}

1038: 【入门】编程求解数学中的分段函数

#include <bits/stdc++.h>
using namespace std;

int main()
{
int x;
cin>>x;
if(x>0)
cout<<x+1<<endl;
else if(x==0)
cout<<0<<endl;
else if(x<0)
cout<<x-1<<endl;
return 0;
}

1039: 求三个数的最大数

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c;
if(a>b){
d=a;
}else{
d=b;
}
if(d<c){

d=c;
}
cout<<d;
return 0;
}

1040: 【入门】求三个数的大小顺序

#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,sum=0,mx,mn;
cin>>a>>b>>c;
sum=a+b+c;
mx=a;
mn=a;
if(b>mx)mx=b;
if(b<mn)mn=b;
if(c>mx)mx=c;
if(c<mn)mn=c;
cout<<mx<<" "<<sum-mx-mn<<" "<<mn<<endl;
return 0;
}

1041: 【入门】判断三个整数是否相邻

#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a+1==b&&b+1==c){
cout<<"TRUE";
}else if(a+1==c&&c+1==b){
cout<<"TRUE";
}else if(b+1==a&&a+1==c){
cout<<"TRUE";
}else if(b+1==c&&c+1==a){
cout<<"TRUE";
}else if(c+1==a&&a+1==b){
cout<<"TRUE";
}else if(c+1==b&&b+1==a){
cout<<"TRUE";
}else{
cout<<"FALSE";
}
return 0;
}

1042: 【入门】求任意三位数打乱次序后的最大值

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int n,a,b,c,temp;
cin>>n;
a=n%10;
b=n/10%10;
c=n/100%10;

if(a>b){
temp=a;
a=b;
b=temp;
}
if(a>c){
temp=a;
a=c;
c=temp;
}
if(b>c){
temp=b;
b=c;
c=temp;
}
cout<<c*100+b*10+a;



return 0;
}

1043: 【入门】行李托运价格

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int n;
double price;
cin>>n;
if(n<=10){
price=2.5;
}else{
price=2.5+(n-10)*1.5;
}


//cout<<fixed<<setprecision(2)<<price;
printf("%.2f",price);


return 0;
}

1044: 【入门】找出最经济型的包装箱型号

#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
if(n>=50)cout<<"E";
else if(n>=40)cout<<"D";
else if(n>=20)cout<<"C";
else if(n>=10)cout<<"B";
else cout<<"A";
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 <algorithm>
using namespace std;
bool cmp(int a, int b)
{
return a > b;
}
int main()
{
int a[4];
for (int i = 0; i < 4; i++)
{
cin >> a[i];
}
sort(a, a + 4);//升序排列
if (a[0] + 2 == a[1] && a[1] + 2 == a[2] && a[2] + 2 == a[3])
{
cout << a[0] << "+2=" << a[1] << endl;
cout << a[1] << "+2=" << a[2] << endl;
cout << a[2] << "+2=" << a[3];
}
else
{
sort(a, a + 4, cmp);//降序排列
for (int i = 0; i < 4; i++)
{
cout << a[i] << " ";
}
}
return 0;
}

1047: 【入门】能否构成直角三角形

#include<bits/stdc++.h>
using namespace std;
int main(){
double a,b,c;
cin>>a>>b>>c;
if(a*a+b*b==c*c){
cout<<fixed<<setprecision(1)<<a*b/2;
}else if(a*a+c*c=b*b){
cout<<fixed<<setprecision(1)<<a*c/2;
}else if(b*b+c*c=a*a){
cout<<fixed<<setprecision(1)<<b*c/2;
}else{
cout<<"No";
}
return 0;
}

1048: 【入门】猜拳

#include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if ((a == 1 && b == 2) || (a == 2 && b == 3) || (a == 3 && b == 1))
{
cout << "win";
}
else if (a == b)
{
cout << "tie";
}
else
{
cout << "lose";
}
return 0;
}

1049: 【入门】汉译英

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
int n;
cin>>n;
if(n==1){
cout<<"one";
}
if(n==2){
cout<<"two";
}
if(n==3){
cout<<"three";
}
if(n==4){
cout<<"four";
}
if(n==5){
cout<<"five";
}
if(n==6){
cout<<"six";
}
if(n==7){
cout<<"seven";
}
if(n==8){
cout<<"eight";
}
if(n==9){
cout<<"nine";
}
if(n>9){
cout<<"out";
}
return 0;
}

1050: 【入门】小高考

未完待续......

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

原文链接：https://blog.csdn.net/webber_lu/article/details/136142344

别人的版本

1000

#include <iostream>
using namespace std;
int main()
{
int a;
int b;
cin >> a >> b;
cout << a+b;
return 0;
}
1002

#include <iostream>
using namespace std;
int main()
{
   int a;
   cin >> a;
   int sum = 0;
   for (int i = 1; i <= a; i++)
   {
       sum += i;
   }
   cout << sum;
   return 0;
}
1003

#include <iostream>
using namespace std;
int main()
{
   int a;
   cin >> a;
   int sum = 0;
   for (int i = 1; i <= a; )
   {
       sum += i;
       i += 2;
   }
   cout << sum;
   return 0;
}
1004

#include <iostream>
using namespace std;
int main()
{
   int a;
   cin >> a;
   int sum = 1;
   for (int i = 1; i <= a; i++)
   {
       sum *= i;
   }
   cout << sum;
   return 0;
}
1005

#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
   const double PI = 3.1415926;
   int a;
   cin >> a;
   cout << fixed << setprecision(2) << PI * a * a << endl;
   cout << fixed << setprecision(2) << 2 * PI * a;
   return 0;
}
1006

这道题是我觉得在前面的嵌套循环题或者说是前面的题中我觉得比较难的一道了，考虑的时间会稍微长一点，毕竟它要有三个一样的东西，但是只要慢下心来拿笔谢谢其实还是比较简单的。

#include <iostream>
using namespace std;
int main()
{
   int n;
   cin >> n;
   for (int i = 1; i <= n; i++)
   {
       for (int j = 1; j <= 6 * n - 3; j++)
       {
           if ((j >n-i && j < n+i) || (j > 3*n-i-1 && j < 3*n+i-1) || (j > 5 * n - i - 2 && j < 5 * n + i-2))
           {
               cout << "*";
           }
           else
           {
               cout << " ";
           }
       }
       cout << endl;
   }
   return 0;
}

1007

#include <iostream>
using namespace std;
int main()
{
   char a[80];
   int num = 0;
   int num2 = 0;
   for (int i = 0; i < 80; i++)
   {
       cin >> a[i];
       num++;
       if (a[i] == '.')
       {
           break;
       }
   }
   for (int i = 0; i < num; i++)
   {
       if ((int)a[i] >= 65 && (int)a[i] <= 90)
       {
           num2++;
       }
   }
   cout << num2;
   return 0;
}

采用了强转将字母转成了ASCII码，A到Z对应ASCII码是65-90.不过这样子获取字符有一个缺点，就是如果重新输出的话空格是打不出来的，在网上找到了getchar()的一些用法但还没玩明白，等我慢慢学呜呜呜呜呜呜。

1008

#include <iostream>
using namespace std;
int main()
{
   int n;
   cin >> n;
   for (int i = 1; i <= n; i++)
   {
       for (int j = 1; j <= 2 * n + 1; j++)
       {
           if (j>n-i&&j<n+i)
           {
               cout << i;
           }
           else
           {
               cout << " ";
           }
       }
       cout << endl;
   }
   return 0;
}

注意换行的位置

1009

#include <iostream>
using namespace std;
int main()
{
   int n;
   cin >> n;
   int a[101];
   for (int i = 0; i < n; 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;
   cin >> n;
   int* p = new int[n];
   for (int i = 0; i < n; i++)
   {
       cin >> p[i];
   }
   for (int i = 0; i < n; i++)
   {
       for (int j = 0; j < n - i - 1; j++)
       {
           if (p[j] > p[j + 1])
           {
               int temp = p[j + 1];
               p[j + 1] = p[j];
               p[j] = temp;
           }
       }
   }
   for (int i = 0; i < n; i++)
   {
       cout << p[i] << " ";
   }
   delete[]p;
   return 0;
}

冒泡排序法，当然用sort可以更快，权当复习一下冒泡，在堆区开辟内存的话记得delete

1011

#include <iostream>
using namespace std;
int main()
{
   int n;
   cin >> n;
   int i, j;
   for (i = 1; i <= n; i++)
   {
       for (j = 1; j <= n - i; j++)
       {
           cout << " ";
       }
       if (i == 1)
       {
           for (j = 1; j <= n; j++)
           {
               cout << "*";
           }
       }
       else
       {
           cout << "*";
           for (j = 1; j <= n + 2 * (i - 2); j++)
           {
               cout << " ";
           }
           cout << "*";
       }
       cout << endl;
   }
   for (i = n - 1; i >= 1; i--)
   {
       for (j = 1; j <= n - i; j++)
       {
           cout << " ";
       }
       if (i == 1)
       {
           for (j = 1; j <= n; j++)
           {
               cout << "*";
           }
       }
       else
       {
           cout << "*";
           for (j = 1; j <= n + 2 * (i - 2); j++)
           {
               cout << " ";
           }
           cout << "*";
       }
       cout << endl;
   }
   return 0;
}

1011本质也是嵌套循环的使用，不过可能在分类上比较复杂一点，这是东方博宜oj上的题解

1012是前五十题里最有挑战性的一道，也是最具价值的一道
1012

#include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main()
{
   string str1;
   string str2;
   int num1 = 0;
   int word_number = 1;
   int nearest = 9999;
   int num2 = 0;//记录空格个数
   getline(cin, str1);
   getline(cin, str2);//这两个用来接收字符串
   str2 = " " + str2 ;//最重点！！在前面添加空格证明是单词，不然this中的is会被误判
   int a = str1.find(str2);//找到匹配的位置
   if (a >= 0)
   {
       for (int i = 0; i < str1.size(); i++)
       {
           if (str1[i] == ' ')
           {
               num2++;
               if (abs(i - a) < nearest)
               {
                   nearest = abs(i - a);//空格离单词最近
                   if (nearest == 0)
                   {
                       break;//0就是最近，不可能更小，直接break跳出循环
                   }
               }
           }
       }
       cout << num2 + 1;//单词是空格个数的下一个，所以加一
   }
   else if (a < 0)
   {
       for (int i = 0; i < str1.size(); i++)
       {
           if ((str1[i] > 64 && str1[i] < 91) || (str1[i] > 96 && str1[i] < 123))//ASCII码中字母对应的值
           {
               num1++;
           }
       }
       cout << num1;
   }
   return 0;
}

1013

#include <iostream>
using namespace std;
int main()
{
   int t, x;
   for (int i = 100007; i < 999999; i += 10)
   {
       int t = i / 10;
       int x = 700000 + t;
       if (x % i == 0 && x / i == 4)
       {
           cout << i;
       }
   }
   return 0;
}

1014

#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
   int n;
   cin >> n;
   double sum = 0;
   for (double i = 1; i <= n; i++)
   {
       sum += 1.0 / i;
   }
   cout << fixed << setprecision(3) << sum;
   return 0;
}
1015

#include <iostream>
using namespace std;
int main()
{
cout << 20 << " " << 30;
return 0;
}
1016

#include <iostream>
using namespace std;
int main()
{
   int X, A, B;
   cin >> X >> A >> B;
   int num = 0;
   for (int i = 1; i <X/A+1; i++)
   {
       for (int j = 1; j <=X/B+1; j++)
       {
           if (i * A + j * B == X)
           {
               num++;
           }
       }
   }
   cout << num;
   return 0;
}

1017

#include <iostream>
using namespace std;
int main()
{
cout << 173;
return 0;
}
1018

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
   int a[3];
   for (int i = 0; i < 3; i++)
   {
       cin >> a[i];
   }
   sort(a, a + 3);
   if (a[0] + a[1] > a[2] && pow(a[0], 2) + pow(a[1], 2) > pow(a[2], 2))
   {
       cout << "ruijiao";
   }
   else if (a[0] + a[1] > a[2] && pow(a[0], 2) + pow(a[1], 2) == pow(a[2], 2))
   {
       cout << "zhijiao";
   }
   else if (a[0] + a[1] > a[2] && pow(a[0], 2) + pow(a[1], 2) < pow(a[2], 2))
   {
       cout << "dunjiao";
   }
   else
   {
       cout << "no";
   }
   return 0;
}

1019

#include <iostream>
using namespace std;
int main()
{
   int n;
   cin >> n;
   int sum = 0;
   int num = 1;
   for (int i = 1; i <= n; i++)
   {
       for (int j = i; j > 0; j--)
       {
           num *= j;
       }
       sum += num;
       num = 1;
   }
   cout << sum;
   return 0;
}

1020

#include <iostream>
#include <cmath>
using namespace std;
int main()
{
   int n;
   cin >> n;
   int sum = 0;
   int a, b, c;
   a = n / 100;
   b = n % 100 / 10;
   c = n % 100 % 10;
   sum = n + 100 * c + 10 * b + a;
   cout << sum;
   return 0;
}

1021

#include <iostream>
using namespace std;
int main()
{
   for (int i = 1; i <= 500; i++)
   {
       if (i % 3 == 2 && i % 5 == 3 && i % 7 == 2)
       {
           cout << i << endl;
       }
   }
   return 0;
}
1022

#include <iostream>
using namespace std;
int main()
{
   for (int i = 1; i <= 20; i++)
   {
       for (int j = 30; j >= 0; j--)
       {
           if (7 * i + 4 * j == 100&&(100-i-j)%3==0)
           {
               cout << i << " " << j << " " << 100 - i - j << endl;
           }
       }
   }
   return 0;
}

1023

#include <iostream>
#include <cmath>
using namespace std;
int main()
{
   int n;
   cin >> n;
   int num = 0;
   if (n == 1)
   {
       cout << "F";
   }
   for (int i = 2; i < sqrt(n); i++)
   {
       if (n % i == 0&&n/i!=1&&n>=2)
       {
           num = 1;
           cout << "F";
           break;
       }
   }
   if (num == 0&&n>=2)
   {
       cout << "T";
   }
   return 0;
}

1024

#include <iostream>
#include <cmath>
using namespace std;
int main()
{
   int n;
   cin >> n;
   int num = 0;
   for (int i = 1; i <= 63; i++)
   {
       for (int j = 1; j <= 250; j++)
       {
           for (int k = 1; k <= 500; k++)
           {
               if (i + j + k > 30 && 8 * i + 2 * j + k == 10 * n)
               {
                   num++;
               }
           }
       }
   }
   cout << num;
   return 0;
}

1025

#include <iostream>
using namespace std;
int main()
{
cout << 461;
return 0;
}
1026

#include <iostream>
using namespace std;
int main()
{
   int a, b;
   cin >> a >> b;
   cout << a / b << " " << a % b;
   return 0;
}
1027

#include <iostream>
using namespace std;
int main()
{
   int n, n1, g, s, b;
   cin >> n;
   g = n % 10;
   s = n % 100 / 10;
   b = n / 100;
   n1 = g + s + b;
   cout << n1;
   return 0;
}
1028

#include <bits/stdc++.h>
using namespace std;
int main(){
   int n,n1,g,s,b;
   cin>>n;
   g=n%10;
   s=n%100/10;
   b=n/100;
   n1=g*100+s*10+b;
   cout<<n1;
   return 0;
}
1029

#include <iostream>
using namespace std;
int main()
{
   int n;
   cin >> n;
   int a = n / 1000;
   int b = n % 1000 / 100;
   int c = n % 1000 % 100 / 10;
   int d = n % 1000 % 100 % 10;
   cout << 1000 * d + 100 * c + 10 * b + a;
   return 0;
}
1030

#include <iostream>
using namespace std;
int main()
{
   int a, b;
   cin >> a >> b;
   if (a % b == 0)
   {
       cout << a / b;
   }
   else if (a % b != 0)
   {
       cout << a / b + 1;
   }
   return 0;
}

1031

#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
   double n;
   cin >> n;
   double f = (9 * n + 160) / 5.0;
   cout << fixed << setprecision(2) << f;
   return 0;
}
1032

#include <iostream>
using namespace std;
int main()
{
   int a, b, c, d, e;
   cin >> a >> b >> c >> d >> e;
   if (a / 3 == 0)
   {
       a = 0;
   }
   else
   {
       a = (a - a % 3) / 3;
       b += a;
       e += a;
   }
   if (b / 3 == 0)
   {
       b = 0;
   }
   else
   {
       b = (b - b % 3) / 3;
       c += b;
       a += b;
   }
   if (c / 3 == 0)
   {
       c = 0;
   }
   else
   {
       c = (c - c % 3) / 3;
       d += c;
       b += c;
   }
   if (d / 3 == 0)
   {
       d = 0;
   }
   else
   {
       d = (d - d % 3) / 3;
       c += d;
       e += d;
   }
   if (e / 3 == 0)
   {
       e = 0;
   }
   else
   {
       e = (e - e % 3) / 3;
       a += e;
       d += e;
   }
   cout << a << " " << b << " " << c << " " << d << " " << e;
   return 0;
}

很sb的做法....只能说本人水平就这样了，本来想用循环的，但由于5号小朋友要把糖果分给1号所以一下子没想到很好的解决方案，把abcde给转换成ASCII码也不是很方便，索性用最笨比的做法。

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";
   }
   else if (n >= 60 && n < 86)
   {
       cout << "GOOD";
   }
   else
   {
       cout << "BAD";
   }
   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 n;
   cin >> n;
   if (n < 1.3)
   {
       cout << "60";
   }
   else
   {
       cout << "120";
   }
   return 0;
}

1038

#include <iostream>
using namespace std;
int main()
{
   int x;
   cin >> x;
   if (x > 0)
   {
       cout << x + 1;
   }
   else if (x == 0)
   {
       cout << 0;
   }
   else
   {
       cout << x - 1;
   }
   return 0;
}

1039

#include <iostream>
using namespace std;
int main()
{
   int a, b, c;
   int d;
   cin >> a >> b >> c;
   d = (a > b) ? (a > c ? a : c) : (b > c ? b : c);
   cout << d;
   return 0;
}
1040

#include <iostream>
#include <algorithm>
using namespace std;
bool cmp(int a,int b)
{
   return a > b;
}
int main()
{
   int a[3];
   cin >> a[0] >> a[1] >> a[2];
   sort(a, a + 3, cmp);
   for (int i = 0; i < 3; i++)
   {
       cout << a[i] << " ";
   }
   return 0;
}

1041

#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
   int a[3];
   for (int i = 0; i < 3; i++)
   {
       cin >> a[i];
   }
   sort(a, a + 3);
   if (a[0] + 1 == a[1] && a[1] + 1 == a[2])
   {
       cout << "TRUE";
   }
   else
   {
       cout << "FALSE";
   }
   return 0;
}

1042

#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
   int n;
   cin >> n;
   int a, b, c;
   a = n / 100;
   b = n % 100 / 10;
   c = n % 100 % 10;
   int d[3];
   d[0] = a;
   d[1] = b;
   d[2] = c;
   sort(d, d + 3);
   cout << d[2] * 100 + d[1] * 10 + d[0];
   return 0;
}

感觉复杂了点..不过看到题目一下子就蹦出来这个思路，题也不难，干脆就这样吧（摆烂

1043

#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
   int n;
   cin >> n;
   double num = 0;
   if (n <= 10)
   {
       num = 2.5;
       cout << fixed << setprecision(2) << num;//保留小数，需要iomanip头文件
   }
   if (n > 10)
   {
       num = 1.5 * n - 12.5;
       cout << fixed << setprecision(2) << num;
   }
   return 0;
}

1044

#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
   int n;
   cin >> n;
   if (n < 10)
   {
       cout << 'A';
   }
   else if (n >= 10 && n < 20)
   {
       cout << 'B';
   }
   else if (n >= 20 && n < 40)
   {
       cout << 'C';
   }
   else if (n >= 40 && n < 50)
   {
       cout << 'D';
   }
   else if (n >= 50 && n < 80)
   {
       cout << 'E';
   }
   return 0;
}

1045

#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
   int a[3];
   cin >> a[0] >> a[1] >> a[2];
   sort(a, a + 3);
   if (a[0] + a[1] > a[2])
   {
       cout << "Yes";
   }
   else
   {
       cout << "No";
   }
   return 0;
}

1046

#include <iostream>
#include <algorithm>
using namespace std;
bool cmp(int a, int b)
{
   return a > b;
}
int main()
{
   int a[4];
   for (int i = 0; i < 4; i++)
   {
       cin >> a[i];
   }
   sort(a, a + 4);//升序排列
   if (a[0] + 2 == a[1] && a[1] + 2 == a[2] && a[2] + 2 == a[3])
   {
       cout << a[0] << "+2=" << a[1] << endl;
       cout << a[1] << "+2=" << a[2] << endl;
       cout << a[2] << "+2=" << a[3];
   }
   else
   {
       sort(a, a + 4, cmp);//降序排列
       for (int i = 0; i < 4; i++)
       {
           cout << a[i] << " ";
       }
   }
   return 0;
}

1047

#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;

int main()
{
   double a[3];
   cin >> a[0] >> a[1] >> a[2];
   sort(a, a + 3);
   if (a[0] + a[1] > a[2] && pow(a[0], 2) + pow(a[1], 2) == pow(a[2], 2))
   {
       cout << fixed << setprecision(1) << a[0] * a[1] / 2.0;
   }
   else
   {
       cout << "No";
   }
   return 0;
}

1048

#include <iostream>
using namespace std;
int main()
{
   int a, b;
   cin >> a >> b;
   if ((a == 1 && b == 2) || (a == 2 && b == 3) || (a == 3 && b == 1))
   {
       cout << "win";
   }
   else if (a == b)
   {
       cout << "tie";
   }
   else
   {
       cout << "lose";
   }
   return 0;
}

1049

#include <iostream>
using namespace std;
int main()
{
   int n;
   cin >> n;
   if (n == 1)
   {
       cout << "one";
   }
   else if (n == 2)
   {
       cout << "two";
   }
   else if (n == 3)
   {
       cout << "three";
   }
   else if (n == 4)
   {
       cout << "four";
   }
   else if (n == 5)
   {
       cout << "five";
   }
   else if (n == 6)
   {
       cout << "six";
   }
   else if (n == 7)
   {
       cout << "seven";
   }
   else if (n == 8)
   {
       cout << "eight";
   }
   else if (n == 9)
   {
       cout << "nine";
   }
   else
   {
       cout << "out";
   }
   return 0;
}

1050

#include <iostream>
using namespace std;
int main()
{
   int a[4];
   int num = 0;
   int judge = 0;
   for (int i = 0; i < 4; i++)
   {
       cin >> a[i];
       if (a[i] >= 90)
       {
           num++;
       }
       if (a[i] < 60)
       {
           cout << "Poor LanYangYang";
           judge = 1;
           break;
       }
   }
   if (judge == 0 && num != 4)
   {
       cout << num;
   }
   if (judge == 0 && num == 4)
   {
       cout << 5;
   }
   return 0;
}