欧拉计划Problem_5

C #

#include<stdio.h>
int main(){
    int count = 0;
    for(int i = 20 ; i >= 20 ; i+=20)
	{
        for(int j=1;j<=20;j++)
		{
            if(i%j == 0) count++;
            else continue;
        }
        if(count == 20)
        {
            printf("%d\n",i);
            break;
        }else count = 0;
    }
	return 0;

}

JAVA

package exercise;
public class _最小公倍数 {

	public static void main(String[] args) {
		int haha = 20;
		int count = 0; // 被整除的个数
		int multiple = haha;
		while (true) {
			for (int j = 1; j <= haha; j++) {
				if (multiple % j == 0)
					count++;
				else {
					count = 0;
					break;
				}
			}
			if (count == haha) {
				break;
			}
			multiple += haha;
		}
		System.out.println(multiple);

	}

}

结果：232792560