Install Steam
login
|
language
简体中文 (Simplified Chinese)
繁體中文 (Traditional Chinese)
日本語 (Japanese)
한국어 (Korean)
ไทย (Thai)
Български (Bulgarian)
Čeština (Czech)
Dansk (Danish)
Deutsch (German)
Español - España (Spanish - Spain)
Español - Latinoamérica (Spanish - Latin America)
Ελληνικά (Greek)
Français (French)
Italiano (Italian)
Bahasa Indonesia (Indonesian)
Magyar (Hungarian)
Nederlands (Dutch)
Norsk (Norwegian)
Polski (Polish)
Português (Portuguese - Portugal)
Português - Brasil (Portuguese - Brazil)
Română (Romanian)
Русский (Russian)
Suomi (Finnish)
Svenska (Swedish)
Türkçe (Turkish)
Tiếng Việt (Vietnamese)
Українська (Ukrainian)
Report a translation problem
I'd like to call it an exponential descending cursor
(once) = (start)xxxxxxxx
# locate position between 3 and 4
xxa = ax
xxb = bx
xxc = cx
# delete tail from 4
xa = x
xb = x
xc = x
#delete cursor
(end)x =
Its like XXXA = XXX (X can be anyletter A, B, C ) for keep first 3 letters. So I wrote all 81(3*3*3*3, 3 = A, B, C) possibilities. So if u guys find easier solution, pls share xd