結果

問題 No.644 G L C C D M
ユーザー yuya178yuya178
提出日時 2018-02-02 23:18:56
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,771 bytes
コンパイル時間 2,370 ms
コンパイル使用メモリ 80,952 KB
実行使用メモリ 54,688 KB
最終ジャッジ日時 2024-06-10 01:33:47
合計ジャッジ時間 7,708 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
49,736 KB
testcase_01 WA -
testcase_02 AC 51 ms
49,920 KB
testcase_03 AC 47 ms
50,172 KB
testcase_04 WA -
testcase_05 AC 50 ms
49,852 KB
testcase_06 AC 51 ms
50,108 KB
testcase_07 AC 50 ms
50,160 KB
testcase_08 AC 50 ms
49,932 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 95 ms
54,528 KB
testcase_12 AC 49 ms
49,928 KB
testcase_13 AC 501 ms
54,688 KB
testcase_14 AC 84 ms
53,100 KB
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 49 ms
50,336 KB
testcase_18 AC 52 ms
50,100 KB
testcase_19 AC 50 ms
49,908 KB
testcase_20 AC 52 ms
50,244 KB
testcase_21 WA -
testcase_22 TLE -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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;

    long sum = 0;

    void solve(){
        int n = ni();
        long m = nl();
        long tmp = 1;
        for(long i = 1; i <= n-2; i++){
            tmp *= i;
            tmp %= mod;
        }
        long max = n/m;
        if(max==0){
            out.println(0);
            return;
        }
        Deque<int[]> st = new ArrayDeque<>();
        st.push(new int[]{2,1});
        st.push(new int[]{3,1});
        while(!st.isEmpty()){
            int[] res = st.pop();
            sum++;
            if(2*res[0]-res[1]<=max && res[0]<=max) st.push(new int[]{2*res[0]-res[1], res[0]});
            if(2*res[0]+res[1]<=max && res[0]<=max) st.push(new int[]{2*res[0]+res[1], res[0]});
            if(res[0]+2*res[1]<=max && res[1]<=max) st.push(new int[]{res[0]+2*res[1], res[1]});
        }
        long ans = 2 * sum * tmp % mod;
        out.println(ans);
    }

    private long pow(long a, long n, long MOD) {
        a %= MOD;
        if (a == 0) {
            return 0;
        }

        long loop = n;
        long ret = 1;
        long x = a;
        while (loop > 0) {
            if (loop % 2 == 1) {
                ret = ret * x % MOD;
            }
            x = x * x % MOD;
            loop /= 2;
        }

        return ret;
    }

    private static long gcd(long m, long n) {
        if(m < n) return gcd(n, m);
        if(n == 0) return m;
        return gcd(n, m % n);
    }
private static long lcm(long m, long n) {
        return m * (n /gcd(m, n));
    }

    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)); }
 
}
0