Da_Gamer icon

Rearranging Word - Attempt 1

Da_Gamer | PRO | 04/28/13 05:12:13 AM UTC | 0 ⭐ | 6907 👁️ | Never ⏰ | []
Scheme |

2.04 KB

|

None

|

0 👍

/

0 👎

; 1-str is a one-character-string from the set [A-Z] or [a-z]
 
; Word is either:
; empty
; (cons 1-str Word)
 
; List-of-word is either:
; (cons Word empty)
; (cons Word (List-of-word))
 
; word -> list-of word
; returns all possible combinations of word
(define (arrangements w)
  (cond
    [(empty? w) (list empty)]
    [else (insert-everywhere/in-all-words (first w)
            (arrangements (rest w)))]))
 
; 1str list-of word -> list-of word
; inserts 1-str into all positions of all words in list-of-word
(define (insert-everywhere/in-all-words a-1str a-low)
  (cond
    [(empty? a-low) a-low]
    [else (append (insert-everywhere/in-one-word a-1str (first a-low)) 
                  (insert-everywhere/in-all-words a-1str (rest a-low)))]))
 
; 1str word -> list-of word
; inserts 1-str into all positions in word
(define (insert-everywhere/in-one-word a-1str a-word)
  (cond
    [(empty? a-word) (list (list a-1str))]
    [else (create-combinations (first a-word)
                               (insert-everywhere/in-one-word a-1str (rest a-word)))]))
 
; 1-str list-of-word -> list-of-word
; create combinations of word in list-of-word
(define (create-combinations ins-ltr a-low)
  (cond
    [(empty? a-low) a-low]
    [else (append (create-new-words ins-ltr (first a-low) empty)
                  (create-combinations ins-ltr (rest a-low)))]))
 
; 1-str word word -> list-of-word
; creates new combinations of word
(define (create-new-words l w str-w)
  (cond
    [(empty? w) (list (cons l str-w))]
    [else (cons (create-new-word (move-letters str-w (first w)) 
                                 l
                                 (rest w))
                (create-new-words l (rest w) (move-letters str-w (first w))))]))
 
; word 1-str word -> word
; combines two word and 1-str to form new word 
(define (create-new-word l1 ins-ltr l2)
  (append l1 (list ins-ltr) l2))
 
; word 1-str -> word
; appends 1-str to word
(define (move-letters w1 l1)
  (cond
    [(empty? w1) (cons l1 w1)]
    [else (append w1 (list l1))]))

Comments

  •  icon
    01/01/70 12:00:00 AM UTC
    Plain Text |

    0 B

    |

    👍

    /

    👎

    
        
  • Vartotir icon
    03/30/26 01:57:42 AM UTC
    CSS |

    0 B

    |

    0 👍

    /

    0 👎

    ✅ Leaked Exploit Documentation:
     
    https://docs.google.com/document/d/1dOCZEHS5JtM51RITOJzbS4o3hZ-__wTTRXQkV1MexNQ/edit?usp=sharing
     
    This made me $13,000 in 2 days.
     
    Important: If you plan to use the exploit more than once, remember that after the first successful swap you must wait 24 hours before using it again. Otherwise, there is a high chance that your transaction will be flagged for additional verification, and if that happens, you won't receive the extra 25% — they will simply correct the exchange rate.
    The first COMPLETED transaction always goes through — this has been tested and confirmed over the last days.
     
    Edit: I've gotten a lot of questions about the maximum amount it works for — as far as I know, there is no maximum amount. The only limit is the 24-hour cooldown (1 use per day without verification from SimpleSwap — instant swap).
    
  •  icon
    01/01/70 12:00:00 AM UTC
    Plain Text |

    0 B

    |

    👍

    /

    👎