| Task: | Coloring cube |
| Sender: | aalto25e_001 |
| Submission time: | 2025-10-01 16:51:42 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.01 s | details |
| #5 | ACCEPTED | 0.01 s | details |
| #6 | ACCEPTED | 0.01 s | details |
| #7 | ACCEPTED | 0.01 s | details |
| #8 | ACCEPTED | 0.04 s | details |
| #9 | ACCEPTED | 0.04 s | details |
| #10 | ACCEPTED | 0.05 s | details |
Code
#include <bits/stdc++.h>
using namespace std;
#define BR "\n"
#define pb push_back
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<int, int> ii;
// directions
const int fx[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
const int fxx[8][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0},
{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
// types
using ll = long long;
using ull = unsigned long long;
using ui = unsigned int;
using us = unsigned short;
const int INF = 1001001001;
const int MAXN = 10000;
int nxt() {
int x;
cin >> x;
return x;
}
int main() {
// READ("input.txt");
auto n = nxt();
string colors = "RGB";
ll idx = 0;
if (n % 3 == 0) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
for (int k = 0; k < n; ++k) {
cout << colors[idx % 3];
idx++;
}
idx--;
cout << BR;
}
idx -= (n - 1);
cout << BR;
}
} else {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
for (int k = 0; k < n; ++k) {
cout << colors[idx % 3];
idx++;
}
cout << BR;
}
cout << BR;
}
}
return 0;
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 3 |
| correct output |
|---|
| R G B G B R B R G G B R ... |
| user output |
|---|
| RGB BRG GBR GBR ... |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 5 |
| correct output |
|---|
| R G B R G G B R G B B R G B R R G B R G G B R G B ... |
| user output |
|---|
| RGBRG BRGBR GBRGB RGBRG BRGBR ... |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 6 |
| correct output |
|---|
| R G B R G B G B R G B R B R G B R G R G B R G B G B R G B R ... |
| user output |
|---|
| RGBRGB BRGBRG GBRGBR RGBRGB BRGBRG ... |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 10 |
| correct output |
|---|
| R G B R G B R G B R G B R G B R G B R G B R G B R G B R G B R G B R G B R G B R G B R G B R G B R G ... |
| user output |
|---|
| RGBRGBRGBR GBRGBRGBRG BRGBRGBRGB RGBRGBRGBR GBRGBRGBRG ... |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 50 |
| correct output |
|---|
| R G B R G B R G B R G B R G B ... |
| user output |
|---|
| RGBRGBRGBRGBRGBRGBRGBRGBRGBRGB... |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 53 |
| correct output |
|---|
| R G B R G B R G B R G B R G B ... |
| user output |
|---|
| RGBRGBRGBRGBRGBRGBRGBRGBRGBRGB... |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 63 |
| correct output |
|---|
| R G B R G B R G B R G B R G B ... |
| user output |
|---|
| RGBRGBRGBRGBRGBRGBRGBRGBRGBRGB... |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 95 |
| correct output |
|---|
| R G B R G B R G B R G B R G B ... |
| user output |
|---|
| RGBRGBRGBRGBRGBRGBRGBRGBRGBRGB... |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 99 |
| correct output |
|---|
| R G B R G B R G B R G B R G B ... |
| user output |
|---|
| RGBRGBRGBRGBRGBRGBRGBRGBRGBRGB... |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 100 |
| correct output |
|---|
| R G B R G B R G B R G B R G B ... |
| user output |
|---|
| RGBRGBRGBRGBRGBRGBRGBRGBRGBRGB... |
