結果

問題 No.1092 modular arithmetic
ユーザー OlandOland
提出日時 2020-06-26 20:43:02
言語 Java21
(openjdk 21)
結果
AC  
実行時間 229 ms / 2,000 ms
コード長 7,349 bytes
コンパイル時間 2,509 ms
コンパイル使用メモリ 81,152 KB
実行使用メモリ 41,412 KB
最終ジャッジ日時 2024-07-04 18:18:02
合計ジャッジ時間 9,592 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 57 ms
37,328 KB
testcase_01 AC 190 ms
41,412 KB
testcase_02 AC 55 ms
37,208 KB
testcase_03 AC 194 ms
41,296 KB
testcase_04 AC 196 ms
41,084 KB
testcase_05 AC 194 ms
41,144 KB
testcase_06 AC 170 ms
41,004 KB
testcase_07 AC 192 ms
41,024 KB
testcase_08 AC 189 ms
41,256 KB
testcase_09 AC 191 ms
41,208 KB
testcase_10 AC 177 ms
40,708 KB
testcase_11 AC 190 ms
40,980 KB
testcase_12 AC 171 ms
40,880 KB
testcase_13 AC 144 ms
40,376 KB
testcase_14 AC 148 ms
40,620 KB
testcase_15 AC 109 ms
39,740 KB
testcase_16 AC 138 ms
40,456 KB
testcase_17 AC 145 ms
40,364 KB
testcase_18 AC 199 ms
41,304 KB
testcase_19 AC 168 ms
40,856 KB
testcase_20 AC 205 ms
41,048 KB
testcase_21 AC 194 ms
41,096 KB
testcase_22 AC 195 ms
41,156 KB
testcase_23 AC 219 ms
41,240 KB
testcase_24 AC 155 ms
40,584 KB
testcase_25 AC 195 ms
40,776 KB
testcase_26 AC 213 ms
41,000 KB
testcase_27 AC 117 ms
40,228 KB
testcase_28 AC 190 ms
40,788 KB
testcase_29 AC 229 ms
41,316 KB
testcase_30 AC 191 ms
40,636 KB
testcase_31 AC 117 ms
40,304 KB
testcase_32 AC 188 ms
40,800 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.BigDecimal;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    final static int MOD = (int)1e9+7;
    
    void solve(){
        int MAX = (int)1e5;
        int P = in.nextInt(), N = in.nextInt();
        int[] A = in.nextIntArray(N);
        String S = "#" + in.nextStr();
        
        long ans = A[0];
        for(int i = 1; i < N; i++){
            switch(S.charAt(i)){
                case '+':
                    ans = (ans + A[i]) % P;
                    break;
                case '-':
                    ans = (ans - A[i] + P) % P;
                    break;
                case '*':
                    ans = (ans * A[i]) % P;
                    break;
                case '/':
                    ans = (ans * modPow(A[i], P-2, P)) % P;
                    break;
            }
        }
        out.println(ans);
    }
    
    public static long modPow(long a, long b, int mod){
        long res = 1;
        while(b > 0){
            if((b & 1) == 1) res = (res * a) % mod;
            a = (a * a) % mod;
            b = b >> 1;
        }
        return res;
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "input.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
            return (int) nl;
        }
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0