Merge pull request #37 from tossy310/dayama/gpajanken

reopen dayama/gpajanken

Author: tossy310

gpajanken/cpp-kumachan/SOLUTION

@@ -0,0 +1,17 @@
+# -*- 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', 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/cpp-kumachan/main.cpp

@@ -0,0 +1,27 @@
+#include <iostream>
+#include <string>
+
+using namespace std;
+
+void GLprint(int A, int B, string greater, string equal, string less){
+    if(A > B){
+        cout << greater << endl;
+    }else if(A == B){
+        cout << equal << endl;
+    }else{
+        cout << less << endl;
+    }
+}
+
+int main(){
+    int T;
+    cin >> T;
+    
+    int A, B;
+    for(int t = 0; t < T; ++t){
+        cin >> A >> B;
+        GLprint(A, B, "KATO", "DRAW", "SATO");
+    }
+    
+    return 0;
+}

gpajanken/cpp-ryoissy/SOLUTION

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

gpajanken/cpp-ryoissy/ryoissy-gpajanken.cpp

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

gpajanken/java-tossy/GPAJanken.java

@@ -0,0 +1,25 @@
+import java.util.Scanner;
+
+public class GPAJanken {
+  static final String win_a = "KATO";
+  static final String win_b = "SATO";
+  static final String draw = "DRAW";
+
+  public static void main(final String[] args) {
+    final Scanner sc = new Scanner(System.in);
+    final int n = sc.nextInt();
+
+    for(int i=0; i<n; i++) {
+      final int a = sc.nextInt();
+      final int b = sc.nextInt();
+
+      final String ans;
+      if (a > b) ans = win_a;
+      else if (a < b) ans = win_b;
+      else ans = draw;
+
+      System.out.println(ans);
+    }
+    sc.close();
+  }
+}

gpajanken/java-tossy/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='GPAJanken.java', encoding='UTF-8', mainclass='GPAJanken')
+#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/statement.md

@@ -3,16 +3,16 @@ GPA JANKENとは
 「じゃんけんをして、じゃんけんの結果に関わらずGPAが高い方が問答無用で勝ち」
 というルールのゲームです。
 GPAが同じ場合引き分けになります。
-（ここでいうGPAとはGanbari Point Accumulateの略で、0から4のいずれかの整数です）
+（ここでいう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$は整数
+ - $0 \leq A \leq 4$
+ - $0 \leq B \leq 4$
+ - $A$ $B$は整数
 
 # Input
 1つの入力ファイルは複数のテストケースからなる。
@@ -22,7 +22,7 @@ $A,\ B$は整数
 2行目以降には、$T$個のテストケースが記述されており、各テストケースは次の形式で表される。
 
 ```
-$A\ B$
+$A$ $B$
 ```
 
 # Output