建議如果看不懂算法的話可以拿起紙筆操作，因為我有點懶不想要畫圖。
感恩彬智讚嘆彬智
建議如果看不懂算法的話可以拿起紙筆操作，因為我有點懶不想要畫圖。
建議如果看不懂算法的話可以拿起紙筆操作，因為我有點懶不想要畫圖。
建議如果看不懂算法的話可以拿起紙筆操作，因為我有點懶不想要畫圖。
SHA-1 is dead - 100 point
SHA-1 is dead
http://sha1.pwn.seccon.jp/
Upload two files satisfy following conditions:
file1 != file2
SHA1(file1) == SHA1(file2)
SHA256(file1) <> SHA256(file2)
2017KiB < sizeof(file1) < 2018KiB
2017KiB < sizeof(file2) < 2018KiB
* 1KiB = 1024 bytes
J...
No I didn’t backup problems…
problem 3
Given an integer (not necessary a decimal number) with n digits, we want to remove $m (\le n)$ digits from this number such that the resulting number is as large as possibe. Design an $O(n)$ time algorithm to solve it.
problem 4
Given a 2-dimensional nn array (or matrix) of 0/1...
整理一下何錦文教授高等演算法課上的作業。
作業題目好像都不太會變的樣子？
所以如果你有參考我整理的題目的話，留個言讓我知道我做功德了♥
有什麼問題都可以在下面留言討論，私訊我也可以。
Written in English.
Ask to input 400 chars, then take it as a 20*20 arry
Next the binary run a function to verify the array
If the verification were success, it would give you the SHA256 hash of you input, which is flag
Let’s take a look at the function I mentioned
There are 150 while loops in this function
Before loops, it initialize lots of variables
Those loops are all similar to each:
要求輸入 400 個字元
然後會把輸入當作20*20的陣列丟入function做驗證
有 150 個迴圈
在進入迴圈會把需要的 local 變數設好
流程如下