結果

問題 No.141 魔法少女コバ
ユーザー tutuz
提出日時 2018-09-14 22:06:20
言語 Java
(openjdk 23)
結果
AC  
実行時間 47 ms / 5,000 ms
コード長 3,213 bytes
コンパイル時間 3,099 ms
コンパイル使用メモリ 77,572 KB
実行使用メモリ 37,376 KB
最終ジャッジ日時 2024-07-06 10:38:41
合計ジャッジ時間 8,961 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 93
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.StringTokenizer;
public class Main {
    public static void main(String[] args) throws IOException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskX solver = new TaskX();
        solver.solve(1, in, out);
        out.close();
    }
    static int INF = 1 << 30;
    static long LINF = 1L << 55;
    static int MOD = 1000000007;
    static int[] mh4 = { 0, -1, 1, 0 };
    static int[] mw4 = { -1, 0, 0, 1 };
    static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
    static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };
    static class TaskX {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            long m = in.nextLong(), n = in.nextLong();
            long g = gcd(n, m);
            m /= g;
            n /= g;
            long ans = f(m, n, 0);
            out.println(ans);
        }
        long f(long bs, long bb, long cnt) {
            long ret = 0;
            if (bb == bs) {
                return cnt;
            }
            if (bs - bb > 0) {
                ret += f(bs - bs/(bb+1)*bb, bb, cnt+bs/(bb+1));
            } else {
                ret += f(bb, bs, cnt+1);
            }
            return ret;
        }
    }
    public static long gcd(long a, long b) {
        return (b == 0) ? a : gcd(b, a % b);
    }
    static class InputReader {
        BufferedReader in;
        StringTokenizer tok;
        public String nextString() {
            while (!tok.hasMoreTokens()) {
                try {
                    tok = new StringTokenizer(in.readLine(), " ");
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
            }
            return tok.nextToken();
        }
        public int nextInt() {
            return Integer.parseInt(nextString());
        }
        public long nextLong() {
            return Long.parseLong(nextString());
        }
        public double nextDouble() {
            return Double.parseDouble(nextString());
        }
        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;
        }
        public InputReader(InputStream inputStream) {
            in = new BufferedReader(new InputStreamReader(inputStream));
            tok = new StringTokenizer("");
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0