added solutions of codeforces global round 10

Author: nb9960

Codeforces_Contests/Global Round 10/A.cpp

@@ -0,0 +1,38 @@
+// nb_9960
+#include <bits/stdc++.h> 
+using namespace std; 
+#define fi(i,a,n) for (ll i=a; i < n; i++) 
+#define ll long long
+
+int main() 
+{  
+  ios_base::sync_with_stdio(0); 
+  cin.tie(0); 
+  cout.tie(0); 
+
+  ll t = 1; 
+  cin >> t;
+
+  while (t--) { 
+    ll n;
+    cin>>n;
+    ll a[n];
+    int flg=0;
+    ll prev;
+    fi(i,0,n){
+      cin>>a[i];
+    }
+    prev = a[0];
+    fi(i,1,n){
+      if(a[i]!=prev){
+          flg=1;
+          break;
+      } 
+      //break;
+    }
+    if(flg)
+    cout<<1<<endl;
+    else cout<<n<<endl;
+  } 
+  return 0; 
+} 

Codeforces_Contests/Global Round 10/B.cpp

@@ -0,0 +1,51 @@
+// nb_9960
+#include <bits/stdc++.h>
+#include<math.h>
+using namespace std;
+#define MOD 1000000007
+#define ll long long int
+#define fi(i,a,n) for(ll i=a;i<n;i++)
+#define fd(i,a,n) for(ll i=a;i>=n;i--)
+#define pb push_back
+#define fv(i,a) for(auto i:a) 
+#define vi vector<int>
+
+int main() { 
+    ll t=1;
+    cin>>t;
+    while(t--){
+        ll n,k;
+        cin>>n>>k;
+        ll a[n],b[n],c[n];
+        ll max=INT_MIN;
+        ll min=INT_MAX;
+        fi(i,0,n){
+            cin>>a[i];
+            if(a[i]>max){
+                max=a[i];
+            }
+            if(a[i]<min){
+                min=a[i];
+            }
+        }
+        fi(i,0,n){
+            b[i]=max-a[i];
+            c[i]=(max-min)-b[i];
+        }
+        if(n==1){
+            cout<<0;
+        }else if(k%2==0){
+            fi(i,0,n){
+                cout<<c[i]<<" ";
+            }
+        }else{
+            fi(i,0,n){
+                cout<<b[i]<<" ";
+            }
+        }
+        cout<<"\n";
+
+        
+    }
+	return 0; 
+} 

Codeforces_Contests/Global Round 10/C.cpp

@@ -0,0 +1,35 @@
+// nb_9960
+#include <bits/stdc++.h>
+#include<math.h>
+using namespace std;
+#define MOD 1000000007
+#define ll long long int
+#define fi(i,a,n) for(ll i=a;i<n;i++)
+#define fd(i,a,n) for(ll i=a;i>=n;i--)
+#define pb push_back
+#define fv(i,a) for(auto i:a) 
+#define vi vector<int>
+
+int main() { 
+    ll t=1;
+    cin>>t;
+    while(t--){
+        ll n;
+        cin>>n;
+        ll a[n],diff[n];
+        fi(i,0,n){
+            cin>>a[i];
+        }
+        fi(i,0,n-1){
+            diff[i]=a[i]-a[i+1];
+        }
+        ll ans=0;
+        fi(i,0,n-1){
+            if(diff[i]>0){
+                ans+=diff[i];
+            }
+        }
+        cout<<ans<<endl;
+    }
+	return 0; 
+} 

Codeforces_Contests/Global Round 10/D.cpp

@@ -0,0 +1,29 @@
+// nb_9960
+#include<bits/stdc++.h>
+#define ll long long 
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        ll n;
+        cin>>n;
+        string s;
+        cin>>s;
+        int ans = 0,i=1,c=0,j;
+        for(;i<n;i++){
+            if(s[i] == s[i-1]);
+            else break;
+        }
+        s=s+s+s;
+        for(j = i;j<i+n;j++){
+            if(s[j] == s[j-1] && s[j] == s[j+1])
+                c++;
+            else{
+                ans+=ceil(c/3.0);
+                c = 0;
+            }
+        }
+        cout<<ans + ceil(c/3.0)<<endl;
+    }
+}