# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339863 | Nimbostratus | Esej (COCI15_esej) | C++17 | 47 ms | 1260 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fre freopen("in","r",stdin),freopen("out","w",stdout)
#define fast_io ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) (x.begin()) , (x.end())
#define fi first
#define se second
#define pii pair<int,int>
#define vpii vector<pair<int,int>>
#define pq(t) priority_queue<t>
#define pb push_back
#define sz(x) x.size()
#define ppb pop_back
#define endl '\n'
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define fr front
#define mt make_tuple
#define bitcnt __builtin_popcount
typedef long long ll;
using namespace std;
int A,B;
int a,b,c;
int pr;
int32_t main ()
{
//fre;
fast_io;
cin >> A >> B;
for(int i=1;pr<B;i++,cout << ' ')
{
if(__builtin_popcount(i) > 15) continue;
pr++;
for(int k=0;(1<<k)<=i;k++)
if(i&(1<<k))
cout << char('a' + k);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |