Pagini recente » Cod sursa (job #1029492) | Cod sursa (job #703140) | Cod sursa (job #2582069) | Cod sursa (job #2775248) | Cod sursa (job #2134963)
#include <cstdio>
#include <iostream>
using namespace std;
FILE *f=fopen("farfurii.in","r");
FILE *g=fopen("farfurii.out","w");
int n,nrcautat;
long long k,power;
void read()
{
fscanf(f,"%d %lld",&n,&k);
}
void solve()
{
while ((power*(power+1))/2<k)
{
++power;
}
--power;
long long ramas=k-(power*(power+1))/2;
int nramas=n-power-1;
nrcautat=nramas+ramas;
for (int i=1; i<nramas; ++i)
fprintf(g,"%d ",i);
fprintf(g,"%d ",nrcautat);
for (int i=n; i>=nramas; --i)
{
if (i==nrcautat)
continue;
fprintf(g,"%d ",i);
}
}
int main()
{
read();
solve();
return 0;
}