Merge remote-tracking branch 'origin' into tossy/json-generator

Author: tossy310

a*b/PROBLEM renamed to a-mul-b/PROBLEM

@@ -0,0 +1,17 @@
+# -*- coding: utf-8; mode: python -*-
+
+pid='X'
+
+problem(
+  time_limit=1.0,
+  id=pid,
+  title=pid + "Battle Royal",
+  #wiki_name="Your pukiwiki page name", # for wikify plugin
+  #assignees=['Assignees', 'for', 'this', 'problem'], # for wikify plugin
+  #need_custom_judge=True, # for wikify plugin
+  reference_solution='shinya',
+  )
+
+atcoder_config(
+  task_id=None # None means a spare
+)

a*b/c-correct/SOLUTION renamed to a-mul-b/c-correct/SOLUTION

@@ -0,0 +1,20 @@
+# -*- coding: utf-8; mode: python -*-
+
+## Solution
+#c_solution(src='main.c') # -lm -O2 as default
+cxx_solution(src='ryoissy-battleroyal.cpp', 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)

a*b/c-correct/main.c renamed to a-mul-b/c-correct/main.c

@@ -0,0 +1,24 @@
+#include <bits/stdc++.h>
+#define MOD 1000000007LL
+using namespace std;
+typedef long long ll;
+typedef pair<int,int> P;
+
+void solve(){
+	int cnt=0;
+	for(int i=0;i<100;i++){
+		int a;
+		scanf("%d",&a);
+		cnt+=a;
+	}
+	printf("%d\n",100-cnt);
+}
+
+int main(void){
+	int t;
+	scanf("%d",&t);
+	for(int i=0;i<t;i++){
+		solve();
+	}
+	return 0;
+}

a*b/cpp-correct/SOLUTION renamed to a-mul-b/cpp-correct/SOLUTION

@@ -0,0 +1,18 @@
+# -*- 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)

a*b/cpp-correct/main.cpp renamed to a-mul-b/cpp-correct/main.cpp

@@ -0,0 +1,30 @@
+#!/usr/local/bin/python3
+# -*- coding: utf-8 -*-
+
+def solve():
+    kill = list(map(int,input().split()))
+    kill.sort()
+
+    n = len(kill)
+    alive = [1]*n
+
+    for i in range(n):
+        rem = kill[i]
+        for j in range(i):
+            if rem == 0:
+                break
+
+            if alive[j]:
+                alive[j] = 0
+                rem -= 1
+
+        assert rem == 0
+
+    print(sum(alive))
+
+def main():
+    for _ in range(int(input())):
+        solve()
+
+if __name__ == '__main__':
+    main()

a*b/java-correct/AB.java renamed to a-mul-b/java-correct/AB.java

@@ -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=[]) # -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)

a*b/java-correct/SOLUTION renamed to a-mul-b/java-correct/SOLUTION

@@ -0,0 +1,23 @@
+#include <iostream>
+using namespace std;
+
+int main(void) {
+  const int N = 100;
+  int T;
+  int K[N];
+
+  cin >> T;
+  for(int t = 0; t < T; t++) {
+    for(int i = 0; i < N; i++) {
+      cin >> K[i];
+    }
+
+    int sum = 0;
+    for(int i = 0; i < N; i++) {
+      sum += K[i];
+    }
+    cout << N - sum << endl;
+  }
+
+  return 0;
+}

a*b/python-correct/SOLUTION renamed to a-mul-b/python-correct/SOLUTION

@@ -0,0 +1,54 @@
+# Description
+
+荒廃した孤島に100人のプレイヤーが集められました。
+彼らは武器と知恵を駆使して、生き残りを懸けたバトルロイヤルを始めます。
+
+バトルロイヤルでは、プレイヤーは他のプレイヤーに攻撃を仕掛けて脱落させることができます。
+その際、あるプレイヤーが他のプレイヤーを1人脱落させるごとに、脱落させたプレイヤーの**キル数**が1ずつ増加します。
+脱落させられたプレイヤーのキル数は変化しません。
+
+100人のプレイヤーそれぞれについて$i$番目のプレイヤーのキル数$K_i$が与えられるので、脱落せずに生き残っているプレイヤーの人数を求めてください。
+ただし、プレイヤーが他のプレイヤーによるキル以外によってひとりでに脱落することはないものとします。
+
+# Constraints
+
+- プレイヤー数は$100$である
+- $i$番目のプレイヤーのキル数$K_i (1 \leq i \leq 100)$は0以上の整数である
+- 100人のプレイヤーのキル数としてありえない入力は与えられない
+
+# Input
+
+1つの入力ファイルは複数のテストケースからなる。
+
+入力ファイルの最初の1行目にはテストケースの個数$T$が記される$(1 \leq T \leq 100)$。
+
+2行目以降には、$T$個のテストケースが記述されており、各テストケースは次の形式で表される。
+
+```
+$K_1$ $K_2$ $\ldots$ $K_{100}$
+```
+
+ただし、$K_i$は$i$人目$(1 \leq i \leq 100)$のプレイヤーのキル数を表す。
+
+# Output
+
+各テストケースに対して、脱落せずに生き残っているプレイヤーの人数を出力せよ。
+
+# Sample Input
+
+```
+4
+0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
+20 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
+0 0 1 1 0 2 0 0 1 0 0 2 0 2 1 2 0 0 0 1 0 2 1 1 2 1 3 2 0 4 1 0 1 0 1 2 2 1 0 0 1 0 1 1 0 1 1 0 0 1 1 1 0 0 1 0 2 1 1 1 1 0 3 1 1 0 0 4 1 1 2 0 1 2 0 0 2 1 1 0 1 1 2 0 3 0 2 1 1 0 1 1 1 2 0 1 1 0 1 1
+1 2 1 1 0 0 1 1 1 1 0 0 1 0 1 1 0 2 1 3 0 2 0 1 2 0 1 2 3 3 0 1 2 0 2 0 1 1 0 2 2 2 0 1 1 1 1 0 0 1 1 2 1 1 0 1 3 0 1 1 0 0 0 0 2 3 0 2 1 0 2 2 0 0 1 2 0 0 1 1 1 1 0 1 0 0 3 1 1 1 0 1 1 1 1 2 1 3 0 0
+```
+
+# Sample Output
+
+```
+1
+80
+8
+3
+```

a*b/python-correct/main.py renamed to a-mul-b/python-correct/main.py

@@ -0,0 +1,41 @@
+# -*- coding: utf-8; mode: python -*-
+
+## Input generators.
+#c_generator(src='generator.c')
+cxx_generator(src='generator.cpp', dependency=['testlib.h'])
+#java_generator(src='Generator.java', encoding='UTF-8', mainclass='Generator')
+#script_generator(src='generator.pl')
+
+## Input validators.
+#c_validator(src='validator.c')
+cxx_validator(src='validator.cpp', dependency=['testlib.h'])
+#java_validator(src='Validator.java', encoding='UTF-8',
+#               mainclass='tmp/validator/Validator')
+#script_validator(src='validator.pl')
+
+## Output judges.
+#c_judge(src='judge.c')
+#cxx_judge(src='judge.cc', dependency=['testlib.h'],
+#          variant=testlib_judge_runner)
+#java_judge(src='Judge.java', encoding='UTF-8', mainclass='Judge')
+#script_judge(src='judge.py')
+
+## Reactives.
+#c_reactive(src='reactive.c')
+#cxx_reactive(src='reactive.cc', dependency=['testlib.h', 'reactive.hpp'],
+#             variant=kupc_reactive_runner)
+#java_reactive(src='Reactive.java', encoding='UTF-8', mainclass='Judge')
+#script_reactive(src='reactive.py')
+
+## Extra Testsets.
+# icpc type
+#icpc_merger(input_terminator='0 0\n')
+# icpc wf ~2011
+#icpc_merger(input_terminator='0 0\n',
+#            output_replace=casenum_replace('Case 1', 'Case {0}'))
+#gcj_merger(output_replace=casenum_replace('Case 1', 'Case {0}'))
+id='X'
+#merged_testset(name=id + '_Merged', input_pattern='*.in')
+#subtask_testset(name='All', score=100, input_patterns=['*'])
+# precisely scored by judge program like Jiyukenkyu (KUPC 2013)
+#scoring_judge()

a*b/ruby-correct/SOLUTION renamed to a-mul-b/ruby-correct/SOLUTION

@@ -0,0 +1,2 @@
+const int MAX_T = 100;
+const int PLAYERS = 100;

a*b/ruby-correct/main.rb renamed to a-mul-b/ruby-correct/main.rb

@@ -0,0 +1,90 @@
+#include <fstream>
+#include <string>
+#include <algorithm>
+#include <random>
+#include "testlib.h"
+#include "constraints.h"
+using namespace std;
+
+vector<int> random_case(int kill_sum, int killers) {
+  int remain = kill_sum - killers;
+  vector<int> K(PLAYERS);
+  for(int i = 0; i < killers; i++) K[i] = 1;
+  for(int i = 0; i < remain; i++) {
+    K[rnd.next(killers)]++;
+  }
+  shuffle(K.begin(), K.end());
+  return K;
+}
+
+vector<int> no_kill_case() {
+  vector<int> K(PLAYERS);
+  return K;
+}
+
+void write_data_set(const string &name, vector< vector<int> > &data_set) {
+  int T = data_set.size();
+  ofstream ofs(name);
+  ofs << T << "\n";
+  for(int t = 0; t < T; t++) {
+    for(int i = 0; i < PLAYERS; i++) {
+      ofs << data_set[t][i] << (i + 1 != PLAYERS ? " " : "\n");
+    }
+  }
+}
+
+void generate_small() {
+  vector< vector<int> > data_set;
+  data_set.push_back(random_case(32, 15));
+  data_set.push_back(random_case(54, 3));
+  data_set.push_back(random_case(82, 10));
+  data_set.push_back(random_case(98, 87));
+  data_set.push_back(random_case(77, 2));
+  data_set.push_back(no_kill_case());
+  write_data_set("small.in", data_set);
+}
+
+void generate_large() {
+  vector< vector<int> > data_set;
+  for(int t = 0; t < 90; t++) {
+    int kill_sum = rnd.next(PLAYERS - 2) + 1;
+    int killers = rnd.next(kill_sum) + 1;
+    data_set.push_back(random_case(kill_sum, killers));
+  }
+  data_set.push_back(random_case(32, 15));
+  data_set.push_back(random_case(54, 3));
+  data_set.push_back(random_case(82, 10));
+  data_set.push_back(random_case(98, 87));
+  data_set.push_back(random_case(77, 2));
+  data_set.push_back(random_case(99, 99));
+  data_set.push_back(random_case(99, 1));
+  data_set.push_back(random_case(5, 4));
+  data_set.push_back(random_case(42, 7));
+  data_set.push_back(no_kill_case());
+  shuffle(data_set.begin(), data_set.end());
+  write_data_set("large.in", data_set);
+}
+
+void generate(const string &name, int T) {
+  vector< vector<int> > data_set;
+  for(int t = 0; t < T; t++) {
+    int kill_sum = rnd.next(PLAYERS - 2) + 1;
+    int killers = rnd.next(kill_sum) + 1;
+    data_set.push_back(random_case(kill_sum, killers));
+  }
+  shuffle(data_set.begin(), data_set.end());
+  write_data_set(name, data_set);
+}
+
+int main(int argc, char* argv[]) {
+  registerGen(argc, argv, 1);
+
+  generate_small();
+  generate_large();
+
+  for(int i = 0; i < 10; i++) {
+    generate("random_test" + to_string(i) + ".in", MAX_T);
+  }
+
+  return 0;
+}

a*b/shell-correct/SOLUTION renamed to a-mul-b/shell-correct/SOLUTION

@@ -0,0 +1,4 @@
+1
+80
+8
+3

a*b/shell-correct/main.sh renamed to a-mul-b/shell-correct/main.sh

@@ -0,0 +1,5 @@
+4
+0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
+20 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
+0 0 1 1 0 2 0 0 1 0 0 2 0 2 1 2 0 0 0 1 0 2 1 1 2 1 3 2 0 4 1 0 1 0 1 2 2 1 0 0 1 0 1 1 0 1 1 0 0 1 1 1 0 0 1 0 2 1 1 1 1 0 3 1 1 0 0 4 1 1 2 0 1 2 0 0 2 1 1 0 1 1 2 0 3 0 2 1 1 0 1 1 1 2 0 1 1 0 1 1
+1 2 1 1 0 0 1 1 1 1 0 0 1 0 1 1 0 2 1 3 0 2 0 1 2 0 1 2 3 3 0 1 2 0 2 0 1 1 0 2 2 2 0 1 1 1 1 0 0 1 1 2 1 1 0 1 3 0 1 1 0 0 0 0 2 3 0 2 1 0 2 2 0 0 1 2 0 0 1 1 1 1 0 1 0 0 3 1 1 1 0 1 1 1 1 2 1 3 0 0

a*b/statement.md renamed to a-mul-b/statement.md

@@ -0,0 +1,29 @@
+#include "testlib.h"
+#include "constraints.h"
+#include <iostream>
+#include <numeric>
+using namespace std;
+
+void check_case(){
+    vector<int> k(PLAYERS);
+    for(int i=0; i<PLAYERS; ++i){
+        k[i] = inf.readInt(0, 100, format("k[%d]", i));
+        if(i == PLAYERS-1) inf.readEoln();
+        else inf.readSpace();
+    }
+
+    // check: 100人のプレイヤーのキル数としてありえない入力は与えられない
+    int sum_kill = accumulate(k.begin(), k.end(), 0);
+    ensure(sum_kill <= PLAYERS-1);
+}
+
+int main(){
+    registerValidation();
+
+    int cases = inf.readInt(1, MAX_T, "cases");
+    inf.readEoln();
+
+    for(int i=0; i<cases; ++i) check_case();
+    inf.readEof();
+    return 0;
+}