본문 바로가기

분류 전체보기263

(BOJ) 5427 풀이 5427 #include #define X first #define Y second using namespace std; int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; int fire[1002][1002], ar[1002][1002], visited[1002][1002]; int main(void) { ios::sync_with_stdio(0); cin.tie(0); int T, w, h, flag = 0; cin >> T; while (T--) { flag = 0; cin >> w >> h; for (int i = 0; i < h; i++) { fill(fire[i], fire[i] + w, -1); fill(visited[i], visited[i] + w.. 2022. 2. 8.
(BOJ) 1697 풀이 1697 #include using namespace std; int visited[100002]; int main(void){ ios::sync_with_stdio(0);cin.tie(0); queue Q; fill(visited,visited+100002,-1); int N,K; cin >> N >> K; Q.push(N); visited[N]=0; while(visited[K]==-1){ int cur=Q.front(); Q.pop(); for(int nxt:{cur-1,cur+1, cur*2}){ if(nxt100000 || visited[nxt]!=-1)continue; Q.push(nxt); visited[nxt]=visited[cur]+1; } } cout 2022. 2. 7.
(CTF) dice CTF flagle writeup https://blog.snwo.fun/posts/(ctf)-dice-ctf-2022-writeup/ hi 2022. 2. 7.
(dreamhack.io) (PWN) unibitmap writeup 보호되어 있는 글 입니다. 2022. 2. 5.

티스토리툴바