Cod sursa(job #1060475)
| Utilizator | Data | 18 decembrie 2013 00:10:06 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.53 kb |
/*
#include<fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int main() {
long long n, k, i, x = 0, aux = 0, ok = 0;
fin >> n >> k;
// cauta x min a. i. x*(x-1) >= k
for(i = 1; i <= k + 5 && ok == 0; i++) {
if(i * (i-1) /2 >= k) {
x = i;
aux = x * (x-1) / 2;
ok = 1;
}
}
for(i = 1; i <= n-x; i++) fout << i << " ";
if(k != 0) fout << n - (aux - k) << " ";
for(i = n; i > n-x; i--) {
if(i != n-(aux-k)) {
fout << i << " ";
}
}
return 0;
}
*/
