Cod sursa(job #2212445)
| Utilizator | Data | 14 iunie 2018 09:44:36 | |
|---|---|---|---|
| Problema | Planeta | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream fin ("planeta.in");
ofstream fout("planeta.out");
long long d[32],k;
int i,n,j;
void R(int n, long long k, int ok)
{
int nod=1;
while(d[nod-1]*d[n-nod]<=k)
{
k=k-d[nod-1]*d[n-nod];
nod++;
}
fout<<nod+ok<<" ";
if(nod>1)R(nod-1, k/d[n-nod], ok);
if(nod<n)R(n-nod, k%d[n-nod], ok+nod);
}
int main(){
fin>>n>>k;d[0]=1;
for(i=1;i<=n;i++) for(j=1;j<=i;j++) d[i]+=d[j-1]*d[i-j];
R(n,k-1,0);
return 0;
}
//euro 2 + interclasare
