Submission #33989158

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;

bool arr[20][20];

int main()
{
	int i, j;
	int x, y;

	for (i = 1; i <= 15; i += 2)
	{
		for (j = min(i, 15 - i); j <= max(i, 15 - i); j++)
		{
			arr[i][j] = true;
			arr[j][i] = true;
		}
	}

	cin >> x >> y;

	if (arr[x][y]) cout << "black";
	else cout << "white";
}

Submission Info

Submission Time
Task B - Nice Grid
User gojib2002
Language C++ (GCC 9.2.1)
Score 200
Code Size 473 Byte
Status AC
Exec Time 7 ms
Memory 3560 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 17
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 7 ms 3360 KiB
001.txt AC 2 ms 3508 KiB
002.txt AC 3 ms 3524 KiB
003.txt AC 2 ms 3392 KiB
004.txt AC 2 ms 3456 KiB
005.txt AC 2 ms 3396 KiB
006.txt AC 3 ms 3340 KiB
007.txt AC 3 ms 3512 KiB
008.txt AC 2 ms 3560 KiB
009.txt AC 2 ms 3336 KiB
010.txt AC 2 ms 3340 KiB
011.txt AC 2 ms 3524 KiB
012.txt AC 4 ms 3516 KiB
013.txt AC 3 ms 3520 KiB
014.txt AC 2 ms 3512 KiB
example0.txt AC 3 ms 3508 KiB
example1.txt AC 2 ms 3520 KiB