結果

問題 No.1476 esreveR dna esreveR
ユーザー watarimaycry2watarimaycry2
提出日時 2021-04-16 20:07:07
言語 Java21
(openjdk 21)
結果
AC  
実行時間 54 ms / 2,000 ms
コード長 3,871 bytes
コンパイル時間 2,654 ms
コンパイル使用メモリ 80,228 KB
実行使用メモリ 40,848 KB
最終ジャッジ日時 2024-07-02 21:56:40
合計ジャッジ時間 3,654 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
36,708 KB
testcase_01 AC 53 ms
37,032 KB
testcase_02 AC 54 ms
37,444 KB
testcase_03 AC 52 ms
37,492 KB
testcase_04 AC 53 ms
37,272 KB
testcase_05 AC 53 ms
40,848 KB
testcase_06 AC 53 ms
37,200 KB
testcase_07 AC 52 ms
37,352 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
    //Don't have to see. start------------------------------------------
    static class InputIterator{
        ArrayList<String> inputLine = new ArrayList<>(1024);
        int index = 0; int max; String read;
        InputIterator(){
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            try{
                while((read = br.readLine()) != null){
                    inputLine.addAll(Arrays.asList(read.split(" ")));
                }
            }catch(IOException e){}
            max = inputLine.size();
        }
        boolean hasNext(){return (index < max);}
        String next(){
            if(hasNext()){
                return inputLine.get(index++);
            }else{
                throw new IndexOutOfBoundsException("There is no more input");
            }
        }
    }
    static HashMap<Integer, String> CONVSTR = new HashMap<>();
    static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
    static PrintWriter out = new PrintWriter(System.out);
    static void flush(){out.flush();}
    static void myout(Object t){out.println(t);}
    static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
    static String next(){return ii.next();}
    static boolean hasNext(){return ii.hasNext();}
    static int nextInt(){return Integer.parseInt(next());}
    static long nextLong(){return Long.parseLong(next());}
    static double nextDouble(){return Double.parseDouble(next());}
    static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
    static ArrayList<String> nextStrArray(int size){
        ArrayList<String> ret = new ArrayList<>(size);
        for(int i = 0; i < size; i++){
            ret.add(next());
        }
        return ret;
    }
    static ArrayList<Integer> nextIntArray(int size){
        ArrayList<Integer> ret = new ArrayList<>(size);
        for(int i = 0; i < size; i++){
            ret.add(Integer.parseInt(next()));
        }
        return ret;
    }
    static ArrayList<Long> nextLongArray(int size){
        ArrayList<Long> ret = new ArrayList<>(size);
        for(int i = 0; i < size; i++){
            ret.add(Long.parseLong(next()));
        }
        return ret;
    }
    @SuppressWarnings("unchecked")
    static String myconv(Object list, int no){//only join
        String joinString = CONVSTR.get(no);
        if(list instanceof String[]){
            return String.join(joinString, (String[])list);
        }else if(list instanceof ArrayList){
            return String.join(joinString, (ArrayList)list);
        }else{
            throw new ClassCastException("Don't join");
        }
    }
    static ArrayList<String> myconv(String str, int no){//only split
        String splitString = CONVSTR.get(no);
        return new ArrayList<String>(Arrays.asList(str.split(splitString)));
    }
    public static void main(String[] args){
        CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
        solve();flush();
    }
    //Don't have to see. end------------------------------------------
    static void solve(){//Here is the main function
        long N = nextLong();
        myout(mypow(6, N / 2, 998244353));
    }
    //Method addition frame start

static long mypow(long x, long n) {return mypow(x, n, -1);}
static long mypow(long x, long n, long m) {
        long ans = 1;
        while (n > 0) {
                if ((n & 1) == 1){
                        ans *= x;
                        if(m != -1){
                                ans %= m;
                        }
                }
                x *= x;
                if(m != -1){
                        x %= m;
                }
                n >>= 1;
        }
        return ans;
}

    //Method addition frame end
}
0