Project Euler 5

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)

转载于:https://www.cnblogs.com/JerryBerry/p/10643502.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值