Pagini recente » Cod sursa (job #1623745) | Monitorul de evaluare | Cod sursa (job #1781472) | Cod sursa (job #2019813) | Cod sursa (job #2902914)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("farfurii.in");
ofstream fout("farfurii.out");
long long n, k, lg, comp;
int main()
{
fin>>n>>k;
while(lg*(lg+1)>>1 <= k)
lg++;
for(int i = 1; i <= n-lg - 1; i++)
fout<<i<<' ';
comp = lg * (lg+1) / 2 - k;
fout<<n - comp << ' ';
for(int i = n; i >= n - lg; i--)
if(i != n - comp)
fout<<i<<' ';
return 0;
}