码迷,mamicode.com
首页 > 其他好文 > 详细

Project Euler 5

时间:2019-04-02 17:06:58      阅读:104      评论:0      收藏:0      [点我收藏+]

标签:end   positive   class   project   clear   tle   number   euler   nbsp   

Problem 5

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?

Solve:

  1. clear
    clc
    for i = 100:20:1000000000
    % if rem(i,11) == 0 && rem(i,12) == 0 && rem(i,13) == 0 && rem(i,14) == 0 && rem(i,15) == 0 &&rem(i,16) == 0 && rem(i,17) == 0 && rem(i,18) == 0 && rem(i,19) == 0 && rem(i,20) == 0
    break
    end
    end
    fprintf(‘The smallest evenly divisible number is %.0d\n‘,i)

  2. clear
    clc
    for i = 100:20:1000000000
    for j = 20:-1:1
    if mod(i,j) ~= 0
    break
    end
    end
    if j == 1
    answer = i;
    break
    end
    end
    fprintf(‘The smallest evenly divisible number is %.0d\n‘,answer)

Project Euler 5

标签:end   positive   class   project   clear   tle   number   euler   nbsp   

原文地址:https://www.cnblogs.com/JerryBerry/p/10643502.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!