Submission #3416971


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[87];
		    
		    luca[0] = 2;
		    luca[1] = 1;
		    for(int i = 2; i < 87; i++) {
		    	luca[i] = luca[i-1] + luca[i-2];
		    }
		    System.out.println(luca[n]);
		    
		    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 200
Code Size 809 Byte
Status AC
Exec Time 95 ms
Memory 22732 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 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 AC 92 ms 21588 KB
02.txt AC 90 ms 19668 KB
03.txt AC 90 ms 21844 KB
04.txt AC 91 ms 19156 KB
05.txt AC 93 ms 21588 KB
06.txt AC 91 ms 19284 KB
07.txt AC 91 ms 20564 KB
08.txt AC 92 ms 18900 KB
09.txt AC 91 ms 19540 KB
10.txt AC 91 ms 21332 KB
11.txt AC 92 ms 21716 KB
12.txt AC 93 ms 21588 KB
13.txt AC 91 ms 21204 KB
14.txt AC 91 ms 21076 KB
sample_01.txt AC 90 ms 18644 KB
sample_02.txt AC 95 ms 22732 KB