Skip to content

Commit c2eaa6a

Browse files
author
rdrgn
committed
Merge branch 'master' into remin/pair-programming
2 parents f9cb63c + 33c455d commit c2eaa6a

File tree

26 files changed

+609
-21
lines changed

26 files changed

+609
-21
lines changed

‎even2primes/java-tossy-tle/Even2PrimesNaive.java

100755100644
File mode changed.

‎even2primes/java-tossy-tle/SOLUTION

+2-2
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
#cxx_solution(src='main.cc', flags=[]) # -std=c++11 -O2 as default
66
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
77
java_solution(src='Even2PrimesNaive.java', encoding='UTF-8', mainclass='Even2PrimesNaive',
8-
challenge_cases=['large.in'])
8+
challenge_cases=[])
99
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
1010
# challenge_cases=['10_corner*.in'])
1111
#script_solution(src='main.sh') # shebang line is required
@@ -17,4 +17,4 @@ java_solution(src='Even2PrimesNaive.java', encoding='UTF-8', mainclass='Even2Pri
1717
#cs_solution(src='main.cs') # C# (mono)
1818

1919
## Score
20-
#expected_score(100)
20+
expected_score(10)

‎even2primes/python-tle/SOLUTION

+20
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
# -*- coding: utf-8; mode: python -*-
2+
3+
## Solution
4+
#c_solution(src='main.c') # -lm -O2 as default
5+
#cxx_solution(src='main.cc', flags=[]) # -std=c++11 -O2 as default
6+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
7+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
8+
# challenge_cases=[])
9+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
10+
# challenge_cases=['10_corner*.in'])
11+
#script_solution(src='main.sh') # shebang line is required
12+
#script_solution(src='main.pl') # shebang line is required
13+
script_solution(src='main.py', challenge_cases=[]) # shebang line is required
14+
#script_solution(src='main.rb') # shebang line is required
15+
#js_solution(src='main.js') # javascript (nodejs)
16+
#hs_solution(src='main.hs') # haskell (stack + ghc)
17+
#cs_solution(src='main.cs') # C# (mono)
18+
19+
## Score
20+
expected_score(10)

‎even2primes/python-tle/main.py

+34
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,34 @@
1+
#!/usr/local/bin/python3
2+
3+
import math
4+
import numpy
5+
6+
_ = int(input())
7+
8+
def all_primes(start, end):
9+
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)))))
10+
11+
def primesfrom2to(n):
12+
""" Input n>=6, Returns a array of primes, 2 <= p < n """
13+
sieve = numpy.ones(n//3 + (n%6 == 2), dtype=numpy.bool)
14+
for i in range(1, int(n**0.5)//3+1):
15+
if sieve[i]:
16+
k=3*i+1|1
17+
sieve[k*k//3::2*k] = False
18+
sieve[k*(k-2*(i&1)+4)//3::2*k] = False
19+
return numpy.r_[2,3,((3*numpy.nonzero(sieve)[0][1:]+1)|1)]
20+
21+
for i in range(_):
22+
x = int(input())
23+
if x < 6:
24+
l = all_primes(2, x)
25+
else:
26+
l = primesfrom2to(x)
27+
ans = 0
28+
for i, p in enumerate(l):
29+
if 2*p > x:
30+
break
31+
if x - p in l:
32+
ans += 1
33+
print(ans)
34+

‎even2primes/tests/TESTSET

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

‎pairprogramming/cpp-wrong/SOLUTION

+20
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
# -*- coding: utf-8; mode: python -*-
2+
3+
## Solution
4+
#c_solution(src='main.c') # -lm -O2 as default
5+
cxx_solution(src='main.cpp', flags=[], challenge_cases=['large.in']) # -std=c++11 -O2 as default
6+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
7+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
8+
# challenge_cases=[])
9+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
10+
# challenge_cases=['10_corner*.in'])
11+
#script_solution(src='main.sh') # shebang line is required
12+
#script_solution(src='main.pl') # shebang line is required
13+
#script_solution(src='main.py') # shebang line is required
14+
#script_solution(src='main.rb') # shebang line is required
15+
#js_solution(src='main.js') # javascript (nodejs)
16+
#hs_solution(src='main.hs') # haskell (stack + ghc)
17+
#cs_solution(src='main.cs') # C# (mono)
18+
19+
## Score
20+
#expected_score(100)

‎pairprogramming/cpp-wrong/main.cpp

+18
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
#include <iostream>
2+
using namespace std;
3+
4+
int main() {
5+
int t;
6+
cin >> t;
7+
int m = 0;
8+
for (int i = 0; i < t; i++) {
9+
int n;
10+
cin >> n;
11+
for (int j = 0; j < n; j++) {
12+
int a;
13+
cin >> a;
14+
m = (m + a) % 2;
15+
cout << m << endl;
16+
}
17+
}
18+
}

‎pairprogramming/ruby-reishimizu/SOLUTION

+20
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
# -*- coding: utf-8; mode: python -*-
2+
3+
## Solution
4+
#c_solution(src='main.c') # -lm -O2 as default
5+
#cxx_solution(src='main.cc', flags=[]) # -std=c++11 -O2 as default
6+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
7+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
8+
# challenge_cases=[])
9+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
10+
# challenge_cases=['10_corner*.in'])
11+
#script_solution(src='main.sh') # shebang line is required
12+
#script_solution(src='main.pl') # shebang line is required
13+
#script_solution(src='main.py') # shebang line is required
14+
script_solution(src='main.rb') # shebang line is required
15+
#js_solution(src='main.js') # javascript (nodejs)
16+
#hs_solution(src='main.hs') # haskell (stack + ghc)
17+
#cs_solution(src='main.cs') # C# (mono)
18+
19+
## Score
20+
#expected_score(100)

‎pairprogramming/ruby-reishimizu/main.rb

+26
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
#!/usr/bin/ruby
2+
3+
l = gets.chomp.to_i
4+
i = []
5+
6+
l.times do
7+
n = gets.chomp.to_i
8+
str = gets.chomp.split(' ').map(&:to_i)
9+
10+
i << str
11+
end
12+
13+
i.each do |ary|
14+
result = []
15+
ary.each_with_index do |value, index|
16+
if index == 0
17+
result << value
18+
else
19+
result << value + result[index-1]
20+
end
21+
end
22+
result.each do |data|
23+
puts data % 2 == 0 ? 0 : 1
24+
end
25+
end
26+

‎shimashima/statement.md

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

1010
# Constraints

‎two-squares/cpp-getty-med/SOLUTION

+20
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
# -*- coding: utf-8; mode: python -*-
2+
3+
## Solution
4+
#c_solution(src='main.c') # -lm -O2 as default
5+
cxx_solution(src='main.cpp', flags=[], challenge_cases=[]) # -std=c++11 -O2 as default
6+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
7+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
8+
# challenge_cases=[])
9+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
10+
# challenge_cases=['10_corner*.in'])
11+
#script_solution(src='main.sh') # shebang line is required
12+
#script_solution(src='main.pl') # shebang line is required
13+
#script_solution(src='main.py') # shebang line is required
14+
#script_solution(src='main.rb') # shebang line is required
15+
#js_solution(src='main.js') # javascript (nodejs)
16+
#hs_solution(src='main.hs') # haskell (stack + ghc)
17+
#cs_solution(src='main.cs') # C# (mono)
18+
19+
## Score
20+
expected_score(10)

‎two-squares/cpp-getty-med/main.cpp

+60
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,60 @@
1+
#include <bits/stdc++.h>
2+
using namespace std;
3+
4+
typedef long long ll;
5+
typedef unsigned long long ull;
6+
typedef pair<ll,ll> P;
7+
typedef vector<ll> Vec;
8+
typedef vector<Vec> DVec;
9+
typedef vector<DVec> TVec;
10+
typedef priority_queue<P, vector<P>, greater<P>> PQ;
11+
12+
#define fi first
13+
#define se second
14+
#define pb push_back
15+
#define INF LLONG_MAX/3
16+
#define MOD 1000000007
17+
#define bcnt __builtin_popcount
18+
#define all(x) (x).begin(),(x).end()
19+
#define srt(x) sort(all(x))
20+
#define rvs(x) reverse(all(x))
21+
#define uni(x) x.erase(unique(all(x)),x.end())
22+
#define ub(x,y) (upper_bound(all(x),y)-x.begin())
23+
#define lb(x,y) (lower_bound(all(x),y)-x.begin())
24+
#define rep(i,n) repl(i,0,n-1)
25+
#define mkp(x,y) make_pair(x,y)
26+
#define mmax(x,y) (x>y?x:y)
27+
#define mmin(x,y) (x<y?x:y)
28+
#define maxch(x,y) x=mmax(x,y)
29+
#define minch(x,y) x=mmin(x,y)
30+
#define exist(x,y) (find(all(x),y)!=x.end())
31+
#define each(itr,v) for(auto itr:v)
32+
#define repl(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);i++)
33+
#define dvec(n1,n2,i) DVec(n1,Vec(n2,i))
34+
#define tvec(n1,n2,n3,i) TVec(n1,dvec(n2,n3,i))
35+
36+
int main() {
37+
cin.sync_with_stdio(false);
38+
ll N;
39+
cin >> N;
40+
rep(i,N){
41+
vector<P> mp;
42+
ll a,b;
43+
rep(i,8)cin >> a >> b,mp.pb(mkp(a,b));
44+
srt(mp);
45+
do{
46+
if(mp[0].fi == mp[1].fi && mp[0].se == mp[2].se && mp[1].se == mp[3].se && mp[2].fi == mp[3].fi)
47+
if(mp[4].fi == mp[5].fi && mp[4].se == mp[6].se && mp[5].se == mp[7].se && mp[6].fi == mp[7].fi){
48+
ll a = abs(mp[0].se - mp[1].se) * abs(mp[0].fi - mp[2].fi);
49+
ll b = abs(mp[4].se - mp[5].se) * abs(mp[4].fi - mp[6].fi);
50+
if(a == 0 || b == 0) continue;
51+
ll t1 = mmin(a,b);
52+
ll t2 = mmax(a,b);
53+
cout << t1 << " " << t2 << endl;
54+
break;
55+
}
56+
}while(next_permutation(all(mp)));
57+
}
58+
return 0;
59+
}
60+

‎two-squares/cpp-zura-wrong/SOLUTION

+20
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
# -*- coding: utf-8; mode: python -*-
2+
3+
## Solution
4+
#c_solution(src='main.c') # -lm -O2 as default
5+
cxx_solution(src='main.cpp', flags=[], challenge_cases=[]) # -std=c++11 -O2 as default
6+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
7+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
8+
# challenge_cases=[])
9+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
10+
# challenge_cases=['10_corner*.in'])
11+
#script_solution(src='main.sh') # shebang line is required
12+
#script_solution(src='main.pl') # shebang line is required
13+
#script_solution(src='main.py') # shebang line is required
14+
#script_solution(src='main.rb') # shebang line is required
15+
#js_solution(src='main.js') # javascript (nodejs)
16+
#hs_solution(src='main.hs') # haskell (stack + ghc)
17+
#cs_solution(src='main.cs') # C# (mono)
18+
19+
## Score
20+
#expected_score(100)

‎two-squares/cpp-zura-wrong/main.cpp

+66
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,66 @@
1+
#include <bits/stdc++.h>
2+
using namespace std;
3+
4+
#define fi first
5+
#define se second
6+
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
7+
#define repr(i,a,b) for(int i=(int)(a-1);i>=b;i--)
8+
#define rep(i,n) repl(i,0,n)
9+
#define each(itr,v) for(auto itr:v)
10+
#define pb(s) push_back(s)
11+
#define all(x) (x).begin(),(x).end()
12+
#define dbg(x) cout << #x" = " << x << endl
13+
#define maxch(x,y) x=max(x,y)
14+
#define minch(x,y) x=min(x,y)
15+
#define uni(x) x.erase(unique(all(x)),x.end())
16+
#define exist(x,y) (find(all(x),y)!=x.end())
17+
#define bcnt(x) bitset<32>(x).count()
18+
19+
typedef long long ll;
20+
typedef unsigned long long ull;
21+
typedef pair<int, int> P;
22+
23+
#define INF INT_MAX/3
24+
25+
P p[8];
26+
27+
bool check(int a, int b, int c, int d) {
28+
int q[] = {a, b, c, d};
29+
sort(q, q + 4);
30+
int x = (p[q[0]].fi - p[q[1]].fi) * (p[q[0]].fi - p[q[1]].fi) + (p[q[0]].se - p[q[1]].se) * (p[q[0]].se - p[q[1]].se);
31+
int y = (p[q[0]].fi - p[q[2]].fi) * (p[q[0]].fi - p[q[2]].fi) + (p[q[0]].se - p[q[2]].se) * (p[q[0]].se - p[q[2]].se);
32+
int z = (p[q[0]].fi - p[q[3]].fi) * (p[q[0]].fi - p[q[3]].fi) + (p[q[0]].se - p[q[3]].se) * (p[q[0]].se - p[q[3]].se);
33+
if (z == x + y) {
34+
x = (p[q[0]].fi - p[q[1]].fi) * (p[q[0]].fi - p[q[1]].fi) + (p[q[0]].se - p[q[1]].se) * (p[q[0]].se - p[q[1]].se);
35+
y = (p[q[1]].fi - p[q[2]].fi) * (p[q[1]].fi - p[q[2]].fi) + (p[q[1]].se - p[q[2]].se) * (p[q[1]].se - p[q[2]].se);
36+
z = (p[q[1]].fi - p[q[3]].fi) * (p[q[1]].fi - p[q[3]].fi) + (p[q[1]].se - p[q[3]].se) * (p[q[1]].se - p[q[3]].se);
37+
if (y == x + z) return true;
38+
}
39+
return false;
40+
}
41+
42+
int main(){
43+
cin.sync_with_stdio(false);
44+
int t;
45+
cin >> t;
46+
rep(ii, t) {
47+
vector<int> v(8);
48+
rep(i, 8) {
49+
cin >> p[i].fi >> p[i].se;
50+
v[i] = i;
51+
}
52+
sort(p, p + 8);
53+
do {
54+
bool ok1 = check(v[0], v[1], v[2], v[3]), ok2 = check(v[4], v[5], v[6], v[7]);
55+
if (ok1 && ok2) {
56+
int n = (p[v[0]].fi - p[v[1]].fi) * (p[v[0]].fi - p[v[1]].fi) + (p[v[0]].se - p[v[1]].se) * (p[v[0]].se - p[v[1]].se);
57+
int m = (p[v[4]].fi - p[v[5]].fi) * (p[v[4]].fi - p[v[5]].fi) + (p[v[4]].se - p[v[5]].se) * (p[v[4]].se - p[v[5]].se);
58+
if (n > m) swap(n, m);
59+
cout << n << " " << m << endl;
60+
break;
61+
}
62+
} while(next_permutation(all(v)));
63+
}
64+
65+
return 0;
66+
}

‎two-squares/cpp-zura/SOLUTION

+20
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
# -*- coding: utf-8; mode: python -*-
2+
3+
## Solution
4+
#c_solution(src='main.c') # -lm -O2 as default
5+
cxx_solution(src='main.cpp', flags=[]) # -std=c++11 -O2 as default
6+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
7+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
8+
# challenge_cases=[])
9+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
10+
# challenge_cases=['10_corner*.in'])
11+
#script_solution(src='main.sh') # shebang line is required
12+
#script_solution(src='main.pl') # shebang line is required
13+
#script_solution(src='main.py') # shebang line is required
14+
#script_solution(src='main.rb') # shebang line is required
15+
#js_solution(src='main.js') # javascript (nodejs)
16+
#hs_solution(src='main.hs') # haskell (stack + ghc)
17+
#cs_solution(src='main.cs') # C# (mono)
18+
19+
## Score
20+
#expected_score(100)

0 commit comments

Comments
 (0)