Cod sursa(job #1776292)
| Utilizator | Data | 11 octombrie 2016 09:26:58 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | cerculdeinfo-lectia2-arborideintervale | Marime | 0.61 kb |
#include <stdio.h>
#include <math.h>
#define lim 100000
int v[lim+1];
int main(){
FILE *fin,*fout;
fin=fopen("farfurii.in","r");
fout=fopen("farfurii.out","w");
long long i,j,x,y,n,k;
fscanf(fin,"%lld%lld",&n,&k);
x=sqrt(2*k);
while(x*(x+1)/2>k)
x--;
y=k-x*(x+1)/2;
for(i=1;i<=n-x-2;i++)
v[i]=i;
j=i;
for(i=0;i<=x;i++){
if(i==y){
v[n-x-1]=j;
j++;
}
v[n-i]=j;
j++;
}
for(i=1;i<=n;i++)
fprintf(fout,"%d ",v[i]);
fclose(fin);
fclose(fout);
return 0;
}