ones
时间限制:
1000 ms | 内存限制:
65535 KB
难度:
3
-
描述
-
Given a positive integer N (0<=N<=10000), you are to find an expression equals to N using only 1,+,*,(,). 1 should not appear continuously, i.e. 11+1 is not allowed.
-
输入
- There are multiple test cases. Each case contains only one line containing a integer N 输出
- For each case, output the minimal number of 1s you need to get N.
只能说神奇的算法,说多了都是泪,直接上代码你琢磨吧:
代码一:400多的做法
#include "iostream"
#include "cstring"
#include "cstdio"
using namespace std;
const int MAXN = 10010;
int dp[MAXN];
int MIN(int a, int b)
{
return a < b ? a :b;
}
void Pre_Solve()
{
dp[1] = 1;
dp[2] = 2;
for(int i = 3; i <MAXN; ++i)
{
dp[i] = i;
for(int j = 1; j < i; ++j)
{
dp[i] =MIN(dp[i], dp[i-j] + dp[j]);
if( j != 1&& !(i%j))
dp[i] = MIN(dp[i], dp[i/j] +dp[j]);
}
}
}
int main()
{
int n;
memset(dp, 0,sizeof(dp));
Pre_Solve();
while(~scanf("%d",&n))
{
printf("%d\n",dp[n]);
}
return 0;
}
解法二:
排行榜第一的就是我的,不解释。哈哈哈。。。对不起洋哥。
#include "iostream"
#include "cstring"
#include "cstdio"
using namespace std;
const int MAXN = 10010;
int dp[MAXN];
int MIN(int a, int b)
{
return a < b ? a :b;
}
void Pre_Solve()
{
dp[1] = 1;
dp[2] = 2;
for(int i = 3; i <MAXN; ++i)
{
dp[i] = i;
for(int j = 1; j < i; ++j)
{
dp[i] =MIN(dp[i], dp[i-j] + dp[j]);
if( j != 1&& !(i%j))
dp[i] = MIN(dp[i], dp[i/j] +dp[j]);
}
}
}
int main()
{
int n;
memset(dp, 0,sizeof(dp));
Pre_Solve();
while(~scanf("%d",&n))
{
printf("%d\n",dp[n]);
}
return 0;
}