as

ICPC/Bakugan.cpp

@@ -10,8 +10,6 @@
 using namespace std;
 
 int main() {
-    freopen("in.in", "r", stdin);
-    freopen("ot.out", "w", stdout);
     int r, mpoints, lpoints, temp, ct = 1;
     stringstream ss;
     string buff;

URI/BrickGame.cpp

@@ -0,0 +1,69 @@
+#include <iostream>
+#include <string>
+#include <sstream>
+#include <vector>
+#include <set>
+#include <map>
+#include <list>
+#include <queue>
+#include <stack>
+#include <memory>
+#include <iomanip>
+#include <numeric>
+#include <functional>
+#include <new>
+#include <algorithm>
+#include <cmath>
+#include <cstring>
+#include <cstdlib>
+#include <cstdio>
+#include <climits>
+#include <cctype>
+#include <ctime>
+
+#define REP(i, n) for(int (i) = 0; i < n; i++)
+#define FOR(i, a, n) for(int (i) = a; i < n; i++)
+#define FORR(i, a, n) for(int (i) = a; i <= n; i++)
+#define for_each(q, s) for(typeof(s.begin()) q=s.begin(); q!=s.end(); q++)
+#define sz(n) n.size()
+#define pb(n) push_back(n)
+#define all(n) n.begin(), n.end()
+
+template<typename T> T gcd(T a, T b) {
+    if(!b) return a;
+    return gcd(b, a % b);
+}
+template<typename T> T lcm(T a, T b) {
+    return a * b / gcd(a, b);
+}
+
+template<typename T> void chmin(T& a, T b) { a = (a > b) ? b : a; }
+template<typename T> void chmax(T& a, T b) { a = (a < b) ? b : a; }
+int in() { int x; scanf("%d", &x); return x; }
+
+using namespace std;
+
+typedef long long Int;
+typedef unsigned uint;
+
+int T, N;
+int age[15];
+
+int main(void) {
+    T = in();
+
+    int i, x;
+
+    for (x = 1; x <= T; x++) {
+        N = in();
+
+        for (i = 0; i < N; i++) {
+            age[i] = in();
+        }
+
+        sort(age, age + N);
+
+        printf("Case %d: %d\n", x, age[N/2]);
+    }
+    return 0;
+}

URI/Cards.cpp

@@ -1,79 +1,35 @@
-#include <iostream>
-#include <string>
-#include <sstream>
-#include <vector>
-#include <set>
-#include <map>
-#include <list>
-#include <queue>
-#include <stack>
-#include <memory>
-#include <iomanip>
-#include <numeric>
-#include <functional>
-#include <new>
 #include <algorithm>
-#include <cmath>
-#include <cstring>
-#include <cstdlib>
 #include <cstdio>
-#include <climits>
-#include <cctype>
-#include <ctime>
-
-#define REP(i, n) for(int (i) = 0; i < n; i++)
-#define FOR(i, a, n) for(int (i) = a; i < n; i++)
-#define FORR(i, a, n) for(int (i) = a; i <= n; i++)
-#define for_each(q, s) for(typeof(s.begin()) q=s.begin(); q!=s.end(); q++)
-#define sz(n) n.size()
-#define pb(n) push_back(n)
-#define all(n) n.begin(), n.end()
-
-template<typename T> T gcd(T a, T b) {
-    if(!b) return a;
-    return gcd(b, a % b);
-}
-template<typename T> T lcm(T a, T b) {
-    return a * b / gcd(a, b);
-}
-
-template<typename T> void chmin(T& a, T b) { a = (a > b) ? b : a; }
-template<typename T> void chmax(T& a, T b) { a = (a < b) ? b : a; }
-int in() { int x; scanf("%d", &x); return x; }
 
 using namespace std;
 
 typedef long long Int;
-typedef unsigned uint;
 
-const int MAXN = 10007;
+const int MAXN = 10107;
 int N;
 
 Int dp[MAXN][MAXN];
 int V[MAXN];
 
 Int func(int i, int j) {
-    if (i > j) return 0LL;
-    if (i + 1 == j) return max(V[i], V[j]);
+    if (i + 1 == j) return (Int) max(V[i], V[j]);
 
     Int& ans = dp[i][j];
 
     if (ans != -1) return ans;
 
-    Int l = V[i] + min(func(i + 2, j), func(i + 1, j - 1));
-    Int r = V[j] + min(func(i, j - 2), func(i + 1, j - 1));
-
-    return ans = max(l, r);
+    return ans = max(V[i] + min(func(i + 2, j), func(i + 1, j - 1)), V[j] + min(func(i, j - 2), func(i + 1, j - 1)));
 }
 
 int main(void) {
     freopen("i.in", "r", stdin);
-    int i;
+    freopen("o.ot", "w", stdout);
+    int i, j;
     for ( ; scanf("%d", &N) == 1; ) {
         for (i = 0; i < N; i++) {
-            V[i] = in();
+            scanf("%d", &V[i]);
         }
-        memset(dp, -1, sizeof(dp));
+        for (i = 0; i < N; i++) for (j = i + 1; j < N; j++) dp[i][j] = -1LL;
         printf("%lld\n", func(0, N - 1));
     }
     return 0;

URI/HeadOrTail.com

@@ -0,0 +1,53 @@
+#include <iostream>
+#include <string>
+#include <sstream>
+#include <vector>
+#include <set>
+#include <map>
+#include <list>
+#include <queue>
+#include <stack>
+#include <memory>
+#include <iomanip>
+#include <numeric>
+#include <functional>
+#include <new>
+#include <algorithm>
+#include <cmath>
+#include <cstring>
+#include <cstdlib>
+#include <cstdio>
+#include <climits>
+#include <cctype>
+#include <ctime>
+
+#define REP(i, n) for(int (i) = 0; i < n; i++)
+#define FOR(i, a, n) for(int (i) = a; i < n; i++)
+#define FORR(i, a, n) for(int (i) = a; i <= n; i++)
+#define for_each(q, s) for(typeof(s.begin()) q=s.begin(); q!=s.end(); q++)
+#define sz(n) n.size()
+#define pb(n) push_back(n)
+#define all(n) n.begin(), n.end()
+
+template<typename T> T gcd(T a, T b) {
+    if(!b) return a;
+    return gcd(b, a % b);
+}
+template<typename T> T lcm(T a, T b) {
+    return a * b / gcd(a, b);
+}
+
+template<typename T> void chmin(T& a, T b) { a = (a > b) ? b : a; }
+template<typename T> void chmax(T& a, T b) { a = (a < b) ? b : a; }
+int in() { int x; scanf("%d", &x); return x; }
+
+using namespace std;
+
+typedef long long Int;
+typedef unsigned uint;
+
+int main(void) {
+
+    return 0;
+}
+

URI/HeadOrTail.cpp

@@ -0,0 +1,68 @@
+#include <iostream>
+#include <string>
+#include <sstream>
+#include <vector>
+#include <set>
+#include <map>
+#include <list>
+#include <queue>
+#include <stack>
+#include <memory>
+#include <iomanip>
+#include <numeric>
+#include <functional>
+#include <new>
+#include <algorithm>
+#include <cmath>
+#include <cstring>
+#include <cstdlib>
+#include <cstdio>
+#include <climits>
+#include <cctype>
+#include <ctime>
+
+#define REP(i, n) for(int (i) = 0; i < n; i++)
+#define FOR(i, a, n) for(int (i) = a; i < n; i++)
+#define FORR(i, a, n) for(int (i) = a; i <= n; i++)
+#define for_each(q, s) for(typeof(s.begin()) q=s.begin(); q!=s.end(); q++)
+#define sz(n) n.size()
+#define pb(n) push_back(n)
+#define all(n) n.begin(), n.end()
+
+template<typename T> T gcd(T a, T b) {
+    if(!b) return a;
+    return gcd(b, a % b);
+}
+template<typename T> T lcm(T a, T b) {
+    return a * b / gcd(a, b);
+}
+
+template<typename T> void chmin(T& a, T b) { a = (a > b) ? b : a; }
+template<typename T> void chmax(T& a, T b) { a = (a < b) ? b : a; }
+int in() { int x; scanf("%d", &x); return x; }
+
+using namespace std;
+
+typedef long long Int;
+typedef unsigned uint;
+
+int N;
+
+int main(void) {
+    int i;
+
+    for ( ; scanf("%d", &N) == 1 && N != 0; ) {
+        uint m = 0, j = 0, c;
+
+        for (i = 0; i < N; i++) {
+            c = in();
+
+            if (c == 0) m += 1;
+            else j += 1;
+        }
+
+        printf("Mary won %d times and John won %d times\n", m, j);
+    }
+    return 0;
+}
+

URI/PerfectChoir.cpp

@@ -0,0 +1,78 @@
+#include <iostream>
+#include <string>
+#include <sstream>
+#include <vector>
+#include <set>
+#include <map>
+#include <list>
+#include <queue>
+#include <stack>
+#include <memory>
+#include <iomanip>
+#include <numeric>
+#include <functional>
+#include <new>
+#include <algorithm>
+#include <cmath>
+#include <cstring>
+#include <cstdlib>
+#include <cstdio>
+#include <climits>
+#include <cctype>
+#include <ctime>
+
+#define REP(i, n) for(int (i) = 0; i < n; i++)
+#define FOR(i, a, n) for(int (i) = a; i < n; i++)
+#define FORR(i, a, n) for(int (i) = a; i <= n; i++)
+#define for_each(q, s) for(typeof(s.begin()) q=s.begin(); q!=s.end(); q++)
+#define sz(n) n.size()
+#define pb(n) push_back(n)
+#define all(n) n.begin(), n.end()
+
+template<typename T> T gcd(T a, T b) {
+    if(!b) return a;
+    return gcd(b, a % b);
+}
+template<typename T> T lcm(T a, T b) {
+    return a * b / gcd(a, b);
+}
+
+template<typename T> void chmin(T& a, T b) { a = (a > b) ? b : a; }
+template<typename T> void chmax(T& a, T b) { a = (a < b) ? b : a; }
+int in() { int x; scanf("%d", &x); return x; }
+
+using namespace std;
+
+typedef long long Int;
+typedef unsigned uint;
+
+const int MAXN = 10007;
+
+int N;
+int v[MAXN];
+
+int main(void) {
+    int i;
+
+    for ( ; scanf("%d", &N) == 1; ) {
+        int s = 0;
+
+        for (i = 0; i < N; i++) {
+            v[i] = in(); s += v[i];
+        }
+
+        if (s % N != 0) {
+            puts("-1"); continue;
+        } else {
+            int mean = s / N;
+            int ans = 0;
+
+            for (i = 0; i < N; i++) if (v[i] < mean) {
+                ans += abs(mean - v[i]);
+            }
+
+            printf("%d\n", ans + 1);
+        }
+    }
+    return 0;
+}