Pagini recente » Cod sursa (job #2686591) | Cod sursa (job #1009744) | Arhiva de probleme | Cod sursa (job #1496687) | Cod sursa (job #1900120)
#include<fstream>
using namespace std;
long long n,k,i,x,y,val;
int main()
{
ifstream f("farfurii.in");
ofstream g("farfurii.out");
f>>n>>k;
x=1;
while(x*(x-1)/2<k)
{
x++;
}
y=x*(x-1)/2;
for(i=1; i<=n-x; i++)
g<<i<<" ";
val=n-(y-k);
g<<val<<" ";
for(i=n; i>=val+1; i--)
g<<i<<" ";
for(i=val-1; i>=n-x+1; i--)
g<<i<<" ";
g<<'\n';
f.close(); g.close();
return 0;
}