poj-2229-Sumsets
来源:互联网 发布:java程序加载类的步骤 编辑:程序博客网 时间:2024/06/10 16:40
Sumsets
Time Limit: 2000MS Memory Limit: 200000KTotal Submissions: 12690 Accepted: 5090
Description
Farmer John commanded his cows to search for different sets of numbers that sum to a given number. The cows use only numbers that are an integer power of 2. Here are the possible sets of numbers that sum to 7:
1) 1+1+1+1+1+1+1
2) 1+1+1+1+1+2
3) 1+1+1+2+2
4) 1+1+1+4
5) 1+2+2+2
6) 1+2+4
Help FJ count all possible representations for a given integer N (1 <= N <= 1,000,000).
1) 1+1+1+1+1+1+1
2) 1+1+1+1+1+2
3) 1+1+1+2+2
4) 1+1+1+4
5) 1+2+2+2
6) 1+2+4
Help FJ count all possible representations for a given integer N (1 <= N <= 1,000,000).
Input
A single line with a single integer, N.
Output
The number of ways to represent N as the indicated sum. Due to the potential huge size of this number, print only last 9 digits (in base 10 representation).
Sample Input
7
Sample Output
6
#include<stdio.h>int a[1000005]={0,1,2,2,4,4,6,6};int main(){ int n,i; for(i=8;i<1000005;i++) if(i%2==0) a[i]=(a[i-2]%1000000000+a[i/2]%1000000000)%1000000000; else a[i]=a[i-1]; while(scanf("%d",&n)!=EOF) printf("%d\n",a[n]); return 0;}
0 0
- POJ 2229 Sumsets
- poj 2229 Sumsets
- [POJ] 2229 Sumsets
- sumsets poj 2229
- POJ-2229-Sumsets
- poj 2229 Sumsets
- poj 2229 Sumsets DP
- POJ 2229 Sumsets DP
- poj 2229 Sumsets
- poj-2229-Sumsets
- Sumsets poj 2229 c++
- POJ-2229 Sumsets DP
- poj 2229 Sumsets
- poj 2229 Sumsets【DP】
- POJ 2229 Sumsets
- poj 2229 Sumsets
- POJ 2229 Sumsets
- POJ 2229:Sumsets
- dbcp连接池配置
- 【Boost】C++ Boost 学习资源列表
- 使用谷歌地图API根据坐标显示地图
- 批量静动态SQL语句
- 算法题:打印1到最大的n位数
- poj-2229-Sumsets
- C++ 形参
- 值传递与引用传递
- poj 3663 Costume Party(快排)
- HDU 4907 Task Schedule (Hash + 二分)
- Trie—单词查找树
- crm组织服务中的crm消息
- RHEL 6.4中安装G++编译器及GCC与G++区别
- hdu-2674-N!Again