Submission #155355
Source Code Expand
#include <vector> #include <list> #include <map> #include <set> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <queue> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <ctime> #include <fstream> #include <stdio.h> #include <complex> using namespace std; //conversion //------------------------------------------ inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;} template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();} //typedef //------------------------------------------ typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> PII; typedef pair<int, PII> TIII; typedef long long LL; typedef vector<LL> VLL; //container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) #define MT(a,b,c) MP(a, MP(b, c)) //repetition //------------------------------------------ #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define MOD 1000000007 int a[3]; int main(){ int n; cin >> n; a[2]=1; n--; FOR(i, 3, n+1)a[i%3] = (a[0]+a[1]+a[2])%10007; cout << a[n%3] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - トリボナッチ数列 |
User | UminchuR |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1719 Byte |
Status | AC |
Exec Time | 29 ms |
Memory | 924 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 | 924 KB |
sample_02.txt | AC | 20 ms | 800 KB |
sample_03.txt | AC | 23 ms | 920 KB |
test_1.txt | AC | 20 ms | 800 KB |
test_1000000.txt | AC | 29 ms | 800 KB |
test_1002.txt | AC | 22 ms | 800 KB |
test_104.txt | AC | 20 ms | 800 KB |
test_107843.txt | AC | 20 ms | 924 KB |
test_10980.txt | AC | 22 ms | 672 KB |
test_1212.txt | AC | 20 ms | 792 KB |
test_1238.txt | AC | 20 ms | 924 KB |
test_13194.txt | AC | 20 ms | 800 KB |
test_14.txt | AC | 20 ms | 796 KB |
test_16.txt | AC | 20 ms | 796 KB |
test_2.txt | AC | 20 ms | 796 KB |
test_210782.txt | AC | 22 ms | 924 KB |
test_21694.txt | AC | 22 ms | 676 KB |
test_243.txt | AC | 20 ms | 924 KB |
test_24916.txt | AC | 20 ms | 800 KB |
test_278.txt | AC | 20 ms | 800 KB |
test_3.txt | AC | 20 ms | 920 KB |
test_31.txt | AC | 21 ms | 796 KB |
test_32.txt | AC | 20 ms | 792 KB |
test_42.txt | AC | 20 ms | 792 KB |
test_5555.txt | AC | 23 ms | 796 KB |
test_567914.txt | AC | 26 ms | 748 KB |
test_61868.txt | AC | 23 ms | 796 KB |
test_765671.txt | AC | 29 ms | 792 KB |
test_8195.txt | AC | 21 ms | 924 KB |
test_8353.txt | AC | 22 ms | 808 KB |
test_9.txt | AC | 20 ms | 792 KB |
test_9625.txt | AC | 20 ms | 796 KB |
test_97.txt | AC | 21 ms | 716 KB |
test_998.txt | AC | 21 ms | 796 KB |
test_999998.txt | AC | 29 ms | 744 KB |
test_999999.txt | AC | 29 ms | 796 KB |