Pagini recente » Cod sursa (job #513480) | Borderou de evaluare (job #2753610) | Cod sursa (job #2861691) | Borderou de evaluare (job #2753605) | Cod sursa (job #2901508)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long long n,k,a,b,index;
int main()
{
fin>>n>>k;
while(a*(a+1)/2<k)
a++;
for(b=1; b<=n-a-1; ++b)
fout<<b<<" ";
a=a*(a+1)/2-k;
fout<<n-a<<" ";
for(index=n; index>=b; index--)
if(index!=n-a)
fout<<index<<" ";
return 0;
}