Rosetta Code

Numbers k such that the last letter of k is the same as the first letter of k+1: Difference between revisions

Page Discussion

Numbers k such that the last letter of k is the same as the first letter of k+1 (view source)

Revision as of 20:47, 1 July 2023

96 bytes removed ,  10 months ago
m
→‎{{header|Python}}
Line 550:
firstcache, lastcache = [s[0] for s in spelledcache], [s[-1] for s in spelledcache]
 
def firstletterqualifies(n):
returnlastchar = lastcache[n % 1000] if n % 1000 > 0 else 'o' if n == 0 else \▼
if n == 0:▼
'n' if n % 1_000_000 == 0 returnelse 'zd'
▲ if n =+= 0:1
j = 0
while n > 0:
n, j = divmod(n, 1000)
return firstcache[j] == lastchar
 
def lastletter(n):
▲ return lastcache[n % 1000] if n % 1000 > 0 else 'o' if n == 0 else \
'n' if n % 1_000_000 == 0 else 'd'
 
def qualifies(n):
return lastletter(n) == firstletter(n + 1)
 
def testqualifies():
Wherrera
4,103

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/345775"