Kategori: Project Euler

Pada postingan saya kali ini akan membahas problem kedua pada Project Euler (baca disini).

Problem 2

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:

1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.

Solution

public class fibonaci{
public static void main (String [] args){

      long x = 1;
      long y = 2;
      long z = 0;

      long hasilFgenap = 2; 

      for(;z < 4000000;){
           z = x + y;
           x = y;
           y = z;
           if(z % 2 == 0){
                hasilFgenap = hasilFgenap + z;
           }
       }
       System.out.print("Hasil: " + hasilFgenap);
   }
}

Output

Hasil: 4613732

Selamat mencoba 🙂

Pada postingan saya kali ini akan membahas problem pertama pada Project Euler (baca disini).

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 multiples of 3 or 5 below 1000.

Solution

import java.util.Scanner;

public class problem1{
    public static void main (String [] args){
        int Total = 0;
        
        Scanner masukan = new Scanner(System.in);
        for(int x=3; x <1000; x = x + 1){
            
            //kelipatan 3 dan 5 berarti habis dibagi 3 dan 5
           if(x%3 == 0 || x%5 == 0){    
                Total = Total + x;
            }
            }
            System.out.print("Hasil: " + Total);
           
       }
           
    }

Output

Hasil: 233168

Selamat mencoba 🙂