Calculations

Practice

0 (0 votes)

Integer factorization

Basics of implementation

Implementation

Mathematics

Math

Number theory

Problem

93% Success 615 Attempts 50 Points 1s Time Limit 256MB Memory 1024 KB Max Code

You are given the following recurrent formula: \(T_n = T_{n - 1} + T_{n - 2} + T_{n – 3}\) , at \(n > 3\), \(T_1 = 3, T_2 = 2, T_3 = 1\) Calculate the following value, \( S = (T^2_1 + T^2_2 + ... + T^2_N ) mod (10^9 + 7)\). Input format The first line contains one integer \(N\). Output format Print \(S\) denoting the answer to the problem. Constraints \(1 ⩽ N ⩽ 10^{18}\)

You need to be logged in to access the code editor

Please wait while we load the editor

Results

Custom Input

Run your code to see the output

Submissions

Please login to view your submissions