[Solved] 21394. Ohani And The Series - TLE

[vamsi_ism]

Hi all,
I thought I solved the problem when I am able to derive a formula(2**(n - 2) * (n + 1)), but n may be as big as 100,000.
I tried different solutions but all got TLE.
I think I am missing something about modulo operator, any help would be great.
Thank you.
My recent code which got TLE:

Issue Resolved.

Problem Link:
http://www.spoj.com/problems/OHANISER/

[luckymastermin]

[bbone=text,748]Removed----------[/bbone]

[vamsi_ism]

Thank you very much Lakshman
AC now ^_^

[numerix]

Today I tried this problem with Python(already done in C++)
I was using a direct formula and was getting TLE. Then I change the method and did some pre-comuptation and got accepted.
suggestion in case of large I/O always use stdin/stdout

I think that should be enough for anyone, who want's to solve the problem.
Please remove the code.