HDOJ 5334 Virtual Participation

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

int res[100005];
LL K, n;

void solve(int L ,int R, int t)
{
int tt = 1, i, t1 = res[R];
for(i = R-1; i >= L && t > 0; i--) {
if(t < tt) break;
else t -= tt, res[i] = t1;
tt++;
}
if(t == 0) return;
solve(L, i, t);
}

void work()
{
if(K <= 10000) {
printf("%lld\n", K);
for(int i = 1; i <= K; i++) printf("1%c", i == K ? '\n' : ' ');
return;
}

for(n = 0; n * (n + 1) / 2 < K; n++);
for(int i = 1; i <= n; i++) res[i] = i;
LL t = n * (n + 1) / 2 - K;
solve(1, n, t);
printf("%lld\n", n);
for(int i = 1; i <= n; i++) printf("%d%c", res[i], i == n ? '\n' : ' ');
}

int main()
{
while(scanf("%lld", &K) != EOF) {
work();
}

return 0;
}