Cod sursa(job #2326315)
| Utilizator | Data | 23 ianuarie 2019 13:51:50 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.46 kb |
#include <stdio.h>
using namespace std;
FILE *in,*out;
int main()
{
in=fopen("farfurii.in","r");
out=fopen("farfurii.out","w");
long long n,k,i,nr;
fscanf(in,"%lld %lld",&n,&k);
for(nr=0;nr*(nr+1)/2<k;nr++){}
for(i=1;i<n-nr;i++)
fprintf(out,"%lld ",i);
long long aux=n-(1ll*nr*(nr+1)/2-k);
fprintf(out,"%d ",aux);
for(i=n;i>=n-nr;i--)
if(i!=aux)
fprintf(out,"%lld ",i);
return 0;
}
