78B - Easter Eggs - CodeForces Solution

constructive algorithms implementation *1200

Please click on ads to support us..

Python Code: 

n = int(input())
colors = ['R', 'O', 'Y', 'G', 'B', 'I', 'V']

ans = ''
for i in range(n-3):
    ans += colors[i % 4]
ans += 'BIV'
print(ans)

C++ Code: 

#define ll long long
#define MAXN 200010
#define INF 0x3f3f3f3f
#include <bits/stdc++.h>
using namespace std;

int main(){
#ifdef _DEBUG
    freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
#endif
#define int ll
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    n -= 7;
    string s = "ROYGBIV";
    string m = "GBIV";
    for (int i = 0; i < n; ++i) {
        s += m[i % 4];
    }

    cout << s << endl;
    return 0;
}


Comments

Submit
0 Comments
More Questions

262A - Roma and Lucky Numbers
1634B - Fortune Telling
1358A - Park Lighting
253C - Text Editor
365B - The Fibonacci Segment
75A - Life Without Zeros
1519A - Red and Blue Beans
466A - Cheap Travel
659E - New Reform
1385B - Restore the Permutation by Merger
706A - Beru-taxi
686A - Free Ice Cream
1358D - The Best Vacation
1620B - Triangles on a Rectangle
999C - Alphabetic Removals
1634C - OKEA
1368C - Even Picture
1505F - Math
1473A - Replacing Elements
959A - Mahmoud and Ehab and the even-odd game
78B - Easter Eggs
1455B - Jumps
1225C - p-binary
1525D - Armchairs
1257A - Two Rival Students
1415A - Prison Break
1271A - Suits
259B - Little Elephant and Magic Square
1389A - LCM Problem
778A - String Game