aboutsummaryrefslogtreecommitdiff
path: root/contests/Round#790/10-10-2022(Div4)
diff options
context:
space:
mode:
Diffstat (limited to 'contests/Round#790/10-10-2022(Div4)')
-rwxr-xr-xcontests/Round#790/10-10-2022(Div4)/A.py14
-rwxr-xr-xcontests/Round#790/10-10-2022(Div4)/B/B.cpp25
-rwxr-xr-xcontests/Round#790/10-10-2022(Div4)/C/C.cpp28
-rwxr-xr-xcontests/Round#790/10-10-2022(Div4)/D/D.cpp51
4 files changed, 0 insertions, 118 deletions
diff --git a/contests/Round#790/10-10-2022(Div4)/A.py b/contests/Round#790/10-10-2022(Div4)/A.py
deleted file mode 100755
index 29d4847..0000000
--- a/contests/Round#790/10-10-2022(Div4)/A.py
+++ /dev/null
@@ -1,14 +0,0 @@
-tt = int(input())
-for i in range(tt):
- lsum = 0
- rsum = 0
- s = input()
- for i in range(3):
- lsum += int(s[i])
- for i in range(3):
- rsum += int(s[len(s) - 1 - i])
- if rsum == lsum:
- print("YES")
- else:
- print("NO")
-
diff --git a/contests/Round#790/10-10-2022(Div4)/B/B.cpp b/contests/Round#790/10-10-2022(Div4)/B/B.cpp
deleted file mode 100755
index a9e3a04..0000000
--- a/contests/Round#790/10-10-2022(Div4)/B/B.cpp
+++ /dev/null
@@ -1,25 +0,0 @@
-#include<bits/stdc++.h>
-
-using namespace std;
-
-int main () {
- int tt;
- cin >> tt;
- while(tt--) {
- int n, c;
- int ans = 0;
- cin >> n;
- vector<int> v(n);
- for(int &x : v) {
- cin >> x;
- }
- int mn = *min_element(v.begin(), v.end());
- for(int i = 0; i < v.size(); i++) {
- if(v[i] != mn){
- ans += v[i] - mn;
- }
- }
- cout << ans << endl;
- }
-
-}
diff --git a/contests/Round#790/10-10-2022(Div4)/C/C.cpp b/contests/Round#790/10-10-2022(Div4)/C/C.cpp
deleted file mode 100755
index 68eda3d..0000000
--- a/contests/Round#790/10-10-2022(Div4)/C/C.cpp
+++ /dev/null
@@ -1,28 +0,0 @@
-#include<bits/stdc++.h>
-
-using namespace std;
-
-int main () {
- int tt;
- cin >> tt;
- while(tt--) {
- int n, m;
- cin >> n >> m;
- vector<string> v(n);
- vector<int> ans;
- for(auto &s : v) {
- cin >> s;
- }
- for(int i = 0; i < v.size() - 1;i++) {
- for(int j = i + 1;j < v.size();j++){
- int sum = 0;
- for(int k = 0; k < v[i].size(); k++) {
- sum+=abs(v[i][k] - v[j][k]);
- }
- ans.push_back(sum);
- }
- }
- cout << *min_element(ans.begin(), ans.end()) << endl;
- }
-
-}
diff --git a/contests/Round#790/10-10-2022(Div4)/D/D.cpp b/contests/Round#790/10-10-2022(Div4)/D/D.cpp
deleted file mode 100755
index 6ee775c..0000000
--- a/contests/Round#790/10-10-2022(Div4)/D/D.cpp
+++ /dev/null
@@ -1,51 +0,0 @@
-#include<bits/stdc++.h>
-
-using namespace std;
-
-int main () {
- int tt;
- cin >> tt;
- while(tt--) {
- int r, c;
- cin >> r >> c;
- vector<vector<int>> grid(r, vector<int>(c));
- for(auto &v : grid) {
- for(auto &x : v){
- cin >> x;
- }
- }
- vector<int> res;
- int ans = 0;
- for(int i = 0; i < r; i++) {
- for(int j = 0; j < c; j++) {
- ans += grid[i][j];
- int r1 = i, r2 = i, r3 = i, r4 = i;
- int c1 = j, c2 = j, c3 = j, c4 =j;
- while(r1+1 <= r - 1 && c1 + 1 <= c - 1) {
- r1++;
- c1++;
- ans+= grid[r1][c1];
- }
- while(r2+1 <= r - 1 && c2 - 1 >= 0) {
- r2++;
- c2--;
- ans+= grid[r2][c2];
- }
- while(r3-1 >= 0 && c3 + 1 <= c - 1) {
- r3--;
- c3++;
- ans+= grid[r3][c3];
- }
- while(r4-1 >= 0 && c4 - 1 >= 0) {
- r4--;
- c4--;
- ans+= grid[r4][c4];
- cout << "r4 " << r4 << " c4 " << c4 << endl;
- }
- res.push_back(ans);
- ans = 0;
- }
- }
- cout << *max_element(res.begin(), res.end()) << endl;
- }
-}