Problem 1 of multiples

最新推荐文章于 2021-06-03 16:11:46 发布

原创最新推荐文章于 2021-06-03 16:11:46 发布 · 500 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#numbers #string #class #list

欧拉项目专栏收录该内容

17 篇文章

订阅专栏

本文提供了一个Java程序，用于计算并输出所有小于1000的自然数中，能被3或5整除的数之和，结果为233168。

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.

Find the sum of all the multiples of 3 or 5 below 1000.

public class Multiples {
	public static void main(String args[]){
		int sum=0;
		for(int i=3;i<1000;i++){
			if((i%3==0&&i%15!=0)||(i%5==0&&i%15!=0)||(i%15==0)){
				sum+=i;
			}
		}
		System.out.println("i="+sum);
	}
}

Answer:

233168

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

comkingfly

关注关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
分享

复制链接

分享到 QQ

分享到新浪微博

扫一扫
举报

举报

专栏目录

【 Project Euler | 欧拉计划】Problem1~5 c++详解+答案

weixin_44557834的博客

06-26

1810

目录Problem1 3或5的倍数-原题（翻译来自pe-cn.github.io 下同）-思路-代码 Problem1 3或5的倍数 -原题（翻译来自pe-cn.github.io 下同）英语原题中文翻译 Multiples of 3 and 5 If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3,5,6 and 9.The sum of these multiples is 23. Fin

Project-Euler problem 1-50

柯安的专栏

01-31

4179

最近闲的做了下Project Euler 上的题目，前面50题都比较简单，简单总结下，一下代码一般是Python和C/C++的用Python 做这些题目简直是酸爽啊一下代码可能不一定是我的，因为不知道论坛里面的回复不是永久的，所以我的代码有的丢了，可能找个和我的意思相近的代码。题目翻译是从欧拉计划 | Project Euler 中文翻译站上面Copy 的表告我。 Prob

参与评论您还未登录，请先登录后发表或查看评论

Problem 1-Multiples of 3 and 5

XuefenLiu的博客

06-03

145

这里写自定义目录标题题目1题解傻瓜方案：优化版本：题目1 题解傻瓜方案：一趟遍历，符合条件的累加起来，时间复杂度为O(N)。 #include <iostream> int main(){ int sum = 0; for(int i=1;i<1000;i++){ if(i % 3 == 0 || i % 5 == 0){ sum += i; } } std::cout << s

Problem 1:Multiples of 3 and 5

chenying7560的博客

04-17

128

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of a...

Project Euler Problem 1: Multiples of 3 and 5

海岛Blog

03-17

613

Multiples of 3 and 5 Problem 1 If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multip

Problem 1 Multiples of 3 and 5 (暴力)

LzyRapX

10-24

500

Problem 1 : Multiples of 3 and 5

weixin_30340775的博客

11-15

146

逛知乎的时候发现的一个网站——projecteuler.net，蛮有意思的一个解题网站，和平常的OJ网站不太一样，只需要提交结果就好了。可以在作工作闲暇之余，练练手。在这里提交解题过程，一是为了做笔记，二是为了督促自己。最近正好在学python，就用python解题了。废话完毕，开始第一题： Problem: If we list all the natural ...

Problem 1: Multiples of 3 and 5

weixin_30655569的博客

11-27

147

小白一枚，python解法，共同学习，一起进步。 Problem 1: Multiples of 3 and 5 If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the...

ProjectEuler Problem1.Multiples of 3 and 5

error311的博客

09-08

175

题目链接：1.Multiples of 3 and 5 题意：求小于1000的3和5的倍数的和解题可以使用循环，也可以直接分析，等差数列求和（注意，3和5的公倍数只需计算一次，多计算的减去） #include <bits/stdc++.h> using namespace std; const int maxn = 300005; int main() { int ans = 0; ans += (995 / 5) * (5 + 995) / 2; ans += ...

Problem 1 Multiples of 3 and 5

junxinsiwo的专栏

07-13

317

Problem 1 Multiples of 3 and 5 project euler

（Problem 1）Multiples of 3 and 5

aeg84268的博客

07-26

118

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000. 1 #i...

Like functions, generators can also be higher-order. For this problem, we will be writing remainders_generator, which yields a series of generator objects. remainders_generator takes in an integer m, and yields m different generators. The first generator is a generator of multiples of m, i.e. numbers where the remainder is 0. The second is a generator of natural numbers with remainder 1 when divided by m. The last generator yields natural numbers with remainder m - 1 when divided by m. Note that different generators should not influence each other.

06-01

Here's a Python implementation of the `remainders_generator` function: ``` def remainders_generator(m): """ Generate m different generators that yield numbers with remainders 0 to m-1 when divided ...

About Project Euler 欧拉项目

comkingfly

06-03

1554

http://projecteuler.netWhat is Project Euler?Project Euler is a series of challenging mathematical/computer programming problems that will require more than just mathematical insights to solve

Problem 16 of 2的1000次方

comkingfly

03-15

1493

215 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. What is the sum of the digits of the number 21000? http://projecteuler.net/problem=16 import java.math.BigInteger; public class S

Problem 19 of How many Sundays fell on the first of the month during the twentieth century

comkingfly

03-20

1420

http://projecteuler.net/problem=19 You are given the following information, but you may prefer to do some research for yourself. 1 Jan 1900 was a Monday.Thirty days has September, April, June a

欧拉项目 Problem 25 of in the Fibonacci sequence to contain 1000 digits

comkingfly

03-22

1122

The Fibonacci sequence is defined by the recurrence relation: Fn = Fn1 + Fn2, where F1 = 1 and F2 = 1. Hence the first 12 terms will be: F1 = 1 F2 = 1 F3 = 2 F4 = 3 F5 = 5 F6 = 8 F7 = 13

Problem 10 of Find the sum of all the primes below two million.

comkingfly

03-13

1037

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million. public class BigPrime { public static void main(String args[]){ long j=0; for(long i=2;i<

欧拉项目 Problem 12 of What is the value of the first triangle number to have over five hundred divisors

comkingfly

03-21

914

The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be: 1, 3, 6, 10, 15, 21, 2

Problem 21 of Evaluate the sum of all the amicable numbers under 10000.

comkingfly

03-20

852

Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n). If d(a) = b and d(b) = a, where a b, then a and b are an amicable pair and each of a and b