diff --git a/OTHERS/800 Codeforces Solutions/110A_Nearly_Lucky_Number.cpp b/OTHERS/800 Codeforces Solutions/110A_Nearly_Lucky_Number.cpp
new file mode 100644
index 00000000..4340e87d
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/110A_Nearly_Lucky_Number.cpp	
@@ -0,0 +1,33 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    long long n;
+    cin>>n;
+    long long count=0;
+    while(n!=0){
+        int x=n%10;
+        n/=10;
+        if(x==4 || x==7){
+            count++;
+        }
+    }
+    if(count==0) {
+        cout<<"NO"<<endl;
+        return 0;
+    }
+    bool flag=true;
+    while(count!=0){
+        int x=count%10;
+        count/=10;
+        if(x!=4 && x!=7){
+            flag=false;
+            cout<<"NO"<<endl;
+            break;
+        }
+    }
+    if(flag) cout<<"YES"<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/112A_Petya_and_Strings.cpp b/OTHERS/800 Codeforces Solutions/112A_Petya_and_Strings.cpp
new file mode 100644
index 00000000..616462cb
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/112A_Petya_and_Strings.cpp	
@@ -0,0 +1,13 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    string a,b;
+    cin>>a>>b;
+    for(auto &c: a) c=tolower(c);
+    transform(b.begin(),b.end(),b.begin(),::tolower);
+    cout<<a.compare(b)<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/116A_Tram.cpp b/OTHERS/800 Codeforces Solutions/116A_Tram.cpp
new file mode 100644
index 00000000..a30f6cbe
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/116A_Tram.cpp	
@@ -0,0 +1,22 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+    int total=0;
+    int min=0;
+    while(n--){
+        int x;
+        cin>>x;
+        total-=x;
+        cin>>x;
+        total+=x;
+        if(total>min)
+        min=total;
+    }
+    cout<<min<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/136A_Presents.cpp b/OTHERS/800 Codeforces Solutions/136A_Presents.cpp
new file mode 100644
index 00000000..dc5b35bb
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/136A_Presents.cpp	
@@ -0,0 +1,24 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+    vector<int> v;
+    for(int i=0;i<n;i++){
+        int temp;
+        cin>>temp;
+        v.push_back(temp);  
+    }
+    int a[n];
+    int num=1;
+    for(int x:v){
+        a[x-1]=num;
+        num++;
+    }
+    for(int x:a)
+    cout<<x<<" ";
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/144A_Arrival_of_the_General.cpp b/OTHERS/800 Codeforces Solutions/144A_Arrival_of_the_General.cpp
new file mode 100644
index 00000000..ffee70b0
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/144A_Arrival_of_the_General.cpp	
@@ -0,0 +1,36 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    int n;
+    cin >> n;
+    int maxindex=0;
+    int minindex=0;
+    int maxvalue=INT_MIN;
+    int minvalue=INT_MAX;
+    for (int i = 0; i < n; i++)
+    {
+        int temp;
+        cin >> temp;
+        if(temp>maxvalue){
+            maxindex=i;
+            maxvalue=temp;
+        }
+        if(temp<=minvalue){
+            minindex=i;
+            minvalue=temp;
+        }
+    }
+
+    int ans=(maxindex)+(n-minindex-1);
+    if(minindex<maxindex){
+        cout<<ans-1<<endl;;
+    }else{
+        cout<<ans<<endl;
+    }
+    
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/148A_Insomnia_Cure.cpp b/OTHERS/800 Codeforces Solutions/148A_Insomnia_Cure.cpp
new file mode 100644
index 00000000..a7e3b37e
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/148A_Insomnia_Cure.cpp	
@@ -0,0 +1,20 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int a[4],d;
+    cin>>a[0]>>a[1]>>a[2]>>a[3]>>d;
+    int j;
+    set<int> s;
+    for(int i=0;i<4;i++){
+        j=1;
+        while(a[i]*j<=d){
+            if(a[i]*j<=d) s.insert(a[i]*j);
+            j++;
+        }
+    }
+    cout<<s.size()<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/158A_Next_Round.cpp b/OTHERS/800 Codeforces Solutions/158A_Next_Round.cpp
new file mode 100644
index 00000000..c81b1f67
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/158A_Next_Round.cpp	
@@ -0,0 +1,22 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n,k;
+    cin>>n>>k;
+    vector<int> a;
+    for(int i=0;i<n;i++){
+        int temp;
+        cin>>temp;
+        a.push_back(temp);
+    }
+    int c=a[k-1];
+    int count=0;
+    for(int x:a){
+        if(x>=c && x>0) count++;
+    }
+    cout<<count<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/1624A_Plus_One_On_The_Subset.cpp b/OTHERS/800 Codeforces Solutions/1624A_Plus_One_On_The_Subset.cpp
new file mode 100644
index 00000000..8f6ba2bf
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/1624A_Plus_One_On_The_Subset.cpp	
@@ -0,0 +1,60 @@
+// code by Susritha
+// cf handle:Susritha.S
+
+#include <bits/stdc++.h>
+#define ll long long int
+#define pb push_back
+#define mp make_pair
+using namespace std;
+int main(){
+ll t;
+cin>>t;
+while(t--){
+  ll n;
+  cin>>n;
+  ll a[n],i,j;
+  ll sus=0;
+  for(i=0;i<n;i++){
+      cin>>a[i];
+  }
+  for(i=0;i<n;i++){
+      while(a[i]>n){
+          a[i]/=2;
+      }
+  }
+  sort(a,a+n);
+  map<ll,ll>m;
+  for(i=0;i<n;i++){
+ if(m[a[i]]==0){
+     m[a[i]]++;
+ }
+ else{
+     while(a[i]>0){
+         if(m[a[i]]==0){
+         m[a[i]]++;
+         break;}
+         else{
+             a[i]/=2;
+         }
+         
+     }
+     if(a[i]==0){
+         sus=1;
+         break;
+     }
+ }
+  }
+  for(auto it=m.begin();it!=m.end();it++){
+      if(it->second==0){
+          sus=1;
+          break;
+      }
+  }
+  if(sus==0){
+      cout<<"YES"<<endl;
+  }
+  else{
+      cout<<"NO"<<endl;
+  }
+}
+}
diff --git a/OTHERS/800 Codeforces Solutions/200B_Drinks.cpp b/OTHERS/800 Codeforces Solutions/200B_Drinks.cpp
new file mode 100644
index 00000000..b013fd73
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/200B_Drinks.cpp	
@@ -0,0 +1,18 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+    double a[n];
+    double ans=0;
+    for(int i=0;i<n;i++){
+        cin>>a[i];
+        ans+=a[i];
+    }
+    cout<<ans/n<<endl;
+    
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/228A_Is_your_horseshoe_on_the_other_hoof.cpp b/OTHERS/800 Codeforces Solutions/228A_Is_your_horseshoe_on_the_other_hoof.cpp
new file mode 100644
index 00000000..690805f7
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/228A_Is_your_horseshoe_on_the_other_hoof.cpp	
@@ -0,0 +1,18 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    set<long long> s;
+    int temp;
+    int t = 4;
+    while (t--)
+    {
+        cin >> temp;
+        s.insert(temp);
+    }
+    cout<<4-s.size()<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/231A_Team.cpp b/OTHERS/800 Codeforces Solutions/231A_Team.cpp
new file mode 100644
index 00000000..2620feb9
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/231A_Team.cpp	
@@ -0,0 +1,17 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+    int count=0;
+    while(n--){
+        int x,y,z;
+        cin>>x>>y>>z;
+        if((x+y+z)>=2) count++;
+    }
+    cout<<count<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/236A_Boy_or_Girl.cpp b/OTHERS/800 Codeforces Solutions/236A_Boy_or_Girl.cpp
new file mode 100644
index 00000000..01089205
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/236A_Boy_or_Girl.cpp	
@@ -0,0 +1,14 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    string s;
+    cin>>s;
+    set<char> a;
+    for(char x:s) a.insert(x);
+    if(a.size()%2==0) cout<<"CHAT WITH HER!"<<endl;
+    else cout<<"IGNORE HIM!"<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/262A_Roma_LuckyNumbers.cpp b/OTHERS/800 Codeforces Solutions/262A_Roma_LuckyNumbers.cpp
new file mode 100644
index 00000000..24eee5c4
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/262A_Roma_LuckyNumbers.cpp	
@@ -0,0 +1,36 @@
+// Problem: A. Roma and Lucky Numbers
+// Contest: Codeforces - Codeforces Round #160 (Div. 2)
+// URL: https://codeforces.com/contest/262/problem/A
+// Memory Limit: 256 MB
+// Time Limit: 1000 ms
+// 
+// Powered by CP Editor (https://cpeditor.org)
+
+#include<bits/stdc++.h>
+using namespace std;
+#define ll long long
+#define FAST1 ios_base::sync_with_stdio(false);
+#define FAST2 cin.tie(NULL);
+int n, k, ans, num;
+	string s;
+int main(){
+    FAST1;
+    FAST2;
+    
+	cin >> n >> k;
+	for (int i = 0; i < n; i++){
+		cin >> s;
+		for (int j = 0; j < s.size(); j++){
+			if (s[j] == '7' || s[j] == '4'){
+				num ++;
+			}
+		}
+		if (num <= k){
+			ans++;
+		}
+		num = 0;
+	}
+	cout << ans << endl;
+	return 0;
+
+}
diff --git a/OTHERS/800 Codeforces Solutions/262B_Roma_and_Changing_Signs.cpp b/OTHERS/800 Codeforces Solutions/262B_Roma_and_Changing_Signs.cpp
new file mode 100644
index 00000000..f51585ae
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/262B_Roma_and_Changing_Signs.cpp	
@@ -0,0 +1,39 @@
+// Problem: B. Roma and Changing Signs
+// Contest: Codeforces - Codeforces Round #160 (Div. 2)
+// URL: https://codeforces.com/contest/262/problem/B
+// Memory Limit: 256 MB
+// Time Limit: 2000 ms
+// 
+// Powered by CP Editor (https://cpeditor.org)
+
+#include<bits/stdc++.h>
+using namespace std;
+#define ll long long
+#define FAST1 ios_base::sync_with_stdio(false);
+#define FAST2 cin.tie(NULL);
+
+
+int main(){
+    FAST1;
+    FAST2;
+    int n;int k;
+    cin>>n>>k;
+    int arr[n];
+    for(int i=0;i<n;i++)
+    	cin>>arr[i];
+    
+    int mn =INT_MAX;
+    int sm=0; 
+    for(int i=0;i<n;i++)
+    {
+    	mn = min(abs(arr[i]),mn);
+    	if(arr[i]<0 && k>0)
+    		arr[i] *= -1,k--;
+    	sm+=arr[i];	
+    }
+    if(k>0 && k%2==1)
+    	sm -= 2 * mn;
+    	
+    cout<<sm;
+    return 0;
+}
diff --git a/OTHERS/800 Codeforces Solutions/263A_Beautiful_Matrix.cpp b/OTHERS/800 Codeforces Solutions/263A_Beautiful_Matrix.cpp
new file mode 100644
index 00000000..8c9b8a1f
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/263A_Beautiful_Matrix.cpp	
@@ -0,0 +1,20 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int a[6][6];
+    int n,x,y;
+    for(int i=1;i<=5;i++){
+        for(int j=1;j<=5;j++){
+            cin>>n;
+            if(n){
+                x=i;
+                y=j;
+            }
+        }
+    }
+    cout<<(abs(3-x)+abs(3-y))<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/266A_Stones_on_the_Table.cpp b/OTHERS/800 Codeforces Solutions/266A_Stones_on_the_Table.cpp
new file mode 100644
index 00000000..6efe97d3
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/266A_Stones_on_the_Table.cpp	
@@ -0,0 +1,21 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+    string s;
+    cin>>s;
+    if(!n){ cout<<0<<endl;return 0;}
+
+    int count=0;
+    for(int i=0;i<n-1;i++){
+        if(s[i]==s[i+1])
+        count++;
+
+    }
+    cout<<count<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/266B_Queue_at_the_School.cpp b/OTHERS/800 Codeforces Solutions/266B_Queue_at_the_School.cpp
new file mode 100644
index 00000000..3f4f6036
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/266B_Queue_at_the_School.cpp	
@@ -0,0 +1,20 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include<bits/stdc++.h>
+using namespace std;
+
+int main() {
+    int n,t;
+    cin>>n>>t;
+    string a;
+    cin>>a;
+    while(t--){
+        for(int i=0;i<n-1;i++)
+        if(a[i]=='B' && a[i+1]=='G') {
+            swap(a[i],a[i+1]);
+            i++;
+        }
+    }
+    cout<<a<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/268A_Games.cpp b/OTHERS/800 Codeforces Solutions/268A_Games.cpp
new file mode 100644
index 00000000..73f74e2e
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/268A_Games.cpp	
@@ -0,0 +1,30 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    int n;
+    cin >> n;
+    vector<pair<int, int>> v;
+    for (int i = 0; i < n; i++)
+    {
+        int a, b;
+        cin >> a >> b;
+        v.push_back({a, b});
+    }
+    int ans = 0;
+    for (int i = 0; i < n; i++)
+    {
+        for (int j = 0; j < n; j++)
+        {
+            if (i != j && v[i].first == v[j].second)
+            ans++;
+        }
+    }
+    cout << ans << endl;
+    return 0;
+}
+
+//O(n+m) solution is also possible
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/271A_Beautiful_Year.cpp b/OTHERS/800 Codeforces Solutions/271A_Beautiful_Year.cpp
new file mode 100644
index 00000000..f8ea8ba7
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/271A_Beautiful_Year.cpp	
@@ -0,0 +1,35 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include <bits/stdc++.h>
+using namespace std;
+
+bool areDistinct(int n)
+{
+    map<int, int> dis;
+    int digit;
+    while (n)
+    {
+        digit = n % 10;
+        if (dis[digit])
+        {
+            return false;
+        }
+        dis[digit] = 1;
+        n /= 10;
+    }
+    return true;
+}
+int main()
+{
+    int n;
+    cin >> n;
+    while (++n)
+    {
+        if (areDistinct(n))
+        {
+            cout << n << endl;
+            break;
+        }
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/281A_Word_Capitalization.cpp b/OTHERS/800 Codeforces Solutions/281A_Word_Capitalization.cpp
new file mode 100644
index 00000000..bb5d0e6d
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/281A_Word_Capitalization.cpp	
@@ -0,0 +1,12 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    string s;
+    cin>>s;
+    s[0]=toupper(s[0]);
+    cout<<s<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/41A_Translation.cpp b/OTHERS/800 Codeforces Solutions/41A_Translation.cpp
new file mode 100644
index 00000000..b0286be1
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/41A_Translation.cpp	
@@ -0,0 +1,15 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    string a,b;
+    cin>>a>>b;
+    for(int i=0;i<a.length()/2;i++){
+        swap(a[i],a[a.length()-1-i]);
+    }
+    if(a==b) cout<<"YES"<<endl;
+    else cout<<"NO"<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/4A_Watermelon.cpp b/OTHERS/800 Codeforces Solutions/4A_Watermelon.cpp
new file mode 100644
index 00000000..98a9c28b
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/4A_Watermelon.cpp	
@@ -0,0 +1,12 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int w;
+    cin>>w;
+    if(w%2==0 && w>2) cout<<"YES"<<endl;
+    else cout<<"NO"<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/50A_Domino_Piling.cpp b/OTHERS/800 Codeforces Solutions/50A_Domino_Piling.cpp
new file mode 100644
index 00000000..51809729
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/50A_Domino_Piling.cpp	
@@ -0,0 +1,11 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int m,n;
+    cin>>m>>n;
+    cout<<(n*m)/2<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/59A_Word.cpp b/OTHERS/800 Codeforces Solutions/59A_Word.cpp
new file mode 100644
index 00000000..93214286
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/59A_Word.cpp	
@@ -0,0 +1,19 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    string s;
+    cin>>s;
+    int u=0,l=0;
+    for(auto x:s){
+        if(isupper(x)) u++;
+        else l++;
+    }
+    if(u>l){
+        transform(s.begin(),s.end(),s.begin(),::toupper);
+    }else transform(s.begin(),s.end(),s.begin(),::tolower);
+    cout<<s<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/61A_Ultra_Fast_Mathematician.cpp b/OTHERS/800 Codeforces Solutions/61A_Ultra_Fast_Mathematician.cpp
new file mode 100644
index 00000000..e916d97d
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/61A_Ultra_Fast_Mathematician.cpp	
@@ -0,0 +1,20 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    string a, b;
+    cin >> a >> b;
+    string v = "";
+    for (int i = 0; i < a.length(); i++)
+    {
+        if (a[i] == b[i])
+            v += "0";
+        else
+            v += "1";
+    }
+    cout << v << endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/71A_Way_Too_Long_Words.cpp b/OTHERS/800 Codeforces Solutions/71A_Way_Too_Long_Words.cpp
new file mode 100644
index 00000000..176cf90d
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/71A_Way_Too_Long_Words.cpp	
@@ -0,0 +1,21 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform else nknagrale
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+    while(n--){
+        string s;
+        cin>>s;
+        if(s.length()>10){
+            string ans;
+            ans.push_back(s.front());
+            ans+=to_string(s.length()-2);
+            ans+=s.back();
+            cout<<ans<<endl;
+        }else cout<<s<<endl;
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/749A_Bachgold_Problem.cpp b/OTHERS/800 Codeforces Solutions/749A_Bachgold_Problem.cpp
new file mode 100644
index 00000000..2d985b7e
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/749A_Bachgold_Problem.cpp	
@@ -0,0 +1,16 @@
+//code by Nikhil Nagrale
+//nikhilnagrale2 on EveryPlatform
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+    cout<<n/2<<endl;
+    while(n>3){
+        cout<<2<<" ";
+        n-=2;
+    }
+    cout<<n<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/OTHERS/800 Codeforces Solutions/README.md b/OTHERS/800 Codeforces Solutions/README.md
new file mode 100644
index 00000000..d0a0ebe8
--- /dev/null
+++ b/OTHERS/800 Codeforces Solutions/README.md	
@@ -0,0 +1 @@
+# Python Code Answer for Learning in `https://codeforces.com/`