5teven1in

choco install -y adobereader
choco install -y flashplayerplugin
choco install -y googlechrome
choco install -y flashplayeractivex
choco install -y chocolatey-core.extension
choco install -y jre8
choco install -y firefox
choco install -y 7zip.install
choco install -y kb2919442
choco install -y kb2919355

5teven1in

import json
import httpx
from bs4 import BeautifulSoup as BS
from urllib.parse import quote, unquote

search_url = "https://shopee.tw/search?keyword={}"
search_items_url = "https://shopee.tw/api/v2/search_items/?by=relevancy&keyword={}&limit=50&newest=0&order=desc&page_type=search&version=2"


def get_items(keyword):

5teven1in

import sys
import requests
from bs4 import BeautifulSoup as BS

url_format = "https://chocolatey.org/packages?sortOrder=package-download-count&page={}&prerelease=False&moderatorQueue=False&moderationStatus=all-statuses"

def get_list(idx):
    res = requests.get(url_format.format(idx))
    soup = BS(res.text, 'html.parser')
    lis = soup.find_all('div', class_="package-list-align")

5teven1in

Easy Crack

Concept

• basic reverse
• static analysis
• string comparison

Solution

5teven1in

Easy Keygen

Concept

• basic reverse
• static analysis
• XOR encryption

Solution

5teven1in

Easy Unpack

Concept

• basic reverse

Solution

After the binary decrypt and extract the real code, it will jump to the OEP. We can find the jump instrcution at the end of the binary.

5teven1in

11011001 [255pts]

0100111001101111001000000110100001101001011011100111010000100000011010000110010101110010011001010010110000100000011101110110100001100001011101000010000001100001011100100110010100100000011110010110111101110101001000000110010101111000011100000110010101100011011101000110100101101110011001110010000001100110011011110111001000111111

11011001-878450f7a8f95309ce756975ce912376d829c1d7caeed7f80da72ee3bc67e5ca

Author: david942j
30 Teams solved.

5teven1in

#include <bits/stdc++.h>

#define MAXN 505

using namespace std;

int N;
char maze[MAXN][MAXN];
int ans[MAXN][MAXN];
bool vis[MAXN][MAXN];

5teven1in

#include <bits/stdc++.h>

using namespace std;

void print(const string &s, int start, int end, char dir)
{
    if (dir == '+')
    {
        for (int i = start + 1; i < end; i++)
            cout << s[i];