Submission #32593324


Source Code Expand

#include<bits/stdc++.h>
typedef long long LL;
#define rep(i, a, b) for(int i = (a); i <= (b); i ++)
#define per(i, a, b) for(int i = (a); i >= (b); i --)
#define Ede(i, u) for(int i = head[u]; i; i = e[i].nxt)
using namespace std;

LL rev(LL x) {
	LL y = 0;
	while(x) y = y * 10 + x % 10, x /= 10;
	return y;
}

int main() {
	LL n, k; scanf("%lld %lld", &n, &k);
	if(k % 10 != 0) {
		set<LL> ans;
		LL a = k, b = rev(k);
		if(a <= b) {LL x = a; while(x <= n) ans.insert(x), x *= 10;}
		if(a <= b) {LL x = b; while(x <= n) ans.insert(x), x *= 10;}
		printf("%d\n", (int) ans.size());
	}
	else printf("%d\n", (k <= n));
	return 0;
}

Submission Info

Submission Time
Task A - Reverse and Minimize
User lpf
Language C++ (GCC 9.2.1)
Score 300
Code Size 654 Byte
Status AC
Exec Time 5 ms
Memory 3764 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:15:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   15 |  LL n, k; scanf("%lld %lld", &n, &k);
      |           ~~~~~^~~~~~~~~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 33
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_max_00.txt, 01_max_01.txt, 01_max_02.txt, 01_max_03.txt, 01_max_04.txt, 02_rnd_00.txt, 02_rnd_01.txt, 02_rnd_02.txt, 02_rnd_03.txt, 02_rnd_04.txt, 03_sym_00.txt, 03_sym_01.txt, 03_sym_02.txt, 03_sym_03.txt, 03_sym_04.txt, 03_sym_05.txt, 03_sym_06.txt, 03_sym_07.txt, 03_sym_08.txt, 04_big_00.txt, 04_big_01.txt, 04_big_02.txt, 05_one_00.txt, 05_one_01.txt, 05_one_02.txt, 05_one_03.txt, 05_one_04.txt, 05_one_05.txt, 05_one_06.txt, 05_one_07.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 5 ms 3660 KiB
00_sample_01.txt AC 2 ms 3580 KiB
00_sample_02.txt AC 2 ms 3580 KiB
01_max_00.txt AC 3 ms 3580 KiB
01_max_01.txt AC 2 ms 3764 KiB
01_max_02.txt AC 2 ms 3764 KiB
01_max_03.txt AC 2 ms 3764 KiB
01_max_04.txt AC 2 ms 3676 KiB
02_rnd_00.txt AC 4 ms 3732 KiB
02_rnd_01.txt AC 2 ms 3656 KiB
02_rnd_02.txt AC 2 ms 3700 KiB
02_rnd_03.txt AC 5 ms 3664 KiB
02_rnd_04.txt AC 2 ms 3664 KiB
03_sym_00.txt AC 2 ms 3764 KiB
03_sym_01.txt AC 2 ms 3716 KiB
03_sym_02.txt AC 1 ms 3704 KiB
03_sym_03.txt AC 2 ms 3712 KiB
03_sym_04.txt AC 2 ms 3624 KiB
03_sym_05.txt AC 2 ms 3728 KiB
03_sym_06.txt AC 2 ms 3716 KiB
03_sym_07.txt AC 2 ms 3728 KiB
03_sym_08.txt AC 2 ms 3760 KiB
04_big_00.txt AC 2 ms 3660 KiB
04_big_01.txt AC 2 ms 3712 KiB
04_big_02.txt AC 2 ms 3696 KiB
05_one_00.txt AC 1 ms 3580 KiB
05_one_01.txt AC 2 ms 3620 KiB
05_one_02.txt AC 2 ms 3660 KiB
05_one_03.txt AC 2 ms 3616 KiB
05_one_04.txt AC 2 ms 3656 KiB
05_one_05.txt AC 2 ms 3616 KiB
05_one_06.txt AC 2 ms 3728 KiB
05_one_07.txt AC 2 ms 3576 KiB