#15221 (Java21) No.141 魔法少女コバ

• 問題: No.141 魔法少女コバ
• ユーザー: t8m8⛄️
• 提出日時: 2015-03-11 00:14:34
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 68 ms / 5,000 ms
• コード長: 3,675 bytes
• コンパイル時間: 4,188 ms
• コンパイル使用メモリ: 79,076 KB
• 実行使用メモリ: 51,784 KB
• 最終ジャッジ日時: 2024-06-24 17:10:29
• 合計ジャッジ時間: 12,616 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	53 ms; 50,068 KB
testcase_01	AC	52 ms; 50,116 KB
testcase_02	AC	52 ms; 50,148 KB
testcase_03	AC	52 ms; 49,736 KB
testcase_04	AC	52 ms; 49,956 KB
testcase_05	AC	53 ms; 50,076 KB
testcase_06	AC	53 ms; 50,228 KB
testcase_07	AC	54 ms; 49,736 KB
testcase_08	AC	53 ms; 50,268 KB
testcase_09	AC	52 ms; 49,776 KB
testcase_10	AC	53 ms; 50,332 KB
testcase_11	AC	53 ms; 50,056 KB
testcase_12	AC	67 ms; 50,160 KB
testcase_13	AC	68 ms; 49,824 KB
testcase_14	AC	67 ms; 50,108 KB
testcase_15	AC	67 ms; 50,008 KB
testcase_16	AC	67 ms; 50,128 KB
testcase_17	AC	67 ms; 50,120 KB
testcase_18	AC	67 ms; 50,268 KB
testcase_19	AC	66 ms; 50,108 KB
testcase_20	AC	66 ms; 49,832 KB
testcase_21	AC	66 ms; 50,024 KB
testcase_22	AC	66 ms; 50,252 KB
testcase_23	AC	66 ms; 50,088 KB
testcase_24	AC	67 ms; 49,704 KB
testcase_25	AC	66 ms; 49,968 KB
testcase_26	AC	66 ms; 49,764 KB
testcase_27	AC	66 ms; 50,232 KB
testcase_28	AC	67 ms; 49,700 KB
testcase_29	AC	67 ms; 50,116 KB
testcase_30	AC	67 ms; 49,840 KB
testcase_31	AC	67 ms; 49,820 KB
testcase_32	AC	67 ms; 50,084 KB
testcase_33	AC	68 ms; 50,012 KB
testcase_34	AC	67 ms; 49,816 KB
testcase_35	AC	68 ms; 50,088 KB
testcase_36	AC	68 ms; 50,124 KB
testcase_37	AC	68 ms; 51,784 KB
testcase_38	AC	66 ms; 50,072 KB
testcase_39	AC	65 ms; 50,240 KB
testcase_40	AC	67 ms; 49,816 KB
testcase_41	AC	66 ms; 50,124 KB
testcase_42	AC	65 ms; 49,812 KB
testcase_43	AC	66 ms; 50,032 KB
testcase_44	AC	66 ms; 49,868 KB
testcase_45	AC	66 ms; 50,040 KB
testcase_46	AC	65 ms; 50,020 KB
testcase_47	AC	52 ms; 50,140 KB
testcase_48	AC	52 ms; 50,080 KB
testcase_49	AC	53 ms; 49,900 KB
testcase_50	AC	52 ms; 49,864 KB
testcase_51	AC	52 ms; 50,048 KB
testcase_52	AC	53 ms; 49,796 KB
testcase_53	AC	53 ms; 50,188 KB
testcase_54	AC	51 ms; 49,840 KB
testcase_55	AC	53 ms; 50,076 KB
testcase_56	AC	53 ms; 49,752 KB
testcase_57	AC	53 ms; 50,160 KB
testcase_58	AC	53 ms; 50,128 KB
testcase_59	AC	53 ms; 50,032 KB
testcase_60	AC	53 ms; 50,136 KB
testcase_61	AC	53 ms; 50,284 KB
testcase_62	AC	65 ms; 49,964 KB
testcase_63	AC	66 ms; 50,196 KB
testcase_64	AC	65 ms; 50,176 KB
testcase_65	AC	66 ms; 49,984 KB
testcase_66	AC	66 ms; 50,260 KB
testcase_67	AC	65 ms; 49,872 KB
testcase_68	AC	65 ms; 49,924 KB
testcase_69	AC	65 ms; 50,168 KB
testcase_70	AC	66 ms; 50,100 KB
testcase_71	AC	68 ms; 49,728 KB
testcase_72	AC	65 ms; 50,100 KB
testcase_73	AC	66 ms; 50,120 KB
testcase_74	AC	67 ms; 50,252 KB
testcase_75	AC	66 ms; 50,240 KB
testcase_76	AC	67 ms; 49,940 KB
testcase_77	AC	68 ms; 49,688 KB
testcase_78	AC	67 ms; 50,216 KB
testcase_79	AC	68 ms; 50,252 KB
testcase_80	AC	66 ms; 49,860 KB
testcase_81	AC	65 ms; 49,856 KB
testcase_82	AC	66 ms; 50,128 KB
testcase-evil-0.txt	AC	67 ms; 49,844 KB
testcase-evil-1.txt	AC	67 ms; 50,104 KB
testcase-evil-2.txt	AC	64 ms; 50,100 KB
testcase-evil-3.txt	AC	67 ms; 49,956 KB
testcase-evil-4.txt	AC	68 ms; 49,740 KB
testcase-evil-5.txt	AC	65 ms; 50,040 KB
testcase-evil-6.txt	AC	67 ms; 50,176 KB
testcase-evil-7.txt	AC	67 ms; 49,872 KB
testcase-evil-8.txt	AC	66 ms; 49,988 KB
testcase-evil-9.txt	AC	65 ms; 49,920 KB

ソースコード

//No.141 魔法少女コバ

import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;

public class No141 {

    static final InputStream in = System.in;
    static final PrintWriter out = new PrintWriter(System.out,false);

    static void solve(){
        int m = nextInt();
        int n = nextInt();
        int d;

        int cnt = 0;
        while (m != n) {
            cnt += m/n;
            m %= n;
            if (m == 0) {cnt--; break;} 
            int t = n; n = m; m = t;
            cnt++;
        }
        out.println(cnt);
    }

    static int ans = 0;

    static void func(int a, int b) {
        if (a < b) func(b,a);
    }

    public static void main(String[] args) throws Exception {
        long start = System.currentTimeMillis();

        solve();
        out.flush();

        long end = System.currentTimeMillis();
        //trace(end-start + "ms");
        in.close();
    }

    static void trace(Object... o) { System.out.println(deepToString(o));}

    static final byte[] buf = new byte[1024];
    static int ptr = 0;
    static int buflen = 0;

    static boolean hasNextByte() {
        if (ptr < buflen)
            return true;
        ptr = 0;
        try{
            buflen = in.read(buf);
        }catch (IOException e) {e.printStackTrace();}
        if (buflen <= 0)
            return false;
        return true;
    }

    static int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;}

    static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}

    static void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;}

    static boolean hasNext() {skip(); return hasNextByte();}

    static String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    static long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        boolean minus = false;
        long num = readByte();

        if(num == '-'){
            num = 0;
            minus = true;
        }else if (num < '0' || '9' < num){
            throw new NumberFormatException();
        }else{
            num -= '0';
        }
        
        while(true){
            int b = readByte();
            if('0' <= b && b <= '9')
                num = num * 10 + (b - '0');
            else if(b == -1 || !isPrintableChar(b))
                return minus ? -num : num;
            else
                throw new NoSuchElementException();
        }
    }

    static int nextInt() {
        long num = nextLong();
        if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num)
            throw new NumberFormatException();
        return (int)num;
    }

    static double nextDouble() {
        return Double.parseDouble(next());
    }

    static char nextChar() {
        if (!hasNext()) throw new NoSuchElementException();
        return (char)readByte();
    }

    static String nextLine() {
        while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++;
        if (!hasNextByte()) throw new NoSuchElementException();

        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (b != '\n' && b != '\r') {
            sb.appendCodePoint(b);
            b = readByte();
        }

        return sb.toString();
    }

    static int[] nextArrayInt(int n) {
        int[] a = new int[n];
        for (int i=0; i<n; i++) a[i] = nextInt();
        return a;
    }
}