본문 바로가기

Algorithm32

(BOJ) 1629 풀이 #include using namespace std; typedef long long ll; ll pow(ll a,ll x,ll m){ if(x==1) return a%m; ll var=pow(a,x/2,m); var=var*var%m; if(x%2==0) return var; return var*a%m; } int main(void){ ios::sync_with_stdio(0);cin.tie(0); ll A,B,C; cin >> A >> B >> C; cout 2022. 2. 16.
(BOJ) 1600 풀이 1600 #include using namespace std; typedef struct _XYZ{ int x; int y; int z; }xyz; int dx[]={-1,0,1,0,-1,-2,-2,-1,1,2, 2, 1}; int dy[]={0,1,0,-1,-2,-1, 1, 2,2,1,-1,-2}; int board[202][202]; int visited[202][202][32]; int main(void){ ios::sync_with_stdio(0);cin.tie(0); int K,W,H,flag=0; xyz v; queue Q; cin >> K; cin >> W >> H; for(int i=1;i board[i][j]; } } Q.push({1,1,K}); while(!Q.empty()){ v=Q.. 2022. 2. 14.
(BOJ) 2206 풀이 2206 #include using namespace std; typedef struct _XYW { int x; int y; int w; } xyw; char ar[1001][1001]; int visited[2][1001][1001]; int dx[] = {-1, 0, 1, 0}; int dy[] = {0, 1, 0, -1}; int main(void) { ios::sync_with_stdio(0); cin.tie(0); int N, M; cin >> N >> M; queue Q; xyw v; for (int i = 1; i ar[i][j]; } } Q.push({1, 1, 1}); visited[1][1][1] = 1; visited[0][1][1] = 1; while (!Q.empty()) { v.. 2022. 2. 10.
(BOJ) 5014 풀이 5014 #include #define MAX 1000001 using namespace std; int visited[MAX + 1]; int main(void) { ios::sync_with_stdio(0); cin.tie(0); int F, S, G, U, D, flag = 0; cin >> F >> S >> G >> U >> D; queue Q; fill(visited, visited + F+1, -1); Q.push(S); visited[S] = 0; while (!Q.empty()&&flag==0) { int v = Q.front(); Q.pop(); for (auto m : {U,-D}) { if(v==G){ cout 2022. 2. 9.

티스토리툴바