Skip to content

Commit b9c6ee4

Browse files
oeddyooeddyo
committedApr 24, 2013
add a few including gcj 2013 first round
1 parent 54c8cc4 commit b9c6ee4

19 files changed

+1846
-0
lines changed
 

‎cf/113/E2.cpp

+89
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,89 @@
1+
#include <iostream>
2+
#include <vector>
3+
#include <cstring>
4+
#include <cstdio>
5+
6+
using namespace std;
7+
8+
typedef long long int ll;
9+
10+
long long int dp[4][4];
11+
long long int bf[4][4];
12+
int N;
13+
14+
long long int MOD = 1000000007;
15+
16+
void multi(ll a[][4], ll b[][4], ll res[][4]){
17+
for(int i=0; i<4; i++){
18+
for(int j=0; j<4; j++){
19+
ll tmp = 0;
20+
for(int k=0; k<4; k++){
21+
tmp += a[i][k]*b[k][j];
22+
}
23+
res[i][j] = tmp%MOD;
24+
}
25+
}
26+
}
27+
28+
29+
void print(ll a[][4]){
30+
for(int i=0; i<4; i++){
31+
for(int j=0; j<4; j++){
32+
cout<<a[i][j]<<" ";
33+
}
34+
cout<<endl;
35+
}
36+
}
37+
38+
void mypow(ll input[][4], ll output[][4], int n){
39+
ll tmp[4][4];
40+
ll tmp2[4][4];
41+
memset(tmp, 0 , sizeof(tmp));
42+
memset(tmp2, 0, sizeof(tmp2));
43+
//cout<<"input is "<<endl;
44+
//print(input);
45+
if(n==1){
46+
for(int i=0; i<4; i++){
47+
for(int j=0; j<4; j++){
48+
output[i][j] = input[i][j];
49+
}
50+
}
51+
return ;
52+
}else if(n%2==1 && n>1){
53+
mypow(input, tmp, n/2);
54+
multi(tmp, tmp, tmp2);
55+
multi(input, tmp2, output);
56+
}else if(n%2==0 && n>0){
57+
mypow(input, tmp, n/2);
58+
multi(tmp, tmp, output);
59+
}
60+
}
61+
62+
63+
void work(){
64+
ll ans[4][4];
65+
memset(ans,0,sizeof(ans));
66+
mypow(dp, ans, N);
67+
//print(ans);
68+
69+
cout<<ans[3][3]<<endl;
70+
71+
}
72+
73+
74+
75+
int main(){
76+
cin>>N;
77+
for(int i=0; i<4; i++){
78+
for(int j=0;j<4; j++){
79+
if(i==j)continue;
80+
dp[i][j] = 1;
81+
}
82+
}
83+
work();
84+
85+
86+
87+
return 0;
88+
}
89+

‎cf/113/a.out

-3.32 KB
Binary file not shown.

‎cf/119/A.cpp

+43
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,43 @@
1+
#include <iostream>
2+
#include <set>
3+
#include <vector>
4+
5+
using namespace std;
6+
7+
const int MAXN = 5000;
8+
const int INF = 99999999;
9+
int dp[MAXN];
10+
int N;
11+
12+
13+
int main(){
14+
cin>>N;
15+
16+
set<int> d;
17+
for(int i=0; i<3; i++){
18+
int t;
19+
cin>>t;
20+
d.insert(t);
21+
}
22+
23+
for(int i=0; i<MAXN; i++)dp[i] = -INF;
24+
dp[0] = 0;
25+
26+
for(int i=0; i<=N; i++){
27+
if(dp[i]!=-INF){
28+
vector<int> tmp(d.begin(), d.end());
29+
for(int j=0; j<tmp.size(); j++){
30+
31+
for(int j=0; j<tmp.size(); j++){
32+
if(i+tmp[j]<=N){
33+
dp[i+tmp[j]] = max( dp[i]+1, dp[i+tmp[j]]);
34+
}
35+
}
36+
}
37+
}
38+
39+
}
40+
cout<<dp[N]<<endl;
41+
return 0;
42+
}
43+

‎cf/119/a.out

43.6 KB
Binary file not shown.

‎cf/134/B.cpp

+52
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,52 @@
1+
#include <iostream>
2+
#include <queue>
3+
#include <vector>
4+
5+
using namespace std;
6+
7+
8+
int N, M;
9+
const int MAXN = 10001;
10+
int data[MAXN];
11+
12+
13+
int main(){
14+
cin>>N>>M;
15+
16+
priority_queue<int> max_Q;
17+
priority_queue<int, vector<int> , greater<int> > min_Q;
18+
19+
for(int i=0; i<M; i++){
20+
int t;
21+
cin>>t;
22+
max_Q.push(t);
23+
min_Q.push(t);
24+
}
25+
int cnt = N;
26+
int max_ans = 0;
27+
int min_ans = 0;
28+
while(cnt--){
29+
int cur = max_Q.top();
30+
max_Q.pop();
31+
max_ans += cur;
32+
cur -= 1;
33+
if(cur>0){
34+
max_Q.push(cur);
35+
}
36+
}
37+
38+
cnt = N;
39+
while(cnt--){
40+
int cur = min_Q.top();
41+
min_Q.pop();
42+
min_ans += cur;
43+
cur -= 1;
44+
if(cur>0){
45+
min_Q.push(cur);
46+
}
47+
}
48+
cout<<max_ans<<" "<<min_ans<<endl;
49+
50+
return 0;
51+
}
52+

‎cf/134/a.out

46.5 KB
Binary file not shown.

‎cf/169/B.cpp

+69
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,69 @@
1+
#include <iostream>
2+
#include <string>
3+
#include <cstring>
4+
5+
using namespace std;
6+
7+
string S;
8+
9+
bool dp[1<<26];
10+
int cnt[26];
11+
const int INF = 99999999;
12+
13+
int get_ans(int state){
14+
if(dp[state]!=INF){
15+
return dp[state];
16+
}
17+
int num = __builtin_popcount(state);
18+
if(num== 0 || num == 1){
19+
return 1;
20+
}
21+
int ok = 0;
22+
for(int i=0; i<26; i++){
23+
if( ((state>>i)&1)==1 ){
24+
int ns = (~(1<<i))&state;
25+
int ans = get_ans(ns);
26+
if(ans==0){
27+
ok = 1;
28+
}
29+
}
30+
}
31+
dp[state] = ok;
32+
return ok;
33+
}
34+
35+
36+
void work(){
37+
memset(cnt,0,sizeof(cnt));
38+
for(int i=0; i<S.size(); i++){
39+
cnt[ S[i]-'a' ] += 1;
40+
}
41+
int start = 0;
42+
for(int i=0; i<26; i++){
43+
if(cnt[i]%2==1){
44+
start |= (1<<i);
45+
}
46+
}
47+
for(int i=0; i<(1<<26); i++){
48+
dp[i] = INF;
49+
}
50+
int ans = get_ans(start);
51+
if(ans==1){
52+
cout<<"First"<<endl;
53+
}
54+
else{
55+
cout<<"Second"<<endl;
56+
}
57+
58+
59+
}
60+
61+
62+
63+
int main(){
64+
cin>>S;
65+
work();
66+
67+
return 0;
68+
}
69+

‎cf/169/C.cpp

+120
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,120 @@
1+
#include <iostream>
2+
#include <cstring>
3+
#include <queue>
4+
#include <algorithm>
5+
#include <cstdio>
6+
using namespace std;
7+
8+
9+
const int MAXN = 200001;
10+
11+
int trees[MAXN*8];
12+
int mark[MAXN*8];
13+
int data[MAXN];
14+
15+
int N, Q;
16+
17+
void pushUp(int idx){
18+
trees[idx] = trees[idx<<1] + trees[idx<<1|1];
19+
}
20+
21+
void pushDown(int idx){
22+
if(mark[idx]){
23+
//cout<<"now at "<<idx<<" and i'm pushing down"<<endl;
24+
mark[idx<<1] = mark[idx<<1|1] = mark[idx];
25+
trees[idx<<1] += trees[idx];
26+
trees[idx<<1|1] += trees[idx];
27+
28+
trees[idx] = 0;
29+
30+
mark[idx] = 0;
31+
}
32+
}
33+
34+
void insert(int L, int R, int l, int r, int idx){
35+
//cout<<"try to insert "<<L<<" "<<R<<" "<<l<<" "<<r<<endl;
36+
if(L<=l && R>=r){
37+
//cout<<"insert!"<<endl;
38+
trees[idx] += 1;
39+
//ncout<<" idx = "<<idx<<" cur = "<<trees[idx]<<endl;
40+
mark[idx] = 1;
41+
return ;
42+
}
43+
pushDown(idx);
44+
int m = (l+r)>>1;
45+
if(L<=m){
46+
insert(L, R, l, m, idx<<1);
47+
}
48+
if(R>m){
49+
insert(L, R, m+1, r, idx<<1|1);
50+
}
51+
//pushUp(idx);
52+
}
53+
54+
int query(int L, int R, int l, int r, int idx){
55+
if(L<=l && R>=r){
56+
return trees[idx];
57+
}
58+
pushDown(idx);
59+
int m = (l+r)>>1;
60+
if(L<=m){
61+
return query(L, R, l, m, idx<<1);
62+
}
63+
if(R>m){
64+
return query(L, R, m+1, r, idx<<1|1);
65+
}
66+
}
67+
68+
69+
void build(int l, int r, int idx){
70+
if(l==r){
71+
trees[idx] = 0;
72+
return ;
73+
}
74+
int m = (l+r)>>1;
75+
build(l, m, 2*idx);
76+
build(m+1, r, 2*idx + 1);
77+
pushUp(idx);
78+
}
79+
80+
81+
82+
83+
int main(){
84+
memset(trees,0,sizeof(trees));
85+
memset(mark, 0, sizeof(mark));
86+
scanf("%d %d", &N,&Q);
87+
88+
89+
//build(1, N, 1);
90+
for(int i=0; i<N; i++){
91+
scanf("%d",&data[i]);
92+
}
93+
94+
95+
int left, right;
96+
for(int i=0; i<Q; i++){
97+
//cout<<"inserting -> "<<i<<" tree[1] = "<<trees[1]<<endl;
98+
scanf("%d %d", &left, &right);
99+
insert(left, right, 1, N, 1);
100+
}
101+
long long int qts[MAXN];
102+
//cout<<"query 1 1 "<<query(1,1,1,N,1)<<endl;
103+
for(int i=0; i<N; i++){
104+
qts[i] = query(i+1, i+1, 1, N, 1);
105+
//cout<<"querying "<<i+1<<" res = "<<qts[i]<<endl;
106+
}
107+
sort(qts, qts+N, std::greater<int>());
108+
sort(data, data+N , std::greater<int>());
109+
long long int ans = 0;
110+
for(int i=0; i<N; i++){
111+
ans += (qts[i])*data[i];
112+
//cout<<"qts["<<i<<"] = "<<qts[i]<<" and data["<<i<<"] = "<<data[i]<<endl;
113+
}
114+
115+
116+
cout<<ans<<endl;
117+
118+
return 0;
119+
}
120+

‎cf/169/a.out

22.3 KB
Binary file not shown.

‎gcj/A.cpp

+174
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,174 @@
1+
#include <iostream>
2+
#include <cstring>
3+
#include <cstdio>
4+
5+
6+
using namespace std;
7+
int T;
8+
string S[4];
9+
10+
11+
int checkRow(int row){
12+
int x = 0, y = 0, t = 0;
13+
for(int i=0; i<4; i++){
14+
if(S[row][i] == 'X' ){
15+
x++;
16+
}else if(S[row][i]== 'O'){
17+
y++;
18+
}else if(S[row][i]=='T'){
19+
t++;
20+
}
21+
}
22+
// 0-> x, 1->y, 2->nothing
23+
if(x==4){
24+
return 0;
25+
}
26+
if(y==4){
27+
return 1;
28+
}
29+
if(x==3 && t==1){
30+
return 0;
31+
}else if(y==3 && t==1){
32+
return 1;
33+
}
34+
return 2;
35+
}
36+
37+
int checkCol(int col){
38+
int x = 0, y = 0, t = 0;
39+
for(int i=0; i<4; i++){
40+
if(S[i][col] == 'X' ){
41+
x++;
42+
}else if(S[i][col]== 'O'){
43+
y++;
44+
}else if(S[i][col]=='T'){
45+
t++;
46+
}
47+
}
48+
// 0-> x, 1->y, 2->nothing
49+
if(x==4){
50+
return 0;
51+
}
52+
if(y==4){
53+
return 1;
54+
}
55+
if(x==3 && t==1){
56+
return 0;
57+
}else if(y==3 && t==1){
58+
return 1;
59+
}
60+
return 2;
61+
}
62+
63+
int checkLeftDiag(){
64+
int x = 0, y = 0, t = 0;
65+
for(int i=0; i<4; i++){
66+
if(S[i][i] == 'X' ){
67+
x++;
68+
}else if(S[i][i]== 'O'){
69+
y++;
70+
}else if(S[i][i]=='T'){
71+
t++;
72+
}
73+
}
74+
// 0-> x, 1->y, 2->nothing
75+
if(x==4){
76+
return 0;
77+
}
78+
if(y==4){
79+
return 1;
80+
}
81+
if(x==3 && t==1){
82+
return 0;
83+
}else if(y==3 && t==1){
84+
return 1;
85+
}
86+
return 2;
87+
}
88+
89+
int checkRightDiag(){
90+
int x = 0, y = 0, t = 0;
91+
for(int i=0; i<4; i++){
92+
if(S[i][3-i] == 'X' ){
93+
x++;
94+
}else if(S[i][3-i]== 'O'){
95+
y++;
96+
}else if(S[i][3-i]=='T'){
97+
t++;
98+
}
99+
}
100+
// 0-> x, 1->y, 2->nothing
101+
if(x==4){
102+
return 0;
103+
}
104+
if(y==4){
105+
return 1;
106+
}
107+
if(x==3 && t==1){
108+
return 0;
109+
}else if(y==3 && t==1){
110+
return 1;
111+
}
112+
return 2;
113+
}
114+
115+
116+
void work(){
117+
//diag
118+
bool empty = false;
119+
for(int i=0; i<4; i++){
120+
for(int j=0; j<4; j++){
121+
if(S[i][j]=='.')empty=true;
122+
}
123+
}
124+
bool x = false, y = false;
125+
for(int i=0; i<4; i++){
126+
int r = checkRow(i);
127+
if(r==0){
128+
x = true;
129+
}else if(r==1){
130+
y = true;
131+
}
132+
}
133+
for(int i=0; i<4; i++){
134+
int r = checkCol(i);
135+
if(r==0){
136+
x=true;
137+
}else if(r==1){
138+
y = true;
139+
}
140+
}
141+
int r = checkLeftDiag();
142+
if(r==0)x = true;
143+
if(r==1)y = true;
144+
145+
r = checkRightDiag();
146+
if(r==0)x = true;
147+
if(r==1)y = true;
148+
149+
//cout<<"res = "<<x<<" "<<y<<" "<<empty<<endl;
150+
151+
if((x && y && empty==false) || (x==false && y==false && empty==false)){
152+
cout<<"Case #"<<T<<": Draw"<<endl;
153+
}else if(x==true && y==false){
154+
cout<<"Case #"<<T<<": X won"<<endl;
155+
}else if(x==false && y==true){
156+
cout<<"Case #"<<T<<": O won"<<endl;
157+
}else if(x==false && y==false && empty==true){
158+
cout<<"Case #"<<T<<": Game has not completed"<<endl;
159+
}
160+
}
161+
162+
163+
int main(){
164+
int n_case;
165+
cin>>n_case;
166+
for(T = 1; T<=n_case; T++){
167+
for(int i=0; i<4; i++){
168+
cin>>S[i];
169+
}
170+
work();
171+
}
172+
return 0;
173+
}
174+

‎gcj/B.cpp

+77
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,77 @@
1+
#include <iostream>
2+
3+
using namespace std;
4+
int T, M, N;
5+
const int MAXN = 150;
6+
int mydata[MAXN][MAXN];
7+
8+
9+
bool checkRow(int i, int j){
10+
bool left = true, right = true;
11+
for(int k=0; k<j; k++){
12+
if(mydata[i][k]>mydata[i][j]){
13+
left = false;
14+
}
15+
}
16+
for(int k=M-1; k>j; k--){
17+
if(mydata[i][k]>mydata[i][j]){
18+
right = false;
19+
}
20+
}
21+
if(left && right){
22+
return true;
23+
}
24+
return false;
25+
}
26+
27+
bool checkCol(int i, int j){
28+
bool up = true, down = true;
29+
for(int k=0; k<i; k++){
30+
if(mydata[k][j]>mydata[i][j]){
31+
up = false;
32+
}
33+
}
34+
for(int k=N-1; k>i; k--){
35+
if(mydata[k][j]>mydata[i][j]){
36+
down = false;
37+
}
38+
}
39+
if(up&& down){
40+
return true;
41+
}
42+
return false;
43+
}
44+
45+
46+
void work(){
47+
bool ok = true;
48+
for(int i=0; i<N; i++){
49+
for(int j=0; j<M; j++){
50+
if( checkRow(i,j)==false && checkCol(i,j)==false){
51+
ok = false;
52+
}
53+
}
54+
}
55+
if(ok){
56+
cout<<"Case #"<<T<<": YES"<<endl;
57+
}else{
58+
cout<<"Case #"<<T<<": NO"<<endl;
59+
}
60+
}
61+
62+
int main(){
63+
64+
int n_case;
65+
cin>>n_case;
66+
for(T=1; T<=n_case; T++){
67+
cin>>N>>M;
68+
for(int i=0; i<N; i++){
69+
for(int j=0; j<M; j++){
70+
cin>>mydata[i][j];
71+
}
72+
}
73+
work();
74+
}
75+
return 0;
76+
}
77+

‎gcj/B_large.txt

+100
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,100 @@
1+
Case #1: NO
2+
Case #2: NO
3+
Case #3: YES
4+
Case #4: NO
5+
Case #5: NO
6+
Case #6: NO
7+
Case #7: NO
8+
Case #8: NO
9+
Case #9: NO
10+
Case #10: NO
11+
Case #11: NO
12+
Case #12: NO
13+
Case #13: YES
14+
Case #14: NO
15+
Case #15: NO
16+
Case #16: YES
17+
Case #17: YES
18+
Case #18: YES
19+
Case #19: NO
20+
Case #20: NO
21+
Case #21: NO
22+
Case #22: NO
23+
Case #23: NO
24+
Case #24: NO
25+
Case #25: NO
26+
Case #26: NO
27+
Case #27: YES
28+
Case #28: YES
29+
Case #29: YES
30+
Case #30: NO
31+
Case #31: NO
32+
Case #32: NO
33+
Case #33: YES
34+
Case #34: NO
35+
Case #35: YES
36+
Case #36: NO
37+
Case #37: NO
38+
Case #38: NO
39+
Case #39: YES
40+
Case #40: NO
41+
Case #41: NO
42+
Case #42: NO
43+
Case #43: YES
44+
Case #44: YES
45+
Case #45: YES
46+
Case #46: YES
47+
Case #47: NO
48+
Case #48: NO
49+
Case #49: YES
50+
Case #50: NO
51+
Case #51: NO
52+
Case #52: YES
53+
Case #53: NO
54+
Case #54: YES
55+
Case #55: NO
56+
Case #56: NO
57+
Case #57: YES
58+
Case #58: YES
59+
Case #59: NO
60+
Case #60: NO
61+
Case #61: NO
62+
Case #62: NO
63+
Case #63: YES
64+
Case #64: NO
65+
Case #65: YES
66+
Case #66: YES
67+
Case #67: YES
68+
Case #68: NO
69+
Case #69: NO
70+
Case #70: YES
71+
Case #71: YES
72+
Case #72: YES
73+
Case #73: YES
74+
Case #74: NO
75+
Case #75: NO
76+
Case #76: NO
77+
Case #77: NO
78+
Case #78: YES
79+
Case #79: NO
80+
Case #80: YES
81+
Case #81: NO
82+
Case #82: NO
83+
Case #83: NO
84+
Case #84: YES
85+
Case #85: NO
86+
Case #86: YES
87+
Case #87: NO
88+
Case #88: NO
89+
Case #89: NO
90+
Case #90: YES
91+
Case #91: NO
92+
Case #92: NO
93+
Case #93: YES
94+
Case #94: NO
95+
Case #95: YES
96+
Case #96: NO
97+
Case #97: NO
98+
Case #98: NO
99+
Case #99: NO
100+
Case #100: NO

‎gcj/B_small.txt

+100
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,100 @@
1+
Case #1: YES
2+
Case #2: NO
3+
Case #3: YES
4+
Case #4: NO
5+
Case #5: YES
6+
Case #6: YES
7+
Case #7: NO
8+
Case #8: NO
9+
Case #9: NO
10+
Case #10: NO
11+
Case #11: NO
12+
Case #12: NO
13+
Case #13: NO
14+
Case #14: NO
15+
Case #15: YES
16+
Case #16: NO
17+
Case #17: YES
18+
Case #18: NO
19+
Case #19: YES
20+
Case #20: NO
21+
Case #21: NO
22+
Case #22: NO
23+
Case #23: NO
24+
Case #24: NO
25+
Case #25: NO
26+
Case #26: NO
27+
Case #27: NO
28+
Case #28: YES
29+
Case #29: YES
30+
Case #30: YES
31+
Case #31: NO
32+
Case #32: NO
33+
Case #33: YES
34+
Case #34: NO
35+
Case #35: NO
36+
Case #36: NO
37+
Case #37: YES
38+
Case #38: NO
39+
Case #39: YES
40+
Case #40: NO
41+
Case #41: NO
42+
Case #42: NO
43+
Case #43: NO
44+
Case #44: NO
45+
Case #45: NO
46+
Case #46: YES
47+
Case #47: NO
48+
Case #48: YES
49+
Case #49: NO
50+
Case #50: NO
51+
Case #51: YES
52+
Case #52: NO
53+
Case #53: YES
54+
Case #54: NO
55+
Case #55: YES
56+
Case #56: NO
57+
Case #57: NO
58+
Case #58: NO
59+
Case #59: NO
60+
Case #60: NO
61+
Case #61: YES
62+
Case #62: NO
63+
Case #63: YES
64+
Case #64: NO
65+
Case #65: YES
66+
Case #66: YES
67+
Case #67: NO
68+
Case #68: YES
69+
Case #69: NO
70+
Case #70: NO
71+
Case #71: YES
72+
Case #72: YES
73+
Case #73: YES
74+
Case #74: NO
75+
Case #75: NO
76+
Case #76: YES
77+
Case #77: NO
78+
Case #78: NO
79+
Case #79: NO
80+
Case #80: YES
81+
Case #81: YES
82+
Case #82: NO
83+
Case #83: YES
84+
Case #84: YES
85+
Case #85: NO
86+
Case #86: NO
87+
Case #87: NO
88+
Case #88: YES
89+
Case #89: YES
90+
Case #90: NO
91+
Case #91: YES
92+
Case #92: NO
93+
Case #93: YES
94+
Case #94: YES
95+
Case #95: NO
96+
Case #96: NO
97+
Case #97: NO
98+
Case #98: NO
99+
Case #99: NO
100+
Case #100: NO

‎gcj/a.out

9.74 KB
Binary file not shown.

‎gcj/large.txt

+1,000
Large diffs are not rendered by default.

‎gcj/res.txt

+6
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
Case #1: X won
2+
Case #2: Draw
3+
Case #3: Game has not completed
4+
Case #4: O won
5+
Case #5: O won
6+
Case #6: O won

‎gcj/res2.txt

+6
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
Case #1: X won
2+
Case #2: Draw
3+
Case #3: Game has not completed
4+
Case #4: O won
5+
Case #5: O won
6+
Case #6: O won

‎gcj/small.txt

+10
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
Case #1: O won
2+
Case #2: O won
3+
Case #3: X won
4+
Case #4: Game has not completed
5+
Case #5: Draw
6+
Case #6: Draw
7+
Case #7: X won
8+
Case #8: X won
9+
Case #9: Game has not completed
10+
Case #10: X won

‎hdoj/.1698.cpp.swp

12 KB
Binary file not shown.

0 commit comments

Comments
 (0)
Please sign in to comment.