QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#708802 | #2936. Simple Collatz Sequence | sefnuray# | TL | 0ms | 3696kb | C++14 | 858b | 2024-11-04 07:08:45 | 2024-11-04 07:08:47 |
Judging History
answer
#include <iostream>
#include <algorithm>
#include <bitset>
#include <vector>
#include <cmath>
#include <string>
#include <set>
#include <map>
#include <unordered_map>
#include <sstream>
#include <iomanip>
#include <stdexcept>
#include <utility>
#include <deque>
using namespace std;
typedef long long ll;
typedef long double ld;
int gcd (int a, int b) {
return b ? gcd (b, a % b) : a;
}
int main() {
//these first two lines speed up input / output significantly
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n;
cin>>n;
if(n <= 2) {
cout<<"1";
}
ll even = 1;
ll odd = 1;
n = n-3;
while(n--){
ll temp =( even % 1000007);
even = (even+odd) % 1000007;
odd =temp % 1000007;
}
cout<<(even+odd);
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3696kb
input:
6
output:
8
result:
ok single line: '8'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
12345
output:
540591
result:
ok single line: '540591'
Test #3:
score: -100
Time Limit Exceeded
input:
1