E840 202512GESP C++二级试卷-练习

int N;
cin >> N;
remainder = ______________;
if (remainder == 0)
	cout << 1;
else if (remainder == 1)
	cout << 2;
else
	cout << 3;

int rst = 0, N;
for (int i = 0; i < 4; i++){
	cin >> N;
	rst += ___________; // L1
}
cout << ___________; // L2

for (int i = -2; i < 2; i++)
	if (i % 2)
		printf("%d#",i);

int cnt = 0, N;
for (int i =1; i < 10; i += 2)
	for (int j =0; j < i; j++)
		cnt += 1;
cout << cnt;

int i,j;
for (i = 1; i < 12; i++){
	if (i % 2 == 0)
		continue;
	for (j = 0; j < i; j++)
		if (i * j % 2 == 0)
			break;
	if(j >= i)
		cout << i * j << " ";
}
if(i >= 12)
	cout << (i * j);

int i;
for (i = 0; i < 10; i++)
	cout << i;

int num = 0;
while (num <= 5){
	num += 1;
	if (num % 3)
		continue;
	printf("%d#",num);
}
if(num > 5)
	printf("%d", num);

int cnt = 0;
for (int i = 0; i <5; i++)
	for (int j =i; j < 4; j++)
		cnt += 1;
cout << cnt;

int N, M, Flag, Sum, num;
cout << "请输入N，不等于0的正整数：";
cin >> N;
cout << "请输入M：M必须大于1小于9：";
cin >> M;
Sum = 0; // 记录各位数之和
Flag = 0; // 假设记录N不含有M
while (N != 0){
	num = N % 10;
	Sum += num;
	if (num == M)
		Flag = 1;
	N /= 10;
}
if ((N % M == 0) && (Flag == 1) && (Sum % M == 0)) // L1
	printf("%d 是 %d 的完整漂亮数", N, M);
else
	printf("%d 不是 %d 的完整漂亮数", N, M);

int n,i,j,k;
cin >> n;
for (i = 0; i < n; i++){
	for (j = 0; j < n-i-1; j++)
    	cout << " ";
	for (k = 0; k < 2*i+1; k++)
    	cout << "*";
	cout << endl;
}

float total_score, max_score, min_score, now_score;
for (int i = 0; i < 25; i++){
	max_score = 0;  // 记录最高分
	min_score = 10; // 记录最低分
	total_score = 0; // 记录总分
	for (int j = 0; j < 10; j++){
		cin >> now_score; // 录入评委打分
		max_score = max(max_score, now_score); // L1
		min_score = min(min_score, now_score); // L2
		total_score += now_score;
	}
	cout << (total_score - max_score - min_score);
}

cin >> N;
while (N)
	N /= 10;
cout << N;

int a,b;
a = 4;
b = a == 5;
cout << a << ' ' << b;

int N, N10, i;
cin >> N;
N10 = 10, i = 1;
while (1) {
	if (N % N10 == N) {
		printf("%d 是 %d 位数", N, i);
		break;
	}
	i++, N10 *= 10;
}

cin >> N;
Flag = -1;
tnt = 0;
for (i = 1; i < N + 1; i++) {
Flag = -Flag;
  tnt += Flag * i;
}
cout << tnt;

int cnt = 0;
for (i = 0; i < 10; i++)
	for (j = i; j < 10; j++)
    	cnt += 1;
cout << cnt;

1  2  3  4  5  6  7  8  9
2  4  6  8 10 12 14 16 18
3  6  9 12 15 18 21 24 27
4  8 12 16 20 24 28 32 36
5 10 15 20 25 30 35 40 45
6 12 18 24 30 36 42 48 54
7 14 21 28 35 42 49 56 63
8 16 24 32 40 48 56 64 72
9 18 27 36 45 54 63 72 81

for (int i = 1; i < 10; i++) {
	for(int j = 1; j < 10; j++)
		printf("%3d", i * j);
	printf("\n");
}