update CF

Author: coderxiang

Codeforces/269A_165.py

@@ -0,0 +1,28 @@
+# There is a way more simpler solution noticing that boxes of different sizes are really independent.
+from math import *
+
+n = input ();
+d = [map (int, raw_input().split()) for i in xrange (n)];
+
+d.sort (key = lambda x : x[0]);
+
+for i in xrange (n - 1):
+	p1 = d[i]; p2 = d[i+1];
+	if log (p1[1] / (float (p2[1])), 4) <= p2[0] - p1[0]:
+		continue
+	else:
+		cnt = 4 ** (p2[0] - p1[0]);
+		d[i+1][1] += ((p1[1] - cnt * p2[1]) + cnt - 1) / cnt;
+
+print "%d" % (d[n - 1][0] + max (1, ceil (log (d[n - 1][1], 4))));
+
+
+
+
+
+
+
+
+
+	
+	

Codeforces/Div II/271A_166.py

@@ -0,0 +1,12 @@
+n = input ();
+i = n;
+
+while True:
+	i += 1;
+	a = []; j = i;
+	while j != 0:
+		a.append (j%10);
+		j /= 10;
+	if len(a) == len(set(a)):
+		print i
+		break;

Codeforces/Div II/271B_166.cpp

@@ -0,0 +1,51 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <string>
+#include <list>
+#include <set>
+#include <map>
+#include <sstream>
+#include <cstdio>
+#include <algorithm>
+#include <cstring>
+#include <cmath>
+#include <ctime>
+
+using namespace std;
+
+bool isp[110011];
+vector<int>p;
+int r[511], c[511];
+void genPrime () {
+	int i, j, k;
+	memset (isp, true, sizeof (isp));
+	for (i = 2; i < 1000; ++i) {
+		if (isp[i])
+			for (j = i * i; j <= 110000; j += i)
+				isp[j] = false;
+	}
+	p.push_back(2);
+	for (i = 3; i <= 110000; i+=2)
+		if (isp[i]) p.push_back(i);
+}
+
+int a[511][511];
+int main () {
+	int i, j, k, m, n;
+	genPrime ();
+	scanf ("%d%d", &m, &n);
+	for (i = 1; i <= m; ++i)
+		for (j = 1; j <= n; ++j) {
+			scanf ("%d", &a[i][j]);
+			a[i][j] = *lower_bound (p.begin(), p.end(), a[i][j]) - a[i][j];
+			r[i] += a[i][j];
+			c[j] += a[i][j];
+		}
+	int ans = 1000000011;
+	for (i = 1; i <= m; ++i) ans = min (ans, r[i]);
+	for (j = 1; j <= n; ++j) ans = min (ans, c[j]);
+	printf ("%d\n", ans);
+	return 0;
+
+}

Codeforces/Div II/271C_166.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <string>
+#include <list>
+#include <set>
+#include <map>
+#include <sstream>
+#include <cstdio>
+#include <algorithm>
+#include <cstring>
+#include <cmath>
+#include <ctime>
+
+using namespace std;
+
+int d[2][1000011];
+
+int a[511][511];
+int main () {
+	int i, j, k;
+	int n, m;
+	scanf ("%d%d", &n, &m);
+	if (3 * m > n) {
+		printf ("-1");
+		return 0;
+	}
+
+	for (i = 1; i <= m; ++i) printf ("%d ", i);
+	for (i = 1; i <= m; ++i) printf ("%d ", i);
+	for (i = 2; i <= m; ++i) printf ("%d ", i); printf ("1 ");
+	for (i = 1; i <= n - 3 * m; ++i)
+		printf ("1%c", i == (n-3*m) ? '\n' : ' ');
+	return 0;
+}

Codeforces/Div II/271D_166.cpp

@@ -0,0 +1,52 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <string>
+#include <list>
+#include <set>
+#include <map>
+#include <sstream>
+#include <cstdio>
+#include <algorithm>
+#include <cstring>
+#include <cmath>
+#include <ctime>
+
+using namespace std;
+
+#define CHAR_NUM 26
+
+int node_num;
+
+struct node
+{
+	int p[CHAR_NUM];
+	void clear() { memset( p, -1, sizeof p );  }
+}dict[4000011];
+
+// Add a new node in Trie and return the node number
+int new_node() {
+	dict[node_num].clear();
+	return node_num++;
+}
+
+int f[26];
+char s[2011];
+int main () {
+	int i, j, k, m;
+	scanf ("%s", s); int n = strlen (s);
+	int root = new_node ();
+	for (i = 0; i < 26; ++i) scanf ("%1d", &f[i]);
+	scanf ("%d", &m);
+	for (i = 0; i < n; ++i) {
+		int t = root, cnt = 0;
+		for (j = i; j < n; ++j) {
+			if (!f[s[j] - 'a']) ++cnt;
+			if (cnt > m) break;
+			if (dict[t].p[s[j] - 'a'] == -1) dict[t].p[s[j] - 'a'] = new_node ();
+			t = dict[t].p[s[j] - 'a'];
+		}
+	}
+	printf ("%d\n", node_num - 1);
+	return 0;
+}

Codeforces/Div II/271E_166.ml

@@ -0,0 +1,67 @@
+let ( |> ) x f = f x
+let ( <| ) f x = f x
+
+let foi = float_of_int
+let iof = int_of_float
+
+let next_int () = Scanf.scanf "%d%c" (fun x _ -> x)
+let next_flt () = Scanf.scanf "%f%c" (fun x _ -> x)
+
+let seq n = 
+  let rec aux n acc = 
+	if n = 0 then acc
+	else aux (n-1) (n :: acc) in
+  aux n []
+
+let rec show_flt_list x = 
+  match x with
+	  [] -> print_newline ()
+	| x::xs -> print_float x; print_string " "; show_flt_list xs
+
+let rec show_int_list x = 
+  match x with
+	  [] -> print_newline ()
+	| x::xs -> print_int x; print_string " "; show_int_list xs
+
+let rec loop n f acc = 
+  if n = 0 then List.rev acc else loop (n-1) f ((f n) :: acc)
+
+let rec gcd x y = 
+  if y = 0 then x else gcd y (x mod y)
+;;
+
+let n = next_int () 
+let m = next_int () 
+
+
+let a = loop n (fun _ -> (next_int()) - 1) []
+let d = List.fold_left gcd (List.hd a) a
+
+let calc x =
+  let m = Int64.of_int m in
+  let rec aux acc x = 
+	if x >= m then acc
+	else aux (Int64.add acc (Int64.sub m x)) (Int64.add x x) in
+  aux (Int64.zero) (Int64.of_int x)
+
+let get_dvsr () = 
+  let up = iof (sqrt (foi d)) in
+  let rec aux n acc = 
+	if n > up then acc
+	else 
+	  if d mod n = 0 then 
+		if n * n <> d then aux (n + 1) (n :: (d/n) :: acc)
+		else aux (n + 1) (n :: acc)
+	  else 
+		aux (n + 1) acc
+  in
+  aux 1 []
+
+let () =
+  List.filter (fun x -> x mod 2 = 1) (get_dvsr () )
+	|> List.fold_left (fun acc y -> Int64.add acc (calc y)) Int64.zero
+	|> Printf.printf "%Ld"
+	
+
+
+  

Codeforces/Div II/278A_170.rb

@@ -0,0 +1,8 @@
+n = gets.to_i;
+a = gets.split.map(& :to_i);
+sum = a.inject(:+);
+acc = 0;
+d = [0].concat(a.map {|x| acc += x})
+s, t = gets.split.map(&:to_i);
+s, t = t, s if t < s
+p ([d[t-1]-d[s-1], sum - d[t-1] + d[s-1]].min)