fork(1) download
  1. #include <iostream>
  2. #include <deque>
  3.  
  4. using namespace std;
  5.  
  6. int fibonacci_sum_deque(long long n) {
  7. if (n <= 2)
  8. return n;
  9.  
  10. deque<int> sum(4);
  11. sum[0] = 0;
  12. sum[1] = 1;
  13. sum[2] = 2;
  14.  
  15. for (long long i = 3; i <= n; ++i) {
  16. sum[3] = (sum[2] + sum[1] + 1) % 10;
  17. sum.pop_front();
  18. std::cout << sum.size() << '\n';
  19. }
  20.  
  21. return sum[2];
  22. }
  23.  
  24. int main() {
  25. long long n = 0;
  26. cin >> n;
  27. cout << fibonacci_sum_deque(n);
  28. }
  29.  
Success #stdin #stdout 0s 16064KB
stdin
10
stdout
3
2
1
0
18446744073709551615
18446744073709551614
18446744073709551613
18446744073709551612
3