Cod sursa(job #1829668)
| Utilizator | Data | 15 decembrie 2016 15:15:16 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#define NMAX 100001
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
char mark[NMAX];
int main()
{
long long int n;
long long int k;
in >> n >> k;
in.close();
long long int tt = (n * (n - 1)) / 2;
for (long long int i = 1; i < n; i++)
{
if (tt - (n - i) >= k)
{
out << i << " ";
tt -= (n - i);
mark[i] = 1;
}
}
for (long long int i = n; i >= 1; i--)
if (!mark[i])
out << i << " ";
out.close();
return 0;
}