import requests
import json
from bs4 import BeautifulSoup
session = requests.session()
r = session.get('http://r4u.top:5000/api/getQuestion')
soup = BeautifulSoup(r.content, "html.parser")
x2 = int(soup.find_all('mn')[0].get_text()) * -1
x1 = int(soup.find_all('mn')[1].get_text())
a = int(soup.find_all('mn')[2].get_text())
b = int(soup.find_all('mn')[3].get_text())
# print(soup.find_all('mn')[0].get_text())
answer = a/2*x1*x1+b*x1-a/2*x2*x2-b*x2
answer = round(answer, 2)
data = {"answer": answer}
r = session.post('http://r4u.top:5000/api/verify', json=data)
print(r.content)
status = json.loads(session.get('http://r4u.top:5000/api/getStatus').text)

while(status.get('solving') != 100):
    r = session.get('http://r4u.top:5000/api/getQuestion')
    soup = BeautifulSoup(r.content, "html.parser")
    x2 = int(soup.find_all('mn')[0].get_text()) * -1
    x1 = int(soup.find_all('mn')[1].get_text())
    a = int(soup.find_all('mn')[2].get_text())
    b = int(soup.find_all('mn')[3].get_text())
    answer = a/2*x1*x1+b*x1-a/2*x2*x2-b*x2
    answer = round(answer, 2)
    data = {"answer": answer}
    r = session.post('http://r4u.top:5000/api/verify', json=data)
    print(r.content)
    status = json.loads(session.get('http://r4u.top:5000/api/getStatus').text)
    print(status.get('solving'))
    print(session.cookies)

#include <stdio.h>
#include <string.h>
#define DELTA 0x9e3779b9
#define MX                                            \
    (((z >> 5) ^ (y << 2)) + ((y >> 3) ^ (z << 4))) ^ \
        ((sum ^ y) + (key[(p & 3) ^ e] ^ z))
static unsigned int* xxtea_uint_decrypt(unsigned int* data,
                                        size_t len,
                                        unsigned int* key) {
    unsigned int n = (unsigned int)len - 1;
    unsigned int z, y = data[0], p, q = 6 + 52 / (n + 1), sum = q * DELTA, e;

    if (n < 1)
        return data;

    while (sum != 0) {
        e = sum >> 2 & 3;

        for (p = n; p > 0; p--) {
            z = data[p - 1];
            y = data[p] -= MX;
        }

        z = data[n];
        y = data[0] -= MX;
        sum -= DELTA;
    }

    return data;
}
int main() {
    unsigned int data2[35] = {
        0x0E74EB323, 0x0B7A72836, 0x59CA6FE2,  0x967CC5C1,  0x0E7802674,
        0x3D2D54E6,  0x8A9D0356,  0x99DCC39C,  0x7026D8ED,  0x6A33FDAD,
        0x0F496550A, 0x5C9C6F9E,  0x1BE5D04C,  0x6723AE17,  0x5270A5C2,
        0x0AC42130A, 0x84BE67B2,  0x705CC779,  0x5C513D98,  0x0FB36DA2D,
        0x22179645,  0x5CE3529D,  0x0D189E1FB, 0x0E85BD489, 0x73C8D11F,
        0x54B5C196,  0x0B67CB490, 0x2117E4CA,  0x9DE3F994,  0x2F5AA1AA,
        0x0A7E801FD, 0x0C30D6EAB, 0x1BADDC9C,  0x3453B04A,  0x92A406F9};
    unsigned int key[4] = {1, 2, 3, 4};
    xxtea_uint_decrypt(data2, 35, key);
    for (int i = 0; i < 35; i++) {
        printf("%c", (char)data2[i]);
    }
    return 0;
}

key = '\xff'
words = '\x97\x99\x9C\x91\x9E\x81\x91\x9D\x9B\x9A\x9A\xAB\x81\x97\xAE\x80\x83\x8F\x94\x89\x99\x97'
for word in words:
    print(chr(ord(word) ^ ord(key)), end='')
    key = chr(ord(key) - 1)

raw_flag = input('give me your flag:')
cipher = raw_flag[6:-1]
length = len(cipher)
for i in range(length/2):
    cipher[2*i], cipher[2*i+1] = cipher[2*i+1], cipher[2*i]
res = []
for i in range(length):
    res.append(ord(cipher[i]) ^ i)
res = bytes(hex(res))
return 0

cipher = "0Ff34oY!;A9yE W+EQMaX1QWf8d:"
length = len(cipher)
words = []
for i in range(length):
    words.append(ord(cipher[i]) ^ i)
for i in range(int(length/2)):
    i = int(length/2)-i-1
    words[2*i], words[2*i+1] = words[2*i+1], words[2*i]
print(words)
for i in words:
    print(chr(i), end='')

from __future__ import print_function
import sys
import hexdump
import math
import os
import random
from simanneal import Annealer

# requires https://github.com/perrygeo/simanneal

KEYLEN = 16


def xor_strings(s, t):
    # https://en.wikipedia.org/wiki/XOR_cipher#Example_implementation
    """xor two strings together"""
    return "".join(chr(ord(a) ^ ord(b)) for a, b in zip(s, t))


def read_file(fname):
    file = open(fname, mode='rb')
    content = file.read()
    file.close()
    return content


def chunks(l, n):
    """divide input buffer by n-len chunks"""
    n = max(1, n)
    return [l[i:i + n] for i in range(0, len(l), n)]


trigrams = ["the", "and", "tha", "ent", "ing", "ion", "tio",
            "for", "nde", "has", "nce", "edt", "tis", "oft", "sth", "men"]
digrams = ["th", "he", "in", "er"]

# additional tuning may be needed:
BONUS_FOR_PRINTABLE = 1
BONUS_FOR_LOWERCASE = 3
BONUS_FOR_SPACE = 8
BONUS_FOR_DIGRAM = 8
BONUS_FOR_TRIGRAM = 16
PENALTY_FOR_DIGIT = -10


def fitness(state):
    fitness = 0
    state_as_string = "".join(map(chr, state))
    tmp = chunks(cipher_file, KEYLEN)
    plain = "".join(map(lambda x: xor_strings(x, state_as_string), tmp))
    for p in plain:
        if p in "qwertyuiopasdfghjklzxcvbnm":
            fitness = fitness+BONUS_FOR_LOWERCASE
        if p in "0123456789":
            fitness = fitness+PENALTY_FOR_DIGIT
        p = ord(p)
        if (p >= 0x20 and p <= 0x7E) or p == 0xA or p == 0xD:
            fitness = fitness+BONUS_FOR_PRINTABLE

    for digram in digrams:
        fitness = fitness + plain.count(digram)*BONUS_FOR_DIGRAM

    for trigram in trigrams:
        fitness = fitness + plain.count(trigram)*BONUS_FOR_TRIGRAM

    fitness = fitness + plain.count(" ")*BONUS_FOR_SPACE

    return fitness


class TestProblem(Annealer):

    def __init__(self, state):
        super(TestProblem, self).__init__(state)  # important!

    def move(self):
        # set random byte in state to random byte
        i = random.randint(0, len(self.state) - 1)
        self.state[i] = random.randint(0, 255)

    def energy(self):
        return -fitness(self.state)


# cipher_file=read_file("cipher1.txt")
cipher = b'H;<Z\x1a*=G \x14$\x06fT:Ab\x016\x17\x00\',[y@%\rfP$P/\r+C\x04o&Sy>,H6T![6\x01+PW ;\x15=F,\x1f/[/\x15 \t)V\x19,,\x15<U.\x00fZ<]\'\x1ae=\x18:=\x1by`%\x015\x15+Z7\x04!\x17\x15*iA1Qm\x07$_-V6\x1beC\x1f*$F<X;\r5\x19h? \x1d1\x17\x1e;iV8Zm\t*F\'\x150\r)V\x03*iA6\x14.\x07*Z:Fb\t+SWE&A1Q?H%Z%E-\x1b,C\x1e \'T5\x149\r%]&\\3\x1d DYE\x10Z,\x14 \t?\x15&Z6H7R\x16# O<\x14$\x1cj\x15*@6H<X\x02=iW+U$\x06f?!Fb\n0D\x0eo>Z+_$\x06!\x15*P*\x01+SW;!PyG.\r(P;\x156\x07eD\x12*"\x15S[8\x1cfF1X/\r1E\x0eo>]<Zm\x11)@hY-\x07.\x17\x16;iTyD,\x01(A![%Fe=#\',G<\x14,\x1a#\x15;P4\r7V\x1bo;P8G"\x065\x15.Z0H1_\x1e<g\x15\r\\(HLS!G1\x1ce^\x04o=]8@m\x1f#\x12:Pb\x00$E\x13b>\\+Q)H2ZhY-\x07.\x17\x11 ;\x15S]9Ffz=Gb\t+T\x1e*\'AyU#\x0b#F<Z0\x1beZ\x166i[6@m\x00\'C-\x15*\t!\x17}.i[8Y(H Z:\x15+\x1ci\x17\x15:=\x15-\\(\x11f^&P5H1_\x16;iA1Q$\x1af?\'B,H\'X\x13&,FyC(\x1a#\x15*T1\x01&V\x1b#0\x15*M \x05#A:\\!\t)\x1bW.:\x15SC(\x1a#\x15<]-\x1b \x17\x18)iE6@(\x062\\)Yb\x187R\x13.=Z+Gm\x074\x158G\'\x11k\x17}\x1b!P+Q+\x074Pd\x156\x00,DW,(X<\x14$\x06f])[&\x11e@\x1f*=]<Fmb%]\'Z1\x01+PW.iX8@(DfV)A!\x00,Y\x10o-\\7Z(\x1afZ:\x15H\t3X\x1e+ [>\x14/\r/[/\x15-\x06eC\x1f*iX<Z8H)ShTb\x1b+V\x05# [>\x18mb.@&R0\x11eG\x16,"\x156Rm\x1f)Y>P1H*EW-,T+Glb\x12T#Pb\te[\x18 "\x158@m\x11)@:\x15$\t&RW&\'\x15-\\(H+\\:G-\x1ae=\x16!-\x150Y,\x0f/[-\x15#H)^\x19*iF-F,\x01!]<\x15&\x072YW;!Py> \x01"Q$PlH\x1cX\x02h%YyG(\rfW\'A*H6^\x13*:\x156Rm\x11)@:\x15H\x0e$T\x12o(G<\x14=\x1a#A<Lb\x1b<Z\x1a*=G0W,\x04h\x15\x1c]+\x1be^\x04oC^7[:\x06fT;\x15 \x01)V\x03*;T5\x14>\x11+X-A0\x11eV\x19+i\\-\x13>HLB P0\reU\x18;!\x15*])\r5\x15-\\6\x00 EW< Q<\x14"\x0efA \\1HOS\x1e9 Q0Z*H*\\&Pb\t5G\x12.;\x154[?\rfZ:\x15.\r6DW;!PyG,\x05#\x1bBf-H-R\x05*i\\*\x149\x00#\x15.Y#\x0f\x7f\x17}\'.T4Q60vG\x17\\wE$h\x02\x1czS\x0c\x05f\\(QlS\x17&+N(\x0cxE\x11\x07?\x15L'
# print(len(cipher))
cipher_file = str(cipher, encoding="utf-8")

init_state = [0 for i in range(KEYLEN)]

test = TestProblem(init_state)
# increase if you're not satisfied with result:
test.steps = 200000
# since our state is just a list, slice is the fastest way to copy
test.copy_strategy = "slice"
#test.copy_strategy = "deepcopy"
state, e = test.anneal()

possible_key = "".join(map(chr, state))
print("state/key:")
# hexdump.hexdump(possible_key)

print("decrypted:")
tmp = chunks(cipher_file, KEYLEN)
plain = "".join(map(lambda x: xor_strings(x, possible_key), tmp))
print(plain)
# hexdump.hexdump(plain)

#include <stdio.h>
int main(){
    char map[26] = {'o','z','d','y','c','i','x','e','n','k','s','q','b','r','t','a','h','w','f','m','l','v','j','p','g','u'};
    char temp;
    while ((temp = getchar())!=0){
        if (temp>='a'&&temp<='z') printf("%c", map[temp-'a']);
        else printf("%c",temp);
    }
    return 0;
}

import struct
import binascii
from Crypto.Util.number import bytes_to_long

img = open("galaxy.png", "rb").read()

for i in range(0xFFFF):
    stream = img[12:20] + struct.pack('>i', i) + img[24:29]
    crc = binascii.crc32(stream)
    if crc == bytes_to_long(img[29:33]):
        print(hex(i))

import os
temp = '101001000000010010000010000010001000100\n\
010000000101000010000001100000001100000100\n\
01000001000001000010000001000110010010\n\
000010100000100000001000000010000100000011010\n\
00100000010101000001001000100000001000000010\n\
00100000010100001001000000100000100001000000100000\n\
00001000001000011001010000000110000010000\n\
000100000001000000010100100000010100001001000000\n\
000001000010001000010010000001000001000010000010000\n\
100100011001000001011000001000000\n\
100001000010000100010000000100'
words = ''
for i in temp:
    if i == '1':
        words = words+'\t'
    if i == '0':
        words = words+' '
    if i == '\n':
        words = words+'\n'
with open('b.txt', 'w') as f:
    f.write(words)