結果
問題 | No.438 Cwwプログラミング入門 |
ユーザー | uwi |
提出日時 | 2016-10-28 22:38:16 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 70 ms / 2,000 ms |
コード長 | 4,793 bytes |
コンパイル時間 | 5,551 ms |
コンパイル使用メモリ | 79,304 KB |
実行使用メモリ | 51,360 KB |
最終ジャッジ日時 | 2023-08-18 15:29:53 |
合計ジャッジ時間 | 14,182 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
49,204 KB |
testcase_01 | AC | 41 ms
49,128 KB |
testcase_02 | AC | 38 ms
49,072 KB |
testcase_03 | AC | 36 ms
49,324 KB |
testcase_04 | AC | 37 ms
49,460 KB |
testcase_05 | AC | 37 ms
49,248 KB |
testcase_06 | AC | 39 ms
49,736 KB |
testcase_07 | AC | 39 ms
49,196 KB |
testcase_08 | AC | 38 ms
49,392 KB |
testcase_09 | AC | 36 ms
49,244 KB |
testcase_10 | AC | 43 ms
50,132 KB |
testcase_11 | AC | 45 ms
50,052 KB |
testcase_12 | AC | 38 ms
49,176 KB |
testcase_13 | AC | 37 ms
49,176 KB |
testcase_14 | AC | 36 ms
49,356 KB |
testcase_15 | AC | 38 ms
49,400 KB |
testcase_16 | AC | 37 ms
49,324 KB |
testcase_17 | AC | 38 ms
49,316 KB |
testcase_18 | AC | 37 ms
49,360 KB |
testcase_19 | AC | 37 ms
49,140 KB |
testcase_20 | AC | 36 ms
49,316 KB |
testcase_21 | AC | 36 ms
49,480 KB |
testcase_22 | AC | 44 ms
50,156 KB |
testcase_23 | AC | 37 ms
49,384 KB |
testcase_24 | AC | 36 ms
49,256 KB |
testcase_25 | AC | 36 ms
49,204 KB |
testcase_26 | AC | 37 ms
49,400 KB |
testcase_27 | AC | 37 ms
49,204 KB |
testcase_28 | AC | 36 ms
49,140 KB |
testcase_29 | AC | 35 ms
49,364 KB |
testcase_30 | AC | 37 ms
49,184 KB |
testcase_31 | AC | 36 ms
49,308 KB |
testcase_32 | AC | 35 ms
49,244 KB |
testcase_33 | AC | 35 ms
49,400 KB |
testcase_34 | AC | 36 ms
49,356 KB |
testcase_35 | AC | 35 ms
47,284 KB |
testcase_36 | AC | 35 ms
49,184 KB |
testcase_37 | AC | 36 ms
49,264 KB |
testcase_38 | AC | 36 ms
49,312 KB |
testcase_39 | AC | 36 ms
49,412 KB |
testcase_40 | AC | 37 ms
49,348 KB |
testcase_41 | AC | 36 ms
49,288 KB |
testcase_42 | AC | 37 ms
49,664 KB |
testcase_43 | AC | 35 ms
49,328 KB |
testcase_44 | AC | 36 ms
49,476 KB |
testcase_45 | AC | 35 ms
49,276 KB |
testcase_46 | AC | 36 ms
49,452 KB |
testcase_47 | AC | 35 ms
49,360 KB |
testcase_48 | AC | 54 ms
50,496 KB |
testcase_49 | AC | 44 ms
49,968 KB |
testcase_50 | AC | 38 ms
49,396 KB |
testcase_51 | AC | 39 ms
49,236 KB |
testcase_52 | AC | 59 ms
50,880 KB |
testcase_53 | AC | 53 ms
50,832 KB |
testcase_54 | AC | 37 ms
49,432 KB |
testcase_55 | AC | 54 ms
50,688 KB |
testcase_56 | AC | 57 ms
50,468 KB |
testcase_57 | AC | 37 ms
49,288 KB |
testcase_58 | AC | 36 ms
49,732 KB |
testcase_59 | AC | 35 ms
49,396 KB |
testcase_60 | AC | 37 ms
49,236 KB |
testcase_61 | AC | 44 ms
49,952 KB |
testcase_62 | AC | 37 ms
49,580 KB |
testcase_63 | AC | 57 ms
50,588 KB |
testcase_64 | AC | 58 ms
51,108 KB |
testcase_65 | AC | 36 ms
49,200 KB |
testcase_66 | AC | 45 ms
49,504 KB |
testcase_67 | AC | 38 ms
49,192 KB |
testcase_68 | AC | 36 ms
49,140 KB |
testcase_69 | AC | 37 ms
49,268 KB |
testcase_70 | AC | 37 ms
49,728 KB |
testcase_71 | AC | 37 ms
49,256 KB |
testcase_72 | AC | 36 ms
49,476 KB |
testcase_73 | AC | 36 ms
49,228 KB |
testcase_74 | AC | 35 ms
49,296 KB |
testcase_75 | AC | 36 ms
49,212 KB |
testcase_76 | AC | 36 ms
49,208 KB |
testcase_77 | AC | 37 ms
49,320 KB |
testcase_78 | AC | 37 ms
49,428 KB |
testcase_79 | AC | 36 ms
49,216 KB |
testcase_80 | AC | 36 ms
49,604 KB |
testcase_81 | AC | 37 ms
49,404 KB |
testcase_82 | AC | 37 ms
49,228 KB |
testcase_83 | AC | 38 ms
49,340 KB |
testcase_84 | AC | 37 ms
49,192 KB |
testcase_85 | AC | 36 ms
47,648 KB |
testcase_86 | AC | 37 ms
49,180 KB |
testcase_87 | AC | 37 ms
49,328 KB |
testcase_88 | AC | 36 ms
49,368 KB |
testcase_89 | AC | 59 ms
50,960 KB |
testcase_90 | AC | 37 ms
49,428 KB |
testcase_91 | AC | 62 ms
50,788 KB |
testcase_92 | AC | 36 ms
49,344 KB |
testcase_93 | AC | 39 ms
49,276 KB |
testcase_94 | AC | 38 ms
49,288 KB |
testcase_95 | AC | 60 ms
51,292 KB |
testcase_96 | AC | 40 ms
47,240 KB |
testcase_97 | AC | 70 ms
51,360 KB |
testcase_98 | AC | 41 ms
49,356 KB |
testcase_99 | AC | 36 ms
49,364 KB |
testcase_100 | AC | 51 ms
50,312 KB |
ソースコード
package contest161028; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class C { InputStream is; PrintWriter out; String INPUT = ""; void solve() { String M = "mourennaihasimasenn"; int x = ni(), y = ni(), z = ni(); if(z == 0){ out.println("ccW"); return; } if(x == 0 && y == 0){ out.println(M); return; } int T = 10000; if(x == 0){ if(z % y == 0 && z/y+z/y-1 <= T){ for(int i = 0;i < z/y;i++)out.print("w"); for(int i = 0;i < z/y-1;i++)out.print("C"); out.println(); }else{ out.println(M); } return; } if(y == 0){ if(z % x == 0 && z/x+z/x-1 <= T){ for(int i = 0;i < z/x;i++)out.print("c"); for(int i = 0;i < z/x-1;i++)out.print("C"); out.println(); }else{ out.println(M); } return; } for(int i = 0;i <= T;i++){ long rem = z - (long)x*i; if(rem >= 0 && rem % y == 0 && i + rem/y + (i+rem/y-1) <= T){ for(int j = 0;j < i;j++)out.print("c"); for(int j = 0;j < rem/y;j++)out.print("w"); for(int j = 0;j < i+rem/y-1;j++)out.print("C"); out.println(); return; } } for(int i = 0;i <= T;i++){ long rem = z + (long)x*i; if(rem >= 0 && rem % y == 0 && i + rem/y + (i+rem/y-1) <= T){ for(int j = 0;j < i;j++)out.print("c"); for(int j = 0;j < rem/y;j++)out.print("w"); for(int j = 0;j < rem/y-1;j++)out.print("C"); for(int j = 0;j < i;j++)out.print("W"); out.println(); return; } } for(int i = 0;i <= T;i++){ long rem = z + (long)y*i; if(rem >= 0 && rem % x == 0 && i + rem/x + (i+rem/x-1) <= T){ for(int j = 0;j < i;j++)out.print("w"); for(int j = 0;j < rem/x;j++)out.print("c"); for(int j = 0;j < rem/x-1;j++)out.print("C"); for(int j = 0;j < i;j++)out.print("W"); out.println(); return; } } out.println(M); return; } public static int gcd(int a, int b) { while (b > 0) { int c = a; a = b; b = c % b; } return a; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new C().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }