add perni

.vscode/settings.json

@@ -4,7 +4,9 @@
         "if-else",
         "for_loop",
         "Class12Project",
-        "Inheritance"
+        "Inheritance",
+        "FinalRevision",
+        ""
     ],
     "java.project.outputPath": "bin",
     "java.project.referencedLibraries": [

FinalRevision/Colors.java

@@ -0,0 +1,12 @@
+public class Colors {
+    public static final String RESET = "\u001B[0m";
+
+    public static final String RED = "\u001B[31m";
+    public static final String GREEN = "\u001B[32m";
+    public static final String YELLOW = "\u001B[33m";
+    public static final String BLUE = "\u001B[34m";
+    public static final String PURPLE = "\u001B[35m";
+    public static final String CYAN = "\u001B[36m";
+
+    public static final String BOLD = "\u001B[1m";
+}

FinalRevision/Colsum2.java

@@ -0,0 +1,88 @@
+
+import java.util.Scanner;
+
+public class Colsum2 {
+
+    int mat[][], m, n;
+
+    public Colsum2(int mm, int nn) {
+        m = mm;
+        n = nn;
+
+    }
+
+    void readArray()
+    {
+        mat = new int[m][n];
+        Scanner x = new Scanner(System.in);
+        System.out.println("Enter array elements for MATRIX "+((int)(100*Math.random())));
+        for(int i=0; i<m; i++)
+        {
+            for(int j=0;j<n;j++)
+            {
+                mat[i][j] = x.nextInt();
+            }
+        }
+
+        x.close();
+    }
+
+    boolean check (Colsum2 A, Colsum2 B)
+    {
+        int sum1 = 0;
+        int sum2 = 0;
+        for(int i=0; i<n; i++)
+        {
+            sum1=0;
+            sum2=0;
+
+            for(int j=0; j<m; j++)
+            {
+                sum1 += A.mat[j][i];
+                sum2 += B.mat[j][i];
+            }
+
+            if (sum1==sum2) continue;
+            else return false;
+        }
+
+
+        return true;
+    }
+
+    void print()
+    {
+        // FIRST
+        System.out.println("---------- MATRIX "+(int)(100*Math.random())+"----------");
+        for(int i=0;i<m;i++)
+        {
+            for(int j=0;j<m;j++)
+            {
+                System.out.print(mat[i][j] + "  ");
+            }
+            System.out.println();
+        }
+    }
+
+
+    public static void main(String[] args) {
+        Scanner x = new Scanner(System.in);
+        System.out.println("Enter the rows and column for ");
+        int in=x.nextInt();
+        int im=x.nextInt();
+
+        Colsum2 C1 = new Colsum2(in, im);
+        Colsum2 C2 = new Colsum2(in, im);
+
+        C1.readArray();
+        C2.readArray();
+
+        System.out.println("========================Array print========================");
+        C1.print();
+        C2.print();
+
+        C1.check(C1,C2);
+
+        x.close();
+    }
+}

FinalRevision/Flipgram.java

@@ -0,0 +1,55 @@
+import java.util.Scanner;
+
+public class Flipgram {
+    String word;
+
+    public Flipgram(String s) {
+        word = s;
+    }
+
+    boolean isHetero()
+    {
+        String lwrCase = word.toLowerCase();
+        for(int i=0;i<lwrCase.length(); i++)
+        {
+            char currentChar = lwrCase.charAt(i);
+            if(lwrCase.indexOf(currentChar, i+1)!=-1) return false;
+        }
+        return true;
+    }
+
+    String flip()
+    {
+        int len = word.length();
+        int mid = len/2;
+        char midl = word.charAt(mid);
+        String flipa;
+
+        if(len%2==0)
+            flipa = word.substring(mid)+word.substring(0,mid);
+        else
+             flipa = word.substring(mid+1)+midl+word.substring(0,mid);
+        return flipa;
+    }
+
+    void display()
+    {
+        if(!isHetero())
+        {
+            System.out.println(flip().toUpperCase());
+        }
+        else{
+            System.out.println("HETEROGRAM");
+        }
+    }
+
+    public static void main(String[] args) {
+        Scanner x = new Scanner(System.in);
+        String sc = x.next();
+
+        Flipgram obj = new Flipgram(sc);
+        obj.display();
+        x.close();
+    }
+
+}

FinalRevision/MatRev.java

@@ -0,0 +1,22 @@
+import java.util.Scanner;
+
+public class MatRev {
+    int arr[][], m, n;
+
+    MatRev(int mm, int nn)
+    {
+        m = mm;
+        n = nn;
+    }
+
+    void fillarray()
+    {
+        Scanner x = new Scanner(System.in);
+        for (int i = 0; i < m; i++) {
+            for (int j = 0; j < n; j++) {
+                System.out.println("Enter the array element "+i+","+j+": ");
+                arr[i][j] = x.nextInt();
+            }
+        }
+    }
+}

FinalRevision/Perni2.java

@@ -0,0 +1,46 @@
+import java.util.Scanner;
+
+class Perni2 {
+
+    public static void main(String[] args) {
+        Scanner x = new Scanner(System.in);
+        int in_in = x.nextInt();
+        x.close();
+        int in = in_in;
+        int inin = in_in;
+        int s = 0;
+        boolean p = false;
+        int len = 0;
+        while (in != 0) {
+            int d = in % 10;
+            s += d;
+            in /= 10;
+        }
+        for (int i = 1; i <= (int) Math.sqrt(s); i++) {
+            if (s % i == 0) {
+                System.out.println();
+                len++;
+            }
+
+        }
+        if (len>1) System.out.println("not prime");
+        else 
+        {
+            System.out.println("prime");
+            p = true;
+        }
+        len=0;
+        if (p) {
+            while (inin != 0) {
+                int d = inin % 10;
+                len++;
+                inin/=10;
+                if (d != 0 && d != 1) System.exit(0);
+            }
+            if (len < 2) System.exit(0);
+            System.out.println("YEAHHHHH!");
+        } else {
+            System.out.println("NAWWWWWH!");
+        }
+    }
+}

FinalRevision/Rearrage.java

@@ -0,0 +1,37 @@
+import java.util.Scanner;
+
+class Rearrange
+{
+    String wrd, newwrd;
+
+
+    Rearrange()
+    {
+        wrd="";
+        newwrd=""; 
+    }
+
+
+    void readword()
+    {
+        Scanner x = new Scanner(System.in);
+        System.out.println("Enter a word");
+        wrd = x.next();
+        wrd = wrd.toUpperCase();
+
+    }
+
+    void freq_vow()
+    {
+        int f1=0;
+        int f2=0;
+        for(int i=0; i<wrd.length(); i++)
+        {
+            if ("aeiou".indexOf(wrd.charAt(i)) == -1)
+                f1+=1;
+            else
+                f2+=1;
+        }
+    }
+
+}