POJ
文章平均质量分 57
ShuwenLau
Know thyself, nothing in excess.
展开
-
POJ1664 放苹果儿
#include using namespace std; int f(int m,int n){ if(m<=1 || n<=1) return 1; if(n>m) return f(m,m); else return f(m,n-1)+f(m-n,n); } int main(){ int t; cin>>t; int m,n; while(t){ cin原创 2015-08-05 14:27:52 · 277 阅读 · 0 评论 -
POJ 1163 The Triangle
#include #include using namespace std; int main() { const int size=101; int triangle[size][size]; int* maxSum; int n;//行数 int i,j; cin>>n; for(i=1;i<=n;i++) for(j=1;j<=i;j++) cin>>triang原创 2015-08-05 14:40:36 · 198 阅读 · 0 评论 -
POJ 2247 Humble Numbers
#include #include #define maxnum 2000000000 using namespace std; int a[5850]={0}; int main(){ long long n2=1,n3=1,n5=1,n7=1; int n,count=0; while(n2<=maxnum){ n3=1;原创 2015-08-05 14:42:16 · 281 阅读 · 0 评论 -
POJ 2533 Longest Ordered Subsequence
#include using namespace std; int main(){ int n; cin>>n; int a[1004]={0}; int b[1004]={0}; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=1;i<=n;i++){ b[i原创 2015-08-05 14:50:00 · 270 阅读 · 0 评论 -
逆波兰表达式
#include using namespace std; double notation(){ char str[10]; cin>>str; switch(str[0]){ case'+': return notation() + notation(); case'-': return notation() - notation(); case'*': return原创 2015-08-05 15:38:50 · 288 阅读 · 0 评论