結果

問題 No.1486 ロボット
ユーザー shojin_proshojin_pro
提出日時 2021-04-23 21:52:47
言語 Java21
(openjdk 21)
結果
AC  
実行時間 73 ms / 2,000 ms
コード長 4,613 bytes
コンパイル時間 2,212 ms
コンパイル使用メモリ 78,964 KB
実行使用メモリ 42,380 KB
最終ジャッジ日時 2024-07-04 07:55:49
合計ジャッジ時間 4,010 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
37,116 KB
testcase_01 AC 50 ms
37,428 KB
testcase_02 AC 51 ms
37,304 KB
testcase_03 AC 50 ms
36,988 KB
testcase_04 AC 50 ms
37,008 KB
testcase_05 AC 51 ms
37,132 KB
testcase_06 AC 73 ms
42,172 KB
testcase_07 AC 72 ms
42,380 KB
testcase_08 AC 63 ms
39,176 KB
testcase_09 AC 50 ms
37,388 KB
testcase_10 AC 52 ms
37,296 KB
testcase_11 AC 53 ms
37,620 KB
testcase_12 AC 52 ms
37,476 KB
testcase_13 AC 50 ms
37,072 KB
testcase_14 AC 65 ms
38,500 KB
testcase_15 AC 51 ms
37,244 KB
testcase_16 AC 53 ms
37,408 KB
testcase_17 AC 54 ms
37,676 KB
testcase_18 AC 55 ms
37,672 KB
testcase_19 AC 52 ms
36,892 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long) 1e9 + 7;

    public static void main(String[] args) throws Exception {
        solve();
        pw.flush();
    }

    public static void solve() {
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();
        int d = sc.nextInt();
        long e = sc.nextLong();
        int lcm = (int)lcm(a+b,c+d);
        int[] now = new int[lcm];
        long total = 0;
        for(int i = 0; i < lcm; i++){
            if(i % (a+b) < a && i % (c+d) < c){
                total++;
                now[i]++;
                //pw.println(i);
            }
        }
        //pw.println(total);
        long ans = 1L* total * (e/lcm);
        int rem = (int)(e % lcm);
        for(int i = 0; i < rem; i++){
            ans += now[i];
        }
        pw.println(ans);
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
    
    private static long gcd(long a, long b)
    {
        while (b > 0)
        {
            long temp = b;
            b = a % b; // % is remainder
            a = temp;
        }
        return a;
    }
    
    private static long gcd(long[] input)
    {
        long result = input[0];
        for(int i = 1; i < input.length; i++)
        {
            result = gcd(result, input[i]);
        }
        return result;
    }
    
    private static long lcm(long a, long b)
    {
        return a * (b / gcd(a, b));
    }
    
    private static long lcm(long[] input)
    {
        long result = input[0];
        for(int i = 1; i < input.length; i++)
        {
            result = lcm(result, input[i]);
        }
        return result;
    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

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

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

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

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
0