diff --git a/Codeforces/codeforces.cpp/.vs/ProjectSettings.json b/Codeforces/codeforces.cpp/.vs/ProjectSettings.json
new file mode 100644
index 0000000..b11371a
--- /dev/null
+++ b/Codeforces/codeforces.cpp/.vs/ProjectSettings.json
@@ -0,0 +1,3 @@
+{
+  "CurrentProjectSetting": "No Configurations"
+}
\ No newline at end of file
diff --git a/Codeforces/codeforces.cpp/.vs/VSWorkspaceState.json b/Codeforces/codeforces.cpp/.vs/VSWorkspaceState.json
new file mode 100644
index 0000000..9568b22
--- /dev/null
+++ b/Codeforces/codeforces.cpp/.vs/VSWorkspaceState.json
@@ -0,0 +1,6 @@
+{
+  "ExpandedNodes": [
+    ""
+  ],
+  "PreviewInSolutionExplorer": false
+}
\ No newline at end of file
diff --git a/Codeforces/codeforces.cpp/.vs/codeforces.cpp/v17/.suo b/Codeforces/codeforces.cpp/.vs/codeforces.cpp/v17/.suo
new file mode 100644
index 0000000..99819cf
Binary files /dev/null and b/Codeforces/codeforces.cpp/.vs/codeforces.cpp/v17/.suo differ
diff --git a/Codeforces/codeforces.cpp/.vs/codeforces.cpp/v17/Browse.VC.db b/Codeforces/codeforces.cpp/.vs/codeforces.cpp/v17/Browse.VC.db
new file mode 100644
index 0000000..ca268a3
Binary files /dev/null and b/Codeforces/codeforces.cpp/.vs/codeforces.cpp/v17/Browse.VC.db differ
diff --git a/Codeforces/codeforces.cpp/.vs/slnx.sqlite b/Codeforces/codeforces.cpp/.vs/slnx.sqlite
new file mode 100644
index 0000000..80c8881
Binary files /dev/null and b/Codeforces/codeforces.cpp/.vs/slnx.sqlite differ
diff --git a/Codeforces/codeforces.cpp/1.cpp b/Codeforces/codeforces.cpp/1.cpp
new file mode 100644
index 0000000..c6270fc
--- /dev/null
+++ b/Codeforces/codeforces.cpp/1.cpp
@@ -0,0 +1,21 @@
+
+#inciude<iostream>
+using namespace std;
+int main() {
+	int rating;
+	cin >> rating
+		if (rating <= 1399) {
+			cout << 'Division 4'
+		}
+	    elseif(1400 <= rating <= 1599) {
+		cout << 'Division 3'
+	    }
+	    elseif(1600 <= rating <= 1899) {
+		cout << 'Division 4'
+	    }
+		else(1900 <= rating) {
+			cout << 'Division 1'
+		}
+	return 0;
+}
+		
\ No newline at end of file
diff --git a/Codeforces/codeforces.cpp/2code.cpp/.vs/2code.cpp/v17/.suo b/Codeforces/codeforces.cpp/2code.cpp/.vs/2code.cpp/v17/.suo
new file mode 100644
index 0000000..58f917d
Binary files /dev/null and b/Codeforces/codeforces.cpp/2code.cpp/.vs/2code.cpp/v17/.suo differ
diff --git a/Codeforces/codeforces.cpp/2code.cpp/.vs/2code.cpp/v17/Browse.VC.db b/Codeforces/codeforces.cpp/2code.cpp/.vs/2code.cpp/v17/Browse.VC.db
new file mode 100644
index 0000000..ddfd36c
Binary files /dev/null and b/Codeforces/codeforces.cpp/2code.cpp/.vs/2code.cpp/v17/Browse.VC.db differ
diff --git a/Codeforces/codeforces.cpp/2code.cpp/.vs/ProjectSettings.json b/Codeforces/codeforces.cpp/2code.cpp/.vs/ProjectSettings.json
new file mode 100644
index 0000000..b11371a
--- /dev/null
+++ b/Codeforces/codeforces.cpp/2code.cpp/.vs/ProjectSettings.json
@@ -0,0 +1,3 @@
+{
+  "CurrentProjectSetting": "No Configurations"
+}
\ No newline at end of file
diff --git a/Codeforces/codeforces.cpp/2code.cpp/.vs/VSWorkspaceState.json b/Codeforces/codeforces.cpp/2code.cpp/.vs/VSWorkspaceState.json
new file mode 100644
index 0000000..8776c97
--- /dev/null
+++ b/Codeforces/codeforces.cpp/2code.cpp/.vs/VSWorkspaceState.json
@@ -0,0 +1,7 @@
+{
+  "ExpandedNodes": [
+    ""
+  ],
+  "SelectedNode": "\\Source1.cpp",
+  "PreviewInSolutionExplorer": false
+}
\ No newline at end of file
diff --git a/Codeforces/codeforces.cpp/2code.cpp/.vs/slnx.sqlite b/Codeforces/codeforces.cpp/2code.cpp/.vs/slnx.sqlite
new file mode 100644
index 0000000..13687d8
Binary files /dev/null and b/Codeforces/codeforces.cpp/2code.cpp/.vs/slnx.sqlite differ
diff --git a/Codeforces/codeforces.cpp/2code.cpp/Source1.cpp b/Codeforces/codeforces.cpp/2code.cpp/Source1.cpp
new file mode 100644
index 0000000..5628ab8
--- /dev/null
+++ b/Codeforces/codeforces.cpp/2code.cpp/Source1.cpp
@@ -0,0 +1,19 @@
+#inciude<iostream>
+using namespace std;
+int main() {
+	int rating;
+	cin >> rating
+		if (rating <= 1399) {
+			cout << 'Division 4'
+		}
+	elseif(1400 <= rating <= 1599) {
+		cout << 'Division 3'
+	}
+	elseif(1600 <= rating <= 1899) {
+		cout << 'Division 4'
+	}
+		else(1900 <= rating) {
+			cout << 'Division 1'
+		}
+	return 0;
+}
diff --git a/Codeforces/codeforces.cpp/68.c b/Codeforces/codeforces.cpp/68.c
new file mode 100644
index 0000000..d3f5a12
--- /dev/null
+++ b/Codeforces/codeforces.cpp/68.c
@@ -0,0 +1 @@
+
diff --git a/Codeforces/codeforces.cpp/A. Array Coloring.c b/Codeforces/codeforces.cpp/A. Array Coloring.c
new file mode 100644
index 0000000..9b14fee
--- /dev/null
+++ b/Codeforces/codeforces.cpp/A. Array Coloring.c	
@@ -0,0 +1,20 @@
+#include<stdio.h>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;
+        int arr[n];
+        int sum=0;
+        for(i:arr){
+            cin>>arr[i];
+        }
+        for(int i=0; i<n; i++){
+            sum+=arr[i];
+        }
+        if(sum%2==0) return Yes;
+        else{return No;}
+    }
+}
diff --git a/Codeforces/codeforces.cpp/A. Cipher Shifer.cpp b/Codeforces/codeforces.cpp/A. Cipher Shifer.cpp
new file mode 100644
index 0000000..9b14fee
--- /dev/null
+++ b/Codeforces/codeforces.cpp/A. Cipher Shifer.cpp	
@@ -0,0 +1,20 @@
+#include<stdio.h>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;
+        int arr[n];
+        int sum=0;
+        for(i:arr){
+            cin>>arr[i];
+        }
+        for(int i=0; i<n; i++){
+            sum+=arr[i];
+        }
+        if(sum%2==0) return Yes;
+        else{return No;}
+    }
+}
diff --git a/Codeforces/codeforces.cpp/A. Cipher Shifer.exe b/Codeforces/codeforces.cpp/A. Cipher Shifer.exe
new file mode 100644
index 0000000..fc8065e
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. Cipher Shifer.exe differ
diff --git a/Codeforces/codeforces.cpp/A. Cipher Shifer.o b/Codeforces/codeforces.cpp/A. Cipher Shifer.o
new file mode 100644
index 0000000..b8f780d
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. Cipher Shifer.o differ
diff --git a/Codeforces/codeforces.cpp/A. Cipher Shifer1.cpp b/Codeforces/codeforces.cpp/A. Cipher Shifer1.cpp
new file mode 100644
index 0000000..a812fd5
--- /dev/null
+++ b/Codeforces/codeforces.cpp/A. Cipher Shifer1.cpp	
@@ -0,0 +1,30 @@
+#include <iostream>
+#include <string>
+
+using namespace std;
+
+string decryptString(string s) {
+    string result = "";
+
+    for (int i = 0; i < s.length(); i += 2) {
+        result += s[i];
+    }
+
+    return result;
+}
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;
+        string s;
+    cout << "Enter the encrypted string: ";
+    cin >> s;
+
+    string decryptedString = decryptString(s);
+    cout << "Decrypted string: " << decryptedString << endl;
+
+    return 0;
+    }
+}
diff --git a/Codeforces/codeforces.cpp/A. Cipher Shifer1.exe b/Codeforces/codeforces.cpp/A. Cipher Shifer1.exe
new file mode 100644
index 0000000..7158d3d
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. Cipher Shifer1.exe differ
diff --git a/Codeforces/codeforces.cpp/A. Cipher Shifer1.o b/Codeforces/codeforces.cpp/A. Cipher Shifer1.o
new file mode 100644
index 0000000..631952d
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. Cipher Shifer1.o differ
diff --git a/Codeforces/codeforces.cpp/A. Divisible Array.cpp b/Codeforces/codeforces.cpp/A. Divisible Array.cpp
new file mode 100644
index 0000000..1995284
--- /dev/null
+++ b/Codeforces/codeforces.cpp/A. Divisible Array.cpp	
@@ -0,0 +1,32 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;
+        cout<<endl;
+        int arr[n];
+        if(n%2==0){
+            for(int i=0;i<n;i++){
+            arr[i]=((i+1)*2);
+
+            }
+            for(int j=0;j<n;j++){
+            cout<<arr[j]<<" ";
+            }
+        }
+        else if(n%2!=0){
+               for(int i=0;i<n;i++){
+            arr[i]=((i+1));
+
+               }
+               for(int j=0;j<n;j++){
+            cout<<arr[j]<<" ";
+               }
+        }
+
+
+    }
+}
diff --git a/Codeforces/codeforces.cpp/A. Divisible Array.exe b/Codeforces/codeforces.cpp/A. Divisible Array.exe
new file mode 100644
index 0000000..51630f0
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. Divisible Array.exe differ
diff --git a/Codeforces/codeforces.cpp/A. Divisible Array.o b/Codeforces/codeforces.cpp/A. Divisible Array.o
new file mode 100644
index 0000000..e7c20a0
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. Divisible Array.o differ
diff --git a/Codeforces/codeforces.cpp/A. Game with Board.cpp b/Codeforces/codeforces.cpp/A. Game with Board.cpp
new file mode 100644
index 0000000..66552c7
--- /dev/null
+++ b/Codeforces/codeforces.cpp/A. Game with Board.cpp	
@@ -0,0 +1,13 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;
+        if(n==2 || n==99) cout<<"Bob"<<endl;
+        cout<<"Bob";
+        else{cout<<"Alice"<<endl;}
+    }
+}
diff --git a/Codeforces/codeforces.cpp/A. Game with Board.exe b/Codeforces/codeforces.cpp/A. Game with Board.exe
new file mode 100644
index 0000000..e879282
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. Game with Board.exe differ
diff --git a/Codeforces/codeforces.cpp/A. Game with Board.o b/Codeforces/codeforces.cpp/A. Game with Board.o
new file mode 100644
index 0000000..761d6fa
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. Game with Board.o differ
diff --git a/Codeforces/codeforces.cpp/A. Grasshopper on a Line.cpp b/Codeforces/codeforces.cpp/A. Grasshopper on a Line.cpp
new file mode 100644
index 0000000..6411e4c
--- /dev/null
+++ b/Codeforces/codeforces.cpp/A. Grasshopper on a Line.cpp	
@@ -0,0 +1,18 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int x,k;
+        cin>>x>>k;
+        if(x<k || x%k!=0){
+            cout<<1<<endl<<x<<endl;
+        }
+        else{
+            cout<<2<<endl<<(x-1)<<" "<<1<<endl;
+        }
+
+    }
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/A. Grasshopper on a Line.exe b/Codeforces/codeforces.cpp/A. Grasshopper on a Line.exe
new file mode 100644
index 0000000..efa2cac
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. Grasshopper on a Line.exe differ
diff --git a/Codeforces/codeforces.cpp/A. Grasshopper on a Line.o b/Codeforces/codeforces.cpp/A. Grasshopper on a Line.o
new file mode 100644
index 0000000..8b8a27e
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. Grasshopper on a Line.o differ
diff --git a/Codeforces/codeforces.cpp/A. MEXanized Array.cpp b/Codeforces/codeforces.cpp/A. MEXanized Array.cpp
new file mode 100644
index 0000000..79f61f0
--- /dev/null
+++ b/Codeforces/codeforces.cpp/A. MEXanized Array.cpp	
@@ -0,0 +1,35 @@
+#include<iostream>
+#include<vector>
+#define ll long long
+using namespace std;
+
+int main() {
+    int t;
+    cin >> t;
+    while (t--) {
+        long long n, k, x;
+        cin >> n >> k >> x;
+        ll sum = 0;
+
+        if (k > n || k - 1 > x) {
+            cout << -1 << endl; // Print -1 when conditions are not met
+        }
+        else {
+            for (int i = 1; i < k; i++) {
+                sum+=i;
+            }
+            if(k>=x){
+                for (int j = 0; j < n - k; j++) {
+                sum+= (k-1);
+                }
+            }
+            else{
+                for (int l = 0; l < n-k; l++) {
+                sum += x;
+            }
+            }
+            cout << sum  << endl; // Corrected to add 'n' to the sum
+        }
+    }
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/A. MEXanized Array.exe b/Codeforces/codeforces.cpp/A. MEXanized Array.exe
new file mode 100644
index 0000000..ce97f02
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. MEXanized Array.exe differ
diff --git a/Codeforces/codeforces.cpp/A. MEXanized Array.o b/Codeforces/codeforces.cpp/A. MEXanized Array.o
new file mode 100644
index 0000000..d8afab6
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. MEXanized Array.o differ
diff --git a/Codeforces/codeforces.cpp/A. Musical Puzzle.cpp b/Codeforces/codeforces.cpp/A. Musical Puzzle.cpp
new file mode 100644
index 0000000..c5b2889
--- /dev/null
+++ b/Codeforces/codeforces.cpp/A. Musical Puzzle.cpp	
@@ -0,0 +1,15 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n, i, j;
+        cin>>n;
+        string s;
+        cin>>s;
+        int count=0;
+
+    }
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/A. Musical Puzzle.exe b/Codeforces/codeforces.cpp/A. Musical Puzzle.exe
new file mode 100644
index 0000000..aa7d51e
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. Musical Puzzle.exe differ
diff --git a/Codeforces/codeforces.cpp/A. Musical Puzzle.o b/Codeforces/codeforces.cpp/A. Musical Puzzle.o
new file mode 100644
index 0000000..72c1d51
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. Musical Puzzle.o differ
diff --git a/Codeforces/codeforces.cpp/A. Twin Permutations.cpp b/Codeforces/codeforces.cpp/A. Twin Permutations.cpp
new file mode 100644
index 0000000..6110ab6
--- /dev/null
+++ b/Codeforces/codeforces.cpp/A. Twin Permutations.cpp	
@@ -0,0 +1,24 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n, a[n], b[n];
+        cin>>n;
+        for(int i=0; i<n; i++){
+            cin>>a[i];
+        }
+        for(int j=0; j<n; j++){
+            if(a[j]<a[j+1]){
+                cout<<a[j]<<" ";
+            }
+            else{
+                sort(a, a + n);
+            }
+        }
+        cout<<a[n]<<" ";
+        cout<<endl;
+    }
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/A. Twin Permutations.exe b/Codeforces/codeforces.cpp/A. Twin Permutations.exe
new file mode 100644
index 0000000..4af0fec
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. Twin Permutations.exe differ
diff --git a/Codeforces/codeforces.cpp/A. Twin Permutations.o b/Codeforces/codeforces.cpp/A. Twin Permutations.o
new file mode 100644
index 0000000..090d5bc
Binary files /dev/null and b/Codeforces/codeforces.cpp/A. Twin Permutations.o differ
diff --git a/Codeforces/codeforces.cpp/B. Comparison String.cpp b/Codeforces/codeforces.cpp/B. Comparison String.cpp
new file mode 100644
index 0000000..5a6d324
--- /dev/null
+++ b/Codeforces/codeforces.cpp/B. Comparison String.cpp	
@@ -0,0 +1,34 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;
+        string s;
+        cin>>s;
+        int a[n+1];
+        a[0]=1;
+        for(int i=0;i<n;i++){
+            if(s[i]=='<'){
+                a[i+1]=a[i]+1;
+            }
+            else{
+                a[i+1]=a[i]-1;
+            }
+
+        }
+        sort(a,a+n+1);
+        int ans=1;
+        for(int j=0; j<n; j++){
+            if(a[j]!=a[j+1]){
+                ans++;
+            }
+        }
+        cout<<ans<<endl;
+
+
+    }
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/B. Comparison String.exe b/Codeforces/codeforces.cpp/B. Comparison String.exe
new file mode 100644
index 0000000..ff16cfb
Binary files /dev/null and b/Codeforces/codeforces.cpp/B. Comparison String.exe differ
diff --git a/Codeforces/codeforces.cpp/B. Comparison String.o b/Codeforces/codeforces.cpp/B. Comparison String.o
new file mode 100644
index 0000000..bb0fbd0
Binary files /dev/null and b/Codeforces/codeforces.cpp/B. Comparison String.o differ
diff --git a/Codeforces/codeforces.cpp/B. Comparison String1.cpp b/Codeforces/codeforces.cpp/B. Comparison String1.cpp
new file mode 100644
index 0000000..c5dc120
--- /dev/null
+++ b/Codeforces/codeforces.cpp/B. Comparison String1.cpp	
@@ -0,0 +1,35 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;
+        string s;
+        cin>>s;
+        int ind, wid;
+        for(int i=0;i<n;i++){
+            if(s[i]=='>' || s[i]=='<'){
+                cout<<n+1;
+            }
+            else if((s[i]=='<' && s[i+1]=='>') || (s[i]=='>' && s[i+1]=='<')){
+                cout<<2;
+            }
+        }
+        for(int j=0;j<n;j++){
+            if(s[i]=='<' && s[i+1]=='>'){
+                    ind=i;
+            }
+            else if(s[i]=='>' && s[i+1]=='<'){
+                    wid=i;
+            }
+        }
+        for(int k=i;k<n;k++){
+
+        }
+
+
+    }
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/B. Friendly Arrays.cpp b/Codeforces/codeforces.cpp/B. Friendly Arrays.cpp
new file mode 100644
index 0000000..6798387
--- /dev/null
+++ b/Codeforces/codeforces.cpp/B. Friendly Arrays.cpp	
@@ -0,0 +1,45 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+pair<int, int> findMinMaxX(int n, int m, vector<int>& a, vector<int>& b) {
+    int min_x = a[0];
+    int max_x = a[0];
+
+    int or_b = 0;
+    for (int bj : b) {
+        or_b |= bj;
+    }
+
+    min_x |= or_b;
+    max_x |= or_b;
+
+    return make_pair(min_x, max_x);
+}
+
+int main() {
+    int t;
+    cin >> t;
+
+    while (t--) {
+        int n, m;
+        cin >> n >> m;
+        vector<int> a(n), b(m);
+
+        for (int i = 0; i < n; ++i) {
+            cin >> a[i];
+        }
+
+        for (int i = 0; i < m; ++i) {
+            cin >> b[i];
+        }
+
+        pair<int, int> result = findMinMaxX(n, m, a, b);
+
+        cout << result.first << " " << result.second << endl;
+    }
+
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/B. Permutation Swap.c b/Codeforces/codeforces.cpp/B. Permutation Swap.c
new file mode 100644
index 0000000..b64ee56
--- /dev/null
+++ b/Codeforces/codeforces.cpp/B. Permutation Swap.c	
@@ -0,0 +1,12 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n, i, j;
+        cin>>n;
+
+    }
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/Between_the_Offices.cpp b/Codeforces/codeforces.cpp/Between_the_Offices.cpp
new file mode 100644
index 0000000..9b07f0b
--- /dev/null
+++ b/Codeforces/codeforces.cpp/Between_the_Offices.cpp
@@ -0,0 +1,26 @@
+#include<iostream>
+using namespace std;
+ int main(){
+     int N, i, j, NofSF=0, NofFS=0;
+     string s;
+     cin>>N;
+     cout<<endl;
+     cin>>s;
+     for(i=0;i<N-1;i++){
+        if(s[i]=='S' && s[i+1]=='F'){
+            NofSF++;
+        }
+     }
+     for(j=0;j<N-1;j++){
+        if(s[j]=='F' && s[j+1]=='S'){
+            NofFS++;
+        }
+     }
+     if(NofSF>NofFS){
+        cout<<"YES";
+     }
+     else if(NofSF<=NofFS){
+        cout<<"NO";
+     }
+     return 0;
+ }
diff --git a/Codeforces/codeforces.cpp/Between_the_Offices.exe b/Codeforces/codeforces.cpp/Between_the_Offices.exe
new file mode 100644
index 0000000..1058d8c
Binary files /dev/null and b/Codeforces/codeforces.cpp/Between_the_Offices.exe differ
diff --git a/Codeforces/codeforces.cpp/Between_the_Offices.o b/Codeforces/codeforces.cpp/Between_the_Offices.o
new file mode 100644
index 0000000..969a793
Binary files /dev/null and b/Codeforces/codeforces.cpp/Between_the_Offices.o differ
diff --git a/Codeforces/codeforces.cpp/Cards.cpp b/Codeforces/codeforces.cpp/Cards.cpp
new file mode 100644
index 0000000..ca950e7
--- /dev/null
+++ b/Codeforces/codeforces.cpp/Cards.cpp
@@ -0,0 +1,30 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+    int N,i,j;
+    string s;
+    cin>>N;
+    cout<<endl;
+    cin>>s;
+    int num_of_z=0;
+    int num_of_n=0;
+
+    for(i=0;i<N;i++){
+        if(s[i]=='z'){
+            num_of_z++;
+        }
+    }
+    for(j=0;j<N;j++){
+        if(s[j]=='n'){
+            num_of_n++;
+        }
+    }
+    while(num_of_n--){
+        cout<<1<<' ';
+    }
+    while(num_of_z--){
+        cout<<0<<' ';
+    }
+ return 0;
+}
diff --git a/Codeforces/codeforces.cpp/Cards.exe b/Codeforces/codeforces.cpp/Cards.exe
new file mode 100644
index 0000000..93bd5a2
Binary files /dev/null and b/Codeforces/codeforces.cpp/Cards.exe differ
diff --git a/Codeforces/codeforces.cpp/Cards.o b/Codeforces/codeforces.cpp/Cards.o
new file mode 100644
index 0000000..8c86e81
Binary files /dev/null and b/Codeforces/codeforces.cpp/Cards.o differ
diff --git a/Codeforces/codeforces.cpp/Coins.cpp b/Codeforces/codeforces.cpp/Coins.cpp
new file mode 100644
index 0000000..81fdeb1
--- /dev/null
+++ b/Codeforces/codeforces.cpp/Coins.cpp
@@ -0,0 +1,25 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+     int n,k,x=0,y=0;
+     cin>>n>>k;
+     for(int i=0;i<=n/2;i++){
+        for(int j=0;j<=n/k;j++){
+        if(2*i + k*j == n){
+        cout<<"YES";
+        break;
+        }
+
+        if(2*i + k*j != n){
+            cout<<"NO";
+            break;
+        }
+      }
+     }
+    }
+
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/Coins.exe b/Codeforces/codeforces.cpp/Coins.exe
new file mode 100644
index 0000000..a1b2cf5
Binary files /dev/null and b/Codeforces/codeforces.cpp/Coins.exe differ
diff --git a/Codeforces/codeforces.cpp/Coins.o b/Codeforces/codeforces.cpp/Coins.o
new file mode 100644
index 0000000..c9b022f
Binary files /dev/null and b/Codeforces/codeforces.cpp/Coins.o differ
diff --git a/Codeforces/codeforces.cpp/Fafa and his Company.cpp b/Codeforces/codeforces.cpp/Fafa and his Company.cpp
new file mode 100644
index 0000000..bc082f2
--- /dev/null
+++ b/Codeforces/codeforces.cpp/Fafa and his Company.cpp	
@@ -0,0 +1,13 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+    int N, i, No_of_factor=0;
+    cin>>N;
+    for(i=1;i<=N;i++){
+        if(N%i==0){
+            No_of_factor++;
+        }
+    }
+    cout<<No_of_factor-1;
+}
diff --git a/Codeforces/codeforces.cpp/Fafa and his Company.exe b/Codeforces/codeforces.cpp/Fafa and his Company.exe
new file mode 100644
index 0000000..0221a91
Binary files /dev/null and b/Codeforces/codeforces.cpp/Fafa and his Company.exe differ
diff --git a/Codeforces/codeforces.cpp/Fafa and his Company.o b/Codeforces/codeforces.cpp/Fafa and his Company.o
new file mode 100644
index 0000000..edac4fd
Binary files /dev/null and b/Codeforces/codeforces.cpp/Fafa and his Company.o differ
diff --git a/Codeforces/codeforces.cpp/Ian Visits Mary.cpp b/Codeforces/codeforces.cpp/Ian Visits Mary.cpp
new file mode 100644
index 0000000..89aade3
--- /dev/null
+++ b/Codeforces/codeforces.cpp/Ian Visits Mary.cpp	
@@ -0,0 +1,34 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+          int a,b, jumps;
+          cin>>a>>b;
+          if(b%a!=0 || (a==1 && b==1) || (a==1 && b==2) || (a==2 && b==1)){
+            cout<<1;
+            jumps=1;
+          }
+          else if(b%a==0 || a%b==0){
+             cout<<2;
+             jumps=2;
+          }
+          else(cout<<0);
+
+          if(jumps==1){
+            cout<<a<<" "<<b;
+          }
+          else if(jumps==2){
+            cout<<a<<" "<<b;
+            cout<<a<<" "<<b;
+          }
+          else(cout<<0<<" "<<0);
+
+
+    }
+
+
+
+}
diff --git a/Codeforces/codeforces.cpp/Ian Visits Mary.exe b/Codeforces/codeforces.cpp/Ian Visits Mary.exe
new file mode 100644
index 0000000..0bea80a
Binary files /dev/null and b/Codeforces/codeforces.cpp/Ian Visits Mary.exe differ
diff --git a/Codeforces/codeforces.cpp/Ian Visits Mary.o b/Codeforces/codeforces.cpp/Ian Visits Mary.o
new file mode 100644
index 0000000..52b0047
Binary files /dev/null and b/Codeforces/codeforces.cpp/Ian Visits Mary.o differ
diff --git a/Codeforces/codeforces.cpp/Infinity Gauntlet.cpp b/Codeforces/codeforces.cpp/Infinity Gauntlet.cpp
new file mode 100644
index 0000000..a55da35
--- /dev/null
+++ b/Codeforces/codeforces.cpp/Infinity Gauntlet.cpp	
@@ -0,0 +1,17 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+    string brr[6] = {}
+    string arr[];
+    cout<<(6-n);
+    for(i=0;i<n;i++){
+        cin>>arr[i];
+        cout<<endl;
+    }
+    for(j=0;j<(6-n);j++){
+        cout<<arr[6-j]
+    }
+}
diff --git a/Codeforces/codeforces.cpp/Infinity Gauntlet.exe b/Codeforces/codeforces.cpp/Infinity Gauntlet.exe
new file mode 100644
index 0000000..f183eda
Binary files /dev/null and b/Codeforces/codeforces.cpp/Infinity Gauntlet.exe differ
diff --git a/Codeforces/codeforces.cpp/Infinity Gauntlet.o b/Codeforces/codeforces.cpp/Infinity Gauntlet.o
new file mode 100644
index 0000000..e167cde
Binary files /dev/null and b/Codeforces/codeforces.cpp/Infinity Gauntlet.o differ
diff --git a/Codeforces/codeforces.cpp/Mahmoud and Ehab and the even-odd game.cpp b/Codeforces/codeforces.cpp/Mahmoud and Ehab and the even-odd game.cpp
new file mode 100644
index 0000000..dc9d692
--- /dev/null
+++ b/Codeforces/codeforces.cpp/Mahmoud and Ehab and the even-odd game.cpp	
@@ -0,0 +1,14 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+    if(n%2==0){
+       cout<<"Mahmoud";
+    }
+    else if(n%2!=0){
+       cout<<"Ehab";
+    }
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/Mahmoud and Ehab and the even-odd game.exe b/Codeforces/codeforces.cpp/Mahmoud and Ehab and the even-odd game.exe
new file mode 100644
index 0000000..d1bdf99
Binary files /dev/null and b/Codeforces/codeforces.cpp/Mahmoud and Ehab and the even-odd game.exe differ
diff --git a/Codeforces/codeforces.cpp/Mahmoud and Ehab and the even-odd game.o b/Codeforces/codeforces.cpp/Mahmoud and Ehab and the even-odd game.o
new file mode 100644
index 0000000..20c783b
Binary files /dev/null and b/Codeforces/codeforces.cpp/Mahmoud and Ehab and the even-odd game.o differ
diff --git a/Codeforces/codeforces.cpp/Pens and Pencils.cpp b/Codeforces/codeforces.cpp/Pens and Pencils.cpp
new file mode 100644
index 0000000..4693037
--- /dev/null
+++ b/Codeforces/codeforces.cpp/Pens and Pencils.cpp	
@@ -0,0 +1,37 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+           int a, b,  c, d, k, num1, num2;
+           cin>>a>>b>>c>>d>>k;
+
+           if(a>c){
+               //cout<<a;
+               num1 = a;
+           }
+           else if(a<=c){
+               //cout<<1;
+               num1 = 1;
+           }
+           if(b>d){
+               //cout<<b;
+               num2 = b;
+           }
+           else if(b<=d){
+               //cout<<1;
+               num2 = 1;
+           }
+           if((num1+num2) <=k){
+            cout<<(a+1);
+           }
+           else(cout<<-1);
+           if((num2+num2)<=k){
+            cout<<(b+1);
+           }
+           else(cout<<-1);
+
+    }
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/Pens and Pencils.exe b/Codeforces/codeforces.cpp/Pens and Pencils.exe
new file mode 100644
index 0000000..24cb8c2
Binary files /dev/null and b/Codeforces/codeforces.cpp/Pens and Pencils.exe differ
diff --git a/Codeforces/codeforces.cpp/Pens and Pencils.o b/Codeforces/codeforces.cpp/Pens and Pencils.o
new file mode 100644
index 0000000..199309a
Binary files /dev/null and b/Codeforces/codeforces.cpp/Pens and Pencils.o differ
diff --git a/Codeforces/codeforces.cpp/STL.c b/Codeforces/codeforces.cpp/STL.c
new file mode 100644
index 0000000..6087310
--- /dev/null
+++ b/Codeforces/codeforces.cpp/STL.c
@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+    int n,m,i =0,j= 0;
+    cin>>n;
+    cin>>m;
+    int a[n];
+    int b[m];
+    //cin>>a[n];
+    for(int i=0; i<n; i++){
+    cin>>a[i];
+}
+    //cin>>b[m];
+    for(int j=0; i<m; j++){
+    cin>>b[i];
+}
+    sort(a.begin(),a.end());
+    sort(b.begin(),b.end());
+
+    while(m<=n){
+        a[i] = b[m-i+1];
+        i++;
+    }
+    cout << accumulate(a, a + n, 0);
+    return 0;
+
+}
diff --git a/Codeforces/codeforces.cpp/Scarborough Fair.cpp b/Codeforces/codeforces.cpp/Scarborough Fair.cpp
new file mode 100644
index 0000000..8f0d473
--- /dev/null
+++ b/Codeforces/codeforces.cpp/Scarborough Fair.cpp	
@@ -0,0 +1,22 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+    int n, m, l, r, i, j;
+    char c1, c2;
+    cin>>n>>m;
+    cout<<endl;
+    string s;
+    cin>>s;
+    cout<<endl;
+    for(i=1;i<=m;i++){
+        cin>>l>>r>>c1>>c2;
+        for(j=l-1;j<=r-1;j++){
+            if(s[j]==c1){
+               s[j]=c2;
+            }
+        }
+    }
+    cout<<s;
+}
+
diff --git a/Codeforces/codeforces.cpp/Scarborough Fair.exe b/Codeforces/codeforces.cpp/Scarborough Fair.exe
new file mode 100644
index 0000000..d361972
Binary files /dev/null and b/Codeforces/codeforces.cpp/Scarborough Fair.exe differ
diff --git a/Codeforces/codeforces.cpp/Scarborough Fair.o b/Codeforces/codeforces.cpp/Scarborough Fair.o
new file mode 100644
index 0000000..ccd041e
Binary files /dev/null and b/Codeforces/codeforces.cpp/Scarborough Fair.o differ
diff --git a/Codeforces/codeforces.cpp/Tokitsukaze and Enhancement.cpp b/Codeforces/codeforces.cpp/Tokitsukaze and Enhancement.cpp
new file mode 100644
index 0000000..8dec50d
--- /dev/null
+++ b/Codeforces/codeforces.cpp/Tokitsukaze and Enhancement.cpp	
@@ -0,0 +1,20 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+    int x;
+    cin>>x;
+    if(x%4==1){
+        cout<<0<<" ";
+        cout<<'A';
+    }
+    else if(x%4==3){
+        cout<<2<<" ";
+        cout<<'C';
+    }
+    else if(x%4==2){
+        cout<<1<<" ";
+        cout<<'B';
+    }
+
+}
diff --git a/Codeforces/codeforces.cpp/Tokitsukaze and Enhancement.exe b/Codeforces/codeforces.cpp/Tokitsukaze and Enhancement.exe
new file mode 100644
index 0000000..5a4e1f5
Binary files /dev/null and b/Codeforces/codeforces.cpp/Tokitsukaze and Enhancement.exe differ
diff --git a/Codeforces/codeforces.cpp/Tokitsukaze and Enhancement.o b/Codeforces/codeforces.cpp/Tokitsukaze and Enhancement.o
new file mode 100644
index 0000000..8bcafd2
Binary files /dev/null and b/Codeforces/codeforces.cpp/Tokitsukaze and Enhancement.o differ
diff --git a/Codeforces/codeforces.cpp/Untitled2.cpp b/Codeforces/codeforces.cpp/Untitled2.cpp
new file mode 100644
index 0000000..c28fa79
--- /dev/null
+++ b/Codeforces/codeforces.cpp/Untitled2.cpp
@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+    int n,m,i =0,j= 0;
+    cin>>n;
+    cin>>m;
+    int a[n];
+    int b[m];
+    //cin>>a[n];
+    for(int i=0; i<n; i++){
+    cin>>a[i];
+}
+    //cin>>b[m];
+    for(int j=0; i<m; j++){
+    cin>>b[i];
+}
+   sort(a, a + n);
+   sort(b, b + n);
+
+    while(m<=n){
+        a[i] = b[m-i+1];
+        i++;
+    }
+    int sum = 0;
+    sum = accumulate(a, a+n, sum);
+    cout<<sum<<endl;
+   //cout << accumulate(a, a + n, 0);
+
+}
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/Untitled2.exe b/Codeforces/codeforces.cpp/Untitled2.exe
new file mode 100644
index 0000000..0bb35bb
Binary files /dev/null and b/Codeforces/codeforces.cpp/Untitled2.exe differ
diff --git a/Codeforces/codeforces.cpp/Untitled2.o b/Codeforces/codeforces.cpp/Untitled2.o
new file mode 100644
index 0000000..314710a
Binary files /dev/null and b/Codeforces/codeforces.cpp/Untitled2.o differ
diff --git a/Codeforces/codeforces.cpp/Untitled3.c b/Codeforces/codeforces.cpp/Untitled3.c
new file mode 100644
index 0000000..d3f5a12
--- /dev/null
+++ b/Codeforces/codeforces.cpp/Untitled3.c
@@ -0,0 +1 @@
+
diff --git a/Codeforces/codeforces.cpp/Vus the Cossack and a Contest.cpp b/Codeforces/codeforces.cpp/Vus the Cossack and a Contest.cpp
new file mode 100644
index 0000000..cda8abe
--- /dev/null
+++ b/Codeforces/codeforces.cpp/Vus the Cossack and a Contest.cpp	
@@ -0,0 +1,11 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+    int a, b, c;
+    cin>>a>>b>>c;
+    if(b>=a && c>=a){
+        cout<<"Yes";
+    }
+    else(cout<<"No");
+}
diff --git a/Codeforces/codeforces.cpp/Vus the Cossack and a Contest.exe b/Codeforces/codeforces.cpp/Vus the Cossack and a Contest.exe
new file mode 100644
index 0000000..4301f77
Binary files /dev/null and b/Codeforces/codeforces.cpp/Vus the Cossack and a Contest.exe differ
diff --git a/Codeforces/codeforces.cpp/Vus the Cossack and a Contest.o b/Codeforces/codeforces.cpp/Vus the Cossack and a Contest.o
new file mode 100644
index 0000000..977a520
Binary files /dev/null and b/Codeforces/codeforces.cpp/Vus the Cossack and a Contest.o differ
diff --git a/Codeforces/codeforces.cpp/array2.c b/Codeforces/codeforces.cpp/array2.c
new file mode 100644
index 0000000..c2d6dc3
--- /dev/null
+++ b/Codeforces/codeforces.cpp/array2.c
@@ -0,0 +1,20 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;
+        int arr[n];
+        //cin >> arr[i];
+        for(i=0;i<n;i++){
+            cin>>arr[i];
+        }
+
+}
+    return 0;
+}
+
diff --git a/Codeforces/codeforces.cpp/bs.cpp b/Codeforces/codeforces.cpp/bs.cpp
new file mode 100644
index 0000000..e47b305
--- /dev/null
+++ b/Codeforces/codeforces.cpp/bs.cpp
@@ -0,0 +1,17 @@
+#include<iostream>
+using namespace std;
+int main(){
+    char arr[7] = {c, o, d, e, f , r, s}
+
+    int t;
+    cin>>t;
+    while(t--){
+    char n;
+    cin>>'n'>>endl;
+
+
+
+    }
+    return 0;
+}
+
diff --git a/Codeforces/codeforces.cpp/ee.cpp.c b/Codeforces/codeforces.cpp/ee.cpp.c
new file mode 100644
index 0000000..8f33fc5
--- /dev/null
+++ b/Codeforces/codeforces.cpp/ee.cpp.c
@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+    int n,m,i =0,j= 0;
+    cin>>n;
+    cin>>m;
+    int a[n];
+    int b[m];
+    //cin>>a[n];
+    for(int i=0; i<n; i++){
+    cin>>a[i];
+}
+    //cin>>b[m];
+    for(int j=0; i<m; j++){
+    cin>>b[i];
+}
+    sort(a.begin(),a.end());
+    sort(b.begin(),b.end());
+
+    while(m<=n){
+        a[i] = b[m-i+1];
+        i++;
+    }
+    int sum = 0;
+    sum = accumulate(a, a+n, sum);
+    cout<<sum;
+   //cout << accumulate(a, a + n, 0);
+
+}
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/ex.c b/Codeforces/codeforces.cpp/ex.c
new file mode 100644
index 0000000..8f33fc5
--- /dev/null
+++ b/Codeforces/codeforces.cpp/ex.c
@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+    int n,m,i =0,j= 0;
+    cin>>n;
+    cin>>m;
+    int a[n];
+    int b[m];
+    //cin>>a[n];
+    for(int i=0; i<n; i++){
+    cin>>a[i];
+}
+    //cin>>b[m];
+    for(int j=0; i<m; j++){
+    cin>>b[i];
+}
+    sort(a.begin(),a.end());
+    sort(b.begin(),b.end());
+
+    while(m<=n){
+        a[i] = b[m-i+1];
+        i++;
+    }
+    int sum = 0;
+    sum = accumulate(a, a+n, sum);
+    cout<<sum;
+   //cout << accumulate(a, a + n, 0);
+
+}
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/leetcode1.cpp b/Codeforces/codeforces.cpp/leetcode1.cpp
new file mode 100644
index 0000000..0a0266b
--- /dev/null
+++ b/Codeforces/codeforces.cpp/leetcode1.cpp
@@ -0,0 +1,13 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+        int salary[];
+        int n = salary.size();
+        int min = *min_element(salary, salary + n);
+        int max = *max_element(salary, salary + n);
+        for(int i=0;i<salary.size();i++){
+            int sum += salary[i];
+        }
+        cout<<(sum - min - max)/(n-2);
+}
diff --git a/Codeforces/codeforces.cpp/median.cpp b/Codeforces/codeforces.cpp/median.cpp
new file mode 100644
index 0000000..d58b9f9
--- /dev/null
+++ b/Codeforces/codeforces.cpp/median.cpp
@@ -0,0 +1,43 @@
+/*Given three distinct integers a, b, and c, find the medium number between all of them.
+
+The medium number is the number that is neither the minimum nor the maximum of the given three numbers.
+
+For example, the median of 5,2,6 is 5, since the minimum is 2 and the maximum is 6.
+*/
+
+#include<iostream>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+            int a,b,c;
+        cin>>a>>b>>c;
+        int maxi = max(a,max(b,c));
+        int mini = min(a,min(b,c));
+        if(a!=maxi && a!=mini) cout<<a<<endl;
+        else if(b!=maxi && b!=mini) cout<<b<<endl;
+        else if(c!=maxi && c!=mini) cout<<c<<endl;
+        /*if(a>=b){
+            if(b>=c){
+                cout<<b<<endl;
+            }
+            else if(c>=b){
+                cout<<c<<endl;
+            }
+        }
+        else if(b>=a){
+                if(a>=c){
+                     cout<<a<<endl;
+                }
+                else if(a<=c){
+                     cout<<c<<endl;
+                }
+
+        }
+        else{
+            cout<<c<<endl;
+        }*/
+    }
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/median.exe b/Codeforces/codeforces.cpp/median.exe
new file mode 100644
index 0000000..61cb0f3
Binary files /dev/null and b/Codeforces/codeforces.cpp/median.exe differ
diff --git a/Codeforces/codeforces.cpp/median.o b/Codeforces/codeforces.cpp/median.o
new file mode 100644
index 0000000..4ee58ad
Binary files /dev/null and b/Codeforces/codeforces.cpp/median.o differ
diff --git a/Codeforces/codeforces.cpp/phone directory.cpp b/Codeforces/codeforces.cpp/phone directory.cpp
new file mode 100644
index 0000000..fd2348a
--- /dev/null
+++ b/Codeforces/codeforces.cpp/phone directory.cpp	
@@ -0,0 +1,67 @@
+#include<bits/stdc++.h>
+#define ll long long 
+ using namespace std;
+
+ class phonedirectory{
+ public:
+ set<ll int>s ;
+ void insert_num(ll int num){
+ s.insert(num);
+ }
+ bool check(ll int num){
+     set<ll int> :: iterator itr = s.find(num) ;
+     if(*itr >= 0 && *itr < s.size() ){
+         return true;
+     }
+     return false ;
+ }
+ void release_num(){
+ if(s.empty() == 1){
+     cout<<"No numbers in slots"<<endl;
+ }
+
+ else{
+      vector<ll int> :: iterator itr=v.begin();
+      auto it = itr ;
+      cout<<" New Number "<<*it<<endl;
+ //s.erase(itr);
+ }
+ }
+
+ };
+
+ int main(){
+     
+         phonedirectory phone_num;
+         ll int num_of_slot, number, mob_num ;
+         cin >> num_of_slot ;
+         for(int i=0; i < num_of_slot ;i++){
+             cin>>number ;
+         phone_num.insert_num(number);
+         }
+         
+ cout<<"if you want new number please Enter 'X' else 'N'  " <<endl;
+ char new_num;
+ cin>>new_num ;
+ if(new_num == 'X'){
+
+     phone_num.release_num();
+ }
+ char to_check;
+ cout<<"if you want to check number please Enter 'Y' else 'N' " <<endl;
+ cin>>to_check ;
+
+ if(to_check == 'Y'){
+     cout<<"Enter Number to Check "<<endl;
+     cin>>mob_num ;
+     if(phone_num.check(mob_num)){
+         cout<<"Number is present in slots"<<endl;
+     }
+     else{
+         cout<<"Number is not present in slots"<<endl;
+
+     }
+ }
+     
+     return 0;
+ }
diff --git a/Codeforces/codeforces.cpp/phoneDirectory.cpp b/Codeforces/codeforces.cpp/phoneDirectory.cpp
new file mode 100644
index 0000000..d4d5435
--- /dev/null
+++ b/Codeforces/codeforces.cpp/phoneDirectory.cpp
@@ -0,0 +1,72 @@
+#include<bits/stdc++.h>
+#define ll long long 
+using namespace std;
+
+ class phonedirectory{
+ public:
+
+ vector<ll> v;
+    for(int i=0 ; i<n ; i++)
+    {
+        cin>>num;
+        v.push_back(num);
+    }
+ bool check(ll num){
+
+     for(int i=0; i < v.size(); i++){
+         if(v[i]==num){
+         return true;
+         }
+         return false ;
+         }
+}
+ void release_num(){
+ if(v.empty() == 1){
+     cout<<"No numbers in slots"<<endl;
+ }
+
+ else{
+      vector<ll> :: iterator it;
+      auto it = itr ;
+      cout<<" New Number "<<*it<<endl;
+ v.erase(itr);
+ }
+ }
+
+ };
+
+ int main(){
+     
+         phonedirectory phone_num;
+         ll int num_of_slots, number, mob_num ;
+         cin >> num_of_slot ;
+         for(int i=0; i < num_of_slots ;i++){
+             cin>>number ;
+         phone_num.insert_num(number);
+         }
+         
+ cout<<"For new number please Enter 'X' else 'N'  " <<endl;
+ char new_num;
+ cin>>new_num ;
+ if(new_num == 'X'){
+
+     phone_num.release_num();
+ }
+ char to_check;
+ cout<<"To check number please Enter 'Y' else 'N' " <<endl;
+ cin>>to_check ;
+
+ if(to_check == 'Y'){
+     cout<<"Enter Number to Check "<<endl;
+     cin>>mob_num ;
+     if(phone_num.check(mob_num)){
+         cout<<"Number is present in slots"<<endl;
+     }
+     else{
+         cout<<"Number is not present in slots"<<endl;
+
+     }
+ }
+     
+     return 0;
+ }
diff --git a/Codeforces/codeforces.cpp/stlex.c b/Codeforces/codeforces.cpp/stlex.c
new file mode 100644
index 0000000..8f33fc5
--- /dev/null
+++ b/Codeforces/codeforces.cpp/stlex.c
@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+    int n,m,i =0,j= 0;
+    cin>>n;
+    cin>>m;
+    int a[n];
+    int b[m];
+    //cin>>a[n];
+    for(int i=0; i<n; i++){
+    cin>>a[i];
+}
+    //cin>>b[m];
+    for(int j=0; i<m; j++){
+    cin>>b[i];
+}
+    sort(a.begin(),a.end());
+    sort(b.begin(),b.end());
+
+    while(m<=n){
+        a[i] = b[m-i+1];
+        i++;
+    }
+    int sum = 0;
+    sum = accumulate(a, a+n, sum);
+    cout<<sum;
+   //cout << accumulate(a, a + n, 0);
+
+}
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/stls.cpp b/Codeforces/codeforces.cpp/stls.cpp
new file mode 100644
index 0000000..8f57bc2
--- /dev/null
+++ b/Codeforces/codeforces.cpp/stls.cpp
@@ -0,0 +1,19 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        vector<int> v;
+        reverse(sort(v.begin(),v.end()));
+        c = min(a,b);
+        int a[26];
+        sort(a,a+26);
+        d = max(a,b);
+
+    }
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/string1.cpp b/Codeforces/codeforces.cpp/string1.cpp
new file mode 100644
index 0000000..18fc9c2
--- /dev/null
+++ b/Codeforces/codeforces.cpp/string1.cpp
@@ -0,0 +1,34 @@
+/*In order to write a string, Atilla needs to first learn all letters that are contained in the string.
+
+Atilla needs to write a message which can be represented as a string s. He asks you what is the minimum alphabet size required so that one can write this message.
+
+The alphabet of size x (1≤x≤26) contains only the first x Latin letters. For example an alphabet of size 4 contains only the characters a, b, c and d.
+*/
+
+#include<iostream>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+            int n;
+    cin>>n;
+
+        string s;
+        cin>>s;
+        int a[26]={0};
+        for(int i=0;i<n;i++){
+            a[s[i]-'a']++;
+        }
+        for(int i=25;i>=0;i--){
+            if(a[i]>0){
+                cout<<i+1<<endl;
+                break;
+            }
+        }
+
+
+    }
+    return 0;
+}
+
diff --git a/Codeforces/codeforces.cpp/string1.exe b/Codeforces/codeforces.cpp/string1.exe
new file mode 100644
index 0000000..410ce13
Binary files /dev/null and b/Codeforces/codeforces.cpp/string1.exe differ
diff --git a/Codeforces/codeforces.cpp/string1.o b/Codeforces/codeforces.cpp/string1.o
new file mode 100644
index 0000000..cc01c55
Binary files /dev/null and b/Codeforces/codeforces.cpp/string1.o differ
diff --git a/Codeforces/codeforces.cpp/sumofArray.cpp b/Codeforces/codeforces.cpp/sumofArray.cpp
new file mode 100644
index 0000000..4de6d63
--- /dev/null
+++ b/Codeforces/codeforces.cpp/sumofArray.cpp
@@ -0,0 +1,15 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+int i,n;
+cin >> n;
+int arr[n];
+int sum=0;
+for(i=0;i<n;i++){
+    cin >> arr[i];
+    sum += arr[i];
+}
+cout << sum;
+return 0;
+}
diff --git a/Codeforces/codeforces.cpp/sumofArray.exe b/Codeforces/codeforces.cpp/sumofArray.exe
new file mode 100644
index 0000000..2f7bdb0
Binary files /dev/null and b/Codeforces/codeforces.cpp/sumofArray.exe differ
diff --git a/Codeforces/codeforces.cpp/sumofArray.o b/Codeforces/codeforces.cpp/sumofArray.o
new file mode 100644
index 0000000..276fbfb
Binary files /dev/null and b/Codeforces/codeforces.cpp/sumofArray.o differ
diff --git a/Codeforces/codeforces.cpp/task1.cpp b/Codeforces/codeforces.cpp/task1.cpp
new file mode 100644
index 0000000..b17f89e
--- /dev/null
+++ b/Codeforces/codeforces.cpp/task1.cpp
@@ -0,0 +1,38 @@
+void help(vector<vector<int>>&image,int &n,int &m){
+
+    if(x>=n || y>=m || image[x][y]==nc)return;
+
+    int oc=image[x][y];
+
+    image[x][y]=nc;
+
+    if(x+1<n && image[x+1][y]==oc){
+
+        help(image,x+1,y,nc,n,m);
+
+    }
+
+    if(x-1>=0 && image[x-1][y]==oc){
+
+        help(image,x-1,y,nc,n,m);
+
+    }
+
+    if(y-1>=0 && image[x][y-1]==oc){
+
+        help(image,x,y-1,nc,n,m);
+
+    }
+
+    if(y+1<m && image[x][y+1]==oc){
+
+        help(image,x,y+1,nc,n,m);
+
+    }
+
+}
+
+int solution(int **A, int N, int M){
+
+
+}
diff --git a/Codeforces/codeforces.cpp/tower.cpp b/Codeforces/codeforces.cpp/tower.cpp
new file mode 100644
index 0000000..19bcc2f
--- /dev/null
+++ b/Codeforces/codeforces.cpp/tower.cpp
@@ -0,0 +1,31 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+    int n,m;
+    cin>>n>>m;
+    string a, b, c;
+    cin>>a;
+    cin>>b;
+    int i;
+    int flag = 1;
+    reverse(b.begin(), b.end());
+    c = a + (b);
+    for(i=0;i<=n+m-3;i++){
+        if(c[i] == c[i+1] && c[i+1] == c[i+2]){
+            flag = 0;
+            break;
+        }
+    }
+    if(flag == 0){
+        cout<<"NO"<<endl;
+    }
+    else{
+        cout<<"YES"<<endl;
+    }
+    }
+
+    return 0;
+}
diff --git a/Codeforces/codeforces.cpp/tower.exe b/Codeforces/codeforces.cpp/tower.exe
new file mode 100644
index 0000000..b42769e
Binary files /dev/null and b/Codeforces/codeforces.cpp/tower.exe differ
diff --git a/Codeforces/codeforces.cpp/tower.o b/Codeforces/codeforces.cpp/tower.o
new file mode 100644
index 0000000..22b7b44
Binary files /dev/null and b/Codeforces/codeforces.cpp/tower.o differ
diff --git a/Codeforces/codeforces.cpp/vacc.cpp b/Codeforces/codeforces.cpp/vacc.cpp
new file mode 100644
index 0000000..aa7ffb5
--- /dev/null
+++ b/Codeforces/codeforces.cpp/vacc.cpp
@@ -0,0 +1,54 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main() {
+
+        int N,D;
+        cin>>N>>D>>[&n&];
+        int count1=0;
+        int count2=0;
+        int a[N];
+        for(int i=1;i<=N;i++){
+            cin>>a[i];
+        }
+        for(int j=1; j<=N; j++){
+            if (a[j]>=80 || a[j]<=9){
+                count1++;
+            }
+            else {
+                count2++;
+            }
+        }
+        float f1=count1/D;
+        int m1=count1/D;
+        int count11=0;
+        int count22=0;
+
+        float f2=count2/D;
+        int m2=count2/D;
+        if(f1>m1){
+            count11++;
+        }
+        if(f2>m2){
+            count22++;
+        }
+        int a1=count1+count11;
+        int a2=count2+count22;
+        int k1=a1/D;
+        int k2=a2/D;
+        if(a1%D!=0 && a2%D!=0){
+            cout<<k1+k2+2<<endl;
+        }
+        if(a1%D==0 && a2%D!=0){
+            cout<<k1+k2+1<<endl;
+        }
+        if(a1%D==0 && a2%D==0){
+            cout<<k1+k2<<endl;
+        }
+        if(a1%D!=0 && a2%D==0){
+            cout<<k1+k2+1<<endl;
+        }
+
+    return 0;
+}
+
diff --git a/Codeforces/codeforces.cpp/vacc.exe b/Codeforces/codeforces.cpp/vacc.exe
new file mode 100644
index 0000000..b735fbe
Binary files /dev/null and b/Codeforces/codeforces.cpp/vacc.exe differ
diff --git a/Codeforces/codeforces.cpp/vacc.o b/Codeforces/codeforces.cpp/vacc.o
new file mode 100644
index 0000000..d19b3c6
Binary files /dev/null and b/Codeforces/codeforces.cpp/vacc.o differ
diff --git a/Computer Science/Game Theory  CSO445/cso/1.Pandas Series.pdf b/Computer Science/Game Theory  CSO445/cso/1.Pandas Series.pdf
new file mode 100644
index 0000000..1575204
Binary files /dev/null and b/Computer Science/Game Theory  CSO445/cso/1.Pandas Series.pdf differ
diff --git a/Mathematics/FINAL450.xlsx b/Mathematics/FINAL450.xlsx
new file mode 100644
index 0000000..ea776dc
Binary files /dev/null and b/Mathematics/FINAL450.xlsx differ
diff --git a/Research papers/Laser Speckle Odometry for Robotic Applications.pptx b/Research papers/Laser Speckle Odometry for Robotic Applications.pptx
new file mode 100644
index 0000000..f1e050d
Binary files /dev/null and b/Research papers/Laser Speckle Odometry for Robotic Applications.pptx differ