CF 204

Author: coderxiang

Codeforces/CF348A_202.hs renamed to Codeforces/202/CF348A_202.hs

@@ -0,0 +1,51 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <string>
+#include <list>
+#include <set>
+#include <map>
+#include <sstream>
+#include <algorithm>
+#include <cstring>
+#include <cmath>
+#include <ctime>
+#include <cstdio>
+#include <cassert>
+
+using namespace std;
+
+typedef long long ll;
+typedef pair<int,int> PII;
+typedef vector<int> VI;
+typedef vector<string> VS;
+#define pb push_back
+#define mp make_pair
+#define ff first
+#define ss second
+#define sz(v) (int)v.size()
+#define clr(x, v) memset(x, v, sizeof(x))
+#define rep(i, l, u) for(int i = (l); i < (u); i++)
+#define repv(i, v) for(i = 0; i < (int)v.size(); i++)
+#define repi(it, c) for(typeof(c.begin()) it = c.begin(); it != c.end(); ++it)
+
+
+const int N = 100011;
+
+int main () {
+	int i, j, k, n, cnt = 0;
+	int sum = 0;
+	scanf ("%d", &n);
+	for (i = 1; i <= 2 * n; ++i) {
+		scanf ("%d.%d", &j, &k);
+		sum -= k;
+		cnt += k == 0;
+	}
+	sum += 1000 * n;
+	int mi = max(0, cnt - n), ma = min(cnt, n);
+	int ans = 100000000;
+	for (i = mi; i <= ma; ++i)
+		ans = min(ans, abs(sum - i * 1000));
+	printf ("%.3lf\n", (double)ans / 1000.0);
+}
+

Codeforces/CF348B_202.cpp renamed to Codeforces/202/CF348B_202.cpp

@@ -0,0 +1,57 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <string>
+#include <list>
+#include <set>
+#include <map>
+#include <sstream>
+#include <algorithm>
+#include <cstring>
+#include <cmath>
+#include <ctime>
+#include <cstdio>
+#include <cassert>
+
+using namespace std;
+
+typedef long long ll;
+typedef pair<int,int> PII;
+typedef vector<int> VI;
+typedef vector<string> VS;
+#define pb push_back
+#define mp make_pair
+#define ff first
+#define ss second
+#define sz(v) (int)v.size()
+#define clr(x, v) memset(x, v, sizeof(x))
+#define rep(i, l, u) for(int i = (l); i < (u); i++)
+#define repv(i, v) for(i = 0; i < (int)v.size(); i++)
+#define repi(it, c) for(typeof(c.begin()) it = c.begin(); it != c.end(); ++it)
+
+
+const int N = 100011;
+int a[N], n;
+
+int main () {
+	int i, j, k, inv = 0;
+	scanf ("%d", &n);
+	for (i = 1; i <= n; ++i)
+		scanf ("%d", &a[i]);
+	for (i = 1; i <= n; ++i)
+		for (j = i + 1; j <= n; ++j)
+			inv += a[i] > a[j];
+
+	if (inv == 0) printf ("0\n");
+	else if (inv == 1) printf ("1\n");
+	else {
+		int pp = 0, p = 1;
+		for (i = 2; i <= inv; ++i) {
+			k = pp + 4;
+			pp = p; p = k;
+		}
+		printf ("%d\n", k);
+	}
+	return 0;
+}
+

Codeforces/CF348C_202.cpp renamed to Codeforces/202/CF348C_202.cpp

@@ -0,0 +1,53 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <string>
+#include <list>
+#include <set>
+#include <map>
+#include <sstream>
+#include <algorithm>
+#include <cstring>
+#include <cmath>
+#include <ctime>
+#include <cstdio>
+#include <cassert>
+
+using namespace std;
+
+typedef long long ll;
+typedef pair<int,int> PII;
+typedef vector<int> VI;
+typedef vector<string> VS;
+#define pb push_back
+#define mp make_pair
+#define ff first
+#define ss second
+#define sz(v) (int)v.size()
+#define clr(x, v) memset(x, v, sizeof(x))
+#define rep(i, l, u) for(int i = (l); i < (u); i++)
+#define repv(i, v) for(i = 0; i < (int)v.size(); i++)
+#define repi(it, c) for(typeof(c.begin()) it = c.begin(); it != c.end(); ++it)
+
+
+const int N = 100011;
+
+int main () {
+	int i, j, k, n, c0 = 0, c5 = 0;
+	scanf ("%d", &n);
+	for (i = 1; i <= n; ++i) {
+		scanf ("%d", &j);
+		if (j == 0) c0 ++;
+		else c5++;
+	}
+	if (!c0) printf("-1\n");
+	else {
+		c5 = (c5 * 5/45*45)/5;
+		if (c5 == 0) printf ("0\n");
+		else {
+			while(c5--) printf("5");
+			while(c0--) printf("0");
+		}
+	}
+	return 0;
+}

Codeforces/204/351A_204.cpp

@@ -0,0 +1,61 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <string>
+#include <list>
+#include <set>
+#include <map>
+#include <sstream>
+#include <algorithm>
+#include <cstring>
+#include <cmath>
+#include <ctime>
+#include <cstdio>
+#include <cassert>
+
+using namespace std;
+
+typedef long long ll;
+typedef pair<int,int> PII;
+typedef vector<int> VI;
+typedef vector<string> VS;
+#define pb push_back
+#define mp make_pair
+#define ff first
+#define ss second
+#define sz(v) (int)v.size()
+#define clr(x, v) memset(x, v, sizeof(x))
+#define rep(i, l, u) for(int i = (l); i < (u); i++)
+#define repv(i, v) for(i = 0; i < (int)v.size(); i++)
+#define repi(it, c) for(typeof(c.begin()) it = c.begin(); it != c.end(); ++it)
+
+
+const int N = 100011;
+
+int p[N], n;
+int pos[N];
+
+int main () {
+	int i, j, k;
+	scanf ("%d", &n);
+	memset (pos, -1, sizeof(pos));
+	for (i = 1; i <= n; ++i) {
+		scanf ("%d", &j);
+		if (pos[j] == -2) continue;  // not valid
+		if (pos[j] == -1) {pos[j] = i; p[j] = 0;} // first time
+		else if (p[j] == 0) {p[j] = i - pos[j]; pos[j] = i;} // second time
+		else {
+			if (i - pos[j] != p[j]) pos[j] = -2;
+			else pos[j] = i;
+		}
+	}
+	k = 0;
+	for (i = 1; i <= 100000; ++i)
+		if (pos[i] >= 0) k ++;
+	printf ("%d\n", k);
+	for (i = 1; i <= 100000; ++i)
+		if (pos[i] != -2 && pos[i] != -1)
+			printf ("%d %d\n", i, p[i]);
+
+	return 0;
+}