//https://www.acmicpc.net/problem/2644 #include #include #include using namespace std;int parent[101]; // parent[i] :: i의 부모int chon[101];int n; void bfs(int start){ queue q; q.push(start); chon[start]=0; while(!q.empty()) { int now=q.front(); q.pop(); for(int i=1; i> n >> a >> b >> m; for(int i=0; i> x >> y; parent[y]=x;//y의 부모가 x } memset(chon, -1, sizeof(chon)); bfs(a); cout
//https://www.acmicpc.net/problem/10026 #include #include using namespace std;char picture[100][100];bool visit[100][100];bool visitbi[100][100];int n, cnt;int dy[4]={1,-1,0,0};int dx[4]={0,0,-1,1}; void dfs(int y, int x, char c){ visit[y][x]=1; for(int i=0; i=0 && ny=0 && nx> n; //input for(int i=0; i> picture[i]; for(int i=0; i
//https://www.acmicpc.net/problem/2309 #include #include using namespace std;int h[10]; int main(){ int sum=0; bool chk=0; for(int i=1; i> h[i]; sum+=h[i]; } sort(h+1,h+10); bool index[10]={0,}; for(int i=1; i
//https://www.acmicpc.net/problem/1065 #include using namespace std; int main(){ int n,cnt; cin >> n; cnt=n; for(int i=1; i0) { if(now%10-(now%100)/10 != diff) {cnt--; break;} now/=10; } /********* while(now>0) { if(now%10-(now%100)/10 != diff) {cnt--; break;} now/=10; if(now
