Submission #3026823
Source Code Expand
//#include <bits/stdc++.h> //#include <stdio.h> #include<iostream> #include<cstdio> #include<bitset> #include<algorithm> #include<vector> #include<list> #include<queue> #include<stack> #include<string> #include<string.h> #include<cmath> #include<utility> #include<functional> #include<map> #include<set> #include<cctype> #include<fstream> #define FOR(i, a, b) for( int i=(a);i<=(b);i++) #define RFOR(i, a, b) for( int i=(a);i>=(b);i--) #define LFOR(i, a, b) for( long long int i=(a);i<=(b);i++) #define LRFOR(i, a, b) for(long long int i=(a);i>=(b);i--) #define MOD 1000000007 #define INF 1000000000 //2000000000 #define LLINF 1000000000000000000 //9000000000000000000 #define PI 3.14159265358979 #define MAXI 7500000 using namespace std; typedef long long int ll; typedef pair< long long int, long long int> P; typedef string::const_iterator State; int dy[5] = { 0,0,1,-1,0 }; int dx[5] = { 1,-1,0,0 ,0 }; int main(void) { ll n; ll fib[46]; cin >> n; fib[0] = 1; fib[1] = 1; FOR(i, 2, n) { fib[i] = fib[i - 2] + fib[i - 1]; } cout << fib[n] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 算盤の書 |
User | yukiteru |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1152 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample1, 00_sample2, 00_sample3, 10_testcase00, 10_testcase01, 10_testcase02, 10_testcase03, 10_testcase04, 10_testcase05, 10_testcase06, 10_testcase07, 10_testcase08, 10_testcase09, 10_testcase10, 10_testcase11, 10_testcase12, 10_testcase13, 10_testcase14, 10_testcase15, 10_testcase16, 10_testcase17, 10_testcase18, 10_testcase19, 10_testcase20, 10_testcase21, 10_testcase22, 10_testcase23, 10_testcase24, 10_testcase25, 10_testcase26, 10_testcase27, 10_testcase28, 10_testcase29, 10_testcase30, 10_testcase31, 10_testcase32, 10_testcase33, 10_testcase34, 10_testcase35, 10_testcase36, 10_testcase37, 10_testcase38, 10_testcase39, 10_testcase40, 10_testcase41, 10_testcase42 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample1 | AC | 1 ms | 256 KB |
00_sample2 | AC | 1 ms | 256 KB |
00_sample3 | AC | 1 ms | 256 KB |
10_testcase00 | AC | 1 ms | 256 KB |
10_testcase01 | AC | 1 ms | 256 KB |
10_testcase02 | AC | 1 ms | 256 KB |
10_testcase03 | AC | 1 ms | 256 KB |
10_testcase04 | AC | 1 ms | 256 KB |
10_testcase05 | AC | 1 ms | 256 KB |
10_testcase06 | AC | 1 ms | 256 KB |
10_testcase07 | AC | 1 ms | 256 KB |
10_testcase08 | AC | 1 ms | 256 KB |
10_testcase09 | AC | 1 ms | 256 KB |
10_testcase10 | AC | 1 ms | 256 KB |
10_testcase11 | AC | 1 ms | 256 KB |
10_testcase12 | AC | 1 ms | 256 KB |
10_testcase13 | AC | 1 ms | 256 KB |
10_testcase14 | AC | 1 ms | 256 KB |
10_testcase15 | AC | 1 ms | 256 KB |
10_testcase16 | AC | 1 ms | 256 KB |
10_testcase17 | AC | 1 ms | 256 KB |
10_testcase18 | AC | 1 ms | 256 KB |
10_testcase19 | AC | 1 ms | 256 KB |
10_testcase20 | AC | 1 ms | 256 KB |
10_testcase21 | AC | 1 ms | 256 KB |
10_testcase22 | AC | 1 ms | 256 KB |
10_testcase23 | AC | 1 ms | 256 KB |
10_testcase24 | AC | 1 ms | 256 KB |
10_testcase25 | AC | 1 ms | 256 KB |
10_testcase26 | AC | 1 ms | 256 KB |
10_testcase27 | AC | 1 ms | 256 KB |
10_testcase28 | AC | 1 ms | 256 KB |
10_testcase29 | AC | 1 ms | 256 KB |
10_testcase30 | AC | 1 ms | 256 KB |
10_testcase31 | AC | 1 ms | 256 KB |
10_testcase32 | AC | 1 ms | 256 KB |
10_testcase33 | AC | 1 ms | 256 KB |
10_testcase34 | AC | 1 ms | 256 KB |
10_testcase35 | AC | 1 ms | 256 KB |
10_testcase36 | AC | 1 ms | 256 KB |
10_testcase37 | AC | 1 ms | 256 KB |
10_testcase38 | AC | 1 ms | 256 KB |
10_testcase39 | AC | 1 ms | 256 KB |
10_testcase40 | AC | 1 ms | 256 KB |
10_testcase41 | AC | 1 ms | 256 KB |
10_testcase42 | AC | 1 ms | 256 KB |