Pagini recente » Cod sursa (job #2117342) | Cod sursa (job #209083) | Cod sursa (job #1928455) | Cod sursa (job #34960) | Cod sursa (job #2902190)
#include <fstream>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
int main()
{
long long n, k, j, i, l;
in>>n>>k;
for(i = 1; i*(i+1)/2 <= k; i++);
if(i*(i-1)/2 == k) {
for(j = 1; j <= n-i; j++) out<<j<<" ";
}
else {
for(j = 1; j <= n-i-1; j++) out<<j<<" ";
out<<n-i*(i+1)/2 + k<<" ";
for(l = n; l >= n-i+1; l--)
if(l > n-i*(i+1)/2 + k) out<<l<<" ";
else out<<l-1<<" ";
}
return 0;
}