QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#691141#6138. Function and FunctionOIer_kzc#AC ✓22ms1624kbC++17530b2024-10-31 10:05:372024-10-31 10:05:38

Judging History

你现在查看的是最新测评结果

  • [2024-10-31 10:05:38]
  • 评测
  • 测评结果:AC
  • 用时:22ms
  • 内存:1624kb
  • [2024-10-31 10:05:37]
  • 提交

answer

#include <stdio.h>
#include <string.h>

constexpr int calc(int x) {
	if (x == 8) {
		return 2;
	}
	if (x == 0 || x == 4 || x == 6 || x == 9) {
		return 1;
	}
	return 0;
}

constexpr int F(int x, int n) {
	if (!n) {
		return x;
	}
	if (x < 2) {
		return x ^ (n & 1);
	}
	int y = 0;
	while (x) {
		y += calc(x % 10);
		x /= 10;
	}
	return F(y, n - 1);
}

int main() {
	int task;
	for (scanf("%d", &task); task--; ) {
		int x, k;
		scanf("%d%d", &x, &k);
		printf("%d\n", F(x, k));
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 1592kb

input:

6
123456789 1
888888888 1
888888888 2
888888888 999999999
98640 12345
1000000000 0

output:

5
18
2
0
0
1000000000

result:

ok 6 numbers

Test #2:

score: 0
Accepted
time: 22ms
memory: 1624kb

input:

100000
579268184 2
120252252 777743676
255650198 1
152055433 207664522
137430584 754115403
646417467 164848484
743551976 0
0 408695577
363072674 569574204
464290891 0
761830281 3
0 1
49176280 2
791182580 0
474930784 3
402374924 0
739903247 91553857
0 2
688106229 2
65907033 152261569
875191599 3
5319...

output:

0
0
5
0
1
1
743551976
1
1
464290891
0
1
1
791182580
1
402374924
0
0
2
0
1
1
2
1
0
0
0
3
0
0
0
1
0
0
1
0
2
0
1
1
1
0
1
0
0
0
0
0
0
1
55349255
486354015
1
1
0
1
1
0
1
1
0
1
0
9
0
1
1
0
0
1
0
1
1
1
0
0
0
0
25600152
0
0
1
22903397
705086250
771453912
1
1
0
0
1
0
1
1
1
2
1
1
1
1
1
1
6
3
3
1
0
1
0
1
86248...

result:

ok 100000 numbers