Skip to content

Commit f9cb63c

Browse files
author
rdrgn
committed
Merge branch 'master' into remin/pair-programming
2 parents 0b3a24a + 7776de6 commit f9cb63c

File tree

122 files changed

+3234
-2
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

122 files changed

+3234
-2
lines changed

‎a-mul-b/PROBLEM

+17
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
# -*- coding: utf-8; mode: python -*-
2+
3+
pid='X'
4+
5+
problem(
6+
time_limit=1.0,
7+
id=pid,
8+
title=pid + "A times B",
9+
#wiki_name="Your pukiwiki page name", # for wikify plugin
10+
#assignees=['Assignees', 'for', 'this', 'problem'], # for wikify plugin
11+
#need_custom_judge=True, # for wikify plugin
12+
reference_solution='cpp-correct',
13+
)
14+
15+
atcoder_config(
16+
task_id=None # None means a spare
17+
)

‎a-mul-b/c-correct/SOLUTION

+9
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
# -*- coding: utf-8; mode: python -*-
2+
3+
## Solution definition.
4+
## Choose and modify one of definitions below.
5+
## Adding a parameter challenge_cases marks this solution as a wrong solution.
6+
c_solution(src='main.c')
7+
#cxx_solution(src='main.cc')
8+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
9+
#script_solution(src='main.py')

‎a-mul-b/c-correct/main.c

+13
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
#include <stdio.h>
2+
3+
int main() {
4+
int t;
5+
scanf("%d", &t);
6+
while (t-- > 0) {
7+
int a, b;
8+
scanf("%d %d ", &a, &b);
9+
int answer = a * b;
10+
printf("%d\n", answer);
11+
}
12+
return 0;
13+
}

‎a-mul-b/cpp-correct/SOLUTION

+9
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
# -*- coding: utf-8; mode: python -*-
2+
3+
## Solution definition.
4+
## Choose and modify one of definitions below.
5+
## Adding a parameter challenge_cases marks this solution as a wrong solution.
6+
#c_solution(src='main.c')
7+
cxx_solution(src='main.cpp')
8+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
9+
#script_solution(src='main.py')

‎a-mul-b/cpp-correct/main.cpp

+12
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
#include <iostream>
2+
3+
int main() {
4+
int t;
5+
std::cin >> t;
6+
for(int i=0; i<t; i++) {
7+
int a, b;
8+
std::cin >> a >> b;
9+
int ans = a * b;
10+
std::cout << ans << std::endl;
11+
}
12+
}

‎a-mul-b/java-correct/AB.java

+16
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
import java.util.Scanner;
2+
3+
public class AB {
4+
5+
public static void main(String[] args) {
6+
Scanner sc = new Scanner(System.in);
7+
int n = sc.nextInt();
8+
for(int i=0; i<n; i++) {
9+
int a = sc.nextInt();
10+
int b = sc.nextInt();
11+
System.out.println(a * b);
12+
}
13+
sc.close();
14+
}
15+
16+
}

‎a-mul-b/java-correct/SOLUTION

+18
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
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='AB.java', encoding='UTF-8', mainclass='AB')
7+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main', challenge_cases=[])
8+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main', challenge_cases=['10_corner*.in'])
9+
#script_solution(src='main.sh') # shebang line is required
10+
#script_solution(src='main.pl') # shebang line is required
11+
#script_solution(src='main.py') # shebang line is required
12+
#script_solution(src='main.rb') # shebang line is required
13+
#js_solution(src='main.js') # javascript (nodejs)
14+
#hs_solution(src='main.hs') # haskell (stack + ghc)
15+
#cs_solution(src='main.cs') # C# (mono)
16+
17+
## Score
18+
#expected_score(100)

‎a-mul-b/python-correct/SOLUTION

+9
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
# -*- coding: utf-8; mode: python -*-
2+
3+
## Solution definition.
4+
## Choose and modify one of definitions below.
5+
## Adding a parameter challenge_cases marks this solution as a wrong solution.
6+
#c_solution(src='main.c')
7+
#cxx_solution(src='main.cc')
8+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
9+
script_solution(src='main.py')

‎a-mul-b/python-correct/main.py

+14
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
#!/usr/local/bin/python3
2+
# -*- coding: utf-8 -*-
3+
4+
def solve():
5+
a,b = map(int,input().split())
6+
return a * b
7+
8+
def main():
9+
cases = int(input())
10+
for _ in range(cases):
11+
print(solve())
12+
13+
if __name__ == '__main__':
14+
main()

‎a-mul-b/ruby-correct/SOLUTION

+9
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
# -*- coding: utf-8; mode: python -*-
2+
3+
## Solution definition.
4+
## Choose and modify one of definitions below.
5+
## Adding a parameter challenge_cases marks this solution as a wrong solution.
6+
#c_solution(src='main.c')
7+
#cxx_solution(src='main.cc')
8+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
9+
script_solution(src='main.rb')

‎a-mul-b/ruby-correct/main.rb

+8
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
#!/usr/bin/ruby
2+
3+
n = gets.to_i
4+
while n>0
5+
a, b = gets.split.map(&:to_i)
6+
puts a*b
7+
n = n-1
8+
end

‎a-mul-b/shell-correct/SOLUTION

+18
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
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', challenge_cases=[])
8+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main', challenge_cases=['10_corner*.in'])
9+
script_solution(src='main.sh') # shebang line is required
10+
#script_solution(src='main.pl') # shebang line is required
11+
#script_solution(src='main.py') # shebang line is required
12+
#script_solution(src='main.rb') # shebang line is required
13+
#js_solution(src='main.js') # javascript (nodejs)
14+
#hs_solution(src='main.hs') # haskell (stack + ghc)
15+
#cs_solution(src='main.cs') # C# (mono)
16+
17+
## Score
18+
#expected_score(100)

‎a-mul-b/shell-correct/main.sh

+2
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
#!/bin/bash
2+
sed -e '1d' | awk '{print $1*$2;}'

‎a-mul-b/statement.md

+113
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,113 @@
1+
# Description
2+
3+
2つの整数 $A, B$ の積を求めよ。
4+
5+
# Constraints
6+
7+
* $A, B$ は整数
8+
* $-5000 \leq A, B \leq 5000$
9+
10+
# Input
11+
1つの入力ファイルは複数のテストケースからなる。
12+
13+
入力ファイルの最初の1行目にはテストケースの個数 $T$ が記される $(1 \leq T \leq 50)$ 。
14+
15+
2行目以降には、$T$ 個のテストケースが記述されており、各テストケースは次の形式で表される。
16+
17+
```
18+
$A$ $B$
19+
```
20+
21+
# Output
22+
各テストケースに対して、$A \times B$ を1行ずつ出力せよ。
23+
24+
# Sample Input
25+
```
26+
3
27+
1 2
28+
-4 2
29+
-100 100
30+
```
31+
32+
# Sample Output
33+
```
34+
2
35+
-8
36+
-10000
37+
```
38+
39+
# Sample Programs
40+
41+
以下の内容は，Practice Contestの問題 A+B と同等です．理解できている人は読み飛ばして構いません．
42+
43+
## C
44+
45+
```
46+
#include &lt;stdio.h&gt;
47+
48+
int main() {
49+
int t;
50+
scanf("%d", &t);
51+
while (t-- > 0){
52+
int a, b;
53+
scanf("%d %d", &a, &b);
54+
int answer = 0; // EDIT HERE
55+
printf("%d\n", answer);
56+
}
57+
return 0;
58+
}
59+
```
60+
61+
## Java
62+
63+
```
64+
import java.util.Scanner;
65+
66+
public class Main {
67+
public static void main(String[] args) {
68+
Scanner sc = new Scanner(System.in);
69+
int n = sc.nextInt();
70+
for(int i=0; i < n; i++){
71+
int a = sc.nextInt();
72+
int b = sc.nextInt();
73+
System.out.println(0); // EDIT HERE
74+
}
75+
sc.close();
76+
}
77+
}
78+
```
79+
80+
# Answer Book
81+
82+
## C
83+
84+
### コンパイル・実行
85+
86+
```
87+
> gcc main.c
88+
> ./a.out
89+
```
90+
91+
コンパイルでは必要に応じて、``-O2``や``-Wall``などのコンパイルオプションを使用するとよい場合がある。
92+
93+
### ファイル入出力を同時に行う（`in.txt`から入力して`out.txt`に出力）
94+
95+
```
96+
> ./a.out < in.txt > out.txt
97+
```
98+
99+
## Java
100+
101+
### コンパイル・実行
102+
103+
```
104+
> javac Main.java
105+
> java Main
106+
```
107+
108+
### ファイル入出力を同時に行う（`in.txt`から入力して`out.txt`に出力）
109+
110+
```
111+
> java Main < in.txt > out.txt
112+
```
113+

‎a-mul-b/tests/TESTSET

+19
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
# -*- coding: utf-8; mode: python -*-
2+
3+
## Input generators.
4+
#c_generator(src='generator.c')
5+
cxx_generator(src='generator.cpp', dependency=['testlib.h'])
6+
#java_generator(src='Generator.java', encoding='UTF-8', mainclass='Generator')
7+
# script_generator(src='generator.py')
8+
9+
## Input validators.
10+
#c_validator(src='validator.c')
11+
cxx_validator(src='validator.cpp', dependency=['testlib.h'])
12+
#java_validator(src='Validator.java', encoding='UTF-8', mainclass='Validator')
13+
#script_validator(src='validator.py')
14+
15+
## Output judges.
16+
#c_judge(src='judge.c')
17+
#cxx_judge(src='judge.cc')
18+
#java_judge(src='Judge.java', encoding='UTF-8', mainclass='Judge')
19+
#script_judge(src='judge.py')

‎a-mul-b/tests/constraints.h

+3
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,3 @@
1+
#define MAX_T 50
2+
#define MAX_AB 5000
3+

‎a-mul-b/tests/generator.cpp

+28
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
#include <fstream>
2+
#include <string>
3+
#include "testlib.h"
4+
#include "constraints.h"
5+
6+
using namespace std;
7+
8+
void generate(const string &file_name, int num_case, int max_num) {
9+
ofstream ofs(file_name);
10+
ofs << num_case <<endl;
11+
12+
for (int i=0; i<num_case; i++) {
13+
ofs << rnd.next(-max_num, max_num) << " ";
14+
ofs << rnd.next(-max_num, max_num) << endl;
15+
}
16+
}
17+
18+
int main(int argc, char* argv[]) {
19+
registerGen(argc, argv, 1);
20+
21+
generate("small.in", 10, 500);
22+
generate("large.in", MAX_T, MAX_AB);
23+
for (int i=0; i<10; i++) {
24+
generate("random_test" + to_string(i) + ".in", MAX_T, MAX_AB);
25+
}
26+
27+
return 0;
28+
}

‎a-mul-b/tests/sample.diff

+3
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,3 @@
1+
2
2+
-8
3+
-10000

‎a-mul-b/tests/validator.cpp

+24
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
#include "testlib.h"
2+
#include "constraints.h"
3+
using namespace std;
4+
5+
void check_case(){
6+
int a = inf.readInt(-MAX_AB, MAX_AB, "a");
7+
inf.readSpace();
8+
int b = inf.readInt(-MAX_AB, MAX_AB, "b");
9+
inf.readEoln();
10+
}
11+
12+
int main(){
13+
registerValidation();
14+
15+
int cases = inf.readInt(1, MAX_T, "cases");
16+
inf.readEoln();
17+
18+
for(int i=0; i<cases; ++i){
19+
check_case();
20+
}
21+
22+
inf.readEof();
23+
return 0;
24+
}

‎even2primes/PROBLEM

+17
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
# -*- coding: utf-8; mode: python -*-
2+
3+
pid='X'
4+
5+
problem(
6+
time_limit=10.0,
7+
id=pid,
8+
title=pid + "Even2Primes",
9+
#wiki_name="Your pukiwiki page name", # for wikify plugin
10+
#assignees=['Assignees', 'for', 'this', 'problem'], # for wikify plugin
11+
#need_custom_judge=True, # for wikify plugin
12+
reference_solution='cpp-correct',
13+
)
14+
15+
atcoder_config(
16+
task_id=None # None means a spare
17+
)

‎even2primes/c-correct/SOLUTION

+9
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
# -*- coding: utf-8; mode: python -*-
2+
3+
## Solution definition.
4+
## Choose and modify one of definitions below.
5+
## Adding a parameter challenge_cases marks this solution as a wrong solution.
6+
c_solution(src='main.c')
7+
#cxx_solution(src='main.cc')
8+
#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
9+
#script_solution(src='main.py')

0 commit comments

Comments
 (0)