Pagini recente » Cod sursa (job #2150632) | Cod sursa (job #1777660) | Cod sursa (job #143141) | Cod sursa (job #1237413) | Cod sursa (job #2509631)
#include <iostream>
#include <fstream>
using namespace std;
ifstream x("farfurii.in");
ofstream y("farfurii.out");
int n,i,v[100002],s,c,val,k,j;
int main()
{
x>>n>>k;
c=n;
for(i=1;i<=n;i++)
{
s=(n-i)*(n-i+1)/2;
if(s>=k)
v[i]=i;
else
{
v[i-1]=i-1+k-s;
val=v[i-1];
break;
}
}
for(j=1;j<i;j++)
y<<v[j]<<" ";
while(i<=n)
{
if(c==val)
c--;
y<<c<<" ";
c--;
i++;
}
x.close();
y.close();
return 0;
}