Spikey sanju Posted on Feb 23, 2020 Solving Project Euler Problem Everyday - Day 01 #kotlin #eulerproblems #coding #challenge Find the sum of all the multiples of 3 or 5 below 1000. I have used kotlin for this problem. Top comments (3) Subscribe Submit Preview Dismiss Collapse Expand David Mendoza (He/Him) David Mendoza (He/Him) David Mendoza (He/Him) Follow I'm a Honduran developer who loves to code all that I can, if I can't do it I will try anyway. Email davidmendozalainez99@gmail.com Location Tegucigalpa, Francisco MorazΓ‘n, Honduras Education Soon to be systems engineer Work Full stack engineer at Acklen Avenue Joined Aug 18, 2019 • Feb 24 '20 Dropdown menu Copy link Hide made a quick c++ solution #include<iostream> int main() { int total = 0; for (int i = 0; i < 1000; i++) { if (i % 3 == 0 || i % 5 == 0) total += i; } std::cout << total << std::endl; return 0; } Collapse Expand Spikey sanju Spikey sanju Spikey sanju Follow Android Developer π± & UX Ninja π¨ | Kotlin & Java β₯οΈ | Open Source Contributor π. Location Chennai, India Education B.Tech - Computer Science Engineering Work Founder & CEO at ThisUX - A Global UX/UI Design Studio Joined Jul 10, 2019 • Feb 24 '20 Dropdown menu Copy link Hide That's great π Collapse Expand Waseem akram Waseem akram Waseem akram Follow Joined Jul 14, 2020 • Jul 14 '20 • Edited on Jul 14 • Edited Dropdown menu Copy link Hide Python implementation :) print(sum([i for i in range(1,1000) if i % 3 ==0 or i % 5 == 0])) Code of Conduct • Report abuse
Top comments (3)
made a quick c++ solution
That's great π
Python implementation :)