[Project Euler]加入欧拉 Problem 15
2011-02-11 16:45
399 查看
Starting in the top left corner of a 2欧拉项目第十五道题#include <stdio.h>
#include <stdlib.h>
double JieChen(int n);
int main(int argc, char *argv[])
{
double num1, num2, num3;
num1 = JieChen(40);
num2 = JieChen(20);
num3 = num1 / (num2 * num2);
printf("%lf", num3);
system("PAUSE");
return 0;
}
double JieChen(int n)
{
if(n == 1)
return 1;
else
return n * JieChen(n - 1);
}[/code]
这题如果不利用组合数学的这个知识,还是挺费劲的,这个以后再想了。
#include <stdlib.h>
double JieChen(int n);
int main(int argc, char *argv[])
{
double num1, num2, num3;
num1 = JieChen(40);
num2 = JieChen(20);
num3 = num1 / (num2 * num2);
printf("%lf", num3);
system("PAUSE");
return 0;
}
double JieChen(int n)
{
if(n == 1)
return 1;
else
return n * JieChen(n - 1);
}[/code]
这题如果不利用组合数学的这个知识,还是挺费劲的,这个以后再想了。
相关文章推荐
- [Project Euler]加入欧拉 Problem 10
- [Project Euler]加入欧拉 Problem 11
- [Project Euler]加入欧拉 Problem 1
- [Project Euler]加入欧拉 Problem 2
- [Project Euler]加入欧拉 Problem3
- [Project Euler]加入欧拉 Problem 12
- [Project Euler]加入欧拉 Problem 16
- [Project Euler]加入欧拉 Problem 14
- [Project Euler]加入欧拉 Problem 4
- [Project Euler]加入欧拉 Problem 5
- [Project Euler]加入欧拉 Problem 6
- [Project Euler]加入欧拉 Problem 17
- [Project Euler]加入欧拉 Problem 7
- [Project Euler]加入欧拉 Problem 8
- [Project Euler]加入欧拉 Problem 9
- Project Euler:Problem 15 Lattice paths
- [Project Euler] Problem 15
- 欧拉项目(Project Euler)Problem 1
- Project Euler - Problem 15
- [Project Euler] Problem 56