hdu1398 Square Coins
来源:互联网 发布:mock.js 教程 编辑:程序博客网 时间:2024/04/29 17:18
#include <stdio.h> #define MAXN 302 int main() { int arr1[MAXN],arr2[MAXN]; int i,j,k,n; while(scanf("%d",&n)&&n) { for(i=0;i<=n;++i) { arr1[i]=1; arr2[i]=0; } for (i=2;i<=17;++i) { for(j=0;j<=n;++j) for (k=0;k+j<=n;k+=i*i) { arr2[k+j]+=arr1[j]; } for (j=0;j<=n;++j) { arr1[j]=arr2[j]; arr2[j]=0; } } printf("%d\n",arr1[n]); } return 0; }
- hdu1398-Square Coins
- hdu1398 Square Coins
- HDU1398-Square Coins
- hdu1398 -Square Coins
- hdu1398 Square Coins(组合)
- HDU1398-Square Coins
- hdu1398 Square Coins
- hdu1398 Square Coins
- Square Coins (hdu1398)
- Square Coins(HDU1398)
- hdu1398 Square Coins(生成函数)
- hdu1398 Square Coins 母函数
- 【母函数】hdu1398(Square Coins)
- HDU1398 Square Coins【母函数】
- 【HDU1398】Square Coins 母函数
- hdu1398 Square Coins 母函数水题
- HDU1398 Square Coins 【母函数模板】
- HDU1398 Square Coins(母函数)
- a100
- POJ-2909-Goldbach's Conjecture
- MVC2学习
- ${ctx}与${pageContext.request.contextPath}的区别
- AUG13-The Number Of Solutions
- hdu1398 Square Coins
- experiment : VerifyFileSignatureBuildIn
- Introducing Regular Expressions 学习笔记
- uva 10387
- java学习笔记(9)——网络
- HDU 4607 Park Visit
- poj 1743 Musical Theme (后缀数组 不可重叠最长重复子串)
- 探寻C++最快的读取文件的方案
- UVA 10499 (13.08.06)