Cod sursa(job #2397403)
| Utilizator | Data | 4 aprilie 2019 13:08:42 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long nrt,n,k,nr,sol[100005];
int main()
{
f>>n>>k;
nrt=n*(n-1)/2;
int x=n-1;
nr=1;
while(nrt-x>k)
{
sol[nr]=nr;
nr++;
nrt-=x;
x--;
}
int h=n-(nrt-k);
sol[nr++]=h;
x=n;
while(nr<=n)
{
if(x!=h)
sol[nr++]=x;
x--;
}
for(int i=1;i<=n;i++)
g<<sol[i]<<" ";
return 0;
}
