| Task: | Coloring cube |
| Sender: | aalto26ew_008 |
| Submission time: | 2026-09-30 16:48:40 +0300 |
| Language: | C++ (C++20) |
| 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.00 s | details |
| #5 | ACCEPTED | 0.01 s | details |
| #6 | ACCEPTED | 0.02 s | details |
| #7 | ACCEPTED | 0.02 s | details |
| #8 | ACCEPTED | 0.06 s | details |
| #9 | ACCEPTED | 0.07 s | details |
| #10 | ACCEPTED | 0.07 s | details |
Code
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
int prevFaceLetter;
int prevLineLetter;
int currentLetter = 0;
char letters[] = {'R', 'G', 'B'};
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
for (int k = 0; k < n; k++){
if(j == 0 && k == 0){
prevFaceLetter = currentLetter;
}
if (k == 0)
{
prevLineLetter = currentLetter;
}
cout << letters[currentLetter];
if (k < n - 1)
{
cout << " ";
}
currentLetter = (currentLetter + 1) % 3;
}
currentLetter = (prevLineLetter + 1) % 3;
cout << endl;
}
currentLetter = (prevFaceLetter + 1) % 3;
cout << endl;
}
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 3 |
| correct output |
|---|
| R G B G B R B R G G B R ... |
| user output |
|---|
| R G B G B R B R G G B R ... |
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 |
|---|
| 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 ... |
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 |
|---|
| 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 ... |
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 |
|---|
| 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 ... |
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 |
|---|
| R G B R G B R G B R G B R G B ... |
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 |
|---|
| R G B R G B R G B R G B R G B ... |
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 |
|---|
| R G B R G B R G B R G B R G B ... |
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 |
|---|
| R G B R G B R G B R G B R G B ... |
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 |
|---|
| R G B R G B R G B R G B R G B ... |
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 |
|---|
| R G B R G B R G B R G B R G B ... |
