結果

問題 No.639 An Ordinary Sequence
ユーザー yuya178
提出日時 2018-01-26 22:53:55
言語 Java
(openjdk 23)
結果
AC  
実行時間 76 ms / 1,000 ms
コード長 4,345 bytes
コンパイル時間 2,841 ms
コンパイル使用メモリ 82,456 KB
実行使用メモリ 58,364 KB
最終ジャッジ日時 2025-01-02 02:06:29
合計ジャッジ時間 5,048 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 17
権限があれば一括ダウンロードができます

ソースコード

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;

    void solve(){
        long n = nl();
        long ans = f(n);
        out.println(ans);
    }
    long[] seen = new long[1000001];
    long f(long res){
        if(res<=1000000){
            if(seen[(int)res]>0) return seen[(int)res];
        }
        if(res==0){
            seen[(int)res] = 1;
            return 1;
        }
        long a = res/3;
        long b = res/5;
        long c = a/3;
        long d = a/5;
        long e = b/3;
        long g = b/5;
        if(a==0&&b==0){
            if(res<=1000000) seen[(int)res] = 2;
            return 2;
        }
        else if(a==0){
            if(res<=1000000) seen[(int)res] = 1 + f(e)+f(g);
            return 1 + f(e)+f(g);
        }
        else if(b==0){
            if(res<=1000000) seen[(int)res] = 1 + f(c)+f(d);
            return 1 + f(c)+f(d);
        }
        if(d==e){
            if(res<=1000000) seen[(int)res] = f(c)+2*f(e)+f(g);
            return f(c)+2*f(e)+f(g);
        }
        if(res<=1000000) seen[(int)res] = f(c)+f(d)+f(e)+f(g);
        return f(c)+f(d)+f(e)+f(g);
    }
    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