cf update

Author: coderxiang

Codeforces/156A_110.cpp

@@ -1,50 +1,50 @@
-#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;
-
-char s[2010], u[2010];
-
-int main()
-{
-	int i, j, k;
-
-	scanf("%s",s);
-	scanf("%s",u);
-
-	int e1 = strlen(s), e2 = strlen(u);
-
-	int ans = -1;
-
-		for(i = 0; i < e1; i++)
-		{
-			int mch = 0;
-			for(j = 0; j < e2 && i + j < e1; j++)
-				if(s[i+j] == u[j]) mch++;
-			ans = max(ans, mch);
-		}
-
-		for(i = 0; i < e2; i++)
-		{
-			int mch = 0;
-			for(j = 0; j < e1 && i + j < e2; j++)
-				if(u[i+j] == s[j]) mch++;
-			ans = max(ans, mch);
-		}
-
-	printf("%d\n", e2 - ans);
-	return 0;
-}
-
-
+#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;
+
+char s[2010], u[2010];
+
+int main()
+{
+	int i, j, k;
+
+	scanf("%s",s);
+	scanf("%s",u);
+
+	int e1 = strlen(s), e2 = strlen(u);
+
+	int ans = -1;
+
+		for(i = 0; i < e1; i++)
+		{
+			int mch = 0;
+			for(j = 0; j < e2 && i + j < e1; j++)
+				if(s[i+j] == u[j]) mch++;
+			ans = max(ans, mch);
+		}
+
+		for(i = 0; i < e2; i++)
+		{
+			int mch = 0;
+			for(j = 0; j < e1 && i + j < e2; j++)
+				if(u[i+j] == s[j]) mch++;
+			ans = max(ans, mch);
+		}
+
+	printf("%d\n", e2 - ans);
+	return 0;
+}
+
+

Codeforces/288E_177.cpp

@@ -12,13 +12,6 @@ const long long md = 1000000007 ;
 
 long long ten[2*N]; // 10^n mod md
 
-// struct node{
-//     int s, p;
-// 	int c;
-// 	node () {}
-// 	node (int s1, int p1, int c1) : s(s1), p(p1), c(c1) {}
-// };
-
 struct node{
     long long s, p;
 	long long c;

Codeforces/297C_180.rb

@@ -0,0 +1,21 @@
+n = gets.to_i;
+c = gets.split(' ').map(&:to_i);
+idx = (0..n-1).to_a.sort{|x, y|
+  c[x] <=> c[y]
+}
+a = Array.new(n); b = Array.new(n);
+cnt = (n+2)/3;
+
+n.times{|i|
+  j = idx[i];
+  if i < cnt
+    a[j] = i; b[j] = c[j] - a[j];
+  elsif i < 2*cnt
+    b[j] = i; a[j] = c[j] - b[j];
+  else
+    b[j] = n - i - 1; a[j] = c[j] - b[j];
+  end
+}
+puts "YES"
+puts a.map(&:to_s).join(' ')
+puts b.map(&:to_s).join(' ')