-
Notifications
You must be signed in to change notification settings - Fork 3
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #66 from tsutaj/feature
v1.5.0-release
- Loading branch information
Showing
34 changed files
with
539 additions
and
166 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,12 @@ | ||
| { | ||
| "python.pythonPath": "virtualenv/bin/python", | ||
| "python.linting.enabled": true, | ||
| "python.linting.flake8Enabled": true, | ||
| "python.linting.pylintArgs": ["--rcfile=setup.cfg"], | ||
| "python.linting.mypyEnabled": true, | ||
| "python.formatting.provider": "black", | ||
| "editor.formatOnSave": true, | ||
| "editor.codeActionsOnSave": { | ||
| "source.organizeImports": true | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,17 +1,21 @@ | ||
| # choose mode ('docs' or 'local') | ||
| mode = "local" | ||
|
|
||
| # problem id (it is used for the name of output html file) | ||
| id = "A" | ||
|
|
||
| # pato to a statement, output params | ||
| statement_path = "./statement/statement.md" | ||
| # output params | ||
| params_path = "./tests/constraints.hpp" | ||
|
|
||
| # path to statements | ||
| [[statements]] | ||
| path = "./statement/statement_ja.md" | ||
| lang = "ja" | ||
|
|
||
| [[statements]] | ||
| path = "./statement/statement_en.md" | ||
| lang = "en" | ||
|
|
||
| # write constraints | ||
| [constraints] | ||
| MIN_AB = 1 | ||
| MAX_AB = 1_000_000_000 | ||
| MIN_T = 1 | ||
| MAX_T = 100_000 | ||
|
|
File renamed without changes.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,31 @@ | ||
| # A+B | ||
|
|
||
| ## 問題文 | ||
|
|
||
| 2 つの整数 $A$, $B$ が与えられます。$A + B$ を出力してください。 | ||
|
|
||
| $T$ 個のテストケースが与えられますので、$T$ 行出力してください。 | ||
|
|
||
| ## 入力 | ||
|
|
||
| ``` | ||
| $T$ | ||
| $A_1$ $B_1$ | ||
| $A_2$ $B_2$ | ||
| ... | ||
| $A_T$ $B_T$ | ||
| ``` | ||
|
|
||
| - 入力は全て整数で与えられる | ||
| - ${@constraints.MIN_T} \leq T \leq {@constraints.MAX_T}$ | ||
| - ${@constraints.MIN_AB} \leq A_i, B_i \leq {@constraints.MAX_AB}$ | ||
|
|
||
| ## 出力 | ||
|
|
||
| $T$ 行出力してください。 | ||
|
|
||
| $i$ 行目には $A_i + B_i$ の計算結果を出力してください。 | ||
|
|
||
| ## 入出力例 | ||
|
|
||
| {@samples.all} |
1 change: 0 additions & 1 deletion
1
sample/A/tests/00_sample_00.md → sample/A/tests/en/00_sample_00.md
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,2 +1 @@ | ||
| Note that a new-line is required in the end of output. | ||
|
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1 @@ | ||
| 出力の最後の改行を忘れないようご注意ください。 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,37 @@ | ||
| # problem id (it is used for the name of output html file) | ||
| id = "C" | ||
|
|
||
| # output params | ||
| params_path = "./tests/constraints.hpp" | ||
|
|
||
| # path to statements | ||
| [[statements]] | ||
| path = "./statement/en/statement_1.md" | ||
| lang = "en" | ||
|
|
||
| [[statements]] | ||
| path = "./statement/en/statement_2.md" | ||
| lang = "en" | ||
|
|
||
| [[statements]] | ||
| path = "./statement/ja/statement_1.md" | ||
| lang = "ja" | ||
|
|
||
| [[statements]] | ||
| path = "./statement/ja/statement_2.md" | ||
| lang = "ja" | ||
|
|
||
| # write constraints | ||
| [constraints] | ||
| MIN_A = 1 | ||
| MAX_A = 1_000_000_000 | ||
|
|
||
| MIN_N_SMALL = 1 | ||
| MAX_N_SMALL = 1000 | ||
| MIN_Q_SMALL = 1 | ||
| MAX_Q_SMALL = 1000 | ||
|
|
||
| MIN_N_LARGE = 1 | ||
| MAX_N_LARGE = 100_000 | ||
| MIN_Q_LARGE = 1 | ||
| MAX_Q_LARGE = 100_000 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,31 @@ | ||
| # Static Range Sum | ||
|
|
||
| ## Note | ||
|
|
||
| The difference between C1 and C2 is only constraints of $N$ and $Q$. | ||
|
|
||
| ## Problem statement | ||
|
|
||
| You are given a non-negative integer sequence $A = (a_0, a_1, \ldots, a_{N-1})$ with the length $N$. Process the following $Q$ queries in order: | ||
|
|
||
| - You are given integers $l_i$ and $r_i$. Print $\sum_{k=l_i}^{r_i-1}$. | ||
|
|
||
| ## Input | ||
|
|
||
| ``` | ||
| $N$ $Q$ | ||
| $a_0$ $a_1$ $\ldots$ $a_{N-1}$ | ||
| $l_1$ $r_1$ | ||
| $\vdots$ | ||
| $l_Q$ $r_Q$ | ||
| ``` | ||
|
|
||
| - All inputs are integers. | ||
| - ${@constraints.MIN_N_SMALL} \leq N \leq {@constraints.MAX_N_SMALL}$ | ||
| - ${@constraints.MIN_Q_SMALL} \leq Q \leq {@constraints.MAX_Q_SMALL}$ | ||
| - ${@constraints.MIN_A} \leq a_i \leq {@constraints.MAX_A}$ | ||
| - $1 \leq l_i < r_i \leq N$ | ||
|
|
||
| ## Sample | ||
|
|
||
| {@samples.all} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,31 @@ | ||
| # Static Range Sum | ||
|
|
||
| ## Note | ||
|
|
||
| The difference between C1 and C2 is only constraints of $N$ and $Q$. | ||
|
|
||
| ## Problem statement | ||
|
|
||
| You are given a non-negative integer sequence $A = (a_0, a_1, \ldots, a_{N-1})$ with the length $N$. Process the following $Q$ queries in order: | ||
|
|
||
| - You are given integers $l_i$ and $r_i$. Print $\sum_{k=l_i}^{r_i-1}$. | ||
|
|
||
| ## Input | ||
|
|
||
| ``` | ||
| $N$ $Q$ | ||
| $a_0$ $a_1$ $\ldots$ $a_{N-1}$ | ||
| $l_1$ $r_1$ | ||
| $\vdots$ | ||
| $l_Q$ $r_Q$ | ||
| ``` | ||
|
|
||
| - All inputs are integers. | ||
| - ${@constraints.MIN_N_LARGE} \leq N \leq {@constraints.MAX_N_LARGE}$ | ||
| - ${@constraints.MIN_Q_LARGE} \leq Q \leq {@constraints.MAX_Q_LARGE}$ | ||
| - ${@constraints.MIN_A} \leq a_i \leq {@constraints.MAX_A}$ | ||
| - $1 \leq l_i < r_i \leq N$ | ||
|
|
||
| ## Sample | ||
|
|
||
| {@samples.all} |
Oops, something went wrong.