Cod sursa(job #1777052)
| Utilizator | Data | 12 octombrie 2016 00:21:52 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | cerculdeinfo-lectia2-arborideintervale | Marime | 0.45 kb |
#include <cstdio>
int main(){
FILE*fi,*fout;
long long x,k,i,n;
fi=fopen("farfurii.in" ,"r");
fout=fopen("farfurii.out" ,"w");
fscanf(fi,"%lld%lld" ,&n,&k);
x=1;
while((x*(x-1))/2<k)
x++;
for(i=1;i<=n-x;i++)
fprintf(fout,"%d " ,i);
fprintf(fout,"%d " ,n-(x*(x-1))/2+k);
for(i=n;i>n-x;i--)
if(i!=n-(x*(x-1))/2+k)
fprintf(fout,"%d " ,i);
fclose(fi);
fclose(fout);
return 0;
}
