Submission #3602783


Source Code Expand

#include <stdio.h>

int main()
{
	int i;

	printf("20 40\n");
	printf("1 2 %d\n", (1 << 19) + 1);
	printf("1 20 %d\n", 1 << 19);
	for (i = 0; i < 19; i++) {
		printf("%d %d 0\n", i + 1, i + 2);
		printf("%d %d %d\n", i + 1, i + 2, 1 << i);
	}

	return 0;
}

Submission Info

Submission Time
Task D - All Your Paths are Different Lengths
User Oberlin
Language C++14 (GCC 5.4.1)
Score 0
Code Size 271 Byte
Status WA
Exec Time 1 ms
Memory 128 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
WA × 2
WA × 22
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt WA 1 ms 128 KB
02.txt WA 1 ms 128 KB
03.txt WA 1 ms 128 KB
04.txt WA 1 ms 128 KB
05.txt WA 1 ms 128 KB
06.txt WA 1 ms 128 KB
07.txt WA 1 ms 128 KB
08.txt WA 1 ms 128 KB
09.txt WA 1 ms 128 KB
10.txt WA 1 ms 128 KB
11.txt WA 1 ms 128 KB
12.txt WA 1 ms 128 KB
13.txt WA 1 ms 128 KB
14.txt WA 1 ms 128 KB
15.txt WA 1 ms 128 KB
16.txt WA 1 ms 128 KB
17.txt WA 1 ms 128 KB
18.txt WA 1 ms 128 KB
19.txt WA 1 ms 128 KB
20.txt WA 1 ms 128 KB
s1.txt WA 1 ms 128 KB
s2.txt WA 1 ms 128 KB