結果

問題 No.3026 Third Power Problem
ユーザー watarimaycry2watarimaycry2
提出日時 2020-10-01 22:56:09
言語 Java21
(openjdk 21)
結果
AC  
実行時間 58 ms / 2,000 ms
コード長 3,010 bytes
コンパイル時間 2,948 ms
コンパイル使用メモリ 79,948 KB
実行使用メモリ 50,688 KB
最終ジャッジ日時 2024-07-07 06:02:03
合計ジャッジ時間 5,332 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 57 ms
49,988 KB
testcase_01 AC 58 ms
50,356 KB
testcase_02 AC 56 ms
50,132 KB
testcase_03 AC 56 ms
50,096 KB
testcase_04 AC 58 ms
50,344 KB
testcase_05 AC 56 ms
50,380 KB
testcase_06 AC 57 ms
50,364 KB
testcase_07 AC 57 ms
50,016 KB
testcase_08 AC 56 ms
49,968 KB
testcase_09 AC 56 ms
50,076 KB
testcase_10 AC 56 ms
50,424 KB
testcase_11 AC 57 ms
50,096 KB
testcase_12 AC 55 ms
50,220 KB
testcase_13 AC 57 ms
50,456 KB
testcase_14 AC 57 ms
50,688 KB
testcase_15 AC 57 ms
50,292 KB
testcase_16 AC 57 ms
50,172 KB
testcase_17 AC 56 ms
50,200 KB
testcase_18 AC 56 ms
50,100 KB
testcase_19 AC 56 ms
50,132 KB
testcase_20 AC 56 ms
50,328 KB
testcase_21 AC 56 ms
50,112 KB
testcase_22 AC 55 ms
50,160 KB
testcase_23 AC 56 ms
50,428 KB
testcase_24 AC 56 ms
50,080 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	static void solve(){//Here is the main function
		long N = nextLong();
		int mod = 1000000007;
		long output = N;
		output *= N;
		output %= mod;
		output *= N;
		output %= mod;
		myout(output);
	}
	//Method addition frame start



	//Method addition frame end

	//Don't have to see. start------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<String>(1024);
		int index = 0; int max; String read;
		InputIterator(){
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			try{
				while((read = br.readLine()) != null){
					inputLine.add(read);
				}
			}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<Integer, String>();
	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> nextStrArray(){return myconv(next(), 8);}
	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<Integer> nextIntArray(){
		ArrayList<String> input = nextStrArray(); ArrayList<Integer> ret = new ArrayList<Integer>(input.size());
		for(int i = 0; i < input.size(); i++){
			ret.add(Integer.parseInt(input.get(i)));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(){
		ArrayList<String> input = nextStrArray(); ArrayList<Long> ret = new ArrayList<Long>(input.size());
		for(int i = 0; i < input.size(); i++){
			ret.add(Long.parseLong(input.get(i)));
		}
		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------------------------------------------
}
0