Pagini recente » Cod sursa (job #2854933) | Cod sursa (job #1865927) | Cod sursa (job #1847566) | Cod sursa (job #1388864) | Cod sursa (job #2901932)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int main()
{
int a[100001];
long long N, K, i, j, aux;
f>>N>>K;
for(i=1; i<=N; i++)
if(K-(N-i)*(N-i-1)/2 > 0)
break;
for(j=1; j<i; j++)
a[j] = j;
for(j=N; j>=i; j--)
a[N-j+i] = j;
K = K-((N-i)*(N-i+1)/2);
for(j=i-K ;K<0; j--, K++)
{
aux = a[j];
a[j] = a[j-1];
a[j-1] = aux;
}
for(i=1; i<=N; ++i)
g<<a[i]<<" ";
return 0;
}