#include <stdio.h>
#include <vector>
unsigned long long comb[64][64];
int main()
{
long long t;
scanf ("%lld",&t);
if (t <= 300){
printf ("%lld 1\n",t);
for (int i=0;i<t;i++) printf ("%d ",1);
}
else{
for (int i=0;i<64;i++){
comb[i][0] = comb[i][i] = 1;
for (int j=1;j<i;j++) comb[i][j] = comb[i-1][j-1] + comb[i-1][j];
}
std::vector<int> ans;
for (int i=0;i<63;i++) ans.push_back(1);
for (int j=31;j>=0;j--) while (t >= comb[31][j]){
ans.push_back(300-j);
t -= comb[31][j];
}
printf ("%u %d\n",ans.size(),300);
for (auto x : ans) printf ("%d ",x);
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1240 KB |
Output is correct |
2 |
Correct |
0 ms |
1240 KB |
Output is correct |
3 |
Correct |
0 ms |
1240 KB |
Output is correct |
4 |
Correct |
0 ms |
1240 KB |
Output is correct |
5 |
Correct |
0 ms |
1240 KB |
Output is correct |
6 |
Correct |
0 ms |
1240 KB |
Output is correct |
7 |
Correct |
0 ms |
1240 KB |
Output is correct |
8 |
Correct |
0 ms |
1240 KB |
Output is correct |
9 |
Correct |
0 ms |
1240 KB |
Output is correct |
10 |
Correct |
0 ms |
1240 KB |
Output is correct |
11 |
Correct |
0 ms |
1240 KB |
Output is correct |
12 |
Correct |
0 ms |
1240 KB |
Output is correct |
13 |
Correct |
0 ms |
1240 KB |
Output is correct |
14 |
Correct |
0 ms |
1240 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
1240 KB |
Output isn't correct - Integer parameter [name=N] equals to 9794, violates the range [1, 300] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Halted |
0 ms |
0 KB |
- |