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. 样例输入
-
2 10
样例输出
-
2 7
/* * 这个问题应该是dp问题,满足最优化子结构,那么,对于n都有一个对应的的最坏的选择 * 即n个1相加,我们可以通过题目的要求用乘法来减少加法的次数,从而得到一个最少1的个数 * 下面是具体的分析的过程: * 假设dp[i] 表示组成i的需要最少1的个数,那么,初始化的状态 dp[0] = 0,dp[1] = 1,dp[2] = 2 * 当n > 2的时候,其动态转移方程为: dp[i] = min(dp[i-1]+1,dp[m]+dp[n]) 其中要满足一个条件 * 即i = m*n 也就是将i分解为两个数的乘积来减少1的次数,下面是具体的代码: */ #include <stdio.h> #define min(x,y) (x) < (y) ? (x) : (y) int dp[10001] = {0,1,2}; int main(int argc, char const *argv[]) { int n; for(int i = 3; i <= 10000; i++) { int k = dp[i-1] + 1; for(int j = 2; j*j <= i; j++) { if(i%j == 0) { k = min(k,dp[i/j]+dp[j]); } } dp[i] = k; } while(~scanf("%d",&n)) { printf("%d\n", dp[n]); } return 0; }