标签：指南 10 main reverse int 机试 2.1 include 考研

目录

• 1 从零开始
  • 1.1 计算a+b
• 2 暴力求解
  • 2.1 枚举
    • 2.1.1 abc
    • 2.1.2 反序数
    • 2.1.3 对称平方数1
    • 2.1.4 与7无关的数
    • 2.1.5 百鸡问题
    • 2.1.6 Old Bill

1 从零开始

1.1 计算a+b

#include <cstdio>
int main(){
    int a, b;
    while (scanf("%d%d", &a, &b) != EOF) {
        printf("%d\n", a+b);
    }
}

2 暴力求解

2.1 枚举

2.1.1 abc

#include <cstdio>
int main(){
    for(int a=1;a<=9;++a){
        for(int b=1;b<=9;++b){
            for(int c=0;c<=9;++c){
                if(a*100+b*10+c + b*100+c*11 == 532){
                    printf("%d %d %d\n", a,b,c);
                }
            }
        }
    }
    return 0;
}

2.1.2 反序数

#include <cstdio>
int Reverse(int x){
    int reverse = 0;
    while(x!=0){
//        reverse = reverse*10 + x%10;
        reverse *= 10;
        reverse += x%10;
        x /= 10;
    }
    return reverse;
}
int main(){
    for(int i=1000;i<=9999;++i){
        if(i*9==Reverse(i)){
            printf("%d\n", i);
        }
    }
    return 0;
}

2.1.3 对称平方数1

#include <cstdio>
int Reverse(int x){
    int reverse = 0;
    while(x!=0){
//        reverse = reverse*10 + x%10;
        reverse *= 10;
        reverse += x%10;
        x /= 10;
    }
    return reverse;
}
int main(){
    for(int i=0;i<=256;++i){
        if(i*i==Reverse(i*i)){
            printf("%d\n", i);
        }
    }
    return 0;
}

2.1.4 与7无关的数

#include <cstdio>
int main(){
    int sum=0, n;
    while (scanf("%d", &n) != EOF){
        for(int i=1;i<=n;++i){
            if(i%7==0)
                continue;
            if(i%10==7||i/10==7)
                continue;
            sum += i*i;
        }
        printf("%d", sum);
    }
    return 0;
}

2.1.5 百鸡问题

#include <cstdio>
int main(){
    int n, x, y, z;
    while (scanf("%d", &n) != EOF){
        for(x=0;x<=100;++x){
            for(y=0;y<=100-x;++y){
                z = 100-x-y;
                if(5*x+3*y+1.0/3*z <= n){
                    printf("x=%d,y=%d,z=%d\n", x,y,z);
                }
            }
        }
    }
    return 0;
}

2.1.6 Old Bill

#include <cstdio>
int main(){
    int n,x,y,z;
    int price;
    bool flag;
    while (scanf("%d%d%d%d", &n,&x,&y,&z) != EOF){
        flag=false;
        for(int i=9;i>=1;--i){
            for(int j=9;j>=0;--j){
                int sp=i*10000+x*1000+y*100+z*10+j;
                if(sp%n!=0)
                    continue;
                price = sp/n;
                printf("%d %d %d\n", i,j,price);
                flag=true;
                break;
            }
            if(flag){
                break;
            }
        }
        if(!flag){
            printf("0\n");
        }
    }
}

标签：指南,10,main,reverse,int,机试,2.1,include,考研
From： https://www.cnblogs.com/yangyimingcode/p/17063776.html