Nama

NIM
Kelas

: LUTHFI ALIF
: 11150910000028
: TI-A

1. Source code Algoritma Total Buah

import java.util.Scanner;
public class Total_buah_baru {
public static void main(String[] args) {
Scanner r = new Scanner(System.in);
int hargaapel=1000, hargamangga=1000, hargajeruk=1000,
hargatomat=1000, total=0, m, n=0, no = 0;
double berat;
System.out.println("----- menu -----");
System.out.println("1. Apel
Rp. 1000/Kg");
System.out.println("2. Mangga Rp. 1000/Kg");
System.out.println("3. Jeruk Rp. 1000/Kg");
System.out.println("4. Tomat Rp. 1000/Kg");
System.out.println("5. Hitung Total");
System.out.println("----------------");
do{ no+=n+1;
System.out.println("Pilihan Menu "+no+": ");
m = r.nextInt();
if (m<=4 && m>=1){
System.out.println("Berat: ");
berat = r.nextInt();
switch (m) {
case 1:
System.out.println("Kg Apel");
total+=berat*hargaapel;
break;
case 2:
System.out.println("Kg Mangga");
total+=berat*hargamangga;
break;
case 3:
System.out.println("Kg Jeruk");
total+=berat*hargajeruk;
break;
case 4:
System.out.println("Kg Tomat");
total+=berat*hargatomat;
break;
default:
break;
}
}
else if (m==5){
System.out.print("");

}
else
System.out.println("Buah Tidak Tersedia");
}
while( m != 5);
System.out.println("Total Harga: "+total);
}
}

2. Source code Anak Ayam

import java.util.Scanner;
public class anak_ayam_baru {
public static void main(String[] args) {
Scanner baru=new Scanner (System.in);
int n ;
System.out.println("Masukkan jumlah anak ayam = ");
n=baru.nextInt();
while(n>=2) {
System.out.println("Anak ayam turun "+n+ ", mati satu tinggal "+(n-1));
n--;
}
{System.out.println("Anak ayam turun "+n+", mati satu tinggal
Induknya");
}
}
}
}
3. Source code Algoritma Menghitung Nilai Faktorial
import java.util.Scanner;
public class faktorial_baru {

public static void main(String[] args) {

Scanner baru=new Scanner (System.in);
int n, r=1;
System.out.print("Masukkan Angka =");
n= baru.nextInt();
System.out.print(n+"! = ");
for (int z=1; z<n; n--){
r = r*n;
}
System.out.println(r);
}
}
4. Source code Algoritma Bilangan Prima
import java.util.Scanner;
public class prima_baru {
public static void main(String[] args) {
Scanner baru = new Scanner(System.in);
int angka;
boolean prima = true;
System.out.println("Angka:");
angka=baru.nextInt();
if(angka>=2)
{
for(int n=2;n<angka;n++)
{
if(angka%n==0)
{
prima= false;
}
}
if(prima==true)
System.out.println(+angka+" merupakan bilangan prima");
else{
System.out.println(+angka+" bukan merupakan bilangan prima");
}
}
else
{
System.out.println(+angka+" bukan bilangan prima");
}
}
}
5. source code Algoritma Menampilkan Bilangan Faktor Prima Terbesar

import java.util.Scanner;
public class faktor_prima_terbesar_baru {public static void main(String[] args) {
Scanner baru = new Scanner(System.in);
int n, maks=0, i=2;
System.out.print("n = ");
n=baru.nextInt();
if (n>=2){
while (n!=1){
if(n%i!=0){
i++;
}
else{
n= n/i;
maks=i;
}
}
System.out.println("Faktor prima terbesar = "+maks);
}
}}