| Task: | Merkkijono |
| Sender: | Parodontax |
| Submission time: | 2021-10-04 14:26:03 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 100 |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | details |
| #2 | ACCEPTED | 0.01 s | details |
| #3 | ACCEPTED | 0.01 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.01 s | details |
| #9 | ACCEPTED | 0.01 s | details |
| #10 | ACCEPTED | 0.01 s | details |
| #11 | ACCEPTED | 0.01 s | details |
| #12 | ACCEPTED | 0.01 s | details |
| #13 | ACCEPTED | 0.01 s | details |
| #14 | ACCEPTED | 0.01 s | details |
| #15 | ACCEPTED | 0.01 s | details |
| #16 | ACCEPTED | 0.02 s | details |
Code
#include <iostream>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, size;
cin >> n;
n--;
char letters[] = {'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q'};
vector<char> arr = {'a'};
auto it = arr.begin();
for (int i = 0; i < n; i++)
{
size = arr.size();
for (int j = 0; j <= size; j++)
{
it = arr.insert(arr.begin() + j * 2, letters[i]);
}
}
for (auto x : arr)
cout << x;
cout << "\n";
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 1 |
| correct output |
|---|
| a |
| user output |
|---|
| a |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 2 |
| correct output |
|---|
| bab |
| user output |
|---|
| bab |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 3 |
| correct output |
|---|
| cbcacbc |
| user output |
|---|
| cbcacbc |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 4 |
| correct output |
|---|
| dcdbdcdadcdbdcd |
| user output |
|---|
| dcdbdcdadcdbdcd |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 5 |
| correct output |
|---|
| edecedebedecedeaedecedebedeced... |
| user output |
|---|
| edecedebedecedeaedecedebedeced... |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 6 |
| correct output |
|---|
| fefdfefcfefdfefbfefdfefcfefdfe... |
| user output |
|---|
| fefdfefcfefdfefbfefdfefcfefdfe... |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 7 |
| correct output |
|---|
| gfgegfgdgfgegfgcgfgegfgdgfgegf... |
| user output |
|---|
| gfgegfgdgfgegfgcgfgegfgdgfgegf... Truncated |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 8 |
| correct output |
|---|
| hghfhghehghfhghdhghfhghehghfhg... |
| user output |
|---|
| hghfhghehghfhghdhghfhghehghfhg... Truncated |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 9 |
| correct output |
|---|
| ihigihifihigihieihigihifihigih... |
| user output |
|---|
| ihigihifihigihieihigihifihigih... Truncated |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 10 |
| correct output |
|---|
| jijhjijgjijhjijfjijhjijgjijhji... |
| user output |
|---|
| jijhjijgjijhjijfjijhjijgjijhji... Truncated |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 11 |
| correct output |
|---|
| kjkikjkhkjkikjkgkjkikjkhkjkikj... |
| user output |
|---|
| kjkikjkhkjkikjkgkjkikjkhkjkikj... Truncated |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 12 |
| correct output |
|---|
| lkljlklilkljlklhlkljlklilkljlk... |
| user output |
|---|
| lkljlklilkljlklhlkljlklilkljlk... Truncated |
Test 13
Verdict: ACCEPTED
| input |
|---|
| 13 |
| correct output |
|---|
| mlmkmlmjmlmkmlmimlmkmlmjmlmkml... |
| user output |
|---|
| mlmkmlmjmlmkmlmimlmkmlmjmlmkml... Truncated |
Test 14
Verdict: ACCEPTED
| input |
|---|
| 14 |
| correct output |
|---|
| nmnlnmnknmnlnmnjnmnlnmnknmnlnm... |
| user output |
|---|
| nmnlnmnknmnlnmnjnmnlnmnknmnlnm... Truncated |
Test 15
Verdict: ACCEPTED
| input |
|---|
| 15 |
| correct output |
|---|
| onomonolonomonokonomonolonomon... |
| user output |
|---|
| onomonolonomonokonomonolonomon... Truncated |
Test 16
Verdict: ACCEPTED
| input |
|---|
| 16 |
| correct output |
|---|
| popnpopmpopnpoplpopnpopmpopnpo... |
| user output |
|---|
| popnpopmpopnpoplpopnpopmpopnpo... Truncated |
