Skip to main content
Commonmark migration
Source Link

#Python 3, Sp3000

Python 3, Sp3000

x=n= int(input()) # 3 P = [1,1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x) 

#Python 3, Sp3000

x=n= int(input()) # 3 P = [1,1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x) 

Python 3, Sp3000

x=n= int(input()) # 3 P = [1,1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x) 
replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/
Source Link

#Python 3, Sp3000Python 3, Sp3000

x=n= int(input()) # 3 P = [1,1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x) 

#Python 3, Sp3000

x=n= int(input()) # 3 P = [1,1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x) 

#Python 3, Sp3000

x=n= int(input()) # 3 P = [1,1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x) 
edited body
Source Link
feersum
  • 31.8k
  • 10
  • 66
  • 125

#Python 3, Sp3000

x=n= int(input()) # 3 P = [1,2]1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x) 

#Python 3, Sp3000

x=n= int(input()) # 3 P = [1,2] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x) 

#Python 3, Sp3000

x=n= int(input()) # 3 P = [1,1] #+2 = 5 k = 2 while n >=len(P): #+1 = 6 k += 1 for x in P: if k%x ==~0: break #+1 = 7 else: P += [P[-2]+x] #+7 = 14 print(x) 
Source Link
feersum
  • 31.8k
  • 10
  • 66
  • 125
Loading