find pair whose sum is equal to target sum

Author: keshavsingh4522

Codevita/2020/Zone 1/Maximum Prize.py

@@ -11,7 +11,9 @@
 
 o All your opponents are standing inone line next to each other i.e. the order of opponents is fixed
 
-o Your first task is to choose a suitable opponent from this lineoWhen you choose one opponent from that line, he steps out of the line and fights you.
+o Your first task is to choose a suitable opponent from this line
+
+o When you choose one opponent from that line, he steps out of the line and fights you.
 
 o After you beat him, you get to decide how your prize money for winning against him will be calculated
 

Codevita/2020/Zone 2/Path Through Graph.cpp

@@ -95,7 +95,7 @@ Since there are 2 edges in this graph, output will be 2.
 
 #include <bits/stdc++.h>
 using namespace std;
-                     
+
 #define int             long long
 #define endl            '\n'
 
@@ -109,20 +109,20 @@ int get(int x)
 }
 
 void sol()
-{   
+{
     int x,y;
     cin>>x>>y;
     if(x<y)swap(x,y);
     if(x==y){cout<<0;return;}
     map<int,int> m;
-    
+
     int c=0;
     while(x!=1)
     {
         c++;
         x=get(x);
         m[x]=c;
-    } 
+    }
     c=0;
     while(!m.count(y))
     {
@@ -132,8 +132,8 @@ void sol()
     cout<<c+m[y];
 }
 int32_t main()
-{   
+{
 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
     sol();
     return 0;
-}   
+}

DP/Hashing/find pair whose sum is equal to target sum.py

@@ -1,6 +1,5 @@
-'''
-find pair whose sum is equal to target sum
-'''
+''' find pair whose sum is equal to target sum '''
+
 from collections import defaultdict
 n=int(input())
 a=defaultdict(list)