From 1ccba7112b334c0887bd349966219b38eb9ccfb9 Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Sun, 10 Dec 2023 15:55:42 +0200 Subject: Removed some empty problems and solved 2 problems in rust --- contests/Codechef_Starters_41/A/inp | 1 - contests/Codechef_Starters_41/A/main.cpp | 11 -- contests/Codechef_Starters_41/B/inp | 5 - contests/Codechef_Starters_41/B/main.cpp | 16 --- contests/Codechef_Starters_41/C/inp | 5 - contests/Codechef_Starters_41/C/main.cpp | 24 ---- contests/Codechef_Starters_41/D/inp | 6 - contests/Codechef_Starters_41/D/main.cpp | 26 ---- contests/Codechef_Starters_41/E/inp | 5 - contests/Codechef_Starters_41/E/main.cpp | 19 --- contests/Codechef_Starters_41/F/inp | 6 - contests/Codechef_Starters_41/F/main.cpp | 21 --- contests/Edu145/A/main.cpp | 152 +++++++++++++++++++++ contests/Edu145/A/main_input0.txt | 4 + contests/Edu145/A/main_output0.txt | 3 + contests/Edu145/B/main.cpp | 150 +++++++++++++++++++++ contests/Edu145/B/main_input0.txt | 5 + contests/Edu145/B/main_input1.txt | 2 + contests/Edu145/B/main_input2.txt | 4 + contests/Edu145/B/main_input3.txt | 6 + contests/Edu145/B/main_input4.txt | 2 + contests/Edu145/B/main_output0.txt | 4 + contests/Edu145/B/main_output1.txt | 1 + contests/Edu145/B/main_output2.txt | 3 + contests/Edu145/B/main_output3.txt | 5 + contests/Edu145/B/main_output4.txt | 1 + contests/Edu146/A/main.cpp | 140 +++++++++++++++++++ contests/Edu146/A/main_input0.txt | 5 + contests/Edu146/A/main_input1.txt | 2 + contests/Edu146/A/main_output0.txt | 4 + contests/Edu146/A/main_output1.txt | 1 + contests/EduRound145/A/main.cpp | 152 --------------------- contests/EduRound145/A/main_input0.txt | 4 - contests/EduRound145/A/main_output0.txt | 3 - contests/EduRound145/B/main.cpp | 150 --------------------- contests/EduRound145/B/main_input0.txt | 5 - contests/EduRound145/B/main_input1.txt | 2 - contests/EduRound145/B/main_input2.txt | 4 - contests/EduRound145/B/main_input3.txt | 6 - contests/EduRound145/B/main_input4.txt | 2 - contests/EduRound145/B/main_output0.txt | 4 - contests/EduRound145/B/main_output1.txt | 1 - contests/EduRound145/B/main_output2.txt | 3 - contests/EduRound145/B/main_output3.txt | 5 - contests/EduRound145/B/main_output4.txt | 1 - contests/EduRound145/C/main.cpp | 136 ------------------- contests/EduRound145/D/main.cpp | 132 ------------------ contests/EduRound145/E/main.cpp | 132 ------------------ contests/EduRound145/F/main.cpp | 132 ------------------ contests/EduRound146/A/main.cpp | 140 ------------------- contests/EduRound146/A/main_input0.txt | 5 - contests/EduRound146/A/main_input1.txt | 2 - contests/EduRound146/A/main_output0.txt | 4 - contests/EduRound146/A/main_output1.txt | 1 - contests/EduRound146/B/main.cpp | 132 ------------------ contests/EduRound146/C/main.cpp | 132 ------------------ contests/EduRound146/D/main.cpp | 132 ------------------ contests/EduRound146/E/main.cpp | 132 ------------------ contests/EduRound146/F/main.cpp | 132 ------------------ contests/Round153(Edu)/A/main.cpp | 129 ------------------ contests/Round153(Edu)/B/main.cpp | 129 ------------------ contests/Round153(Edu)/C/main.cpp | 129 ------------------ contests/Round153(Edu)/D/main.cpp | 129 ------------------ contests/Round153(Edu)/E/main.cpp | 129 ------------------ contests/Round153(Edu)/F/main.cpp | 129 ------------------ contests/Round788/B/B.cpp | 7 - contests/Round788/C/C.cpp | 7 - contests/Round788/D/D.cpp | 7 - contests/Round788/E/E.cpp | 7 - contests/Round788/F/F.cpp | 7 - contests/Round825/B/main.cpp | 89 ------------- contests/Round825/C/main.cpp | 89 ------------- contests/Round825/D/main.cpp | 89 ------------- contests/Round825/E/main.cpp | 89 ------------- contests/Round825/F/main.cpp | 89 ------------- contests/Round828/E/main.cpp | 79 ----------- contests/Round828/Round#828/A/main.cpp | 39 ------ contests/Round828/Round#828/B/main.cpp | 48 ------- contests/Round828/Round#828/B/main_input0.txt | 27 ---- contests/Round828/Round#828/B/main_output0.txt | 18 --- contests/Round828/Round#828/C/main.cpp | 48 ------- contests/Round828/Round#828/C/main_input0.txt | 13 -- contests/Round828/Round#828/C/main_output0.txt | 6 - contests/Round828/Round#828/D/main.cpp | 20 --- contests/Round828/Round#828/E/main.cpp | 20 --- contests/Round828/Round#828/F/main.cpp | 20 --- contests/Round849/G2Joe/main.cpp | 129 ------------------ contests/Round849/G2Joe/main_input0.txt | 21 --- contests/Round849/G2Joe/main_input1.txt | 3 - contests/Round849/G2Joe/main_input2.txt | 3 - contests/Round849/G2Joe/main_output0.txt | 10 -- contests/Round849/G2Joe/main_output1.txt | 1 - contests/Round849/G2Joe/main_output2.txt | 1 - contests/Round853/C/main.cpp | 89 ------------- contests/Round853/D/main.cpp | 89 ------------- contests/Round853/E/main.cpp | 89 ------------- contests/Round853/F/main.cpp | 89 ------------- contests/Round855/E/main.cpp | 89 ------------- contests/Round855/F/main.cpp | 89 ------------- contests/Round856/D/main.cpp | 89 ------------- contests/Round856/E/main.cpp | 89 ------------- contests/Round856/F/main.cpp | 89 ------------- contests/Round857/C/main.cpp | 89 ------------- contests/Round857/D/main.cpp | 89 ------------- contests/Round857/E/main.cpp | 89 ------------- contests/Round857/F/main.cpp | 89 ------------- contests/Round859/E/main.cpp | 160 ---------------------- contests/Round859/F/main.cpp | 132 ------------------ contests/Round860/C/main.cpp | 132 ------------------ contests/Round860/D/main.cpp | 132 ------------------ contests/Round860/E/main.cpp | 132 ------------------ contests/Round860/F/main.cpp | 132 ------------------ contests/Round862/D/main.cpp | 132 ------------------ contests/Round862/E/main.cpp | 132 ------------------ contests/Round862/F/main.cpp | 132 ------------------ contests/Round864/C/main.cpp | 129 ------------------ contests/Round864/D/main.cpp | 129 ------------------ contests/Round864/E/main.cpp | 129 ------------------ contests/Round864/F/main.cpp | 129 ------------------ contests/Round865/A/main.cpp | 132 ------------------ contests/Round865/B/main.cpp | 129 ------------------ contests/Round865/C/main.cpp | 129 ------------------ contests/Round865/D/main.cpp | 129 ------------------ contests/Round865/E/main.cpp | 129 ------------------ contests/Round865/F/main.cpp | 129 ------------------ contests/Round886/E/main.cpp | 129 ------------------ contests/Round886/F/main.cpp | 129 ------------------ contests/Round887/C/main.cpp | 129 ------------------ contests/Round887/D/main.cpp | 129 ------------------ contests/Round887/E/main.cpp | 129 ------------------ contests/Round887/F/main.cpp | 129 ------------------ contests/Round891/D/main.cpp | 129 ------------------ contests/Round891/E/main.cpp | 129 ------------------ contests/Round891/F/main.cpp | 129 ------------------ contests/Round894/E/main.cpp | 129 ------------------ contests/Round894/F/main.cpp | 129 ------------------ contests/Round895/F/main.cpp | 129 ------------------ contests/Round896/C/main.cpp | 129 ------------------ contests/Round896/D/main.cpp | 129 ------------------ contests/Round896/E/main.cpp | 129 ------------------ contests/Round896/F/main.cpp | 129 ------------------ contests/Round897/C/main.cpp | 129 ------------------ contests/Round897/D/main.cpp | 129 ------------------ contests/Round897/E/main.cpp | 129 ------------------ contests/Round897/F/main.cpp | 129 ------------------ contests/Round899/B/] | 177 ------------------------- contests/Round899/C/main.cpp | 129 ------------------ contests/Round899/D/main.cpp | 129 ------------------ contests/Round899/E/main.cpp | 129 ------------------ contests/Round899/F/main.cpp | 129 ------------------ contests/Round900/D/main.cpp | 132 ------------------ contests/Round900/E/main.cpp | 177 ------------------------- contests/Round900/E/main_input0.txt | 21 --- contests/Round900/E/main_output0.txt | 3 - contests/Round900/F/main.cpp | 129 ------------------ contests/Round901/C/main.cpp | 54 -------- contests/Round901/D/main.cpp | 54 -------- contests/Round901/E/main.cpp | 54 -------- contests/Round901/F/main.cpp | 54 -------- contests/Starters41/A/inp | 1 + contests/Starters41/A/main.cpp | 11 ++ contests/Starters41/B/inp | 5 + contests/Starters41/B/main.cpp | 16 +++ contests/Starters41/C/inp | 5 + contests/Starters41/C/main.cpp | 24 ++++ contests/Starters41/D/inp | 6 + contests/Starters41/D/main.cpp | 26 ++++ contests/Starters41/E/inp | 5 + contests/Starters41/E/main.cpp | 19 +++ contests/Starters41/F/inp | 6 + contests/Starters41/F/main.cpp | 21 +++ contests/Starters78/E/main.cpp | 89 ------------- contests/Starters78/F/main.cpp | 89 ------------- contests/Starters79/E/main.cpp | 89 ------------- contests/Starters79/F/main.cpp | 89 ------------- contests/Starters80/F/main.cpp | 89 ------------- contests/Starters80/main.cpp | 0 contests/Starters80/main_input0.txt | 5 - contests/Starters80/main_output0.txt | 2 - contests/Starters82/F/main.cpp | 132 ------------------ 180 files changed, 639 insertions(+), 11792 deletions(-) delete mode 100755 contests/Codechef_Starters_41/A/inp delete mode 100755 contests/Codechef_Starters_41/A/main.cpp delete mode 100755 contests/Codechef_Starters_41/B/inp delete mode 100755 contests/Codechef_Starters_41/B/main.cpp delete mode 100755 contests/Codechef_Starters_41/C/inp delete mode 100755 contests/Codechef_Starters_41/C/main.cpp delete mode 100755 contests/Codechef_Starters_41/D/inp delete mode 100755 contests/Codechef_Starters_41/D/main.cpp delete mode 100755 contests/Codechef_Starters_41/E/inp delete mode 100755 contests/Codechef_Starters_41/E/main.cpp delete mode 100755 contests/Codechef_Starters_41/F/inp delete mode 100755 contests/Codechef_Starters_41/F/main.cpp create mode 100755 contests/Edu145/A/main.cpp create mode 100644 contests/Edu145/A/main_input0.txt create mode 100644 contests/Edu145/A/main_output0.txt create mode 100755 contests/Edu145/B/main.cpp create mode 100644 contests/Edu145/B/main_input0.txt create mode 100644 contests/Edu145/B/main_input1.txt create mode 100644 contests/Edu145/B/main_input2.txt create mode 100644 contests/Edu145/B/main_input3.txt create mode 100644 contests/Edu145/B/main_input4.txt create mode 100644 contests/Edu145/B/main_output0.txt create mode 100644 contests/Edu145/B/main_output1.txt create mode 100644 contests/Edu145/B/main_output2.txt create mode 100644 contests/Edu145/B/main_output3.txt create mode 100644 contests/Edu145/B/main_output4.txt create mode 100755 contests/Edu146/A/main.cpp create mode 100644 contests/Edu146/A/main_input0.txt create mode 100644 contests/Edu146/A/main_input1.txt create mode 100644 contests/Edu146/A/main_output0.txt create mode 100644 contests/Edu146/A/main_output1.txt delete mode 100755 contests/EduRound145/A/main.cpp delete mode 100644 contests/EduRound145/A/main_input0.txt delete mode 100644 contests/EduRound145/A/main_output0.txt delete mode 100755 contests/EduRound145/B/main.cpp delete mode 100644 contests/EduRound145/B/main_input0.txt delete mode 100644 contests/EduRound145/B/main_input1.txt delete mode 100644 contests/EduRound145/B/main_input2.txt delete mode 100644 contests/EduRound145/B/main_input3.txt delete mode 100644 contests/EduRound145/B/main_input4.txt delete mode 100644 contests/EduRound145/B/main_output0.txt delete mode 100644 contests/EduRound145/B/main_output1.txt delete mode 100644 contests/EduRound145/B/main_output2.txt delete mode 100644 contests/EduRound145/B/main_output3.txt delete mode 100644 contests/EduRound145/B/main_output4.txt delete mode 100755 contests/EduRound145/C/main.cpp delete mode 100755 contests/EduRound145/D/main.cpp delete mode 100755 contests/EduRound145/E/main.cpp delete mode 100755 contests/EduRound145/F/main.cpp delete mode 100755 contests/EduRound146/A/main.cpp delete mode 100644 contests/EduRound146/A/main_input0.txt delete mode 100644 contests/EduRound146/A/main_input1.txt delete mode 100644 contests/EduRound146/A/main_output0.txt delete mode 100644 contests/EduRound146/A/main_output1.txt delete mode 100755 contests/EduRound146/B/main.cpp delete mode 100755 contests/EduRound146/C/main.cpp delete mode 100755 contests/EduRound146/D/main.cpp delete mode 100755 contests/EduRound146/E/main.cpp delete mode 100755 contests/EduRound146/F/main.cpp delete mode 100755 contests/Round153(Edu)/A/main.cpp delete mode 100755 contests/Round153(Edu)/B/main.cpp delete mode 100755 contests/Round153(Edu)/C/main.cpp delete mode 100755 contests/Round153(Edu)/D/main.cpp delete mode 100755 contests/Round153(Edu)/E/main.cpp delete mode 100755 contests/Round153(Edu)/F/main.cpp delete mode 100755 contests/Round788/B/B.cpp delete mode 100755 contests/Round788/C/C.cpp delete mode 100755 contests/Round788/D/D.cpp delete mode 100755 contests/Round788/E/E.cpp delete mode 100755 contests/Round788/F/F.cpp delete mode 100755 contests/Round825/B/main.cpp delete mode 100755 contests/Round825/C/main.cpp delete mode 100755 contests/Round825/D/main.cpp delete mode 100755 contests/Round825/E/main.cpp delete mode 100755 contests/Round825/F/main.cpp delete mode 100755 contests/Round828/E/main.cpp delete mode 100755 contests/Round828/Round#828/A/main.cpp delete mode 100755 contests/Round828/Round#828/B/main.cpp delete mode 100755 contests/Round828/Round#828/B/main_input0.txt delete mode 100755 contests/Round828/Round#828/B/main_output0.txt delete mode 100755 contests/Round828/Round#828/C/main.cpp delete mode 100755 contests/Round828/Round#828/C/main_input0.txt delete mode 100755 contests/Round828/Round#828/C/main_output0.txt delete mode 100755 contests/Round828/Round#828/D/main.cpp delete mode 100755 contests/Round828/Round#828/E/main.cpp delete mode 100755 contests/Round828/Round#828/F/main.cpp delete mode 100755 contests/Round849/G2Joe/main.cpp delete mode 100644 contests/Round849/G2Joe/main_input0.txt delete mode 100644 contests/Round849/G2Joe/main_input1.txt delete mode 100644 contests/Round849/G2Joe/main_input2.txt delete mode 100644 contests/Round849/G2Joe/main_output0.txt delete mode 100644 contests/Round849/G2Joe/main_output1.txt delete mode 100644 contests/Round849/G2Joe/main_output2.txt delete mode 100755 contests/Round853/C/main.cpp delete mode 100755 contests/Round853/D/main.cpp delete mode 100755 contests/Round853/E/main.cpp delete mode 100755 contests/Round853/F/main.cpp delete mode 100755 contests/Round855/E/main.cpp delete mode 100755 contests/Round855/F/main.cpp delete mode 100755 contests/Round856/D/main.cpp delete mode 100755 contests/Round856/E/main.cpp delete mode 100755 contests/Round856/F/main.cpp delete mode 100755 contests/Round857/C/main.cpp delete mode 100755 contests/Round857/D/main.cpp delete mode 100755 contests/Round857/E/main.cpp delete mode 100755 contests/Round857/F/main.cpp delete mode 100755 contests/Round859/E/main.cpp delete mode 100755 contests/Round859/F/main.cpp delete mode 100755 contests/Round860/C/main.cpp delete mode 100755 contests/Round860/D/main.cpp delete mode 100755 contests/Round860/E/main.cpp delete mode 100755 contests/Round860/F/main.cpp delete mode 100755 contests/Round862/D/main.cpp delete mode 100755 contests/Round862/E/main.cpp delete mode 100755 contests/Round862/F/main.cpp delete mode 100755 contests/Round864/C/main.cpp delete mode 100755 contests/Round864/D/main.cpp delete mode 100755 contests/Round864/E/main.cpp delete mode 100755 contests/Round864/F/main.cpp delete mode 100755 contests/Round865/A/main.cpp delete mode 100755 contests/Round865/B/main.cpp delete mode 100755 contests/Round865/C/main.cpp delete mode 100755 contests/Round865/D/main.cpp delete mode 100755 contests/Round865/E/main.cpp delete mode 100755 contests/Round865/F/main.cpp delete mode 100755 contests/Round886/E/main.cpp delete mode 100755 contests/Round886/F/main.cpp delete mode 100755 contests/Round887/C/main.cpp delete mode 100755 contests/Round887/D/main.cpp delete mode 100755 contests/Round887/E/main.cpp delete mode 100755 contests/Round887/F/main.cpp delete mode 100755 contests/Round891/D/main.cpp delete mode 100755 contests/Round891/E/main.cpp delete mode 100755 contests/Round891/F/main.cpp delete mode 100755 contests/Round894/E/main.cpp delete mode 100755 contests/Round894/F/main.cpp delete mode 100755 contests/Round895/F/main.cpp delete mode 100755 contests/Round896/C/main.cpp delete mode 100755 contests/Round896/D/main.cpp delete mode 100755 contests/Round896/E/main.cpp delete mode 100755 contests/Round896/F/main.cpp delete mode 100755 contests/Round897/C/main.cpp delete mode 100755 contests/Round897/D/main.cpp delete mode 100755 contests/Round897/E/main.cpp delete mode 100755 contests/Round897/F/main.cpp delete mode 100644 contests/Round899/B/] delete mode 100755 contests/Round899/C/main.cpp delete mode 100755 contests/Round899/D/main.cpp delete mode 100755 contests/Round899/E/main.cpp delete mode 100755 contests/Round899/F/main.cpp delete mode 100755 contests/Round900/D/main.cpp delete mode 100755 contests/Round900/E/main.cpp delete mode 100644 contests/Round900/E/main_input0.txt delete mode 100644 contests/Round900/E/main_output0.txt delete mode 100755 contests/Round900/F/main.cpp delete mode 100755 contests/Round901/C/main.cpp delete mode 100755 contests/Round901/D/main.cpp delete mode 100755 contests/Round901/E/main.cpp delete mode 100755 contests/Round901/F/main.cpp create mode 100755 contests/Starters41/A/inp create mode 100755 contests/Starters41/A/main.cpp create mode 100755 contests/Starters41/B/inp create mode 100755 contests/Starters41/B/main.cpp create mode 100755 contests/Starters41/C/inp create mode 100755 contests/Starters41/C/main.cpp create mode 100755 contests/Starters41/D/inp create mode 100755 contests/Starters41/D/main.cpp create mode 100755 contests/Starters41/E/inp create mode 100755 contests/Starters41/E/main.cpp create mode 100755 contests/Starters41/F/inp create mode 100755 contests/Starters41/F/main.cpp delete mode 100755 contests/Starters78/E/main.cpp delete mode 100755 contests/Starters78/F/main.cpp delete mode 100755 contests/Starters79/E/main.cpp delete mode 100755 contests/Starters79/F/main.cpp delete mode 100755 contests/Starters80/F/main.cpp delete mode 100644 contests/Starters80/main.cpp delete mode 100644 contests/Starters80/main_input0.txt delete mode 100644 contests/Starters80/main_output0.txt delete mode 100755 contests/Starters82/F/main.cpp (limited to 'contests') diff --git a/contests/Codechef_Starters_41/A/inp b/contests/Codechef_Starters_41/A/inp deleted file mode 100755 index a5b6096..0000000 --- a/contests/Codechef_Starters_41/A/inp +++ /dev/null @@ -1 +0,0 @@ -7 9 diff --git a/contests/Codechef_Starters_41/A/main.cpp b/contests/Codechef_Starters_41/A/main.cpp deleted file mode 100755 index c51d4a4..0000000 --- a/contests/Codechef_Starters_41/A/main.cpp +++ /dev/null @@ -1,11 +0,0 @@ -#include - -using namespace std; - -int main () { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int x, y; - cin >> x >> y; - cout << (y > x ? "YES" : "NO") << endl; -} diff --git a/contests/Codechef_Starters_41/B/inp b/contests/Codechef_Starters_41/B/inp deleted file mode 100755 index c7f56f2..0000000 --- a/contests/Codechef_Starters_41/B/inp +++ /dev/null @@ -1,5 +0,0 @@ -4 -10 10 10 -3 1 8 -8 1 3 -4 4 1000 diff --git a/contests/Codechef_Starters_41/B/main.cpp b/contests/Codechef_Starters_41/B/main.cpp deleted file mode 100755 index 6508f2d..0000000 --- a/contests/Codechef_Starters_41/B/main.cpp +++ /dev/null @@ -1,16 +0,0 @@ -#include - -using namespace std; - -int main () { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while(tt--){ - int x, y , z; - cin >> x >> y >> z; - cout << (x * 5 + y * 10) / z << endl; - - } -} diff --git a/contests/Codechef_Starters_41/C/inp b/contests/Codechef_Starters_41/C/inp deleted file mode 100755 index 969fe00..0000000 --- a/contests/Codechef_Starters_41/C/inp +++ /dev/null @@ -1,5 +0,0 @@ -4 -5 10 2 12 -10 30 15 15 -20 8 4 20 -6 6 6 6 diff --git a/contests/Codechef_Starters_41/C/main.cpp b/contests/Codechef_Starters_41/C/main.cpp deleted file mode 100755 index 8ee0595..0000000 --- a/contests/Codechef_Starters_41/C/main.cpp +++ /dev/null @@ -1,24 +0,0 @@ -#include - - -using namespace std; - -int main() { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while (tt--) { - int a, b, c, d; - cin >> a >> b >> c >> d; - int mx1 = max(a, b); - int mx2 = max(c, d); - if (mx1 > mx2) { - cout << "Q" << endl; - } else if (mx2 > mx1) { - cout << "P" << endl; - } else { - cout << "TIE" << endl; - } - } -} diff --git a/contests/Codechef_Starters_41/D/inp b/contests/Codechef_Starters_41/D/inp deleted file mode 100755 index 55e3ef3..0000000 --- a/contests/Codechef_Starters_41/D/inp +++ /dev/null @@ -1,6 +0,0 @@ -5 -3 4 -5 5 -7 3 -5 2 -7 12 diff --git a/contests/Codechef_Starters_41/D/main.cpp b/contests/Codechef_Starters_41/D/main.cpp deleted file mode 100755 index a0365c2..0000000 --- a/contests/Codechef_Starters_41/D/main.cpp +++ /dev/null @@ -1,26 +0,0 @@ -#include -#include - -using namespace std; - -int main () { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while(tt--){ - int x, y; - cin >> x >> y; - if(x > y) { - if((x - y) % 2 == 0) { - cout << (x - y) / 2 << endl; - } else { - cout << (x - y) / 2 + 2 << endl; - } - } else if (y > x) { - cout << y - x << endl; - } else { - cout << 0 << endl; - } - } -} diff --git a/contests/Codechef_Starters_41/E/inp b/contests/Codechef_Starters_41/E/inp deleted file mode 100755 index ceb48d2..0000000 --- a/contests/Codechef_Starters_41/E/inp +++ /dev/null @@ -1,5 +0,0 @@ -4 -1 0 -2 0 -2 1 -3 1 diff --git a/contests/Codechef_Starters_41/E/main.cpp b/contests/Codechef_Starters_41/E/main.cpp deleted file mode 100755 index b65501c..0000000 --- a/contests/Codechef_Starters_41/E/main.cpp +++ /dev/null @@ -1,19 +0,0 @@ -#include - -using namespace std; - -int main () { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while(tt--){ - int n, k; - cin >> n >> k; - if(n % 2 != 0 && k == 0){ - cout << "NO" << endl; - } else { - cout << "YES" << endl; - } - } -} diff --git a/contests/Codechef_Starters_41/F/inp b/contests/Codechef_Starters_41/F/inp deleted file mode 100755 index 77308bf..0000000 --- a/contests/Codechef_Starters_41/F/inp +++ /dev/null @@ -1,6 +0,0 @@ -4 -4 2 -3 3 -9 1 -3489601027782 8104267 - diff --git a/contests/Codechef_Starters_41/F/main.cpp b/contests/Codechef_Starters_41/F/main.cpp deleted file mode 100755 index 8159cd1..0000000 --- a/contests/Codechef_Starters_41/F/main.cpp +++ /dev/null @@ -1,21 +0,0 @@ -#include - -using namespace std; - -int main() { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while (tt--) { - long long n, k; - cin >> n >> k; - if (k == 1) { - cout << ((n % 2 == 0) ? "EVEN" : "ODD") << endl; - } else if(k == 2) { - cout << "ODD" << endl; - } else { - cout << "EVEN" << endl; - } - } -} diff --git a/contests/Edu145/A/main.cpp b/contests/Edu145/A/main.cpp new file mode 100755 index 0000000..171d87c --- /dev/null +++ b/contests/Edu145/A/main.cpp @@ -0,0 +1,152 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + string s; + cin >> s; + set st; + map mp; + for (auto ch : s) { + st.insert(ch); + mp[ch]++; + } + for (auto ch : st) { + if (mp[ch] == 3) { + cout << 6 << '\n'; + return; + } else if (mp[ch] == 4) { + cout << -1 << '\n'; + return; + } + } + cout << 4 << '\n'; + + + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Edu145/A/main_input0.txt b/contests/Edu145/A/main_input0.txt new file mode 100644 index 0000000..4fa6caf --- /dev/null +++ b/contests/Edu145/A/main_input0.txt @@ -0,0 +1,4 @@ +3 +9546 +0000 +3313 diff --git a/contests/Edu145/A/main_output0.txt b/contests/Edu145/A/main_output0.txt new file mode 100644 index 0000000..5aa0822 --- /dev/null +++ b/contests/Edu145/A/main_output0.txt @@ -0,0 +1,3 @@ +4 +-1 +6 diff --git a/contests/Edu145/B/main.cpp b/contests/Edu145/B/main.cpp new file mode 100755 index 0000000..f95b893 --- /dev/null +++ b/contests/Edu145/B/main.cpp @@ -0,0 +1,150 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +ll mySqrt(ll a) { + ll l = 0, r = 1e9 + 1; + while (l + 1 < r) { + ll m = (l + r) / 2; + if (m * m <= a) { + l = m; + } else { + r = m; + } + } + return l; +} + +void solve() { + ll n; + cin >> n; + cout << (ll)sqrt(n - 1) << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Edu145/B/main_input0.txt b/contests/Edu145/B/main_input0.txt new file mode 100644 index 0000000..e383f1f --- /dev/null +++ b/contests/Edu145/B/main_input0.txt @@ -0,0 +1,5 @@ +4 +1 +3 +5 +975461057789971042 diff --git a/contests/Edu145/B/main_input1.txt b/contests/Edu145/B/main_input1.txt new file mode 100644 index 0000000..42a2f8b --- /dev/null +++ b/contests/Edu145/B/main_input1.txt @@ -0,0 +1,2 @@ +1 +6 \ No newline at end of file diff --git a/contests/Edu145/B/main_input2.txt b/contests/Edu145/B/main_input2.txt new file mode 100644 index 0000000..051f23d --- /dev/null +++ b/contests/Edu145/B/main_input2.txt @@ -0,0 +1,4 @@ +3 +2 +4 +16 \ No newline at end of file diff --git a/contests/Edu145/B/main_input3.txt b/contests/Edu145/B/main_input3.txt new file mode 100644 index 0000000..ee95794 --- /dev/null +++ b/contests/Edu145/B/main_input3.txt @@ -0,0 +1,6 @@ +5 +9 +10 +12 +15 +16 \ No newline at end of file diff --git a/contests/Edu145/B/main_input4.txt b/contests/Edu145/B/main_input4.txt new file mode 100644 index 0000000..ccb572c --- /dev/null +++ b/contests/Edu145/B/main_input4.txt @@ -0,0 +1,2 @@ +1 +1000000000000000000 \ No newline at end of file diff --git a/contests/Edu145/B/main_output0.txt b/contests/Edu145/B/main_output0.txt new file mode 100644 index 0000000..00eb37d --- /dev/null +++ b/contests/Edu145/B/main_output0.txt @@ -0,0 +1,4 @@ +0 +1 +2 +987654321 diff --git a/contests/Edu145/B/main_output1.txt b/contests/Edu145/B/main_output1.txt new file mode 100644 index 0000000..d8263ee --- /dev/null +++ b/contests/Edu145/B/main_output1.txt @@ -0,0 +1 @@ +2 \ No newline at end of file diff --git a/contests/Edu145/B/main_output2.txt b/contests/Edu145/B/main_output2.txt new file mode 100644 index 0000000..da8092b --- /dev/null +++ b/contests/Edu145/B/main_output2.txt @@ -0,0 +1,3 @@ +1 +2 +4 \ No newline at end of file diff --git a/contests/Edu145/B/main_output3.txt b/contests/Edu145/B/main_output3.txt new file mode 100644 index 0000000..d78555d --- /dev/null +++ b/contests/Edu145/B/main_output3.txt @@ -0,0 +1,5 @@ +3 +3 +3 +3 +4 \ No newline at end of file diff --git a/contests/Edu145/B/main_output4.txt b/contests/Edu145/B/main_output4.txt new file mode 100644 index 0000000..21ce28a --- /dev/null +++ b/contests/Edu145/B/main_output4.txt @@ -0,0 +1 @@ +1000000000 \ No newline at end of file diff --git a/contests/Edu146/A/main.cpp b/contests/Edu146/A/main.cpp new file mode 100755 index 0000000..97747e0 --- /dev/null +++ b/contests/Edu146/A/main.cpp @@ -0,0 +1,140 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + ll k, n; + cin >> n >> k; + ll rem = n % k; + ll m = n - k; + bool ok = 0; + if (rem % 2 == 0 || m % 2 == 0 || n % 2 ==0) { + ok = 1; + } + cout << (ok ? "YES" : "NO") << "\n"; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Edu146/A/main_input0.txt b/contests/Edu146/A/main_input0.txt new file mode 100644 index 0000000..84da454 --- /dev/null +++ b/contests/Edu146/A/main_input0.txt @@ -0,0 +1,5 @@ +4 +5 3 +6 1 +7 4 +8 8 diff --git a/contests/Edu146/A/main_input1.txt b/contests/Edu146/A/main_input1.txt new file mode 100644 index 0000000..7692957 --- /dev/null +++ b/contests/Edu146/A/main_input1.txt @@ -0,0 +1,2 @@ +1 +15 7 \ No newline at end of file diff --git a/contests/Edu146/A/main_output0.txt b/contests/Edu146/A/main_output0.txt new file mode 100644 index 0000000..16c3a96 --- /dev/null +++ b/contests/Edu146/A/main_output0.txt @@ -0,0 +1,4 @@ +YES +YES +NO +YES diff --git a/contests/Edu146/A/main_output1.txt b/contests/Edu146/A/main_output1.txt new file mode 100644 index 0000000..d2bb323 --- /dev/null +++ b/contests/Edu146/A/main_output1.txt @@ -0,0 +1 @@ +YES \ No newline at end of file diff --git a/contests/EduRound145/A/main.cpp b/contests/EduRound145/A/main.cpp deleted file mode 100755 index 171d87c..0000000 --- a/contests/EduRound145/A/main.cpp +++ /dev/null @@ -1,152 +0,0 @@ -#include -using namespace std; - -using ll = long long; -using pii = pair; -using vpi = vector; -using vi = vector; -using vll = vector; -using mpii = map; -using mpll = map; -using db = long double; - -#define pb push_back -#define all(x) (x).begin(), (x).end() -#define rall(x) (x).rbegin(), (x).rend() -#define lb lower_bound -#define ub upper_bound -#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) -#define ceil(a, b) ((a) + (b) - 1) / (b)) - -const int MOD = (int)1e9 + 7; -const db PI = acos((db)-1); -const int dx[4]{1, 0, -1, 0}; -const int dy[4]{0, 1, 0, -1}; - -template ostream& operator<<(ostream& os, const pair& p); -template ostream& operator<<(ostream& os, const vector& vec); -template ostream& operator<<(ostream& os, const map& m); -template ostream& operator<<(ostream& os, const unordered_map& m); -template ostream& operator<<(ostream& os, const set& s); -template ostream& operator<<(ostream& os, const unordered_set& s); - -template -ostream& operator<<(ostream& os, const pair& p) { - os << "(" << p.first << ", " << p.second << ")"; - return os; -} - -template -ostream& operator<<(ostream& os, const vector& vec) { - os << "{"; - for (size_t i = 0; i < vec.size(); ++i) { - if (i > 0) os << ", "; - os << vec[i]; - } - os << "}"; - return os; -} - - -template -ostream& operator<<(ostream& os, const map& m) { - os << "{"; - for (const auto& p : m) { - os << p.first << ": " << p.second << ", "; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const unordered_map& m) { - os << "{"; - for (const auto& p : m) { - os << p.first << ": " << p.second << ", "; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const set& s) { - int i = 0; - os << "{"; - for (const auto& e : s) { - if (i > 0) os << ", "; - os << e; - i++; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const unordered_set& s) { - int i = 0; - os << "{"; - for (const auto& e : s) { - if (i > 0) os << ", "; - os << e; - i++; - } - os << "}"; - return os; -} - -void print() { - cerr << "\n"; -} - -template -void print(T val, TS... vals) { - cerr << val << " "; - print(vals...); -} - - - -/* stuff you should look for: - --------------------------- - * special cases (n=1?) - * int overflow, array bounds - * do smth instead of nothing and stay organized - * WRITE STUFF DOWN - * DON'T GET STUCK ON ONE APPROACH - */ - -void solve() { - string s; - cin >> s; - set st; - map mp; - for (auto ch : s) { - st.insert(ch); - mp[ch]++; - } - for (auto ch : st) { - if (mp[ch] == 3) { - cout << 6 << '\n'; - return; - } else if (mp[ch] == 4) { - cout << -1 << '\n'; - return; - } - } - cout << 4 << '\n'; - - - -} - -int main () { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while(tt--) { - solve(); - } -} - - diff --git a/contests/EduRound145/A/main_input0.txt b/contests/EduRound145/A/main_input0.txt deleted file mode 100644 index 4fa6caf..0000000 --- a/contests/EduRound145/A/main_input0.txt +++ /dev/null @@ -1,4 +0,0 @@ -3 -9546 -0000 -3313 diff --git a/contests/EduRound145/A/main_output0.txt b/contests/EduRound145/A/main_output0.txt deleted file mode 100644 index 5aa0822..0000000 --- a/contests/EduRound145/A/main_output0.txt +++ /dev/null @@ -1,3 +0,0 @@ -4 --1 -6 diff --git a/contests/EduRound145/B/main.cpp b/contests/EduRound145/B/main.cpp deleted file mode 100755 index f95b893..0000000 --- a/contests/EduRound145/B/main.cpp +++ /dev/null @@ -1,150 +0,0 @@ -#include -using namespace std; - -using ll = long long; -using pii = pair; -using vpi = vector; -using vi = vector; -using vll = vector; -using mpii = map; -using mpll = map; -using db = long double; - -#define pb push_back -#define all(x) (x).begin(), (x).end() -#define rall(x) (x).rbegin(), (x).rend() -#define lb lower_bound -#define ub upper_bound -#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) -#define ceil(a, b) ((a) + (b) - 1) / (b)) - - -const int MOD = (int)1e9 + 7; -const db PI = acos((db)-1); -const int dx[4]{1, 0, -1, 0}; -const int dy[4]{0, 1, 0, -1}; - -template ostream& operator<<(ostream& os, const pair& p); -template ostream& operator<<(ostream& os, const vector& vec); -template ostream& operator<<(ostream& os, const map& m); -template ostream& operator<<(ostream& os, const unordered_map& m); -template ostream& operator<<(ostream& os, const set& s); -template ostream& operator<<(ostream& os, const unordered_set& s); - - -template -ostream& operator<<(ostream& os, const pair& p) { - os << "(" << p.first << ", " << p.second << ")"; - return os; -} - -template -ostream& operator<<(ostream& os, const vector& vec) { - os << "{"; - for (size_t i = 0; i < vec.size(); ++i) { - if (i > 0) os << ", "; - os << vec[i]; - } - os << "}"; - return os; -} - - -template -ostream& operator<<(ostream& os, const map& m) { - os << "{"; - for (const auto& p : m) { - os << p.first << ": " << p.second << ", "; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const unordered_map& m) { - os << "{"; - for (const auto& p : m) { - os << p.first << ": " << p.second << ", "; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const set& s) { - int i = 0; - os << "{"; - for (const auto& e : s) { - if (i > 0) os << ", "; - os << e; - i++; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const unordered_set& s) { - int i = 0; - os << "{"; - for (const auto& e : s) { - if (i > 0) os << ", "; - os << e; - i++; - } - os << "}"; - return os; -} - - -void print() { - cerr << "\n"; -} - -template -void print(T val, TS... vals) { - cerr << val << " "; - print(vals...); -} - - - -/* stuff you should look for: - --------------------------- - * special cases (n=1?) - * int overflow, array bounds - * do smth instead of nothing and stay organized - * WRITE STUFF DOWN - * DON'T GET STUCK ON ONE APPROACH - */ - -ll mySqrt(ll a) { - ll l = 0, r = 1e9 + 1; - while (l + 1 < r) { - ll m = (l + r) / 2; - if (m * m <= a) { - l = m; - } else { - r = m; - } - } - return l; -} - -void solve() { - ll n; - cin >> n; - cout << (ll)sqrt(n - 1) << '\n'; -} - -int main () { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while(tt--) { - solve(); - } -} - - diff --git a/contests/EduRound145/B/main_input0.txt b/contests/EduRound145/B/main_input0.txt deleted file mode 100644 index e383f1f..0000000 --- a/contests/EduRound145/B/main_input0.txt +++ /dev/null @@ -1,5 +0,0 @@ -4 -1 -3 -5 -975461057789971042 diff --git a/contests/EduRound145/B/main_input1.txt b/contests/EduRound145/B/main_input1.txt deleted file mode 100644 index 42a2f8b..0000000 --- a/contests/EduRound145/B/main_input1.txt +++ /dev/null @@ -1,2 +0,0 @@ -1 -6 \ No newline at end of file diff --git a/contests/EduRound145/B/main_input2.txt b/contests/EduRound145/B/main_input2.txt deleted file mode 100644 index 051f23d..0000000 --- a/contests/EduRound145/B/main_input2.txt +++ /dev/null @@ -1,4 +0,0 @@ -3 -2 -4 -16 \ No newline at end of file diff --git a/contests/EduRound145/B/main_input3.txt b/contests/EduRound145/B/main_input3.txt deleted file mode 100644 index ee95794..0000000 --- a/contests/EduRound145/B/main_input3.txt +++ /dev/null @@ -1,6 +0,0 @@ -5 -9 -10 -12 -15 -16 \ No newline at end of file diff --git a/contests/EduRound145/B/main_input4.txt b/contests/EduRound145/B/main_input4.txt deleted file mode 100644 index ccb572c..0000000 --- a/contests/EduRound145/B/main_input4.txt +++ /dev/null @@ -1,2 +0,0 @@ -1 -1000000000000000000 \ No newline at end of file diff --git a/contests/EduRound145/B/main_output0.txt b/contests/EduRound145/B/main_output0.txt deleted file mode 100644 index 00eb37d..0000000 --- a/contests/EduRound145/B/main_output0.txt +++ /dev/null @@ -1,4 +0,0 @@ -0 -1 -2 -987654321 diff --git a/contests/EduRound145/B/main_output1.txt b/contests/EduRound145/B/main_output1.txt deleted file mode 100644 index d8263ee..0000000 --- a/contests/EduRound145/B/main_output1.txt +++ /dev/null @@ -1 +0,0 @@ -2 \ No newline at end of file diff --git a/contests/EduRound145/B/main_output2.txt b/contests/EduRound145/B/main_output2.txt deleted file mode 100644 index da8092b..0000000 --- a/contests/EduRound145/B/main_output2.txt +++ /dev/null @@ -1,3 +0,0 @@ -1 -2 -4 \ No newline at end of file diff --git a/contests/EduRound145/B/main_output3.txt b/contests/EduRound145/B/main_output3.txt deleted file mode 100644 index d78555d..0000000 --- a/contests/EduRound145/B/main_output3.txt +++ /dev/null @@ -1,5 +0,0 @@ -3 -3 -3 -3 -4 \ No newline at end of file diff --git a/contests/EduRound145/B/main_output4.txt b/contests/EduRound145/B/main_output4.txt deleted file mode 100644 index 21ce28a..0000000 --- a/contests/EduRound145/B/main_output4.txt +++ /dev/null @@ -1 +0,0 @@ -1000000000 \ No newline at end of file diff --git a/contests/EduRound145/C/main.cpp b/contests/EduRound145/C/main.cpp deleted file mode 100755 index 8cfbed2..0000000 --- a/contests/EduRound145/C/main.cpp +++ /dev/null @@ -1,136 +0,0 @@ -#include -using namespace std; - -using ll = long long; -using pii = pair; -using vpi = vector; -using vi = vector; -using vll = vector; -using mpii = map; -using mpll = map; -using db = long double; - -#define pb push_back -#define all(x) (x).begin(), (x).end() -#define rall(x) (x).rbegin(), (x).rend() -#define lb lower_bound -#define ub upper_bound -#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) -#define ceil(a, b) ((a) + (b) - 1) / (b)) - -const int MOD = (int)1e9 + 7; -const db PI = acos((db)-1); -const int dx[4]{1, 0, -1, 0}; -const int dy[4]{0, 1, 0, -1}; - -template ostream& operator<<(ostream& os, const pair& p); -template ostream& operator<<(ostream& os, const vector& vec); -template ostream& operator<<(ostream& os, const map& m); -template ostream& operator<<(ostream& os, const unordered_map& m); -template ostream& operator<<(ostream& os, const set& s); -template ostream& operator<<(ostream& os, const unordered_set& s); - -template -ostream& operator<<(ostream& os, const pair& p) { - os << "(" << p.first << ", " << p.second << ")"; - return os; -} - -template -ostream& operator<<(ostream& os, const vector& vec) { - os << "{"; - for (size_t i = 0; i < vec.size(); ++i) { - if (i > 0) os << ", "; - os << vec[i]; - } - os << "}"; - return os; -} - - -template -ostream& operator<<(ostream& os, const map& m) { - os << "{"; - for (const auto& p : m) { - os << p.first << ": " << p.second << ", "; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const unordered_map& m) { - os << "{"; - for (const auto& p : m) { - os << p.first << ": " << p.second << ", "; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const set& s) { - int i = 0; - os << "{"; - for (const auto& e : s) { - if (i > 0) os << ", "; - os << e; - i++; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const unordered_set& s) { - int i = 0; - os << "{"; - for (const auto& e : s) { - if (i > 0) os << ", "; - os << e; - i++; - } - os << "}"; - return os; -} - -void print() { - cerr << "\n"; -} - -template -void print(T val, TS... vals) { - cerr << val << " "; - print(vals...); -} - - - -/* stuff you should look for: - --------------------------- - * special cases (n=1?) - * int overflow, array bounds - * do smth instead of nothing and stay organized - * WRITE STUFF DOWN - * DON'T GET STUCK ON ONE APPROACH - */ - -void solve() { - int n, k; - cin >> n >> k; - vi a = {1, 2, -3, 4, 5}; - - -} - -int main () { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while(tt--) { - solve(); - } -} - - diff --git a/contests/EduRound145/D/main.cpp b/contests/EduRound145/D/main.cpp deleted file mode 100755 index 70c7757..0000000 --- a/contests/EduRound145/D/main.cpp +++ /dev/null @@ -1,132 +0,0 @@ -#include -using namespace std; - -using ll = long long; -using pii = pair; -using vpi = vector; -using vi = vector; -using vll = vector; -using mpii = map; -using mpll = map; -using db = long double; - -#define pb push_back -#define all(x) (x).begin(), (x).end() -#define rall(x) (x).rbegin(), (x).rend() -#define lb lower_bound -#define ub upper_bound -#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) -#define ceil(a, b) ((a) + (b) - 1) / (b)) - -const int MOD = (int)1e9 + 7; -const db PI = acos((db)-1); -const int dx[4]{1, 0, -1, 0}; -const int dy[4]{0, 1, 0, -1}; - -template ostream& operator<<(ostream& os, const pair& p); -template ostream& operator<<(ostream& os, const vector& vec); -template ostream& operator<<(ostream& os, const map& m); -template ostream& operator<<(ostream& os, const unordered_map& m); -template ostream& operator<<(ostream& os, const set& s); -template ostream& operator<<(ostream& os, const unordered_set& s); - -template -ostream& operator<<(ostream& os, const pair& p) { - os << "(" << p.first << ", " << p.second << ")"; - return os; -} - -template -ostream& operator<<(ostream& os, const vector& vec) { - os << "{"; - for (size_t i = 0; i < vec.size(); ++i) { - if (i > 0) os << ", "; - os << vec[i]; - } - os << "}"; - return os; -} - - -template -ostream& operator<<(ostream& os, const map& m) { - os << "{"; - for (const auto& p : m) { - os << p.first << ": " << p.second << ", "; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const unordered_map& m) { - os << "{"; - for (const auto& p : m) { - os << p.first << ": " << p.second << ", "; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const set& s) { - int i = 0; - os << "{"; - for (const auto& e : s) { - if (i > 0) os << ", "; - os << e; - i++; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const unordered_set& s) { - int i = 0; - os << "{"; - for (const auto& e : s) { - if (i > 0) os << ", "; - os << e; - i++; - } - os << "}"; - return os; -} - -void print() { - cerr << "\n"; -} - -template -void print(T val, TS... vals) { - cerr << val << " "; - print(vals...); -} - - - -/* stuff you should look for: - --------------------------- - * special cases (n=1?) - * int overflow, array bounds - * do smth instead of nothing and stay organized - * WRITE STUFF DOWN - * DON'T GET STUCK ON ONE APPROACH - */ - -void solve() { - -} - -int main () { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while(tt--) { - solve(); - } -} - - diff --git a/contests/EduRound145/E/main.cpp b/contests/EduRound145/E/main.cpp deleted file mode 100755 index 70c7757..0000000 --- a/contests/EduRound145/E/main.cpp +++ /dev/null @@ -1,132 +0,0 @@ -#include -using namespace std; - -using ll = long long; -using pii = pair; -using vpi = vector; -using vi = vector; -using vll = vector; -using mpii = map; -using mpll = map; -using db = long double; - -#define pb push_back -#define all(x) (x).begin(), (x).end() -#define rall(x) (x).rbegin(), (x).rend() -#define lb lower_bound -#define ub upper_bound -#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) -#define ceil(a, b) ((a) + (b) - 1) / (b)) - -const int MOD = (int)1e9 + 7; -const db PI = acos((db)-1); -const int dx[4]{1, 0, -1, 0}; -const int dy[4]{0, 1, 0, -1}; - -template ostream& operator<<(ostream& os, const pair& p); -template ostream& operator<<(ostream& os, const vector& vec); -template ostream& operator<<(ostream& os, const map& m); -template ostream& operator<<(ostream& os, const unordered_map& m); -template ostream& operator<<(ostream& os, const set& s); -template ostream& operator<<(ostream& os, const unordered_set& s); - -template -ostream& operator<<(ostream& os, const pair& p) { - os << "(" << p.first << ", " << p.second << ")"; - return os; -} - -template -ostream& operator<<(ostream& os, const vector& vec) { - os << "{"; - for (size_t i = 0; i < vec.size(); ++i) { - if (i > 0) os << ", "; - os << vec[i]; - } - os << "}"; - return os; -} - - -template -ostream& operator<<(ostream& os, const map& m) { - os << "{"; - for (const auto& p : m) { - os << p.first << ": " << p.second << ", "; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const unordered_map& m) { - os << "{"; - for (const auto& p : m) { - os << p.first << ": " << p.second << ", "; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const set& s) { - int i = 0; - os << "{"; - for (const auto& e : s) { - if (i > 0) os << ", "; - os << e; - i++; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const unordered_set& s) { - int i = 0; - os << "{"; - for (const auto& e : s) { - if (i > 0) os << ", "; - os << e; - i++; - } - os << "}"; - return os; -} - -void print() { - cerr << "\n"; -} - -template -void print(T val, TS... vals) { - cerr << val << " "; - print(vals...); -} - - - -/* stuff you should look for: - --------------------------- - * special cases (n=1?) - * int overflow, array bounds - * do smth instead of nothing and stay organized - * WRITE STUFF DOWN - * DON'T GET STUCK ON ONE APPROACH - */ - -void solve() { - -} - -int main () { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while(tt--) { - solve(); - } -} - - diff --git a/contests/EduRound145/F/main.cpp b/contests/EduRound145/F/main.cpp deleted file mode 100755 index 70c7757..0000000 --- a/contests/EduRound145/F/main.cpp +++ /dev/null @@ -1,132 +0,0 @@ -#include -using namespace std; - -using ll = long long; -using pii = pair; -using vpi = vector; -using vi = vector; -using vll = vector; -using mpii = map; -using mpll = map; -using db = long double; - -#define pb push_back -#define all(x) (x).begin(), (x).end() -#define rall(x) (x).rbegin(), (x).rend() -#define lb lower_bound -#define ub upper_bound -#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) -#define ceil(a, b) ((a) + (b) - 1) / (b)) - -const int MOD = (int)1e9 + 7; -const db PI = acos((db)-1); -const int dx[4]{1, 0, -1, 0}; -const int dy[4]{0, 1, 0, -1}; - -template ostream& operator<<(ostream& os, const pair& p); -template ostream& operator<<(ostream& os, const vector& vec); -template ostream& operator<<(ostream& os, const map& m); -template ostream& operator<<(ostream& os, const unordered_map& m); -template ostream& operator<<(ostream& os, const set& s); -template ostream& operator<<(ostream& os, const unordered_set& s); - -template -ostream& operator<<(ostream& os, const pair& p) { - os << "(" << p.first << ", " << p.second << ")"; - return os; -} - -template -ostream& operator<<(ostream& os, const vector& vec) { - os << "{"; - for (size_t i = 0; i < vec.size(); ++i) { - if (i > 0) os << ", "; - os << vec[i]; - } - os << "}"; - return os; -} - - -template -ostream& operator<<(ostream& os, const map& m) { - os << "{"; - for (const auto& p : m) { - os << p.first << ": " << p.second << ", "; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const unordered_map& m) { - os << "{"; - for (const auto& p : m) { - os << p.first << ": " << p.second << ", "; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const set& s) { - int i = 0; - os << "{"; - for (const auto& e : s) { - if (i > 0) os << ", "; - os << e; - i++; - } - os << "}"; - return os; -} - -template -ostream& operator<<(ostream& os, const unordered_set& s) { - int i = 0; - os << "{"; - for (const auto& e : s) { - if (i > 0) os << ", "; - os << e; - i++; - } - os << "}"; - return os; -} - -void print() { - cerr << "\n"; -} - -template -void print(T val, TS... vals) { - cerr << val << " "; - print(vals...); -} - - - -/* stuff you should look for: - --------------------------- - * special cases (n=1?) - * int overflow, array bounds - * do smth instead of nothing and stay organized - * WRITE STUFF DOWN - * DON'T GET STUCK ON ONE APPROACH - */ - -void solve() { - -} - -int main () { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while(tt--) { - solve(); - } -} - - diff --git a/contests/EduRound146/A/main.cpp b/contests/EduRound146/A/main.cpp deleted file mode 100755 index 97747e0..0000000 --- a/contests/EduRound146/A/main.cpp +++ /dev/null @@ -1,140 +0,0 @@ -#include -using namespace std; - -using ll = long long; -using pii = pair; -using vpi = vector; -using vi = vector; -using vll = vector; -using mpii = map; -using mpll = map; -using db = long double; - -#define pb push_back -#define all(x) (x).begin(), (x).end() -#define rall(x) (x).rbegin(), (x).rend() -#define lb lower_bound -#define ub upper_bound -#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) -#define ceil(a, b) ((a) + (b) - 1) / (b)) - -const int MOD = (int)1e9 + 7; -const db PI = acos((db)-1); -const int dx[4]{1, 0, -1, 0}; -const int dy[4]{0, 1, 0, -1}; - -template ostream& operator<<(ostream& os, const pair& p); -template ostream& operator<<(ostream& os, const vector& vec); -template ostream& operator<<(ostream& os, const map& m); -template ostream& operator<<(ostream& os, const unordered_map& m); -template ostream& operator<<(ostream& os, const set& s); -template ostream& operator<<(ostream& os, const unordered_set& s); - -template -ostream& operator<<(ostream& os, const pair& p) { - os << "(" << p.first << ", " << p.second << ")"; - return os; -} - -template -ostream& operator<<(ostream& os, const vector& vec) { - os << "{"; - for (size_t i = 0; i < vec.size(); ++i) { - if (i > 0) os << ", "; - os << vec[i]; - } - os << "}"; - return os; -} - - -t