Submission #2851706
Source Code Expand
import java.util.HashSet; import java.util.List; import java.util.Scanner; import java.util.Set; public class Main { public static void main(String[] args) { Main main = new Main(); main.run(); } void run() { Scanner sc = new Scanner(System.in); int N=sc.nextInt(); Set<Integer> NG=new HashSet<Integer>(); for (int i = 0; i < 3; i++) { NG.add(sc.nextInt()); } if(NG.contains(N)) { System.out.println("NO"); } for (int i = 0; i < 100; i++) { if(!NG.contains(N-3)) { N-=3; }else if(!NG.contains(N-2)) { N-=2; }else if(!NG.contains(N-1)) { N-=1; }else { System.out.println("NO"); return; } } if(N<=0) { System.out.println("YES"); }else { System.out.println("NO"); } } //以下テンプレート public static int[] extgcd(int a, int b) { int x0 = 1; int x1 = 0; int y0 = 0; int y1 = 1; while (b != 0) { int q = a / b; int r = a % b; int x2 = x0 - q * x1; int y2 = y0 - q * y1; a = b; b = r; x0 = x1; x1 = x2; y0 = y1; y1 = y2; } return new int[] { a, x0, y0 }; } static int gcd(int a, int b) { if (b == 0) return a; if (a < b) { int t = a; a = b; b = t; } return gcd(b, a % b); } static int lcm(int a, int b) { return a * b / gcd(a, b); } static void swap(int[] a) { int t; t = a[0]; a[0] = a[1]; a[1] = t; return; } static <T> void output(List<T> list) { for (int i = 0; i < list.size(); i++) { System.out.print(list.get(i)); if (i != list.size() - 1) { System.out.print(" "); } else { nl(); } } } static void output(String[][] str) { for (int i = 0; i < str.length; i++) { for (int j = 0; j < str[i].length; j++) { print(str[i][j]); } nl(); } } static void output(boolean flg, String Yes, String No) { if (flg) { pln(Yes); } else { pln(No); } } static void output(String[][] str, int digit) { String dig = "%" + String.valueOf(digit) + "s"; for (int i = 0; i < str.length; i++) { for (int j = 0; j < str[i].length; j++) { System.out.printf(dig, str[i][j]); } nl(); } } static void pln(String str) { System.out.println(str); } static void pln(int x) { System.out.println(x); } static void print(String str) { System.out.print(str); } static void print(int x) { System.out.print(x); } static void print(String str, int times) { for (int i = 0; i < times; i++) { print(str); } } static void print(int x, int times) { for (int i = 0; i < times; i++) { print(x); } } static void nl() { System.out.println(); } }
Submission Info
Submission Time | |
---|---|
Task | C - 123引き算 |
User | poporo |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 2833 Byte |
Status | WA |
Exec Time | 104 ms |
Memory | 21844 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
All | sample_01.txt, sample_02.txt, sample_03.txt, test_143_142_141_140.txt, test_1_1_2_3.txt, test_1_2_3_4.txt, test_200_200_2_3.txt, test_231_77_78_80.txt, test_235_124_126_125.txt, test_253_45_47_48.txt, test_297_223_224_225.txt, test_297_294_292_290.txt, test_297_297_30_83.txt, test_297_3_43_72.txt, test_298_125_123_124.txt, test_298_293_295_291.txt, test_298_298_4_8.txt, test_298_36_72_98.txt, test_298_55_3_43.txt, test_298_92_91_295.txt, test_299_200_151_65.txt, test_299_240_35_154.txt, test_299_300_299_298.txt, test_299_33_242_151.txt, test_299_56_57_58.txt, test_299_66_132_198.txt, test_300_271_44_68.txt, test_300_299_298_296.txt, test_300_30_99_183.txt, test_300_4_5_6.txt, test_84_34_64_36.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 93 ms | 20812 KB |
sample_02.txt | AC | 103 ms | 21716 KB |
sample_03.txt | AC | 92 ms | 18640 KB |
test_143_142_141_140.txt | AC | 92 ms | 19924 KB |
test_1_1_2_3.txt | WA | 93 ms | 19028 KB |
test_1_2_3_4.txt | AC | 93 ms | 18900 KB |
test_200_200_2_3.txt | WA | 93 ms | 18640 KB |
test_231_77_78_80.txt | AC | 94 ms | 21712 KB |
test_235_124_126_125.txt | AC | 92 ms | 18644 KB |
test_253_45_47_48.txt | AC | 93 ms | 21588 KB |
test_297_223_224_225.txt | AC | 90 ms | 18640 KB |
test_297_294_292_290.txt | AC | 95 ms | 19028 KB |
test_297_297_30_83.txt | WA | 92 ms | 21716 KB |
test_297_3_43_72.txt | AC | 92 ms | 21844 KB |
test_298_125_123_124.txt | AC | 93 ms | 19796 KB |
test_298_293_295_291.txt | AC | 94 ms | 21716 KB |
test_298_298_4_8.txt | WA | 92 ms | 21844 KB |
test_298_36_72_98.txt | AC | 93 ms | 19924 KB |
test_298_55_3_43.txt | AC | 91 ms | 19924 KB |
test_298_92_91_295.txt | AC | 93 ms | 18632 KB |
test_299_200_151_65.txt | AC | 94 ms | 18644 KB |
test_299_240_35_154.txt | AC | 93 ms | 21844 KB |
test_299_300_299_298.txt | WA | 94 ms | 20820 KB |
test_299_33_242_151.txt | AC | 94 ms | 19028 KB |
test_299_56_57_58.txt | AC | 92 ms | 21844 KB |
test_299_66_132_198.txt | AC | 93 ms | 21076 KB |
test_300_271_44_68.txt | AC | 93 ms | 18644 KB |
test_300_299_298_296.txt | AC | 92 ms | 20812 KB |
test_300_30_99_183.txt | AC | 104 ms | 20820 KB |
test_300_4_5_6.txt | AC | 93 ms | 20560 KB |
test_84_34_64_36.txt | AC | 92 ms | 20692 KB |