Pagini recente » Cod sursa (job #2136629) | Cod sursa (job #1907650) | Cod sursa (job #1854286) | Cod sursa (job #2138461) | Cod sursa (job #2615750)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("farfurii.in");
ofstream out ("farfurii.out");
long long n,k,i,m,j;
int main()
{
in>>n>>k;
//cautam m
int m=2;
while((m*(m-1)/2)<k )
{
m++;
}
m--;
if(m*(m-1)/2==k )
{
for(int i=1;i<=n-m;i++)out<<i<<" ";
for(int i=n;i>n-m+1;i--)out<<i<< " ";
return 0;
}
else
{
int d=n-(( (m+1)*m/2)-k);
for(int i=1;i<=n-m-1;i++)out<<i<<" ";
out<<d<< " ";
for(int i=n;i>=n-m;i--)
{
if(i!=d)out<<i<<" ";
}
}
return 0;
}