141 added

Author: coderxiang

Codeforces/191C_watashi.cpp

@@ -0,0 +1,94 @@
+#include <cstdio>
+#include <vector>
+
+using namespace std;
+
+const int MAXB = 17;
+const int MAXN = 1 << MAXB;
+
+vector<pair<int, int> > e[MAXN];
+int v[MAXN], c[MAXN], d[MAXN], r[MAXN], p[MAXN][MAXB];
+
+void dfs(int v, int f) {
+    p[v][0] = f;
+    for (int i = 1; i < MAXB; ++i) {
+        p[v][i] = p[p[v][i - 1]][i - 1];
+    }
+    for (auto& i: e[v]) {
+        if (i.first == f) {
+            continue;
+        }
+        d[i.first] = d[v] + 1;
+        r[i.first] = i.second;
+        dfs(i.first, v);
+    }
+}
+
+int go(int v, int d) {
+    for (int i = 0; i < MAXB; ++i) {
+        if (d & (1 << i)) {
+            v = p[v][i];
+        }
+    }
+    return v;
+}
+
+int lca(int i, int j) {
+    if (d[i] > d[j]) {
+        swap(i, j);
+    }
+    j = go(j, d[j] - d[i]);
+    if (i == j) {
+        return i;
+    }
+    for (int k = MAXB - 1; k >= 0; --k) {
+        if (p[i][k] != p[j][k]) {
+            i = p[i][k];
+            j = p[j][k];
+        }
+    }
+    return p[i][0];
+}
+
+void gao(int v, int f) {
+    for (auto& i: e[v]) {
+        if (i.first == f) {
+            continue;
+        }
+        gao(i.first, v);
+        c[i.second] = ::v[i.first];
+        ::v[v] += ::v[i.first];
+    }
+}
+
+int main() {
+    int n, m, a, b;
+
+    scanf("%d", &n);
+    for (int i = 1; i < n; ++i) {
+        scanf("%d%d", &a, &b);
+        --a;
+        --b;
+        e[a].push_back({b, i});
+        e[b].push_back({a, i});
+    }
+    d[0] = 0;
+    dfs(0, 0);
+
+    scanf("%d", &m);
+    for (int i = 0; i < m; ++i) {
+        scanf("%d%d", &a, &b);
+        --a;
+        --b;
+        ++v[a];
+        ++v[b];
+        v[lca(a, b)] -= 2;
+    }
+    gao(0, 0);
+
+    for (int i = 1; i < n; ++i) {
+        printf("%d ", c[i]);
+    }
+
+    return 0;
+}

Codeforces/232A_141.cpp

@@ -0,0 +1,62 @@
+#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>
+
+using namespace std;
+
+int cnt[110];
+int sum[110];
+int ans[500], s[500], m;
+int g[500][500];
+int n;
+
+void process (int x) {
+	int i, j;
+	m = 0;
+	for (i = 3; i + 1 <= 100 && x >= sum[i+1]; ++i);
+	x -= sum[i];
+	ans[++m] = i;
+	n = i;
+	while (x != 0) {
+		for (i = 3; i + 1 <= 100 && x >= cnt[i + 1]; ++i);
+		x -= cnt[i];
+		ans[++m] = i - 1;
+		n++;
+	}
+}
+int main () {
+	int i, j, k;
+	for (i = 3; i <= 100; ++i) {
+		cnt[i] = (i - 1) * (i - 2) / 2;
+		sum[i] = sum[i - 1] + cnt[i];
+	}
+	
+	scanf ("%d", &k);
+	process (k);
+	
+	printf ("%d\n", n);
+	for (i = 1; i <= ans[1]; ++i)
+		for (j = 1; j <= ans[1]; ++j)
+			g[i][j] = (i == j ? 0 : 1);
+
+	for (i = 2; i <= m; ++i)
+		for (j = 1; j <= ans[i]; ++j)
+			g[j][ans[1] + i - 1] = g[ans[1] + i - 1][j] = 1;
+			
+	for (i = 1; i <= n; ++i) {
+		for (j = 1; j <= n; ++j)
+			printf ("%d", g[i][j]);
+		printf ("\n");
+	}
+	return 0;
+}

Codeforces/232B_141.cpp

@@ -0,0 +1,61 @@
+#include <iostream>
+#include <cstring>
+
+using namespace std;
+
+const int N = 110;
+
+long long C[N][N];
+long long d[N][N*N];
+long long ex[N][2];
+int n;
+long long m;
+
+const int md = 1000000007;
+
+
+long long p (long long x, long long e) {
+	long long ans = 1;
+	while (e) {
+		if (e&1)
+			ans = (ans * x) % md;
+		x = (x * x) % md;
+		e /= 2;
+	}
+	return ans;
+}
+
+int main () {
+	int i, j, k, num;
+	cin >> n >> m >> num;
+	for (i = 0; i <= n; i++)
+		d[i][0] = 1;
+
+	for (i = 0; i <= n; ++i)
+		C[i][i] = C[i][0] = 1;
+	for (i = 2; i <= n; ++i)
+		for (j = 1; j < i; ++j)
+			C[i][j] = (C[i-1][j] + C[i-1][j-1]) % md;
+
+	for (i = 0; i <= n; ++i) {
+		ex[i][0] = p (C[n][i], m / n);
+		ex[i][1] = (ex[i][0] * C[n][i]) % md;
+	}
+	
+	d[0][0] = 1;
+	long long ans = 0;
+	for (i = 1; i <= n; ++i)
+		for (j = 1; j <= n * n; ++j)
+			for (k = 0; k <= n && k <= j; ++k) {
+				long long e = (i <= m % n ? 1 : 0);
+				d[i][j] = (d[i][j] + ex[k][e] * d[i - 1][j - k]) % md;
+			}
+
+	cout << d[n][num] << endl;
+	return 0;
+}
+		
+		
+
+	
+	

Codeforces/Div II/233A_144.py

@@ -0,0 +1,8 @@
+n = input ();
+
+if n % 2 == 0:
+	for i in xrange (n / 2):
+		print 2 * (i+1), 2 *i + 1,
+else:
+	print -1
+		

Codeforces/Div II/233B_144.py

@@ -0,0 +1,20 @@
+import math
+
+n = input ();
+
+def f (x):
+	cnt = 0;
+	while x != 0:
+		cnt += x % 10;
+		x /= 10;
+	return cnt
+
+mi = -1;
+for sx in xrange (1, 100):
+	t = int (math.sqrt (4 * n + sx * sx));
+	if t * t == 4 * n + sx * sx:
+		tmpAns = (t - sx) / 2;
+		if f(tmpAns) == sx and (mi == -1 or tmpAns < mi):
+			mi = tmpAns;
+print mi
+