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