Cod sursa(job #1076870)
| Utilizator | Data | 10 ianuarie 2014 17:40:51 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.49 kb |
#include <fstream>
#include <vector>
using namespace std;
int main ()
{
ifstream f ("farfurii.in");
ofstream o ("farfurii.out");
int i, j, k, N;
long long K;
f >> N >> K;
for (i = N, k = 0; i >= 1 && K > 0; i--, k++){
K -= N - i;
}
K = N + K;
for (j = 1; j <= i; j++){
o << j << ' ';
}
o << K << ' ';
for (j = N; j >= i + 1; j--){
if (j != K){
o << j << ' ';
}
}
return 0;
}