Pagini recente » Cod sursa (job #2454185) | Cod sursa (job #1643449) | Cod sursa (job #2498457) | Cod sursa (job #470793) | Cod sursa (job #2622805)
#include <bits/stdc++.h>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
int main()
{
int n=7,i=1;
long long k=8;
in>>n>>k;
while((long long)(n-i-1)*(n-i-2)/2>k){
i++;
out<<i<<' ';
}
long long aux = k-(long long)(n-i-1)*(n-i-2)/2+i+1;
out<<aux<<' ';
for(j=n;j>aux;j--)
out<<j<<' ';
for(j=aux-1;j>=i;j--)
out<<j<<' ';
return 0;
}