Add files via upload

Author: MathProgrammer

Contests/AtCoder Beginner Contest 123/Explanations/Five Antenna Explanation.txt

@@ -0,0 +1,22 @@
+The maximum distance between any two antenna is A[n] - A[1] 
+
+Checking only this is suffiicent.
+
+------
+
+int main()
+{
+    const int NO_OF_ANTENNA = 5;
+    vector <int> A(NO_OF_ANTENNA + 1);
+    int max_distance;
+    for(int i = 1; i <= NO_OF_ANTENNA; i++)
+    {
+        cin >> A[i];
+    }
+    cin >> max_distance;
+
+    int possible = (A[NO_OF_ANTENNA] - A[1] <= max_distance ? true : false);
+    cout << (possible ? "Yay!" : ":(") << "\n";
+
+    return 0;
+}

Contests/AtCoder Beginner Contest 123/Explanations/Five Dishes Explanation.txt

@@ -0,0 +1,30 @@
+Notice that every dish other than 1, will finish at a multiple of 10 
+
+Round up every element to the nearest multiple of 10, apart from the one with the smallest remainder modulo i 
+
+------
+
+int main()
+{
+    const int NO_OF_DISHES = 5;
+    vector <int> A(NO_OF_DISHES + 1);
+    for(int i = 1; i <= NO_OF_DISHES; i++)
+    {
+        cin >> A[i];
+    }
+
+    int total_time = 0;
+    int time_saved = 0;
+    for(int i = 1; i <= NO_OF_DISHES; i++)
+    {
+        int remaining = (A[i]%10 != 0 ? 10 - A[i]%10 : 0);
+        time_saved = max(time_saved, remaining);
+
+        total_time += A[i] + remaining;
+    }
+    total_time -= time_saved;
+
+    cout << total_time << "\n";
+
+    return 0;
+}