Cod sursa(job #2098904)
| Utilizator | Data | 3 ianuarie 2018 17:33:43 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
#include<cmath>
using namespace std;
int main()
{
long long n,k,i,v[100005],poz=0;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
f>>n>>k;
i=sqrt(2*k);
for(;i*(i-1)/2<k;++i);
for(long long j=1;j<=n-i;++j) {v[++poz]=j;g<<v[poz]<<' ';}
k=i*(i-1)/2-k;
v[++poz]=n-k;g<<v[poz]<<' ';
for(long long j=n;j>n-k;--j) {v[++poz]=j;g<<v[poz]<<' ';}
for(long long j=n-k-1;j>n-i;--j) {v[++poz]=j;g<<v[poz]<<' ';}
return 0;
}
