# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466163 | ardaak33 | Rack (eJOI19_rack) | C++17 | 1077 ms | 204 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 int kuvvet[1000005];
long long int mod = 1e9 + 7;
long long int sayac=1;
vector <long long int> us;
bool bayrak=false;
void yap(int n,int k,int sinir) {
if(sayac==k){
bayrak=true;
return;
}
for (int i = n; i > sinir; i--)
{
sayac++;
yap(n,k,i);
if(bayrak==true){
//cout << i<<endl;
us.push_back(i-1);
return;
}
}
}
int main() {
cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false);
long long int n,k;
cin >> n >> k;
yap(n,k,0);
long long int sonuc=0;
kuvvet[0]=1;
for (int i = 0; i < us.size(); i++)
{
for (int j = 0; j<= us[i]; j++)
{
if(kuvvet[us[i]]!=0){
sonuc+=kuvvet[us[i]];
sonuc%=mod;
//cout <<kuvvet[us[i]];
break;
}
if(kuvvet[j+1]!=0)
continue;
kuvvet[j+1]=kuvvet[j]*2;
kuvvet[j+1]%=mod;
//cout << kuvvet[j+1] << endl;
}
}
cout << (sonuc+1)%mod;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |