We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Mathematics
  3. Algebra
  4. Girlfriend & Necklace
  5. Discussions

Girlfriend & Necklace

Sort by

recency

|

6 Discussions

|

  • sergey4spam
     + 0 comments

    This is interesting problem. It may be solved using recursive formula for numbers 1,2,3,4,6, ... But I have no idea why this formula works. Can someone be kind enough to explain?

  • acharyapavansha1
     + 0 comments

    I like this post now follow this forum.

  • eliahosford
     + 0 comments

    Does anyone know why my solution fail several tests? get your love back in 24 hours

  • harveyoberion
     + 0 comments

    Hey you did this I am new here can you help me out ? best tantrik in Visakhapatnam

  • TChalla
     + 0 comments

    Python 3 code

    # Enter your code here. Read input from STDIN. Print output to STDOUT
M = 10 ** 9 + 7
d = {}

def f(n):
    if n <= 0: return 1
    if n == 1: return 2
    if n == 2: return 3
    if n == 3: return 4
    if n in d: return d[n]
    t1 = f(n // 2 - 1) 
    t2 = f(n // 2 - 2) 
    t3 = f(n // 2 - 3) 
    if n % 2 == 0:
        d[n] = (t1 * t1 + 2 * t2 * t3) % M
    else:
        d[n] = (t2 * t2 + 2 * t3 * t1 + t1 * t1) % M
    return d[n]

T = input()
for _ in range(int(T)):
    N = int(input())
    print(f(N))