結果

問題 No.554 recurrence formula
ユーザー yuya178yuya178
提出日時 2017-11-27 17:31:33
言語 Java21
(openjdk 21)
結果
AC  
実行時間 65 ms / 2,000 ms
コード長 4,295 bytes
コンパイル時間 2,478 ms
コンパイル使用メモリ 85,312 KB
実行使用メモリ 43,700 KB
最終ジャッジ日時 2024-05-05 13:19:46
合計ジャッジ時間 4,224 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
43,068 KB
testcase_01 AC 56 ms
43,528 KB
testcase_02 AC 55 ms
43,684 KB
testcase_03 AC 56 ms
43,668 KB
testcase_04 AC 56 ms
43,084 KB
testcase_05 AC 55 ms
43,580 KB
testcase_06 AC 56 ms
43,400 KB
testcase_07 AC 55 ms
43,332 KB
testcase_08 AC 54 ms
43,560 KB
testcase_09 AC 54 ms
43,432 KB
testcase_10 AC 55 ms
43,700 KB
testcase_11 AC 55 ms
43,580 KB
testcase_12 AC 55 ms
43,264 KB
testcase_13 AC 55 ms
43,100 KB
testcase_14 AC 55 ms
43,264 KB
testcase_15 AC 56 ms
43,488 KB
testcase_16 AC 55 ms
43,476 KB
testcase_17 AC 56 ms
43,484 KB
testcase_18 AC 57 ms
43,152 KB
testcase_19 AC 65 ms
43,388 KB
testcase_20 AC 63 ms
43,428 KB
権限があれば一括ダウンロードができます

ソースコード

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;
    
    void solve()
    {

        int n = ni();
        long[] a = new long[200000];
        long[] o = new long[200000];
        long[] e = new long[200000];
        a[0] = 0;
        e[0] = 0;
        a[1] = 1;
        o[1] = 1;
        for(int i = 2; i <= n; i++){
            if(i%2==0){
                a[i] = (long)o[i-1]*i%MOD;
                e[i] = e[i-2] + a[i];
                e[i] %= MOD;
            }
            else {
                a[i] = (long)e[i-1]*i%MOD;
                o[i] = o[i-2] + a[i];
                o[i] %= MOD;
            }
        }
        out.println(a[n]);

    }

    int go(int x, int y){
        out.println(x+" "+y);
        out.flush();
        int r = ni();
        return r;
    }
    
    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)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0