Solution of project euler problem 1 in java

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);
+        }
+    }
+}

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);
+
+        }
+    }
+}