From 86aa9fa0cb719026e0a838474643b52a08f02451 Mon Sep 17 00:00:00 2001
From: carbonxx <vishnunv142000@gmail.com>
Date: Tue, 5 Oct 2021 23:46:06 +0530
Subject: [PATCH 1/3] lol

---
 C++/{Program -1 => Program-01}/Program.cpp | 0
 C++/{Program -1 => Program-01}/README.md   | 0
 2 files changed, 0 insertions(+), 0 deletions(-)
 rename C++/{Program -1 => Program-01}/Program.cpp (100%)
 rename C++/{Program -1 => Program-01}/README.md (100%)

diff --git a/C++/Program -1/Program.cpp b/C++/Program-01/Program.cpp
similarity index 100%
rename from C++/Program -1/Program.cpp
rename to C++/Program-01/Program.cpp
diff --git a/C++/Program -1/README.md b/C++/Program-01/README.md
similarity index 100%
rename from C++/Program -1/README.md
rename to C++/Program-01/README.md

From 05fcd453aa45a65cdae60ab89c35904e9708ea50 Mon Sep 17 00:00:00 2001
From: carbonxx <vishnunv142000@gmail.com>
Date: Tue, 5 Oct 2021 23:55:05 +0530
Subject: [PATCH 2/3] :P

---
 C/program-61/program.c | 59 ------------------------------------------
 C/program-80/program.c | 58 +++++++++++++++++++++++++++++++++++++++++
 2 files changed, 58 insertions(+), 59 deletions(-)
 create mode 100644 C/program-80/program.c

diff --git a/C/program-61/program.c b/C/program-61/program.c
index 0f343960..d298b9f3 100644
--- a/C/program-61/program.c
+++ b/C/program-61/program.c
@@ -39,62 +39,3 @@ int main()
      printf("%d\n", array[c]);
   return 0;
   
-  
-/*
-  This Program calulates all the prime between the range of numbers
-  includes the numbers which is provided.
-  
-  For e.g:   2  7
-  Prime Numbers are : 2 3 5 7
-*/
-
-#include <stdio.h>
-#include <stdlib.h>
-
-char primecheck(int);
-
-int main()
-{
-    int i,num1,num2,cases;
-    char ans;
-    printf("Enter Number of Test Cases: ");
-    scanf("%d",&cases);
-    while (cases--)
-    {
-        printf("Enter First Number: ");
-        scanf("%d",&num1);
-        printf("Enter Second Number: ");
-        scanf("%d",&num2);
-
-        printf("Answer: ");
-        for(i=num1;i<=num2;i++)
-        {
-            ans = primecheck(i);
-            if (ans == 'y')
-                printf("%d ",i);
-        }
-        printf("\n");
-    }
-    return 0;
-}
-
-char primecheck(int num)
-{
-    int i;
-    if (num == 0 || num == 1)
-        return 'n';
-    else
-    {
-        for(i=(num-1);i>1;i--)
-        {
-            if(num%i == 0)
-            {
-                return 'n';
-            }
-            else
-                continue;
-        }
-        return 'y';
-    }
-
-}
\ No newline at end of file
diff --git a/C/program-80/program.c b/C/program-80/program.c
new file mode 100644
index 00000000..ca8f1a80
--- /dev/null
+++ b/C/program-80/program.c
@@ -0,0 +1,58 @@
+/*
+  This Program calulates all the prime between the range of numbers
+  includes the numbers which is provided.
+  
+  For e.g:   2  7
+  Prime Numbers are : 2 3 5 7
+*/
+
+#include <stdio.h>
+#include <stdlib.h>
+
+char primecheck(int);
+
+int main()
+{
+    int i,num1,num2,cases;
+    char ans;
+    printf("Enter Number of Test Cases: ");
+    scanf("%d",&cases);
+    while (cases--)
+    {
+        printf("Enter First Number: ");
+        scanf("%d",&num1);
+        printf("Enter Second Number: ");
+        scanf("%d",&num2);
+
+        printf("Answer: ");
+        for(i=num1;i<=num2;i++)
+        {
+            ans = primecheck(i);
+            if (ans == 'y')
+                printf("%d ",i);
+        }
+        printf("\n");
+    }
+    return 0;
+}
+
+char primecheck(int num)
+{
+    int i;
+    if (num == 0 || num == 1)
+        return 'n';
+    else
+    {
+        for(i=(num-1);i>1;i--)
+        {
+            if(num%i == 0)
+            {
+                return 'n';
+            }
+            else
+                continue;
+        }
+        return 'y';
+    }
+
+}
\ No newline at end of file

From 9db280c5c34a9b23a88fba7b7fb2243cbc11cfe7 Mon Sep 17 00:00:00 2001
From: Nithin Mahendran <nithinmahendren@gmail.com>
Date: Wed, 6 Oct 2021 00:32:56 +0530
Subject: [PATCH 3/3] Resolved

---
 Java/Program-12/Program-12.txt | 17 +++++++++++++++++
 Java/program-3/program.java    | 21 +--------------------
 2 files changed, 18 insertions(+), 20 deletions(-)
 create mode 100644 Java/Program-12/Program-12.txt

diff --git a/Java/Program-12/Program-12.txt b/Java/Program-12/Program-12.txt
new file mode 100644
index 00000000..95be6346
--- /dev/null
+++ b/Java/Program-12/Program-12.txt
@@ -0,0 +1,17 @@
+import java.io.*;
+import java.util.*;
+class Prg{
+	public static void main(String args[])
+	{
+		Scanner sc=new Scanner(System.in);
+		String s=sc.next();
+		int v=0;
+		for(int i=0;i<s.length();i++)
+		{
+			if(("AEIOUaeiou").indexOf(s.charAt(i))!=-1)//checking for vowel in shorter way
+			v++;	
+		}
+		System.out.println("Number of vowels "+v);
+		System.out.println("Number of consonants "+(s.length()-v));
+	}
+}
diff --git a/Java/program-3/program.java b/Java/program-3/program.java
index d9a3b280..5a5c9233 100644
--- a/Java/program-3/program.java
+++ b/Java/program-3/program.java
@@ -55,23 +55,4 @@ public static int[][] transposeMatrix(int[][] a) {
     return temp;
   }
 
-}
-
-
-import java.io.*;
-import java.util.*;
-class Prg{
-	public static void main(String args[])
-	{
-		Scanner sc=new Scanner(System.in);
-		String s=sc.next();
-		int v=0;
-		for(int i=0;i<s.length();i++)
-		{
-			if(("AEIOUaeiou").indexOf(s.charAt(i))!=-1)//checking for vowel in shorter way
-			v++;	
-		}
-		System.out.println("Number of vowels "+v);
-		System.out.println("Number of consonants "+(s.length()-v));
-	}
-}
+}
\ No newline at end of file