Cod sursa(job #938354)
| Utilizator | Data | 12 aprilie 2013 14:06:38 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdlib.h>
using namespace std;
ifstream fi ("farfurii.in");
ofstream fo ("farfurii.out");
int main ()
{
int i, j, k, N;
long long K;
fi >> 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++)
fo << j << ' ';
fo << K << ' ';
for (j = N; j >= i + 1; j--)
if (j != K)
fo << j << ' ';
return 0;
}
