Pagini recente » Cod sursa (job #1011525) | Cod sursa (job #2663535) | Cod sursa (job #1086886) | Cod sursa (job #533635) | Cod sursa (job #340722)
Cod sursa(job #340722)
#include <stdio.h>
FILE *fin,*fout;
long long v[100001];
long long n,k;
void solve(){
long long e,s,i,nr;
i=1; s=1; e=n;
while(i<=n){
nr=e-s;
if(((nr-1)*nr) /2 >=k){
v[s]=i;
s++;
}
else{
v[e]=i;
e--;
k -= nr;
}
i++;
}
}
void afis(){
long long i;
for(i=1;i<=n-1;i++) fprintf(fout,"%lld ",v[i]);
fprintf(fout,"%lld\n",v[n]);
}
int main(){
fin=fopen("farfurii.in","r");
fout=fopen("farfurii.out","w");
fscanf(fin,"%lld%lld",&n,&k);
solve();
afis();
fclose(fin); fclose(fout);
return 0;
}