結果

問題 No.314 ケンケンパ
コンテスト
ユーザー threepipes_s
提出日時 2015-12-07 00:16:46
言語 Java
(openjdk 23)
結果
AC  
実行時間 227 ms / 1,000 ms
コード長 2,529 bytes
コンパイル時間 2,536 ms
コンパイル使用メモリ 80,188 KB
実行使用メモリ 75,324 KB
最終ジャッジ日時 2024-09-14 16:59:01
合計ジャッジ時間 4,875 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 17
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
 
public class Main {
	public static void main(String[] args) throws NumberFormatException,
	IOException {Solve solve = new Solve();solve.solve();}
}
class Solve{
	void solve() throws NumberFormatException, IOException{
		ContestScanner in = new ContestScanner();
		Writer out = new Writer();
		int n = in.nextInt();
		int[][] dp = new int[n][3];
		dp[0][0] = 1;
		dp[0][2] = 0;
		int mod = 1000000007;
		for(int i=1; i<n; i++){
			dp[i][0] = (dp[i][0]+dp[i-1][2])%mod;
			dp[i][1] = (dp[i][1]+dp[i-1][0])%mod;
			dp[i][2] = (int)(((long)dp[i][2]+dp[i-1][1]+dp[i-1][0])%mod);
		}
		long sum = 0;
		for(int i=0; i<3; i++){
			sum = (sum+dp[n-1][i])%mod;
		}
		System.out.println(sum);
	}
}
 
class MultiSet<T> extends HashMap<T, Integer>{
	@Override
	public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
}
class Timer{
	long time;
	public void set(){time = System.currentTimeMillis();}
	public long stop(){return System.currentTimeMillis()-time;}
}
class Writer extends PrintWriter{
	public Writer(String filename) throws IOException
	{super(new BufferedWriter(new FileWriter(filename)));}
	public Writer() throws IOException{super(System.out);}
}
class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException 
	{reader = new BufferedReader(new InputStreamReader(System.in));}
	public ContestScanner(String filename) throws FileNotFoundException
	{reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	public String readLine() throws IOException{return reader.readLine();}
	public long nextLong() throws IOException, NumberFormatException
	{return Long.parseLong(nextToken());}
	public int nextInt() throws NumberFormatException, IOException
	{return (int) nextLong();}
	public double nextDouble() throws NumberFormatException, IOException 
	{return Double.parseDouble(nextToken());}
}
0