Merge pull request #24 from tossy310/dayama/gpajanken

GPA JANKEN

Author: DAyamaCTF

gpajanken/PROBLEM

@@ -0,0 +1,17 @@
+# -*- coding: utf-8; mode: python -*-
+
+pid='X'
+
+problem(
+  time_limit=1.0,
+  id=pid,
+  title=pid + "GPA JANKEN",
+  #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='c-correct',
+  )
+
+atcoder_config(
+  task_id=None # None means a spare
+)

gpajanken/c-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)

gpajanken/c-correct/main.c

@@ -0,0 +1,18 @@
+#include <stdio.h>
+
+int main(){
+  int T;
+  scanf("%d", &T);
+  for(int i = 0; i < T; i++){
+    int A, B;
+    scanf("%d %d",&A,&B);
+    if(A > B){
+      printf("KATO\n");
+    }else if(A < B){
+      printf("SATO\n");
+    }else{
+      printf("DRAW\n");
+    }
+  }
+  return 0;
+}

gpajanken/statement.md

@@ -0,0 +1,44 @@
+# Description
+GPA JANKENとは
+「じゃんけんをして、じゃんけんの結果に関わらずGPAが高い方が問答無用で勝ち」
+というルールのゲームです。
+GPAが同じ場合引き分けになります。
+（ここでいうGPAとはGanbari Point Accumulateの略で、0から4のいずれかの整数です）
+
+カトー君とサトー君がGPA JANKENをしました。
+カトー君のGPAは$A$、サトー君のGPAは$B$です。
+カトー君が勝った場合`KATO`、サトー君が勝った場合`SATO`、引き分けの場合`DRAW`と出力してください。
+
+# Constraints
+$0 \leq A \leq 4$
+$0 \leq B \leq 4$
+$A,\ B$は整数
+
+# Input
+1つの入力ファイルは複数のテストケースからなる。
+
+入力ファイルの最初の1行目にはテストケースの個数 $T$ が記される $(1 \leq T \leq 100)$。
+
+2行目以降には、$T$個のテストケースが記述されており、各テストケースは次の形式で表される。
+
+```
+$A\ B$
+```
+
+# Output
+各テストケースに対して、GPA JANKENの結果を1行ずつ出力せよ。
+
+# Sample Input
+```
+3
+2 3
+4 3
+0 0
+```
+
+# Sample Output
+```
+SATO
+KATO
+DRAW
+```

gpajanken/tests/TESTSET

@@ -0,0 +1,34 @@
+# -*- 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_merger(input_terminator='0 0\n') # icpc type
+#icpc_merger(input_terminator='0 0\n', output_replace=casenum_replace('Case 1', 'Case {0}')) # icpc wf ~2011
+#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=['*'])
+#scoring_judge() # precisely scored by judge program like Jiyukenkyu (KUPC 2013)

gpajanken/tests/constraints.h

@@ -0,0 +1,3 @@
+#define MAX_T 100
+#define MIN_AB 0
+#define MAX_AB 4

gpajanken/tests/generator.cpp

@@ -0,0 +1,28 @@
+#include <fstream>
+#include <string>
+#include "testlib.h"
+#include "constraints.h"
+
+using namespace std;
+
+void generate(const string &file_name, int num_case) {
+  ofstream ofs(file_name);
+  ofs << num_case <<endl;
+
+  for (int i=0; i<num_case; i++) {
+    ofs << rnd.next(MIN_AB, MAX_AB) << " ";
+    ofs << rnd.next(MIN_AB, MAX_AB) << endl;
+  }
+}
+
+int main(int argc, char* argv[]) {
+  registerGen(argc, argv, 1);
+
+  generate("small.in", 10);
+  generate("large.in", MAX_T);
+  for (int i=0; i<10; i++) {
+    generate("random_test" + to_string(i) + ".in", MAX_T);
+  }
+
+  return 0;
+}

gpajanken/tests/sample.diff

@@ -0,0 +1,3 @@
+SATO
+KATO
+DRAW

gpajanken/tests/sample.in

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

gpajanken/tests/validator.cpp

@@ -0,0 +1,25 @@
+#include "testlib.h"
+#include "constraints.h"
+#include <iostream>
+using namespace std;
+
+void check_case(){
+  int a = inf.readInt(MIN_AB, MAX_AB, "a");
+  inf.readSpace();
+  int b = inf.readInt(MIN_AB, MAX_AB, "b");
+  inf.readEoln();
+}
+
+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;
+}