답안 #292365

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
292365	2020-09-06T21:44:38 Z	kingfran1907	Sob (COCI19_sob)	C++14	110 / 110	99 ms	7160 KB

sob

#include <bits/stdc++.h>
#define X first
#define Y second

using namespace std;
typedef long long llint;

const int maxn = 2e5+10;
const int base = 31337;
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const int logo = 20;
const int off = 1 << logo;
const int treesiz = off << 1;

int n, m;
int main() {
	scanf("%d%d", &n, &m);
 	n--;
	while (n >= 0) {
		int tren = m;
		while ((tren & n) != n) tren++;
		for (int i = tren; i >= m; i--) 
			printf("%d %d\n", n--, i);
		m = tren + 1;
	}
	return 0;
}

Compilation message

sob.cpp: In function 'int main()':
sob.cpp:18:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   18 |  scanf("%d%d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	51 ms	3832 KB	Output is correct

Subtask #2

29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	51 ms	3832 KB	Output is correct
7	Correct	24 ms	2040 KB	Output is correct

Subtask #3

39.0 / 39.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct

Subtask #4

32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	51 ms	3832 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	51 ms	3832 KB	Output is correct
11	Correct	24 ms	2040 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	11 ms	1024 KB	Output is correct
20	Correct	39 ms	2936 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	56 ms	4216 KB	Output is correct
24	Correct	99 ms	7160 KB	Output is correct
25	Correct	98 ms	7148 KB	Output is correct