# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
81636 | 2018-10-25T16:25:18 Z | xiaowuc1 | Esej (COCI15_esej) | C++14 | 125 ms | 2164 KB |
#include <bits/stdc++.h> /* unsigned seed1 = std::chrono::system_clock::now().time_since_epoch().count(); mt19937 g1.seed(seed1); ios_base::sync_with_stdio(false); cin.tie(NULL); */ using namespace std; const double PI = 2 * acos(0); typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<int, ll> pill; typedef pair<ll, ll> pll; typedef long double ld; typedef vector<vector<ll>> matrix; int main() { int a, b; scanf("%d%d", &a, &b); mt19937 g1; for(int x = 0; x < b; x++) { for(int i = 0; i < 15; i++) { int v = g1(); v = abs(v)%26; printf("%c", 'a' + v); } if(x == b-1) printf("\n"); else printf(" "); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 504 KB | Output is correct |
3 | Correct | 2 ms | 504 KB | Output is correct |
4 | Correct | 3 ms | 504 KB | Output is correct |
5 | Correct | 7 ms | 504 KB | Output is correct |
6 | Correct | 26 ms | 888 KB | Output is correct |
7 | Correct | 94 ms | 2060 KB | Output is correct |
8 | Correct | 101 ms | 2100 KB | Output is correct |
9 | Correct | 106 ms | 2160 KB | Output is correct |
10 | Correct | 125 ms | 2164 KB | Output is correct |