Problem 5-Project Euter
来源:互联网 发布:mac怎么隐藏照片 编辑:程序博客网 时间:2024/06/07 01:37
2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
#include<iostream>
//#include<cstring>
#include<algorithm>
using namespace std;
_int64 maxCommonDivisor(_int64 a,_int64 b)
{
_int64 temp;
if(a<b) swap(a,b);
while(a%b!=0)
{
temp=b;
b=a%b;
a=temp;
}
return b;
}
int main()
{
_int64 val;
val=1;
for(int i=2;i<=20;++i)
{
val=val*i/maxCommonDivisor(val,i);
}
printf("%I64d",val);
return 0;
}
- Problem 5-Project Euter
- Problem 9-Project Euter
- Project Euler - Problem 5
- Project Euler problem 5
- 【Project Euler】【Problem 5】Smallest multiple
- project euler problem 5:Smallest multiple
- Project Euler Problem 5: Smallest multiple
- Euler Project Problem 6
- project euler problem 11
- Project Euler Problem 81
- Project Euler Problem 60
- Project Euler Problem 59
- Project Euler Problem 58
- Project Euler Problem 57
- Project Euler Problem 16
- Project Euler Problem 30
- Project Euler Problem 31
- Project Euler Problem 32
- sprintf以及__int64 与long long int
- uva 10161 - Ant on a Chessboard
- UVA 10034 - Freckles
- 计算24(随机法)
- 购票找零问题(5角,一元)
- Problem 5-Project Euter
- Problem 9-Project Euter
- 把一个字符以二进制的形式写到控制台
- poj 1094 Sorting It All Out
- poj 1087 A Plug for UNIX
- poj 1149 : PIGS
- xmllogger
- poj 1611
- poj 2524 Ubiquitous Religions