Home ABCTF-2016 The Big Kahuna
Writeup
Cancel

The Big Kahuna

Challenge

What’s the smallest amount of steps (additions, deletions, and replacing) it would take to make the string “massivegargantuanhugeepicginormous” into “tinysmallmicroscopicinvisible”? Don’t guess too many times or we will disqualify you. Remember to wrap your answer in abctf{}.

Solution

This is just the edit distance of two strings.

1
2
3
# pip install python-Levenshtein
import Levenshtein as L
L.distance('massivegargantuanhugeepicginormous', 'tinysmallmicroscopicinvisible')

output

1
28

Flag

abctf{28}