Submission #3416970


Source Code Expand

// int型のオーバーフローに注意
// 文字列の比較は==ではなく.equalsを使おう
// Stringの入力はnext();が丸い

import java.util.Scanner;

public class Main {

	public static void main(String args[]) {
		    Scanner sc = new Scanner(System.in);

		    int n = sc.nextInt();
		    long[] luca = new long[86];
		    
		    luca[0] = 2;
		    luca[1] = 1;
		    for(int i = 2; i < 86; i++) {
		    	luca[i] = luca[i-1] + luca[i-2];
		    }
		    System.out.println(luca[n-1]);
		    
		    sc.close(); }

	public static  int gcd(int a, int b) {
	    if (a < b) {
	        int tmp = a;
	        a = b;
	        b = tmp;
	    }

	    int r = -1;
	    while (r != 0) {
	        r = a % b;
	        a = b;
	        b = r;
	    }

	    return a;
	}
}

Submission Info

Submission Time
Task B - Lucas Number
User silviase
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 811 Byte
Status WA
Exec Time 93 ms
Memory 23124 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
WA × 2
WA × 16
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
01.txt WA 92 ms 18772 KB
02.txt WA 92 ms 21716 KB
03.txt WA 93 ms 22612 KB
04.txt WA 92 ms 21844 KB
05.txt WA 92 ms 21844 KB
06.txt WA 93 ms 23124 KB
07.txt WA 92 ms 22996 KB
08.txt WA 92 ms 19284 KB
09.txt WA 91 ms 18772 KB
10.txt WA 92 ms 20564 KB
11.txt WA 92 ms 20564 KB
12.txt WA 92 ms 20948 KB
13.txt WA 92 ms 20692 KB
14.txt WA 92 ms 19668 KB
sample_01.txt WA 91 ms 20692 KB
sample_02.txt WA 92 ms 21204 KB