Cod sursa(job #2130784)
| Utilizator | Data | 13 februarie 2018 21:44:04 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
using namespace std;
int main() {
ifstream cin ("farfurii.in");
ofstream cout ("farfurii.out");
int n, k;
cin >> n >> k;
int maxCresc = 1;
while (maxCresc * (maxCresc - 1) / 2 < k) {
maxCresc++;
}
int x = maxCresc * (maxCresc - 1) / 2;
for (int i = 1; i <= n - maxCresc; i++) {
cout << i << " ";
}
cout << n - x + k;
for (int i = n; i >= n - maxCresc + 1; i--) {
if (i == n - x + k)
continue;
cout << " " << i;
}
cout << "\n";
return 0;
}
