2024年12月 GESP C++ 3级

$-125$，$-3$

$-3$，$-125$

$-3$，$-3$

$-125$，$-125$

对于无符号数，原码就是真值

正数的反码是其本身

负数的反码和补码是不一样的

负数的反码，在其原码的基础上，各个位取反

2620045

2004526

729125

2420045

$1001110001.101$

$101.101$

$101.1001110001$

$1001110001.1101$

5 && 3 == 0

5 | 3 == 8

5 || 3 == 11

5 & 3 == 0001

1111 1100

$-2$

1111 1101

1111 1010

12345

2345@

112345chenadai

12345chenadai

使 $a$ 的二进制表示从右往左的第二位为 $1$

使 $a$ 的二进制表示从右往左的第一位为 $0$

使 $a$ 的二进制表示从右往左第二位为 $0$

使 $a$ 的二进制表示最高位为 $0$

right

wrong

hello

不能正确执行

$11$

$10$

$13$

$12$

$65$

A

a

$97$

int n,m,res,d;
cin >> n >> m>>d;
for(int i = n+1; i <= m; i++){
    int temp = i;
    while(temp){
        if(temp % 10 == d) res++;
        temp /= 10;
    }
}
cout << res << endl;
return 0;

int n,m,res,d;
cin >> n >> m>>d;
for(int i = n; i <= m; i++){
    int temp = i;
    while(temp){
        if(temp % 10 = d) res++;
        temp /= 10;
    }
}
cout << res << endl;
return 0;

int n,m,res=0,d;
cin >> n >> m>>d;
for(int i = n; i <= m; i++){
    int temp = i;
    while(temp){
        if(temp % 10 == d) res++;
        temp /= 10;
    }
}
cout << res << endl;
return 0;

int n,m,res=0,d;
cin >> n >> m>>d;
for(int i = n; i <= m; i++){
    while(temp){
        if(temp % 10 == d) res++;
        temp /= 10;
    }
}
cout << res << endl;
return 0;

for(int i = 0; i <= 100; i++){
    for(int j = 0; j <= 100; j++){
        for(int k = 0; k <= 100; k++){
            if(i + j + k == 100 && 25 * i + 10 * j + k == 300)
                cout << i << " " << j << " " << k << endl;
        }
    }
}

for(int i = 0; i <= 100; i++){
    for(int j = 0; j <= 100; j++){
        for(int k = 0; k <= 100; k++){
            if(i + j + k == 100 && 20 * i + 10 * j + k == 300)
                cout << i << " " << j << " " << k << endl;
        }
    }
}

for(int i = 0; i <= 20; i++){
    for(int j = 0; j <= 34; j++){
        for(int k = 0; k <= 20; k++){
            if(i + j + k == 100 && 15 * i + 9 * j + k == 300)
                cout << i << " " << j << " " << k << endl;
        }
    }
}

for(int i = 0; i <= 100; i++){
    for(int j = 0; j <= 100; j++){
        for(int k = 0; k <= 100; k++){
            if(i + j + k == 100 && 15 * i + 9 * j + k == 300)
                cout << i << " " << j << " " << k << endl;
        }
    }
}

if(N >= 3){
    cout<<2<<endl;
    for(int i = 2;i <= N;i ++){
        for(int j = 2;j < i;j ++){
            if(i % j != 0){
                flag = 1;
            }
        }
        if(flag == 0){
            cout<<i<<endl;
        }
        flag = 0;
    }
}

if(N >= 2){
    for(int i = 3;i <= N;i ++){
        for(int j = 2;j < i;j ++){
            if(i % j == 0){
                flag = 1;
            }
        }
        if(flag == 0){
            cout<<i<<endl;
        }
        flag = 0;
    }
}

if(N >= 2){
    cout<<2<<endl;
    for(int i = 3;i <= N;i ++){
        for(int j = 2;j < i;j ++){
            if(i % j == 0){
                flag = 1;
            }
        }
        if(flag == 0){
            cout<<i<<endl;
        }
        flag = 0;
    }
}

if(N >= 2){
    cout<<2<<endl;
    for(int i = 3;i <= N;i ++){
        for(int j = 2;j < i;j ++){
            if(i % j == 0){
                flag = 1;
            }
        }
        if(flag == 0){
            cout<<i<<endl;
        }
    }
}

$4$ 段，分别是 $1$、$2$、$4$、$8$

$15$ 段，每段 $1$ 个

$6$ 段，分别是 $3$、$3$、$3$、$3$、$2$、$1$

$9$ 段，分别是 $2$、$2$、$2$、$2$、$2$、$2$、$1$、$1$、$1$