Cod sursa(job #3359397)
| Utilizator | Data | 27 iunie 2026 18:26:10 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int main() {
long long n, k;
fin >> n >> k;
long long t = 1;
while (t <= n){
long long rest = n - t;
if (rest * (rest - 1) / 2 >= k){
fout << t << ' ';
t++;
}
else{
break;
}
}
long long rest = n - t;
long long maxim = rest * (rest - 1) / 2;
long long q = k - maxim;
fout << t + q << ' ';
for (long long i = n; i >= t; i--){
if (i != t + q){
fout << i << ' ';
}
}
fout << '\n';
return 0;
}