結果
問題 | No.667 Mice's Luck(ネズミ達の運) |
ユーザー | ziita |
提出日時 | 2018-03-23 22:25:39 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 258 ms / 2,000 ms |
コード長 | 3,682 bytes |
コンパイル時間 | 2,896 ms |
コンパイル使用メモリ | 80,648 KB |
実行使用メモリ | 46,364 KB |
最終ジャッジ日時 | 2024-06-24 21:42:40 |
合計ジャッジ時間 | 5,750 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
36,508 KB |
testcase_01 | AC | 50 ms
36,852 KB |
testcase_02 | AC | 50 ms
37,108 KB |
testcase_03 | AC | 51 ms
36,872 KB |
testcase_04 | AC | 83 ms
37,816 KB |
testcase_05 | AC | 132 ms
40,500 KB |
testcase_06 | AC | 205 ms
43,332 KB |
testcase_07 | AC | 258 ms
46,364 KB |
testcase_08 | AC | 212 ms
44,556 KB |
testcase_09 | AC | 172 ms
44,260 KB |
ソースコード
import java.io.*; import java.util.*; import java.math.*; // import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; long mod = 1_000_000_007; long inf = Long.MAX_VALUE; void solve(){ char[] s = ns().toCharArray(); int n = s.length; int ok = 0; int ng = 0; for(int i = 0; i < n; i++){ if(s[i]=='o') ok++; if(s[i]=='x') ng++; } for(int i = 0; i < n; i++){ out.println((double)ok/(ok+ng)*100); if(s[i]=='o') ok--; if(s[i]=='x') ng--; } } 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"); } public static void main(String[] args) throws Exception { new Main().run(); } private byte[] inbuf = new byte[1024]; private 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) && 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 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[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, 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 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)); } }