HCI '16 - Computation

View as PDF

Submit solution

Points: 0
Time limit: 8.0s
Memory limit: 4M

Authors:
Problem types

This problem requires to compute some numbers!

Input Specification

First line: N, number of iterations

Second line: 16 numbers, each of them 2321

Output Specification

For each number, let it be F(0).

Do these computations in order:

X=(F(n1))2mod1000000007Y=X×log2XF(n)=Y×(Y+F(n1))2

Also, if X=0 then Y=0. For each number, output sum of F(i)mod1000000007 for each i from 0 to N1.

Constraints

Subtask 1 [100%]

N=108

Subtask 2 [0%]

Sample test cases.

Sample Input

Copy
10
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Sample Output

Copy
1 4732602024 6148672003 4338052043 4483023256 4518465763 4649308948 3879800457 3164030163 3788568405 6057821801 5081899390 3575845616 4623378973 4148490590 5052851606

Comments

There are no comments at the moment.