From a1a8d6de7cf7531bfd23101905fbda7945723d8d Mon Sep 17 00:00:00 2001 From: anubhavm55 Date: Thu, 24 Oct 2019 00:37:01 +0530 Subject: [PATCH 1/2] Solution of project euler problem 1 in java --- coder07/ProjectEuler#1.java | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 coder07/ProjectEuler#1.java diff --git a/coder07/ProjectEuler#1.java b/coder07/ProjectEuler#1.java new file mode 100644 index 0000000..b6dc191 --- /dev/null +++ b/coder07/ProjectEuler#1.java @@ -0,0 +1,24 @@ +import java.io.*; +import java.util.*; +import java.text.*; +import java.math.*; +import java.util.regex.*; + +public class Solution { + + public static void main(String[] args) { + Scanner in = new Scanner(System.in); + int t = in.nextInt(); + for(int a0 = 0; a0 < t; a0++){ + long N = in.nextInt(); + long n=N-1; + long n3=n/3; + long s=n3*(3+(n3*3))/2; + long n5=n/5; + long s1=n5*(5+(n5*5))/2; + long n15=n/15; + long s2=n15*(15+(n15*15))/2; + System.out.println(s+s1-s2); + } + } +} From a6099f07223de5ed9bcc5be080ff18799e4a3fc4 Mon Sep 17 00:00:00 2001 From: anubhavm55 Date: Thu, 24 Oct 2019 00:41:37 +0530 Subject: [PATCH 2/2] Solution of project euler problem 2: Even Fibonacci Numbers in java --- coder07/ProjectEuler#2.java | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 coder07/ProjectEuler#2.java diff --git a/coder07/ProjectEuler#2.java b/coder07/ProjectEuler#2.java new file mode 100644 index 0000000..549b43c --- /dev/null +++ b/coder07/ProjectEuler#2.java @@ -0,0 +1,29 @@ +import java.io.*; +import java.util.*; +import java.text.*; +import java.math.*; +import java.util.regex.*; + +public class Solution { + + public static void main(String[] args) { + Scanner in = new Scanner(System.in); + int t = in.nextInt(); + for(int a0 = 0; a0 < t; a0++){ + long n = in.nextLong(); + long a=1,b=2,c,sum=2; + while(true) + { + c=a+b; + a=b; + b=c; + if(c>=n) + break; + if(c%2==0) + sum+=c; + } + System.out.println(sum); + + } + } +} \ No newline at end of file