'''
class code:
def __init__(self,n, map):
self.tt=0
self.tmp=0
self.str={}
self.cnt=0
self.i=0
self.j=0
self.map = map
self.n=n
def dfs(self,ii,jj):
if ii<self.n and ii>=0 and jj>=0 and self.map[ii][jj]==1:
self.tt+=1
self.map[ii][jj]=-1
self.dfs(ii, jj+1)
self.dfs(ii, jj-1)
self.dfs(ii-1,jj)
self.dfs(ii+1,jj)
def result1(self):
for self.i in range(0,n):
for self.j in range(0,n):
if self.map[self.i][self.j]==1:
self.tt=0
self.dfs(self.i,self.j)
self.str[self.cnt]=self.tt
self.cnt+=1
self.cnt-=1
return self.cnt
def result2(self):
for self.i in range(1,self.cnt):
for self.j in range(1,self.cnt-self.i):
if self.str[self.j]>self.str[self.j+1]:
self.tmp=self.str[self.j]
self.str[self.j]=self.str[self.j+1]
self.str[self.j+1]=self.tmp
for self.i in range(1,self.cnt-1):
return self.str[self.i]
n=int(input())
v = []
for i in range(n):
p = input()
k = []
for j in range(len(p)):
k.append(p[j])
v.append(k)
for i in range(len(v)):
for j in range(len(v[i])):
print(v[i][j], end=' ')
print()
x=code(n, v)
k=x.result1()
l=x.result2()
print(k,l)
'''
'''
class code:
def __init__(self):
self.result2=-1
def dfs(self,v,visited):
self.result2+=1
visited[v]=True
for i in graph[v]:
if not visited[i]:
self.dfs(i,visited)
def result(self):
graph[a].append(b)
graph[b].append(a)
visited = [False]*(n+1)
self.dfs(1,visited)
return self.result2
n=int(input())
m=int(input())
graph=[[]for i in range(n+1)]
for i in range(m):
a,b=map(int, input().split())
graph[a].append(b)
graph[b].append(a)
x=code()
y=x.result()
print(y)
'''
# 1925 2626 4880 3002 2608
# habit
# 3709 3712 3713
'''
n=int(input())
a=0
b=1
c=0
for i in range(n):
c=b
b=a+b
a=c
print(b%100000007)
'''
'''
n=int(input())
sum=1
for i in range(n):
if i % 3==0 and n!=1:
sum=sum*2
elif n%3 != 0:
sum=0
print(sum)
break
if sum != 0:
print(sum%100000007)
'''
n=int(input())
a=0
b=1
c=0
sum=0
for i in range(n):
c=b
b=a+b
a=c
sum=sum+b
print(sum, a, b,"***********")
if n % 2 != 0:
sum -= 1
if n != 1:
print(sum%100007)
elif n == 1:
print("1")
elif n % 2 == 0:
print(sum % 100007)
top of page
실제 작동 상태를 확인하려면 라이브 사이트로 이동하세요.
210729
210729
댓글 0개
좋아요
댓글(0)
bottom of page