Pagini recente » Cod sursa (job #154172) | Borderou de evaluare (job #2023477) | Cod sursa (job #2540593) | Cod sursa (job #2309577) | Cod sursa (job #2755132)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n,k,mm;
int main() {
long long i,p;
f >> n >> k;
for(i=1;i<=n;++i) {
p = n-i;
if(p*(p-1)/2 < k) {
mm = k - (p-1)*p/2 + i;
g << mm << " ";
break;}
g << i << " ";}
p = n-i+1;
for(i=0;i!=p;++i) {
if(n-i!=mm)
g << n-i << " ";}
return 0;
}