Ural 1017 Staircases(DP)
2014-10-05 10:51
225 查看
题目地址:Ural 1017
简单的背包。
代码如下:
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <ctype.h>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
const int INF=0x3f3f3f3f;
#define LL long long
LL dp[60006];
int main()
{
int i, j, n;
memset(dp,0,sizeof(dp));
dp[0]=1;
for(i=1;i<=500;i++)
{
for(j=500;j>=i;j--)
{
dp[j]+=dp[j-i];
}
}
while(scanf("%d",&n)!=EOF)
{
printf("%lld\n",dp
-1);
}
return 0;
}
简单的背包。
代码如下:
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <ctype.h>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
const int INF=0x3f3f3f3f;
#define LL long long
LL dp[60006];
int main()
{
int i, j, n;
memset(dp,0,sizeof(dp));
dp[0]=1;
for(i=1;i<=500;i++)
{
for(j=500;j>=i;j--)
{
dp[j]+=dp[j-i];
}
}
while(scanf("%d",&n)!=EOF)
{
printf("%lld\n",dp
-1);
}
return 0;
}
相关文章推荐
- ural 1017. Staircases(dp数的划分)
- Ural_1017. Staircases(DP)
- ural 1017. Staircases(dp)
- 递推DP URAL 1017 Staircases
- ural 1017. Staircases(dp)
- URAL1017——DP——Staircases
- ural 1017. Staircases
- URAL 1017 Staircases
- URAL 1017|Staircases|动态规划
- ural 1017. Staircases
- URAL:1017 Staircases
- Ural 1017. Staircases
- URAL 1017 Staircases dp练习
- 【DP】ural 1017
- ural 1017. Staircases
- ural 1017 Staircases
- URAL 1017. Staircases(递推)
- URAL 1017 Staircases
- ural 1017 Staircases
- ural 1017. Staircases DP