Pagini recente » Cod sursa (job #3338509) | Cod sursa (job #3338507) | Cod sursa (job #3338389) | Monitorul de evaluare | Cod sursa (job #3342602)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int main()
{
int n , k , partk , restn , restk , i;
fin>>n>>k;
partk=int(sqrt(k*2))+1;
restn=n-partk;
restk=k-(partk-1)*(partk-2)/2;
for(i=1; i<=restn+1; i++)
{
if(i<=restn)
fout<<i<<" ";
if(i==restn+1)
fout<<i+restk<<" ";
}
for(i=n; i>restn; i--)
{
if(i!=restn+restk+1)
fout<<i<<" ";
}
//fout<<n<<" "<<restn<<" "<<k<<" "<<partk<<" "<<restk;
return 0;
}