# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
156423 | mdn2002 | Tavan (COCI16_tavan) | C++14 | 2 ms | 376 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>
using namespace std;
long long mod=1e9+7;
int n,m,k,x;
string s;
vector<string>v;
vector<char>c;
long long pw(int xz,int y)
{
long long xx=1;
for(int i=0;i<y;i++)
{
xx*=xz;
if(xx>x)return x+4;
}
return xx;
}
int main()
{
cin>>n>>m>>k>>x;
cin>>s;
for(int i=0;i<m;i++)
{
string x;
cin>>x;
sort(x.begin(),x.end());
v.push_back(x);
}
for(int i=0;i<m;i++)
{
long long mx=0,lmx=0;
for(int j=0;j<k;j++)
{
mx+=pw(k,m-i-1);
if(mx>=x)
{
c.push_back(v[i][j]);
x-=lmx;
break;
}
lmx=mx;
}
}
int kk=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='#')cout<<c[kk++];
else cout<<s[i];
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |