摘要： svn教程推荐：Version Control with Subversion有点out的中文版：Subversion 与版本控制 阅读全文

摘要： 汉诺塔问题：有3根杆子A, B, C。A杆上有N个(N>1)穿孔圆盘，盘的尺寸由下到上依次变小。按如下规则将所有圆盘移至C杆：每次只能移动一个圆盘；大盘不能叠在小盘上面。问如何移动次数最少？#include <iostream>void move(x, y) { std::cout << x << " -> " << y << std::endl;}void hanoi(unsigned int n, char a, char b, char c) { if (n == 1) { move(a, c); 阅读全文

摘要： unsigned int fibonacci(unsigned int n) { if (n == 0 || n == 1) { return n; } else { return fibonacci(n-1) + fibonacci(n-2); }}递归 阅读全文

摘要： unsigned int factorial(unsigned int n) { if (n <= 1) { return 1; } else { return factorial(n-1) * n; }}递归 阅读全文

摘要： unsigned int gcd(unsigned int a, unsigned int b){ unsigned int rem; while (b != 0) { rem = a % b; a = b; b = rem; } return a;}Euclidean辗转相除法unsigned int lcm(unsigned int a, unsigned int b){ return a / gcd(a, b) * b;}根据 greatest common divisor 求 least common multiple 阅读全文

摘要： unsigned int count(unsigned int n) { unsigned int cnt = 0; unsigned int i, j; for (i = 1; i <= n; i++) { j = i; while (j % 5 == 0) { cnt++; j /= 5; } } return cnt;}或unsigned int count(unsigned int n) { unsigned int cnt = 0; while (n) { cnt += n / 5; ... 阅读全文

摘要： 给出一个数，判断这个数是不是素数：#include bool is_prime(unsigned int n) { unsigned int sqroot = sqrt(n); for (unsigned int i = 2; i < sqroot; i++) { if (n % i == 0) return false; } return true;}试除法 阅读全文

摘要： 阅读全文