結果
問題 | No.64 XORフィボナッチ数列 |
ユーザー |
![]() |
提出日時 | 2017-06-27 13:56:02 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 52 ms / 5,000 ms |
コード長 | 2,130 bytes |
コンパイル時間 | 1,991 ms |
コンパイル使用メモリ | 78,948 KB |
実行使用メモリ | 37,304 KB |
最終ジャッジ日時 | 2024-10-04 11:30:43 |
合計ジャッジ時間 | 3,566 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 11 |
ソースコード
import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.InputMismatchException;import java.io.OutputStream;import java.util.StringTokenizer;import java.io.BufferedReader;import java.io.InputStreamReader;import java.util.HashMap;import java.util.Map;import java.util.ArrayList;import java.util.List;import java.util.Scanner;import java.math.BigDecimal;/*** Built using CHelper plug-in* Actual solution is at the top*/public class Main {public static void main(String[] args) {InputStream inputStream = System.in;OutputStream outputStream = System.out;InputReader in = new InputReader(inputStream);PrintWriter out = new PrintWriter(outputStream);Task solver = new Task();solver.solve(1, in, out);out.close();}static class Task {public void solve(int testNumber, InputReader in, PrintWriter out) {long A = in.nextLong();long B = in.nextLong();long N = in.nextLong();long[] F = new long[4];F[0] = A;F[1] = B;F[2] = A^B;N=N%3;out.println(F[(int)N]);}}static class InputReader {public BufferedReader reader;public StringTokenizer tokenizer;public InputReader(InputStream stream) {reader = new BufferedReader(new InputStreamReader(stream), 32768);tokenizer = null;}public String next() {while (tokenizer == null || !tokenizer.hasMoreTokens()) {try {tokenizer = new StringTokenizer(reader.readLine());} catch (IOException e) {throw new RuntimeException(e);}}return tokenizer.nextToken();}public int nextInt() {return Integer.parseInt(next());}public long nextLong() {return Long.parseLong(next());}}}