add editorial c solution

Author: DAyama

battle_royal/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)

battle_royal/c-correct/main.c

@@ -0,0 +1,22 @@
+#include <stdio.h>
+
+int main(void) {
+  const int N = 100;
+  int T;
+  int K[N];
+
+  scanf("%d", &T);
+  for(int t = 0; t < T; t++) {
+    for(int i = 0; i < N; i++) {
+      scanf("%d", &K[i]);
+    }
+
+    int sum = 0;
+    for(int i = 0; i < N; i++) {
+      sum += K[i];
+    }
+    printf("%d\n", N - sum);
+  }
+
+  return 0;
+}

zoo/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)

zoo/c-correct/main.c

@@ -0,0 +1,49 @@
+#include <stdio.h>
+#include <string.h>
+
+char know[100][100], saw[100][100];
+char query[100];
+
+void solve(){
+	int n, m;
+	int i, j;
+	int sawcount = 0;
+	scanf("%d", &n);
+	for(i = 0; i < n; i++){
+		scanf("%s", know[i]);
+	}
+	scanf("%d", &m);
+	for(i = 0; i < m; i++){
+		int known = 0, done = 0;
+		scanf("%s", query);
+		for(j = 0; j < n; j++){
+			if(strcmp(know[j], query) == 0){
+				known = 1; break;
+			}
+		}
+		if(!known){
+			printf("siranai\n");
+			continue;
+		}
+
+		for(j = 0; j < sawcount; j++){
+			if(strcmp(saw[j], query) == 0){
+				printf("moumita\n");
+				done = 1; break;
+			}
+		}
+		if(done)continue;
+
+		printf("kawaii\n");
+		strcpy(saw[sawcount++], query);
+	}
+}
+
+int main(void){
+	int t;
+	scanf("%d", &t);
+	for(int i = 0; i < t; i++){
+		solve();
+	}	
+	return 0;
+}