Pagini recente » Rating Stepan Patrik (Patrik) | Cod sursa (job #966011) | Cod sursa (job #3300245) | Cod sursa (job #25001) | Cod sursa (job #1417926)
#include <cstdio>
using namespace std;
FILE *fin = fopen("farfurii.in" ,"r");
FILE *fout = fopen("farfurii.out","w");
long long N, M, i, j, K, ok, minim, T, X, Y, Z;
void CodeExpert(){
fscanf(fin, "%lld%lld", &N, &K);
X = 1;
while((X+1) * 1LL * (X+2) <= K * 1LL * 2)
X ++;
Y = X * 1LL * (X+1) / 2;
for(i = 1; i <= N-X-2; i ++)
fprintf(fout,"%lld ", i);
Z = N-X-1+K-Y;
fprintf(fout,"%lld ", Z);
for(i = N; i >= N-X-1; i --)
if(i == Z)
continue;
else
fprintf(fout,"%lld ", i);
return;
}
int main(){
CodeExpert();
return 0;
}