#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll t,k,cnt[10];
map<ll,ll>viz;
int32_t main(){
CODE_START;
cin>>t;
while(t--){
cin>>k;
for(ll i=1;i<=9;i++){
cin>>cnt[i];
}
if(cnt[2]<k){
for(ll i=1;i<=2;i++)
{
for(ll j=1;j<=cnt[i];j++)
{
cout<<i;
}
}
cout<<endl;
}
string ans="";
for(ll i=1;i<k;i++)
{
ans+=(2+'0');
}
cnt[2]-=k-1;
ll sz=cnt[1]+cnt[2];
ll nr=(cnt[2]+k-1)/k;
viz.clear();
for(ll i=1;i<=nr;i++)
{
for(ll j=i;j<=sz;j+=k){
if(cnt[2]){
viz[j]=1;
cnt[2]--;
}
}
}
for(ll i=sz;i>=1;i--)
{
if(viz[i]==1){
ans+=(2+'0');
}else ans+=(1+'0');
}
reverse(ans.begin(),ans.end());
cout<<ans<<endl;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
364 KB |
Token parameter [name=X] equals to "112", doesn't correspond to pattern "[0-9]{7}" |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
47 ms |
876 KB |
Token parameter [name=X] equals to "2", doesn't correspond to pattern "[0-9]{31}" |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
88 ms |
1796 KB |
Token parameter [name=X] equals to "11111122222222222222222222", doesn't correspond to pattern "[0-9]{36}" |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
364 KB |
Token parameter [name=X] equals to "112", doesn't correspond to pattern "[0-9]{7}" |