Pagini recente » Cod sursa (job #2380109) | Cod sursa (job #1495494) | Cod sursa (job #340550) | Cod sursa (job #1313166) | Cod sursa (job #2145355)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long i, N, K, reper, x;
int main(){
f >> N >> K;
while (reper * (reper + 1) / 2 < K)
reper++;
for (i = 1; i < N - reper; i++)
g << i << " ";
x = reper * (reper + 1) / 2 - K;
if (x){
g << N - x << " ";
for (i = N; i >= N - reper; i--){
if (i != N - x)
g << i << " ";
}
}
else{
for (i = N; i >= N - reper; i--)
g << i << " ";
}
return 0;
}