Deep Learning study

#include using namespace std; #define FOR(i,a,b) for(int i = a; i=b; i--) #define x first #define y second int board[16][16],pos[3],tmp[16][16],N,M,D,ANS; int dist(int a, int b, int c, int d){ return abs(a-c) + abs(b-d); } void update(){ FOR_(i,N-1,1) FOR(j,0,M) board[i][j] = board[i-1][j]; FOR(j,0,M) board[0][j] = 0; } int attack(){ int min[3] = {99,99,99}; vector co(3); FOR(i,0,3) co[i].x = 99..

#include using namespace std; int main(){ ios_base::sync_with_stdio(false); int t; cin >> t; for(int T = 1 ; T > m >> c >> i; char C[100010] = {0,}, I[5000] = {0,}; cin >> C >> I; int point = 0, input_p = 0,cnt = 0; char mem[100010] = {0,}; int brack[100010] = {0,},min_loop_idx = 0, max_loop_idx = 0; stack bracket; for(int i=0 ;i< c ; i++){ if(C[i] == '[') bracket.push(i); else if(C[i]==']'){ br..

#include using namespace std; int A[50][50],N,M,K,ANS = 1e9; vector order; struct{ int r,c,s; }rot[6]; void go(int r, int c, int s){ if(!s) return; int sr = r - s, sc = c - s, er = r + s, ec = c + s; int x = A[sr][sc], y = A[sr][ec], z = A[er][ec], w = A[er][sc]; for(int i = sr ; i sc ; i--) if(i==sc+1) A[sr..

#include using namespace std; int N, pop[12],visit[12],divi[12],ANS = 1e9; vector G; void dfs(int cur, int division){ visit[cur] = 1; for(int next : G[cur]) if(!visit[next] && divi[next] == division) dfs(next, division); } void update(){ int div0 = -1, div1 = -1; for(int i=0 ;i pop[i]; for(int i=0; i> k; for(;k>0;k--){ int p; cin >> p; G[i].push_back(p-1); } } div(0); cout

#include using namespace std; #define pb push_back bool bracket[30]; vector oper; vector num; vector new_num; vector new_oper; int ANS = -1e9; int cal(int a , int b , char oper){ if(oper == '+') return a + b; else if(oper == '-') return a - b; else return a * b; } int fin_cal(int N){ new_num.clear(); new_oper.clear(); for(int i=0 ;i> N; cin >> arr; for(int i=0 ;i

#include using namespace std; #define pb push_back int game[55][10]; int where[4]; int score,inni = 1; int main(){ cin.tie(NULL); ios_base::sync_with_stdio(false); int N; cin >> N; for(int i=1 ;i game[i][j]; vector t(8); for(int i=2 ; i

#include using namespace std; int paper[11][11]; int cnt[6] = {0,}; int ans = 1e9; void update(int size, int x, int y, int num){ for(int i = x ; i 10) return false; for(int i = x ; i

#include using namespace std; int N; int arr[17][17]; //1 : 가로 ,2 : 세로 , 3 : 대각선 bool chk(int x, int y){ if(x N ; for(int i=1 ; i arr[i][j]; cout