C語言源碼: [cpp] #include<stdio.h> int max(int a,int b) { if(b==0) return a; else return max(b,a%b); } int main() { int a,b,c; while(scanf("%d %d",&a,&b)!=EOF) { if(a<b) { c=a; a=b; b=c; } printf("%d\n",a*b/max(a,b)); } }
雙邊濾波算法的簡易實現bilateralFilter,bil
POJ1037:A decorative fence(DP)
C. Purification time limit
B. I.O.U. 題目鏈接:點擊打開鏈接  
Division Time Limit: 10000
UVA 1637 Double Patience 概率DP