Submission #258072

#TimeUsernameProblemLanguageResultExecution timeMemory
258072kartelEsej (COCI15_esej)C++14
80 / 80
157 ms11352 KiB
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> #define in(x) freopen(x, "r", stdin) #define out(x) freopen(x, "w", stdout) //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //#pragma GCC optimize("Ofast,nso-stack-protector,unroll-loops,fast-math,-O3") #define F first #define S second #define pb push_back #define N +100500 #define M (int(1e4) + 7) #define sz(x) (int)x.size() #define re return #define oo ll(1e9) #define el '\n' #define Max_A int(1e9) //#define el endl #define pii pair <int, int> #define err ld(1e-9) #define Max_S int(3e6) #define last(x) x.back() #define all(x) (x).begin(), (x).end() #define arr_all(x, n) (x + 1), (x + 1 + n) //#define mp make_pair using namespace std; //using namespace __gnu_pbds; //typedef tree <pair <int, int> , null_type, less_equal <pair <int, int> > , rb_tree_tag, tree_order_statistics_node_update> ordered_set; typedef long long ll; typedef short int si; typedef long double ld; string ans; char c; int kol, a, b, cnt, i; map <string, char> mp; vector <int> vc; int main() { cout.precision(2); ios_base::sync_with_stdio(0); iostream::sync_with_stdio(0); ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); // in("input.txt"); // out("output.txt"); cin >> a >> b; for (i = 0; i < 26; i++) vc.pb(i); while (cnt < b) { random_shuffle(all(vc)); string new_str = ""; for (i = 0; i < 15; i++) new_str += char('a' + vc[i]); if (mp[new_str]) continue; cnt++; ans += new_str + ' '; } ans.erase(sz(ans) - 1); cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...