結果
| 問題 | 
                            No.1092 modular arithmetic
                             | 
                    
| ユーザー | 
                             neko_the_shadow
                         | 
                    
| 提出日時 | 2020-07-09 15:26:23 | 
| 言語 | Java  (openjdk 23)  | 
                    
| 結果 | 
                             
                                AC
                                 
                             
                            
                         | 
                    
| 実行時間 | 475 ms / 2,000 ms | 
| コード長 | 4,259 bytes | 
| コンパイル時間 | 3,175 ms | 
| コンパイル使用メモリ | 84,704 KB | 
| 実行使用メモリ | 54,756 KB | 
| 最終ジャッジ日時 | 2024-10-07 05:28:56 | 
| 合計ジャッジ時間 | 16,432 ms | 
| 
                            ジャッジサーバーID (参考情報)  | 
                        judge2 / judge1 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| sample | AC * 1 | 
| other | AC * 32 | 
ソースコード
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.UncheckedIOException;
import java.lang.reflect.Array;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.Objects;
import java.util.regex.Pattern;
import java.util.stream.Collectors;
public class Main {
    public void exec() {
        long p = stdin.nextLong();
        int n = stdin.nextInt();
        long[] a = stdin.nextLongArray(n);
        String s = stdin.nextString();
        long ans = a[0];
        for (int i = 0; i < n - 1; i++) {
            if (s.charAt(i) == '+') ans = (ans + a[i+1]) % p;
            if (s.charAt(i) == '-') ans = (ans - a[i+1] + p) % p;
            if (s.charAt(i) == '*') ans = (ans * a[i+1]) % p;
            if (s.charAt(i) == '/') ans = (ans * modInv(a[i+1], p)) % p;
        }
        stdout.println(ans);
    }
    public long modPow(long x, long y, long mod) {
        long z = 1;
        while (y > 0) {
            if (y % 2 == 0) {
                x = (x * x) % mod;
                y /= 2;
            } else {
                z = (z * x) % mod;
                y--;
            }
        }
        return z;
    }
    public long modInv(long x, long mod) {
        return modPow(x, mod - 2, mod);
    }
    private static final Stdin stdin = new Stdin();
    private static final Stdout stdout = new Stdout();
    public static void main(String[] args) {
        new Main().exec();
        stdout.flush();
    }
    public static class Stdin {
        private BufferedReader stdin;
        private Deque<String> tokens;
        private Pattern delim;
        public Stdin() {
            stdin = new BufferedReader(new InputStreamReader(System.in));
            tokens = new ArrayDeque<>();
            delim = Pattern.compile(" ");
        }
        public String nextString() {
            try {
                if (tokens.isEmpty()) {
                    String line = stdin.readLine();
                    delim.splitAsStream(line).forEach(tokens::addLast);
                }
                return tokens.pollFirst();
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
        }
        public int nextInt() {
            return Integer.parseInt(nextString());
        }
        public double nextDouble() {
            return Double.parseDouble(nextString());
        }
        public long nextLong() {
            return Long.parseLong(nextString());
        }
        public String[] nextStringArray(int n) {
            String[] a = new String[n];
            for (int i = 0; i < n; i++) a[i] = nextString();
            return a;
        }
        public int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt();
            return a;
        }
        public double[] nextDoubleArray(int n) {
            double[] a = new double[n];
            for (int i = 0; i < n; i++) a[i] = nextDouble();
            return a;
        }
        public long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) a[i] = nextLong();
            return a;
        }
    }
    public static class Stdout {
        private PrintWriter stdout;
        public Stdout() {
            stdout =  new PrintWriter(System.out, false);
        }
        public void printf(String format, Object ... args) {
            stdout.printf(format, args);
        }
        public void println(Object ... objs) {
            String line = Arrays.stream(objs).map(this::deepToString).collect(Collectors.joining(" "));
            stdout.println(line);
        }
        private String deepToString(Object o) {
            if (o == null || !o.getClass().isArray()) {
                return Objects.toString(o);
            }
            int len = Array.getLength(o);
            String[] tokens = new String[len];
            for (int i = 0; i < len; i++) {
                tokens[i] = deepToString(Array.get(o, i));
            }
            return "{" + String.join(",", tokens) + "}";
        }
        public void flush() {
            stdout.flush();
        }
    }
}
            
            
            
        
            
neko_the_shadow