//https://www.acmicpc.net/problem/2146 #include #include using namespace std;bool map[100][100];int visited[100][100];int visited2[100][100];int N, cnt;int min1=10001; int dy[4]={0,0,1,-1};int dx[4]={1,-1,0,0}; void dfs(int y, int x, int land){ visited[y][x]=land; for(int i=0; i=0 && ny=0 && nx
//https://www.acmicpc.net/problem/1037 #include #include using namespace std;int num[51]; int main(){ int A,N; cin >> N; int a,b,bin; if(N==1){ cin >> a; cout num[i]; } sort(num,num+N); cout
//https://www.acmicpc.net/problem/7562#include #include using namespace std;int map[300][300];int sy,sx,dy,dx, I; int diry[8]={2,2,1,1,-1,-1,-2,-2};int dirx[8]={-1,1,-2,2,-2,2,-1,1}; void bfs(int starty, int startx){ queue q; q.push(starty*1000+startx); map[starty][startx]=1; bool chk=1; while(chk && !q.empty()){ int nowy=q.front()/1000; int nowx=q.front()%1000; q.pop(); for(int i=0; i=0 && next..
//https://www.acmicpc.net/problem/2293 #include using namespace std;int dp[10001];int value[101]; int main(){ int n, k; cin >> n >> k; for(int i=0; i> value[i]; dp[0]=1; for(int i=0; i=5이므로 계산에 포함 x
