Pagini recente » Cod sursa (job #1833935) | Cod sursa (job #2271997) | Cod sursa (job #2273051) | Cod sursa (job #1587666) | Cod sursa (job #2900698)
#include <fstream>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
int main()
{
long long n,k,inv=1;
in>>n>>k;
while((inv*(inv-1))>>1<k)
inv++;
for(int i=1; i<=n-inv; i++)
out<<i<<" ";
int val=inv*(inv-1)/2-k;
out<<n-val<<" ";
for(int i=n; i>n-val; i--)
out<<i<<" ";
for(int i=n-val-1;i>n-inv;i--)
out<<i<<" ";
return 0;
}