diff --git a/Prob1.java b/Prob1.java new file mode 100644 index 0000000..e4623c8 --- /dev/null +++ b/Prob1.java @@ -0,0 +1,20 @@ +/** + * + */ +package lab1; +//import java.util.*; +/** + * @author User + * + */ +public class Prob1 { + + /** + * @param args + */ + public static void main(String[] args) { + System.out.println("Test Java"); + + } + +} diff --git a/Prob2.java b/Prob2.java new file mode 100644 index 0000000..2dc6e10 --- /dev/null +++ b/Prob2.java @@ -0,0 +1,19 @@ +package lab1; + +import java.util.*; + +public class Prob2 { + + public static void print (String kek) + { + System.out.println(kek); + } + + public static void main(String[] args) { + Scanner scan = new Scanner (System.in); + String meh = scan.nextLine(); + print(meh); + scan.close(); + } + +} diff --git a/Prob3.java b/Prob3.java new file mode 100644 index 0000000..779d6b7 --- /dev/null +++ b/Prob3.java @@ -0,0 +1,21 @@ +package lab1; +import java.util.*; + +class One { + public static void print (String kek) + { + System.out.println(kek); + } +} + +public class Prob3 { + + public static void main(String[] args) { + // TODO Auto-generated method stub + Scanner scan = new Scanner (System.in); + String kek = scan.nextLine(); + One.print(kek); + scan.close(); + } + +} diff --git a/Prob31.java b/Prob31.java new file mode 100644 index 0000000..c9f218e --- /dev/null +++ b/Prob31.java @@ -0,0 +1,21 @@ +package lab1; + +import java.util.Scanner; + +public class Prob31 { + + public static void print (String kek) + { + System.out.println(kek); + } + + public static void main(String[] args) { + // TODO Auto-generated method stub + Scanner scan = new Scanner(System.in); + String kek = scan.nextLine(); + print(kek); + scan.close(); + + } + +} diff --git a/Prob32.java b/Prob32.java new file mode 100644 index 0000000..f4e0ba9 --- /dev/null +++ b/Prob32.java @@ -0,0 +1,15 @@ +package lab1; + +import java.util.Scanner; + +public class Prob32 { + + public static void main(String[] args) { + // TODO Auto-generated method stub + Scanner scan = new Scanner(System.in); + String meh = scan.nextLine(); + Prob31.print(meh); + scan.close(); + } + +} diff --git a/Prob4.java b/Prob4.java new file mode 100644 index 0000000..d6eacb1 --- /dev/null +++ b/Prob4.java @@ -0,0 +1,14 @@ +package lab1; + +public class Prob4 { + + public static void main(String[] args) { + // TODO Auto-generated method stub + int count = args.length; + for (int i = 0; i < count; ++i) + { + System.out.println(args[i]); + } + } + +} diff --git a/Prob5.java b/Prob5.java new file mode 100644 index 0000000..b60d95c --- /dev/null +++ b/Prob5.java @@ -0,0 +1,28 @@ +package lab1; + +public class Prob5 { + + public static int power1 (int n, int k) + { + int p = 1; + for (int i = 1; i <= n; ++i) + p *= k; + return p; + } + + public static int power2 (int n, int k) + { + if (n == 0) + return 1; + else + return (k * power2(n - 1, k)); + } + + public static void main(String[] args) { + // TODO Auto-generated method stub + System.out.println(power1(3, 9)); + System.out.println(power2(3, 9)); + System.out.println(Math.pow(9, 3)); + } + +} diff --git a/Prob6.java b/Prob6.java new file mode 100644 index 0000000..9d2ac68 --- /dev/null +++ b/Prob6.java @@ -0,0 +1,32 @@ +package lab1; + +public class Prob6 { + + public static boolean check (int n) + { + int count = 0; + if (n == 1 || n == 0) + return false; + for (int i = 2; i <= n; ++i) + { + if (n % i == 0) + count++; + } + if (count == 1) + return true; + else + return false; + } + + public static void main(String[] args) { + // TODO Auto-generated method stub + for (int i = 0; i < 20; i++) + { + if (check(i)) + System.out.println("Prime " + i); + else + System.out.println("Not prime " + i); + } + } + +} diff --git a/Prob7.java b/Prob7.java new file mode 100644 index 0000000..1f92418 --- /dev/null +++ b/Prob7.java @@ -0,0 +1,44 @@ +package lab1; + +import java.util.Scanner; + +public class Prob7 { + + public static boolean check (int n) + { + int count = 0; + if (n == 1 || n == 0) + return false; + for (int i = 2; i <= n; ++i) + { + if (n % i == 0) + count++; + } + if (count == 1) + return true; + else + return false; + } + + public static void main(String[] args) { + Scanner scan = new Scanner(System.in); + int n = scan.nextInt(); + int k = 2 * n; + for (int i = 0; i < k; i += 2) + { + if (i == 0 || i == 2) + System.out.println("Nope: " + i); + else + { + for (int j = 2; j <= i; j++) + { + if (check(j) && (check(i - j))) + System.out.println(i + " = " + j + " + " + (i - j)); + } + } + } + scan.close(); + + } + +} diff --git a/Prob8.java b/Prob8.java new file mode 100644 index 0000000..fd9194e --- /dev/null +++ b/Prob8.java @@ -0,0 +1,32 @@ +package lab1; + +import java.util.*; + +public class Prob8 { + + public static void main(String[] args) { + // TODO Auto-generated method stub + double[] array = new double[10]; + for (int i = 0; i < 10; ++i) + { + array[i] = 10 * Math.random(); + } + System.out.printf("Unsorted\n"); + for (int i = 0; i < 10; ++i) + { + System.out.println(array[i]); + } + Arrays.sort(array); + System.out.printf("Sorted\n"); + for (int i = 0; i < 10; ++i) + { + System.out.println(array[i]); + } + System.out.printf("Binary search:\n"); + for (int i = 0; i < 10; ++i) + { + System.out.println(Arrays.binarySearch(array, array[i])); + } + } + +}