Cod sursa(job #2128482)
| Utilizator | Data | 11 februarie 2018 19:12:39 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.32 kb |
#include <fstream>
using namespace std;
ifstream f ("farfurii.in");
ofstream g ("farfurii.out");
long long n,k,p,t;
int main()
{
f>>n>>k;
while(p*(p+1)/2<k) ++p;
for(int j=1;j<=n-p-1;++j) g<<j<<' ';
t=p*(p+1)/2-k;
g<<n-t<<' ';
for(int j=n;j>=n-p;--j) if(j!=n-t) g<<j<<' ';
return 0;
}
