完全背包——方案个数 UVA11137 Ingenuous Cubrency
2015-08-28 11:04
281 查看
题目描述如下
:
代码如下:
#include <stdio.h>
unsigned long long int dp[10001] ;
int main (){
int i,j ,k ;
int v[22];
int n ;
for (i = 1 ; i < 22 ; i ++)
v[i] = i*i*i ;
dp [0] = 0 ;
for ( i = 1 ; i <=21 ; i ++ ){
for ( j = 0 ; j<10001 ; j ++ ){
if ( j>=v[i] && i>1 )
dp[j] = dp[j] + dp[ j -v[i] ];
if ( i == 1){
dp[j] = 1;
}
}
}
while (scanf ("%d",&n)!=EOF){
printf ("%llu\n" , dp
);
}
return 0;
}
:
代码如下:
#include <stdio.h>
unsigned long long int dp[10001] ;
int main (){
int i,j ,k ;
int v[22];
int n ;
for (i = 1 ; i < 22 ; i ++)
v[i] = i*i*i ;
dp [0] = 0 ;
for ( i = 1 ; i <=21 ; i ++ ){
for ( j = 0 ; j<10001 ; j ++ ){
if ( j>=v[i] && i>1 )
dp[j] = dp[j] + dp[ j -v[i] ];
if ( i == 1){
dp[j] = 1;
}
}
}
while (scanf ("%d",&n)!=EOF){
printf ("%llu\n" , dp
);
}
return 0;
}
相关文章推荐
- 1.10055 - Hashmat the brave warrior
- 2.10071 - Back to High School Physics
- 3.458 - The Decoder
- 4.694 - The Collatz Sequence
- 6.494 - Kindergarten Counting Game
- 7.490 - Rotating Sentences
- 8.414 - Machined Surfaces
- 9.488 - Triangle Wave
- A.457 - Linear Cellular Automata
- B.489 - Hangman Judge
- C.445 - Marvelous Mazes
- 1.10494 - If We Were a Child Again
- 2.424 - Integer Inquiry
- 3.10250 - The Other Two Trees
- 5.465 - Overflow
- 6.113 - Power of Cryptography
- 7.10161 - Ant on a Chessboard
- 8.621 - Secret Research
- 9.401 - Palindromes
- A.537 - Artificial Intelligence?