diff --git a/Magic_number.java b/Magic_number.java
index 327d123..002b6cb 100644
--- a/Magic_number.java
+++ b/Magic_number.java
@@ -2,12 +2,11 @@
 //seperatly 1+2+3+4 =10 again adding the result 1+0= 1 if single digit //
 //number is 1 then given number is magic number else not//
 
-import  java.io.;
+import  java.io.*;
 class Magic_number
 {
-	public static void main(String ar[])
+	public static void main(String ar[]) throws IOException
 {
-
 	BufferedReader br = new BufferedReader (new InputStreamReader(System.in));
 	int n,v,t,d=0,s;
 	System.out.println("Enter the number");
diff --git a/ReverseKrushkal.java b/ReverseKrushkal.java
index f8cfc69..f9358ae 100644
--- a/ReverseKrushkal.java
+++ b/ReverseKrushkal.java
@@ -15,7 +15,7 @@ void addEdge(int v,int w)
 		adj[w].add(v);
 	}
 	void removeEdge(int v,int w){
-		
+
 		for(int i=0;i<adj[v].size();i++){
 		int t=adj[v].get(i);
 		if(t==w){
@@ -28,10 +28,8 @@ void removeEdge(int v,int w){
 			if(t==v){
 				adj[w].remove(i);
 			}
-			}
-		
+			}		
 	}
-
 	boolean BFS(int s,int d)
 	{
 		boolean visited[] = new boolean[V];
@@ -82,7 +80,6 @@ public int compareTo(Edge compareEdge) {
 		for (int i=0; i<v; ++i)
 			adj[i] = new LinkedList<Integer>();
 	}
-	
 	void ReverseKruskal(){
 		
 		Edge result[]=new Edge[V];
@@ -117,9 +114,7 @@ public class ReverseKrushkal {
 		public static void main(String[] args) {
 			int V=6;
 			int E=8;
-			
-			
-			
+					
 			Graph graph=new Graph(V,E);
 			
 			graph.edge[0].src=0;