結果

問題 No.265 数学のテスト
ユーザー 37zigen
提出日時 2020-04-02 15:58:52
言語 Java
(openjdk 23)
結果
AC  
実行時間 123 ms / 2,000 ms
コード長 3,385 bytes
コンパイル時間 2,389 ms
コンパイル使用メモリ 80,328 KB
実行使用メモリ 40,240 KB
最終ジャッジ日時 2024-06-28 15:06:30
合計ジャッジ時間 7,210 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.IOException;
import java.io.InputStream;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Scanner;
class Main {
    public static void main(String[] args) {
        new Main().run();
    }
    
    final long MOD=(long)1e9+7;
    
    long[] fac=new long[20];
    {
        fac[0]=1;
        for(int i=1;i<fac.length;++i)fac[i]=i*fac[i-1];
    }
    
    boolean number(char c) {
        return 0<=(int)(c-'0')&&(int)(c-'0')<=9;
    }
    
    void run() {
        FastScanner sc=new FastScanner();
        int N=sc.nextInt();
        int d=sc.nextInt();
        long[] ans=new long[d+1];
        char[] cs=sc.next().toCharArray();
        int op=0;
        for(int i=0;i<cs.length;++i) {
            if(cs[i]=='d'||cs[i]=='+')continue;
            if(cs[i]=='{')++op;
            else if(cs[i]=='}')--op;
            else {
                int coe=1;
                int deg=0;
                int j=i;
                while(true) {
                    if(cs[j]=='x')++deg;
                    else if(number(cs[j]))coe*=(int)(cs[j]-'0');
                    if(j+1<cs.length&&(cs[j+1]=='x'||cs[j+1]=='*'||number(cs[j+1])))++j;
                    else break;
                }
                i=j;
                if(deg<op)continue;
                coe*=fac[deg]/fac[deg-op];
                deg-=op;
                ans[deg]+=coe;
            }
        }
        for(int i=0;i<ans.length;++i) {
            System.out.print(ans[i]+(i==ans.length-1?"\n":" "));
        }
    }
    static void tr(Object... objects) {
        System.out.println(Arrays.deepToString(objects));
    }
}
class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0