Add files via upload

Author: MathProgrammer

Contests/AtCoder Beginner Contest 063/Programs/Bugged.cpp

@@ -0,0 +1,30 @@
+#include <cstdio>
+
+#define min(a, b) (a < b ? a : b)
+
+int main()
+{
+    int no_of_elements;
+    scanf("%d", &no_of_elements);
+
+    const int oo = 1e9 + 9;
+    int sum = 0, min_non_multiple_10 = oo;
+
+    while(no_of_elements--)
+    {
+        int element;
+        scanf("%d", &element);
+
+        sum += element;
+
+        if(element%10 != 0)
+            min_non_multiple_10 = min(min_non_multiple_10, element);
+    }
+
+    if(sum%10 == 0)
+        printf("%d\n", min_non_multiple_10 == oo ? 0 : sum - min_non_multiple_10);
+    else
+        printf("%d\n", sum);
+
+    return 0;
+}

Contests/AtCoder Beginner Contest 063/Programs/Varied.cpp

@@ -0,0 +1,19 @@
+#include <iostream>
+#include <set>
+
+using namespace std;
+
+int main()
+{
+    string S;
+    cin >> S;
+
+    set <char> distinct;
+    for(int i = 0; i < S.size(); i++)
+    {
+        distinct.insert(S[i]);
+    }
+
+    cout << (distinct.size() == S.size() ? "yes" : "no") << "\n";
+    return 0;
+}

Contests/AtCoder Beginner Contest 063/Programs/Widespread.cpp

@@ -0,0 +1,68 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+#define all(v) (v).begin(), (v).end()
+typedef long long LL;
+using namespace std;
+
+int ceil(LL numerator, LL denominator)
+{
+    int quotient = numerator/denominator;
+    int remainder_exists = (numerator%denominator != 0);
+
+	return (quotient + remainder_exists);
+}
+
+int possible(vector <LL> H, LL A, LL B, LL explosions)
+{
+	for(int i = 1; i < H.size(); i++)
+	{
+		H[i] -= (explosions*B);
+	}
+
+	LL explosions_used = 0;
+	for(int i = H.size() - 1; i > 0 && H[i] > 0; i--)
+	{
+		explosions_used += ceil(H[i], A - B);
+	}
+
+	return (explosions_used <= explosions);
+}
+
+int main()
+{
+    int no_of_monsters, A, B;
+    cin >> no_of_monsters >> A >> B;
+
+    vector <LL> health(no_of_monsters + 1);
+    for(int i = 1; i <= no_of_monsters; i++)
+    	cin >> health[i];
+
+    sort(all(health));
+
+    int left_explosions = 1, right_explosions = 1e9;
+    while(left_explosions <= right_explosions)
+    {
+    	int mid_explosions = (left_explosions + right_explosions) >> 1;
+
+    	if(possible(health, A, B, mid_explosions))
+    	{
+    		if(mid_explosions == left_explosions || !possible(health, A, B, mid_explosions - 1))
+    		{
+    			cout << mid_explosions;
+    			break;
+    		}
+    		else
+    		{
+    			right_explosions = mid_explosions - 1;
+    		}
+    	}
+    	else
+    	{
+    		left_explosions = mid_explosions + 1;
+    	}
+    }
+	return 0;
+}
+