Pagini recente » Istoria paginii utilizator/ottototto | Cod sursa (job #1379966) | Istoria paginii runda/surprize_surprize | Cod sursa (job #939964) | Cod sursa (job #2754853)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int main(){
long long n, k, c = 1; //in c memoram cate numere trebuiesc inversate
fin>>n>>k;
while(c * (c - 1) / 2 < k)
c++;
for(long long i = 1; i <= n - c; i++) //afisam restul de n-c numere
fout<<i<<' ';
k = n - (c * (c - 1) / 2 - k);
fout<<k<<' ';
for(long long i = n; i > n - c; i--)
if(i != k)
fout<<i<<' ';
return 0;
}