๋ฐฑ์ค - ๋์ 0(๊ทธ๋ฆฌ๋ ์๊ณ ๋ฆฌ์ฆ), ํ์ด์ฌ & C
https://www.acmicpc.net/problem/11047 11047๋ฒ: ๋์ 0 ์ฒซ์งธ ์ค์ N๊ณผ K๊ฐ ์ฃผ์ด์ง๋ค. (1 ≤ N ≤ 10, 1 ≤ K ≤ 100,000,000) ๋์งธ ์ค๋ถํฐ N๊ฐ์ ์ค์ ๋์ ์ ๊ฐ์น Ai๊ฐ ์ค๋ฆ์ฐจ์์ผ๋ก ์ฃผ์ด์ง๋ค. (1 ≤ Ai ≤ 1,000,000, A1 = 1, i ≥ 2์ธ ๊ฒฝ์ฐ์ Ai๋ Ai-1์ ๋ฐฐ์) www.acmicpc.net [ํ์ด์ฌ] N, K = map(int, input().split()) coins = [] count = 0 for _ in range(N): coins.append( int( input() ) ) idx = len( coins ) - 1 while K > 0: if ( K - coins[idx] ) >= 0 : count += 1 K..
2021. 12. 5.
๊ฒ์ ํดํน - ํผ์นด์ธ ๋ฐฐ๊ตฌ ํต(C)
#include #include int make_envincible(HANDLE hProcess) { // ์ ์ ๋ชฐ๋นต LPVOID base = (LPVOID)0x00403C4A; BYTE buffer[4] = {0xFF, 0x46, 0x40, 0x90}; // 1P: 0xFF, 0x46, 0x3C, 0x90 | 2P: 0xFF, 0x46, 0x40, 0x90 BOOL is_successed = WriteProcessMemory(hProcess, base, buffer, 4, NULL); // ์๋๋ฆฌ์ค ๊ฒ์ base = (LPVOID)0x00403C27; BYTE buffer2[2] = {0x74, 0x76}; is_successed = WriteProcessMemory(hProcess, base, buf..
2021. 12. 3.