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