Deep Learning study

#include using namespace std; #define FOR(i,a,b) for(int i=a ; i=0 && a=0 && b > N >> M; FOR(i,0,N) FOR(j,0,M) cin >> A[i][j]; FOR(i,0,N) FOR(j,0,M){ dfs(i,j,1,A[i][j]); ex(i,j); } 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; 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

#include using namespace std; #define pb push_back int N,M; int X[4] = {0,0,1,-1}; int Y[4] = {1,-1,0,0}; int dfs(int x, int y,int arr[][11]){ int ret = 1; for(int i = 0; i = 1 && nextX 0 && nextY > N >> M; for(int i = 1 ; i arr[i][j]; if( arr[i][j] == 2) posV.pb(make_pair(i,j)); else if(arr[i][j] == 0) posZ.pb(make_pair(i,j)); else one..

#include #include using namespace std; int n,k; int r[1001]; bool visited[1001]; int dfs(int i,int dep){//깊이 탐색. 연결고리 탐색. if(!visited[r[i]]){ visited[r[i]] = true; return dfs(r[i],dep+1); } else return dep; } int dfs2(int i,int dep){//깊이 탐색. 연결고리 탐색. int k=0; if(!visited[r[i]]){ visited[r[i]] = true; k = dfs(r[i],dep+1); visited[r[i]] = false; } else return dep; return k; } int ks(int i,int sum)..