結果

問題 No.64 XORフィボナッチ数列
ユーザー threepipes_s
提出日時 2015-02-19 00:11:25
言語 Java
(openjdk 23)
結果
AC  
実行時間 54 ms / 5,000 ms
コード長 1,927 bytes
コンパイル時間 2,350 ms
コンパイル使用メモリ 78,512 KB
実行使用メモリ 50,496 KB
最終ジャッジ日時 2024-06-23 21:17:09
合計ジャッジ時間 3,820 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 11
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
public class Main {
    public static boolean result[];
    public static int dp[][];
    public static void main(String[] args) throws NumberFormatException, IOException{
        ContestScanner in = new ContestScanner();
        long[] f = new long[3];
        f[0] = in.nextLong();
        f[1] = in.nextLong();
        f[2] = f[0]^f[1];
        System.out.println(f[(int)(in.nextLong()%3)]);
    }
}
class MyComp implements Comparator<int[]>{
    public int compare(int[] a, int[] b) {
        return a[0] - b[0];
    }
}
class Reverse implements Comparator<Integer>{
    public int compare(Integer arg0, Integer arg1) {
        return arg1 - arg0;
    }
}
class Node{
    int id;
    List<Node> edge = new ArrayList<Node>();
    public Node(int id){
        this.id = id;
    }
    public void createEdge(Node node){
        edge.add(node);
    }
}
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 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());
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0