Submission #154779
Source Code Expand
#include <bitset> #include <deque> #include <list> #include <map> #include <queue> #include <set> #include <stack> #include <vector> #include <algorithm> #include <functional> #include <iterator> #include <locale> #include <memory> #include <stdexcept> #include <utility> #include <string> #include <fstream> #include <ios> #include <iostream> #include <iosfwd> #include <iomanip> #include <istream> #include <ostream> #include <sstream> #include <streambuf> #include <complex> #include <numeric> #include <valarray> #include <exception> #include <limits> #include <new> #include <typeinfo> #include <cassert> #include <cctype> #include <cerrno> #include <cfloat> #include <climits> #include <cmath> #include <csetjmp> #include <csignal> #include <cstdlib> #include <cstddef> #include <cstdarg> #include <ctime> #include <cstdio> #include <cstring> #include <cwchar> #include <cwctype> using namespace std; static const double EPS = 1e-8; static const double PI = 4.0 * atan(1.0); static const double PI2 = 8.0 * atan(1.0); typedef long long ll; typedef unsigned long long ull; #define ALL(c) (c).begin(), (c).end() #define CLEAR(v) memset(v,0,sizeof(v)) #define MP(a,b) make_pair((a),(b)) #define REP(i,n) for(int i=0;i<(int)n;++i) #define ABS(a) ((a)>0?(a):-(a)) template<class T> T MIN(const T& a, const T& b) { return a < b ? a : b; } template<class T> T MAX(const T& a, const T& b) { return a > b ? a : b; } template<class T> void MIN_UPDATE(T& a, const T& b) { if (a > b) a = b; } template<class T> void MAX_UPDATE(T& a, const T& b) { if (a < b) a = b; } int main() { std::ios::sync_with_stdio(false); int n; cin >> n; int a = 0; int b = 0; int c = 1; for (int i = 2; i <= n; ++i) { int d = (a + b + c) % 10007; a = b; b = c; c = d; } cout << a << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - トリボナッチ数列 |
User | nodchip |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1863 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 932 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | test_1.txt, test_1000000.txt, test_1002.txt, test_104.txt, test_107843.txt, test_10980.txt, test_1212.txt, test_1238.txt, test_13194.txt, test_14.txt, test_16.txt, test_2.txt, test_210782.txt, test_21694.txt, test_243.txt, test_24916.txt, test_278.txt, test_3.txt, test_31.txt, test_32.txt, test_42.txt, test_5555.txt, test_567914.txt, test_61868.txt, test_765671.txt, test_8195.txt, test_8353.txt, test_9.txt, test_9625.txt, test_97.txt, test_998.txt, test_999998.txt, test_999999.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 21 ms | 800 KB |
sample_02.txt | AC | 21 ms | 792 KB |
sample_03.txt | AC | 21 ms | 800 KB |
test_1.txt | AC | 22 ms | 928 KB |
test_1000000.txt | AC | 28 ms | 924 KB |
test_1002.txt | AC | 22 ms | 932 KB |
test_104.txt | AC | 21 ms | 796 KB |
test_107843.txt | AC | 22 ms | 800 KB |
test_10980.txt | AC | 21 ms | 804 KB |
test_1212.txt | AC | 21 ms | 756 KB |
test_1238.txt | AC | 21 ms | 928 KB |
test_13194.txt | AC | 21 ms | 932 KB |
test_14.txt | AC | 21 ms | 932 KB |
test_16.txt | AC | 21 ms | 924 KB |
test_2.txt | AC | 21 ms | 748 KB |
test_210782.txt | AC | 23 ms | 804 KB |
test_21694.txt | AC | 21 ms | 920 KB |
test_243.txt | AC | 21 ms | 932 KB |
test_24916.txt | AC | 21 ms | 804 KB |
test_278.txt | AC | 21 ms | 932 KB |
test_3.txt | AC | 21 ms | 804 KB |
test_31.txt | AC | 20 ms | 932 KB |
test_32.txt | AC | 21 ms | 932 KB |
test_42.txt | AC | 21 ms | 924 KB |
test_5555.txt | AC | 21 ms | 924 KB |
test_567914.txt | AC | 24 ms | 924 KB |
test_61868.txt | AC | 20 ms | 928 KB |
test_765671.txt | AC | 26 ms | 928 KB |
test_8195.txt | AC | 20 ms | 920 KB |
test_8353.txt | AC | 21 ms | 932 KB |
test_9.txt | AC | 21 ms | 740 KB |
test_9625.txt | AC | 23 ms | 804 KB |
test_97.txt | AC | 21 ms | 800 KB |
test_998.txt | AC | 21 ms | 928 KB |
test_999998.txt | AC | 28 ms | 932 KB |
test_999999.txt | AC | 27 ms | 932 KB |