Pagini recente » Cod sursa (job #322796) | Borderou de evaluare (job #1527426) | Borderou de evaluare (job #1720275) | Borderou de evaluare (job #504318) | Cod sursa (job #2758043)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
long long n, k, flag = 1;
int main()
{
in>>n>>k;
while(flag * (flag-1) / 2 < k)
flag++;
for(int i = 1; i <= n-flag; i++)
out<<i<<" ";
out<<flag<<" ";
for(int i = n; i > n-flag; i--)
if(i != flag)
out<<i<<" ";
return 0;
}