Cod sursa(job #2904982)
| Utilizator | Data | 18 mai 2022 23:30:47 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int main()
{
long long N, K, m=1, i, p;
f >> N >> K;
while(m * (m-1) / 2 < K)
++m;
for(i=1; i<=N-m; ++i)
g << i << ' ';
if(m * (m-1) / 2 == K)
for(i=N; i>N-m; --i)
g << i << ' ';
else
{
p = m * (m-1) / 2 - K;
g << N - p << ' ';
for(i=N; i>N-m; --i)
if(i != N-p)
g << i << ' ';
}
}
