Pagini recente » Cod sursa (job #2055224) | Cod sursa (job #1284073) | Cod sursa (job #867970) | Cod sursa (job #1253945) | Cod sursa (job #2311370)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int n,i,aux;
long long k;
int main()
{
f>>n>>k;
if(k==0)
{
for(i=1;i<=n;i++)
g<<i<<" ";
return 0;
}
k=(long long)n*(n-1)/2-k;
aux=n-1;
while(k-aux>=0)
{
g<<n-aux<<" ";
k-=aux;
aux--;
}
g<<n-k<<" ";
for(i=n;i>=n-aux;i--)
{
if(i!=n-k)
g<<i<<" ";
}
}