Pagini recente » Cod sursa (job #1853021) | Cod sursa (job #480528) | Cod sursa (job #1182586) | Cod sursa (job #2136499) | Cod sursa (job #2752138)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g ("farfurii.out");
int main(){
long long n, k;
long long contor = 1;
f >> n >> k;
while(contor * (contor - 1) < k)
contor ++;
for(long long i = 1; i < n - contor; i++)
g << i << ' ';
k = n + k - contor * (contor + 1) / 2;
g << k << ' ';
for(long long i = n; i >= n - contor; i--)
if(i != k)
g << i << ' ';
return 0;
}