oj.uz

Submission #235206

# Submission time Handle Problem Language Result Execution time Memory
235206 2020-05-27T10:52:22 Z ParsaAlizadeh Esej (COCI15_esej) C++17
80 / 80
 13 ms 896 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long int   ll;
typedef pair<ll, ll>    pll;
typedef pair<int, int>  pii;

#define all(x)          x.begin(), x.end()
#define kill(x)         return cout << x << endl, 0
#define X               first
#define Y               second
#define sep             ' '
#define endl            '\n'

ll pw(ll a, ll b, ll mod) {
    if (!b)    return 1;
    if (b & 1) return a * pw(a * a % mod, b / 2, mod) % mod;
    return pw(a * a % mod, b / 2, mod) % mod;
}

const ll N    = 1e5 + 10;
const ll MOD  = 1e9 + 7;
const ll INF  = 1e18;

int L, R;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    cin >> L >> R;
    for (int i = 0; i < R; i++) {
        string s;
        int now = i;
        for (int j = 0; j < 4; j++) {
            s.push_back((now % 26) + 'a');
            now /= 26;
        }
        cout << s << sep;
    }
    cout << endl;
    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 12 ms 896 KB Output is correct
8 Correct 13 ms 896 KB Output is correct
9 Correct 12 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct