Merge branch 'master' into remin/pair-programming

Author: rdrgn

even2primes/java-tossy-tle/Even2PrimesNaive.java

@@ -5,7 +5,7 @@
 #cxx_solution(src='main.cc', flags=[]) # -std=c++11 -O2 as default
 #java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
 java_solution(src='Even2PrimesNaive.java', encoding='UTF-8', mainclass='Even2PrimesNaive',
-              challenge_cases=['large.in'])
+              challenge_cases=[])
 #java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
 #              challenge_cases=['10_corner*.in'])
 #script_solution(src='main.sh') # shebang line is required
@@ -17,4 +17,4 @@ java_solution(src='Even2PrimesNaive.java', encoding='UTF-8', mainclass='Even2Pri
 #cs_solution(src='main.cs') # C# (mono)
 
 ## Score
-#expected_score(100)
+expected_score(10)

even2primes/java-tossy-tle/SOLUTION

@@ -0,0 +1,20 @@
+# -*- coding: utf-8; mode: python -*-
+
+## Solution
+#c_solution(src='main.c') # -lm -O2 as default
+#cxx_solution(src='main.cc', flags=[]) # -std=c++11 -O2 as default
+#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
+#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
+#              challenge_cases=[])
+#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
+#              challenge_cases=['10_corner*.in'])
+#script_solution(src='main.sh') # shebang line is required
+#script_solution(src='main.pl') # shebang line is required
+script_solution(src='main.py', challenge_cases=[]) # shebang line is required
+#script_solution(src='main.rb') # shebang line is required
+#js_solution(src='main.js') # javascript (nodejs)
+#hs_solution(src='main.hs') # haskell (stack + ghc)
+#cs_solution(src='main.cs') # C# (mono)
+
+## Score
+expected_score(10)

even2primes/python-tle/SOLUTION

@@ -0,0 +1,34 @@
+#!/usr/local/bin/python3
+
+import math
+import numpy
+
+_ = int(input())
+
+def all_primes(start, end):
+   return list(sorted(set(range(start, end + 1)).difference(set((p * f) for p in range(2, int(end ** 0.5) + 2) for f in range(2, (end // p) + 1)))))
+
+def primesfrom2to(n):
+   """ Input n>=6, Returns a array of primes, 2 <= p < n """
+   sieve = numpy.ones(n//3 + (n%6 == 2), dtype=numpy.bool)
+   for i in range(1, int(n**0.5)//3+1):
+       if sieve[i]:
+           k=3*i+1|1
+           sieve[k*k//3::2*k] = False
+           sieve[k*(k-2*(i&1)+4)//3::2*k] = False
+   return numpy.r_[2,3,((3*numpy.nonzero(sieve)[0][1:]+1)|1)]
+
+for i in range(_):
+   x = int(input())
+   if x < 6:
+       l = all_primes(2, x)
+   else:
+       l = primesfrom2to(x)
+   ans = 0
+   for i, p in enumerate(l):
+       if 2*p > x:
+           break
+       if x - p in l:
+           ans += 1
+   print(ans)
+

even2primes/python-tle/main.py

@@ -17,3 +17,6 @@ cxx_validator(src='validator.cpp', dependency=['testlib.h'])
 #cxx_judge(src='judge.cc')
 #java_judge(src='Judge.java', encoding='UTF-8', mainclass='Judge')
 #script_judge(src='judge.py')
+
+subtask_testset(name='All', score=100, input_patterns=['*'])
+subtask_testset(name='Med', score=10, input_patterns=['sample.in', 'small.in', 'medium.in'])

even2primes/tests/TESTSET

@@ -0,0 +1,20 @@
+# -*- coding: utf-8; mode: python -*-
+
+## Solution
+#c_solution(src='main.c') # -lm -O2 as default
+cxx_solution(src='main.cpp', flags=[], challenge_cases=['large.in']) # -std=c++11 -O2 as default
+#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
+#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
+#              challenge_cases=[])
+#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
+#              challenge_cases=['10_corner*.in'])
+#script_solution(src='main.sh') # shebang line is required
+#script_solution(src='main.pl') # shebang line is required
+#script_solution(src='main.py') # shebang line is required
+#script_solution(src='main.rb') # shebang line is required
+#js_solution(src='main.js') # javascript (nodejs)
+#hs_solution(src='main.hs') # haskell (stack + ghc)
+#cs_solution(src='main.cs') # C# (mono)
+
+## Score
+#expected_score(100)

pairprogramming/cpp-wrong/SOLUTION

@@ -0,0 +1,18 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+  int t;
+  cin >> t;
+  int m = 0;
+  for (int i = 0; i < t; i++) {
+    int n;
+    cin >> n;
+    for (int j = 0; j < n; j++) {
+      int a;
+      cin >> a;
+      m = (m + a) % 2;
+      cout << m << endl;
+    }
+  }
+}

pairprogramming/cpp-wrong/main.cpp

@@ -0,0 +1,20 @@
+# -*- coding: utf-8; mode: python -*-
+
+## Solution
+#c_solution(src='main.c') # -lm -O2 as default
+#cxx_solution(src='main.cc', flags=[]) # -std=c++11 -O2 as default
+#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
+#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
+#              challenge_cases=[])
+#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
+#              challenge_cases=['10_corner*.in'])
+#script_solution(src='main.sh') # shebang line is required
+#script_solution(src='main.pl') # shebang line is required
+#script_solution(src='main.py') # shebang line is required
+script_solution(src='main.rb') # shebang line is required
+#js_solution(src='main.js') # javascript (nodejs)
+#hs_solution(src='main.hs') # haskell (stack + ghc)
+#cs_solution(src='main.cs') # C# (mono)
+
+## Score
+#expected_score(100)

pairprogramming/ruby-reishimizu/SOLUTION

@@ -0,0 +1,26 @@
+#!/usr/bin/ruby
+
+l = gets.chomp.to_i
+i = []
+
+l.times do
+  n = gets.chomp.to_i
+  str = gets.chomp.split(' ').map(&:to_i)
+
+  i << str
+end
+
+i.each do |ary|
+  result = []
+  ary.each_with_index do |value, index|
+    if index == 0
+      result << value
+    else
+      result << value + result[index-1]
+    end
+  end
+  result.each do |data|
+    puts data % 2 == 0 ? 0 : 1
+  end
+end
+

pairprogramming/ruby-reishimizu/main.rb

@@ -4,7 +4,7 @@
 しまりんの体は以下の図のように、1列に並んだ$A+B$個のブロックで表されます。  
 はじめ全てのブロックの色は茶色です。  
 1缶の絵の具で、ちょうど1個のブロックを塗ることができます。  
-しまりんをシマウマにするには、$A+B$個のブロック全てを隣同士が異なる色になるように塗らなければいけません。  
+しまりんをシマウマにするには、$A+B$個のブロック全てを**白と黒が交互になる**ように塗らなければいけません。  
 しまりんをシマウマにできるなら`YES`、できないなら`NO`を出力してください。  
 
 # Constraints