結果

問題 No.841 8/32
ユーザー OlandOland
提出日時 2019-06-28 21:54:47
言語 Java21
(openjdk 21)
結果
AC  
実行時間 54 ms / 2,000 ms
コード長 4,009 bytes
コンパイル時間 2,647 ms
コンパイル使用メモリ 80,864 KB
実行使用メモリ 37,360 KB
最終ジャッジ日時 2024-07-02 04:40:59
合計ジャッジ時間 4,752 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
37,220 KB
testcase_01 AC 52 ms
37,108 KB
testcase_02 AC 52 ms
36,980 KB
testcase_03 AC 51 ms
37,036 KB
testcase_04 AC 51 ms
37,072 KB
testcase_05 AC 51 ms
37,356 KB
testcase_06 AC 54 ms
37,164 KB
testcase_07 AC 52 ms
37,240 KB
testcase_08 AC 52 ms
37,036 KB
testcase_09 AC 51 ms
37,164 KB
testcase_10 AC 52 ms
37,072 KB
testcase_11 AC 54 ms
37,240 KB
testcase_12 AC 51 ms
37,240 KB
testcase_13 AC 52 ms
37,344 KB
testcase_14 AC 51 ms
37,088 KB
testcase_15 AC 50 ms
37,228 KB
testcase_16 AC 52 ms
37,036 KB
testcase_17 AC 51 ms
37,284 KB
testcase_18 AC 52 ms
37,144 KB
testcase_19 AC 52 ms
36,736 KB
testcase_20 AC 52 ms
37,360 KB
testcase_21 AC 53 ms
37,360 KB
testcase_22 AC 52 ms
37,036 KB
testcase_23 AC 53 ms
37,120 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.Map.Entry;
import java.util.function.Function;
import java.util.stream.Collectors;

@SuppressWarnings("unused")
public class Main {
	FastScanner in = new FastScanner(System.in);
	PrintWriter out = new PrintWriter(System.out);
		
	//System.out.println();はつかわない！！
	void solve() throws Exception{
		String S1 = in.nextStr(), S2 = in.nextStr();
		boolean b1 = (S1.equals("Sun") || S1.equals("Sat"));
		boolean b2 = (S2.equals("Sun") || S2.equals("Sat"));
		
		if(b1 && !b2) out.println("8/32");
		else if(b1 && b2) out.println("8/33");
		else out.println("8/31");
	}
		
	public static void main(String[] args) throws Exception {
		new Main().m();
	}
	
	void m() throws Exception {
		solve();
		out.flush();
	}
	
	class FastScanner {
		Reader input;

		FastScanner() {this(System.in);}
		FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
		
		int nextInt() {return (int) nextLong();}

		long nextLong() {
			try {
				int sign = 1;
				int b = input.read();
				while ((b < '0' || '9' < b) && b != '-' && b != '+') {
					b = input.read();
				}
				if (b == '-') {
					sign = -1;
					b = input.read();
				} else if (b == '+') {
					b = input.read();
				}
				long ret = b - '0';
				while (true) {
					b = input.read();
					if (b < '0' || '9' < b) return ret * sign;
					ret *= 10;
					ret += b - '0';
				}
			} catch (IOException e) {
				e.printStackTrace();
				return -1;
			}
		}

		double nextDouble() {
			try {
				double sign = 1;
				int b = input.read();
				while ((b < '0' || '9' < b) && b != '-' && b != '+') {
					b = input.read();
				}
				if (b == '-') {
					sign = -1;
					b = input.read();
				} else if (b == '+') {
					b = input.read();
				}
				double ret = b - '0';
				while (true) {
					b = input.read();
					if (b < '0' || '9' < b) break;
					ret *= 10;
					ret += b - '0';
				}
				if (b != '.') return sign * ret;
				double div = 1;
				b = input.read();
				while ('0' <= b && b <= '9') {
					ret *= 10;
					ret += b - '0';
					div *= 10;
					b = input.read();
				}
				return sign * ret / div;
			} catch (IOException e) {
				e.printStackTrace();
				return Double.NaN;
			}
		}

		char nextChar() {
			try {
				int b = input.read();
				while (Character.isWhitespace(b)) {
					b = input.read();
				}
				return (char) b;
			} catch (IOException e) {
				e.printStackTrace();
				return 0;
			}
		}

		String nextStr() {
			try {
				StringBuilder sb = new StringBuilder();
				int b = input.read();
				while (Character.isWhitespace(b)) {
					b = input.read();
				}
				while (b != -1 && !Character.isWhitespace(b)) {
					sb.append((char) b);
					b = input.read();
				}
				return sb.toString();
			} catch (IOException e) {
				e.printStackTrace();
				return "";
			}
		}
		
		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}
 
		public int[] nextIntArrayDec(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}
 
		public int[] nextIntArray1Index(int n) {
			int[] res = new int[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextInt();
			}
			return res;
		}
 
		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}
 
		public long[] nextLongArrayDec(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}
 
		public long[] nextLongArray1Index(int n) {
			long[] res = new long[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextLong();
			}
			return res;
		}
 
		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}
	}
}
/* end Main */
0