Added solutions of Div2_Round#675

Author: nb9960

Codeforces_Contests/8_Round_675_Div_2/A.cpp

@@ -0,0 +1,31 @@
+// nb_9960
+#include <bits/stdc++.h> 
+using namespace std; 
+#define fi(i,a,n) for (int i=a; i < n; i++) 
+#define ll long long
+#define pb push_back  
+#define all(x) x.begin(), x.end() 
+#define clr(x) memset(x, 0, sizeof(x)) 
+#define sortall(x) sort(all(x)) 
+typedef pair<ll, ll> pl; 
+typedef vector<ll> vl; 
+typedef vector<pl> vpii; 
+
+int main() 
+{  
+  ios_base::sync_with_stdio(0); 
+  cin.tie(0); 
+  cout.tie(0); 
+  
+  ll t = 1; 
+  cin >> t;
+  
+  while (t--) { 
+    ll a,b,c;
+    cin>>a>>b>>c;
+    vl v={a,b,c};
+    sortall(v);
+    cout<<v[2]+v[1]-v[0]<<endl;
+  } 
+  return 0; 
+} 

Codeforces_Contests/8_Round_675_Div_2/B.cpp

@@ -0,0 +1,58 @@
+// nb_9960
+#include <bits/stdc++.h> 
+using namespace std; 
+#define fi(i,a,n) for (int i=a; i < n; i++) 
+#define ll long long
+#define pb push_back 
+#define mp make_pair 
+#define F first 
+#define S second 
+#define all(x) x.begin(), x.end() 
+#define clr(x) memset(x, 0, sizeof(x)) 
+#define sortall(x) sort(all(x)) 
+typedef pair<ll, ll> pl; 
+typedef vector<ll> vl; 
+
+int main() 
+{  
+  ios_base::sync_with_stdio(0); 
+  cin.tie(0); 
+  cout.tie(0); 
+
+  ll t = 1; 
+  cin >> t;
+
+  while (t--) { 
+    ll n,m,ans=0;
+    cin>>n>>m;
+    vl v[n];
+    fi(i,0,n){
+      fi(j,0,m){
+        ll x;cin>>x;
+        v[i].pb(x);
+      }
+    }
+    fi(i,0,n/2){
+      fi(j,0,m/2){
+        vector<ll> v1={v[i][m-j-1],v[i][j],v[n-1-i][j],v[n-1-i][m-1-j]};
+        sortall(v1);
+        ll mean=v1[1];
+        fi(i,0,v1.size())
+        ans+=abs(mean-v1[i]);
+      }
+    }
+    if(n%2){
+      fi(i,0,m/2){
+        ans+=abs(v[n/2][i]-v[n/2][m-1-i]);
+      }
+    }
+    if(m%2){
+      fi(i,0,n/2){
+        ans+=abs(v[i][m/2]-v[n-1-i][m/2]);
+      }
+    }
+    cout<<ans<<endl;
+  } 
+
+  return 0; 
+} 

Codeforces_Contests/8_Round_675_Div_2/C.cpp

@@ -0,0 +1,50 @@
+// 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
+#define pb push_back 
+#define all(x) x.begin(), x.end() 
+#define clr(x) memset(x, 0, sizeof(x)) 
+#define sortall(x) sort(all(x)) 
+typedef pair<ll, ll> pl; 
+typedef vector<ll> vl;  
+const ll mod=1000000007;
+ll power(ll x,ll y,ll m){if(y==0)return 1;ll p=power(x,y/2,m)%m;p=(p*p)%m;return (y%2==0)?p:(x*p)%m;}
+
+int main() 
+{  
+  ios_base::sync_with_stdio(0); 
+  cin.tie(0); 
+  cout.tie(0); 
+
+  ll t = 1; 
+  // cin >> t;
+
+  while (t--) { 
+    	string s;
+      cin >> s;
+      ll ans=0;
+      ll n=s.length();
+      ll tmp=0;
+      for(ll i=n-2;i>=0;--i)
+      {
+        ll t=(s[i]-'0');
+        tmp+=(power(10,n-i-2,mod)*(n-i-1))%mod;
+        tmp%=mod;
+        ans+=((t*tmp)%mod);
+        ans%=mod;
+      }
+      tmp=0;
+      fi(i,1,n)
+      {
+        ll t=(s[i]-'0');
+        tmp+=i;
+        tmp%=mod;
+        ans+=(((t*tmp)%mod)*power(10,n-i-1,mod))%mod;
+        ans%=mod;
+      }
+      cout << ans << endl;
+  } 
+  return 0; 
+}