Cod sursa(job #2136227)
| Utilizator | Data | 19 februarie 2018 19:16:09 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.33 kb |
#include<fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long N,K,nr,p;
int main()
{
f>>N>>K;
nr=1;
while(nr*(nr+1)/2<K)++nr;
for(int i=1;i<=N-nr-1;++i)g<<i<<' ';
p=N-(nr*(nr+1)/2)+K;
g<<p<<' ';
for(int i=N;i>=N-nr;--i)if(i!=p)g<<i<<' ';
return 0;
}
