Resolved

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';
-    }
-
-}

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';
+    }
+
+}

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));
+	}
+}

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));
-	}
-}
+}