Commit 42d42c3

SandersLinpoyea

authored and

committed

Project Euler problem 4 sol 2 small fix (TheAlgorithms#632)

1 parent dbe3f06 commit 42d42c3Copy full SHA for 42d42c3

File tree

-11

lines changed

-11

lines changed

Lines changed: 9 additions & 11 deletions

Original file line number	Diff line number	Diff line change
`@@ -4,16 +4,14 @@`
`4`	`4`	`Find the largest palindrome made from the product of two 3-digit numbers which is less than N.`
`5`	`5`	`'''`
`6`	`6`	`from __future__ import print_function`
`7`		`-arr = []`
`8`		`-for i in range(999,100,-1):`
`9`		`- for j in range(999,100,-1):`
	`7`	`+n = int(input().strip())`
	`8`	`+answer = 0`
	`9`	`+for i in range(999,99,-1): #3 digit nimbers range from 999 down to 100`
	`10`	`+ for j in range(999,99,-1):`
`10`	`11`	`t = str(i*j)`
`11`		`- if t == t[::-1]:`
`12`		`- arr.append(i*j)`
`13`		`-arr.sort()`
	`12`	`+ if t == t[::-1] and i*j < n:`
	`13`	`+ answer = max(answer,i*j)`
	`14`	`+print(answer)`
	`15`	`+exit(0)`
	`16`	`+`
`14`	`17`
`15`		`-n=int(input())`
`16`		`-for i in arr[::-1]:`
`17`		`- if(i<n):`
`18`		`- print(i)`
`19`		`- exit(0)`

Comments

(0)