Cod sursa(job #1083099)
Utilizator | FMI Belu Andrei Octavian tavi.belu1994 | Data | 15 ianuarie 2014 16:52:43 |
---|---|---|---|
Problema | Farfurii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <cstdio>
FILE *f,*g;
using namespace std;
int main() {
f=fopen("farfurii.in","r");
g=fopen("farfurii.out","w");
int n,k,x,i,p;
fscanf(f,"%d %d",&n,&k);
for(x=1 ; x*(x-1) <= 2*k ; ++x);
for(i=1 ; i<=n-x ; ++i)
fprintf(g,"%d ",i);
p = n-(x-1) * x/2 + k;
fprintf(f,"%d ",p);
for (i=n ; i>n-x+1 ; --i)
if(i != p)
fprintf(g,"%d ",i);
if(k)
fprintf(g,"%d",i);
fclose(f);
fclose(g);
return 0;
}