| 比赛 |
20111111 |
评测结果 |
AAWWWWWWEE |
| 题目名称 |
最优分解方案 |
最终得分 |
20 |
| 用户昵称 |
Yeehok |
运行时间 |
0.000 s |
| 代码语言 |
C++ |
内存使用 |
0.00 MiB |
| 提交时间 |
2011-11-11 11:43:01 |
显示代码纯文本
#include<cstdio>
using namespace std;
int main()
{
freopen("best.in","r",stdin);
freopen("best.out","w",stdout);
int n;
int num[60]={0,1,1,2,3,4,6,9,15,18,30,36,54,81,108,162,243,324,486,729,972,1458,2187,2916,4374,6561,8748,13122,19683,26244,39366,59049,78732,118098,177147,236196,354294,531441,708588,1062882,1594323,2125764,3188646,4782969,6377292,14348907,19131876,28697814,43046721,57395628};
scanf("%d\n",&n);
printf("%d\n",num[n]);
return(0);
}