Scratcherへの挑戦状 in Summer!

737368696E6F•Shared July 12, 2026

0

12 views

Love/View Ratio: 0.00%

Instructions

#!/usr/bin/env python3 # -*- coding: utf-8 -*- CODE_CHAR = [ "A","B","C","D","E","F","G","H","I","J","K","L","M", "N","O","P","Q","R","S","T","U","V","W","X","Y","Z", "0","1","2","3","4","5","6","7","8","9", "!","\"","#","$","%","&","'","(",")","*","+", ",","-","/",":",";","<","=",">","?","@", "[","\\","]","^","_","`","{","|","}","~","." ] MOD = 100 def decode_hash(hash_string): if len(hash_string) != 256: raise ValueError("Hash must be exactly 256 digits.") # 分割 final = [ int(hash_string[i:i+2]) for i in range(0,256,2) ] original = [0]*128 # 1文字は維持 original[0] = final[0] # new[i]=(new[i-1]+old[i]+5)%100 # ↓ # old[i]=(new[i]-new[i-1]-5)%100 for i in range(1,128): original[i] = (final[i]-final[i-1]-5) % MOD return original def recover_message(numbers): for length in range(1,129): ok = True for i in range(128): if numbers[i] != numbers[i % length]: ok = False break if not ok: continue if any(x >= len(CODE_CHAR) for x in numbers[:length]): continue text = "".join(CODE_CHAR[x] for x in numbers[:length]) return text return None def main(): hash_string = input("Hash : ").strip() nums = decode_hash(hash_string) print("Recovered numbers:") print(nums) text = recover_message(nums) if text is None: print("\nNo repeating message found.") else: print("\nRecovered text:") print(text) if __name__ == "__main__": main()

Project Details

Project ID1353003809

Search IndexUnindexed / NFEChecking...

CreatedJuly 12, 2026

Last ModifiedJuly 12, 2026

SharedJuly 12, 2026

CommentsAllowed

Remix Information

Direct Remix SourceView Parent

Original ProjectView Root

Notes & Credits

結果0SWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSWWKVSW LJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ.A/GJ. NZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1X7IZ1 から周期を探しておそらく解答はKWWSV,/a.jg,7x1ziだと思う

Unindexed / NFE