# 武科WUST-CTF2020“Tiki组 ”

## 题目状态：

OPEN - 正在试图解这道题
CLOSED - 这道题还没有打开
SOLVED - 解决了！鼓掌撒花！

# Web：

X-Forwarded-For: 127.0.0.1

post方式提交wust=1314

## checkin | SOLVED |

input的max去掉。输入可以获得出题人的博客地址。
https://www.52hertz.tech/

var typed = new Typed(".subtitle", { strings: ‘Rome was not built in
a day.,wctf2020{can_y0u_can_a_can_a,Never put off till tomorrow what
you can do today’.split(","), startDelay: 300, typeSpeed: 100,
loop: true, backSpeed: 50 });

# Misc：

wctf2020{y0

## 爬 | SOLVED |

wctf2020{[email protected]_pdf_and_y0u_can_use_phot0sh0p}

## 签到 | SOLVED |

wctf2020{y0u_kn0w_th3_rule5}

## Alison likes jojo | SOLVED |

outguess -k "killerqueen" -r jljy.jpg hidden.txt


wctf2020{pretty_girl_alison_likes_jojo}

## Space Club | SOLVED |

nodejs 脚本 var str  = "011101110110001101110100011001100011001000110000001100100011000001111011011010000011001101110010011001010101111100110001011100110101111101111001001100000111010101110010010111110110011001101100010000000110011101011111011100110011000101111000010111110111001100110001011110000101111101110011001100010111100001111101"; for(let i = 0;i<=str.length;i+=8){
process.stdout.write(binaryToStr(str.substr(i,8))); } function binaryToStr(str){
var result = [];
var list = str.split(" ");
for(var i=0;i<list.length;i++){
var item = list[i];
var asciiCode = parseInt(item,2);
var charValue = String.fromCharCode(asciiCode);
result.push(charValue);
}
return result.join(""); }

#! /usr/bin/env python
#-*- coding: utf-8 -*-
#读取文本内容 ftxt = open("./space.txt")#待解密文本 line = ftxt.readline() string = [] while line:
# 6个空格7长度，计0
if (len(line) == 7):
string.append(0)
# 12个空格13长度，计1
if (len(line) == 13):
string.append(1)
#print(string) str3=[1] for i in range(int(len(string) / 8)):
#print(string[8 * i:8 * i + 8])
str2 = string[8 * i:8 * i + 8]
asc = 0
if (str2[0:1] == str3):
asc = asc + 128
if (str2[1:2] == str3):
asc = asc + 64
if (str2[2:3] == str3):
asc = asc + 32
if (str2[3:4] == str3):
asc = asc + 16
if (str2[4:5] == str3):
asc = asc + 8
if (str2[5:6] == str3):
asc = asc + 4
if (str2[6:7] == str3):
asc = asc + 2
if (str2[7:8] == str3):
asc = asc + 1
print(chr(asc),end=‘‘)

wctf2020{[email protected]_s1x_s1x_s1x}

## 三人行 | SOLVED |

wctf2020{We1cOme_t0_wCtF2o20_aNd_eNj0y_1t}

## girlfriend | SOLVED |

wctf2020{youaremygirlfriends}

# Crypto：

## 佛说：只能四天 | OPEN |

RLJDQTOVPTQ6O6duws5CD6IB5B52CC57okCaUUC3SO4OSOWG3LynarAVGRZSJRAEYEZ_ooe_doyouknowfence

## 大数运算 | SOLVED |

flag等于 wctf2020{Part1-Part2-Part3-Part4} 每一Part都为数的十六进制形式（不需要0x)，并用
‘-’ 连接。 Part1 = 2020×2019×2018× … ×3×2×1 的前8位: 十进制数前8位:
38609695，十六进制0x24d231f Part2 = 520^1314 + 2333^666 的前8位: 十进制数前8位:
67358675，0x403cfd3 Part3 = 宇宙终极问题的答案 x, y, z绝对值和的前8位:

42 =(-80538738812075974)³+ 80435758145817515³+ 12602123297335631³

520
1314=683280 十进制数683280,0xa6d10 python代码：

#! /usr/bin/env python
# -*- coding: utf-8 -*-
import gmpy2
part1=1
for i in range(1,2021):
part1=part1*i
p1=str(part1)[0:8]
print(p1)
part1=hex(int(p1))
print(part1)
part2=pow(520,1314)+pow(2333,666)
p2=str(part2)[0:8]
part2=hex(int(p2))
print(part2)
part3 = 80538738812075974 + 80435758145817515 + 12602123297335631
p3=str(part3)[0:8]
part3=hex(int(p3))
print(part3)
part4=(pow(22,2)+36)*1314
part4=hex(part4)
p4=str(part4)
print(p4)
print(‘wctf2020{‘+str(part1)+‘-‘+str(part2)+‘-‘+str(part3)+‘-‘+str(p4)+‘}‘)

wctf2020{24d231f-403cfd3-108db5e-a6d10}

(0)
(0)