rajcode126
diff --git a/‎BeatsTheOdd.cpp‎
Lines changed: 33 additions & 0 deletions b/‎BeatsTheOdd.cpp‎
Lines changed: 33 additions & 0 deletions
diff --git a/‎BeatsTheOdd.exe‎
44 KB b/‎BeatsTheOdd.exe‎
44 KB
diff --git a/‎D806.cpp‎
Lines changed: 42 additions & 0 deletions b/‎D806.cpp‎
Lines changed: 42 additions & 0 deletions
diff --git a/‎ICPCBallon.cpp‎
Lines changed: 25 additions & 0 deletions b/‎ICPCBallon.cpp‎
Lines changed: 25 additions & 0 deletions
diff --git a/‎ICPCBallon.exe‎
124 KB b/‎ICPCBallon.exe‎
124 KB
diff --git a/‎PoliceStation.cpp‎
Lines changed: 55 additions & 0 deletions b/‎PoliceStation.cpp‎
Lines changed: 55 additions & 0 deletions
diff --git a/‎PoliceStation.exe‎
88.5 KB b/‎PoliceStation.exe‎
88.5 KB
diff --git a/‎YESisYES.cpp‎
Lines changed: 21 additions & 0 deletions b/‎YESisYES.cpp‎
Lines changed: 21 additions & 0 deletions
diff --git a/‎cypher.cpp‎
Lines changed: 45 additions & 0 deletions b/‎cypher.cpp‎
Lines changed: 45 additions & 0 deletions
diff --git a/‎cypher.exe‎
70 KB b/‎cypher.exe‎
70 KB
@@ -0,0 +1,33 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int t;
+    cin>>t;
+   // int r=0;
+    //int a[t];
+    while(t--)
+    {
+        int n;
+         cin>>n;
+        int e=0,o=0;
+        int arr[n];
+        for(int i=0;i<n;i++)
+        {
+            cin>>arr[i];
+            if(arr[i]%2==0)
+            e++;
+            else
+            o++;
+        }
+        if(o<e)
+        cout<<o<<endl;
+        else
+        cout<<e<<endl;
+ 
+            
+    }
+   
+    
+ 
+}
@@ -0,0 +1,42 @@
+#include<bits/stdc++.h>
+#define int long long int
+using namespace std;
+bool check(vector<string> &kp int k){
+    for(int i=0;i<kp[k].size();i++){
+        string k1=kp[k];
+        k1.erase(i+1,k1.size()i-1);
+        string k2=kp[i];
+        k2.erase(0,i+1)
+        if(find(kp.begin(),kp.end(),k1)!=kp.end() && find(kp.begin(),kp.end(),k2)!=kp.end()){
+            return true;
+        }
+    }
+    return false;
+}
+signed main()
+{
+    int t;
+    cin>>t;
+    while(t--)
+    {
+        int n;
+        cin>>n;
+        vector<string>kp;
+        for(int i=0;i<n;i++)
+        {
+            string str;
+            cin>>str;
+            kp.push_back(str);
+        }
+vector<int>result;
+for(int i=0;i<n;i++){
+    result.push_back(check(kp,i));
+}
+for(auto &ele : result)
+{
+    cout<<ele;
+}
+cout<<endl;
+        
+    }
+}
@@ -0,0 +1,25 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int test;
+    cin>>test;
+    while(test--)
+    {
+       int n;
+       cin>>n;
+        unordered_map<char,int>kp;
+        for(int i=0;i<n;i++)
+        {
+            char k;cin>>k;kp[k]++;
+        }
+        int result=0;
+        for(auto x:kp)
+        {
+            int k1=(x.second-1);
+            int k2=2;
+            result+=k1+k2;
+        }
+        cout<<result<<endl;
+    }
+}
@@ -0,0 +1,55 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+
+ // } Driver Code Ends
+//User function Template for C++
+
+class Solution {
+public:
+    int solve(int N, int a, vector<int> x) 
+    {
+        sort(x.begin(),x.end());
+        int k=x.size()-1;
+        int s=0;
+        int c=0;
+        for(int i=k;c<=2;i--)
+        {
+            if(x[k]!=x[k-1]) 
+            {
+                s+=(abs(x[k]-a));
+                c++;
+                
+            }
+            else
+            {
+                s+=(abs(x[k]-a));
+            }
+                
+            
+        }
+        return s;
+        // code here
+    }
+};
+
+// { Driver Code Starts.
+int main() {
+    int T;
+    cin >> T;
+    while (T--) {
+
+        int N, a;
+        cin >> N >> a;
+
+
+        vector<int> x(N);
+        for (int i = 0; i < N; i++)
+            cin >> x[i];
+
+        Solution ob;
+        cout << ob.solve(N, a, x) << "\n";
+    }
+    return 0;
+}
+  // } Driver Code Ends
@@ -0,0 +1,21 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int t;
+    cin>>t;
+    while(t--)
+    {
+        string str;
+        cin>>str;
+        for(int i=0;i<str.size();i++)
+        {
+            if(str[i]>='A' && str[i]<='Z')
+            str[i]+=32;
+        }
+        if(str[0]=='y' && str[1]=='e' && str[2]=='s')
+        cout<<"YES"<<endl;
+        else 
+        cout<<"NO"<<endl;
+    }
+}
@@ -0,0 +1,45 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int t;
+    cin>>t;
+    while(t--)
+    {
+        int n;
+        cin>>n;
+        vector<int>kp;
+        for(int i=0;i<n;i++)
+        {
+            int v;
+            cin>>v;
+            kp.push_back(v);
+        }
+        for(int i=0;i<n;i++)
+        {
+            int l;
+            cin>>l;
+            string s;
+            cin>>s;
+            for(int j=0;j<l;j++)
+            {
+                if(s[j]=='U'){
+                    if(kp[i]==0){
+                        kp[i]=9;
+                    }
+                    else{
+                        kp[i]-=1;
+                    }
+                }
+                else if(s[j]=='D'){
+                    kp[i]=(kp[i]+1)%10;
+                }
+
+            }
+        }
+        for(auto &ele:kp){
+            cout<<ele<<" ";
+        }cout<<endl;
+    }
+    return 0;
+}