1.润年判断
int IsYear(int N)
{
if ((N % 4 == 0 && N % 100 != 0) || N % 400 == 0)
{
return 1;
}
else
{
return 0;
}
}
2.素数判断
int IsPrimeNum1(int X)
{
if (X == 1||X==2)
{
return 1;
}
else
{
for (int i = 2; i < X; i++)
{
if (X%i == 0)
{
return 0;
}
}
return 1;
}
}
3.斐波那契
int N =40;
int i = 0;
long results[40];
void F(int a, int b)
{
long c= a + b;
results[i+1] = c;
i++;
if (i < N)
{
F(b, c);
}
}
4.最大公约数
//计算公因数的欧几里得算法(辗转相除法)M>=N
//证明在书中23页
unsigned int Gcd(unsigned int M, unsigned int N)
{
unsigned int Rem;
while (N > 0)
{
Rem = M % N;
M = N;
N = Rem;
}
return M;
}