//https://www.acmicpc.net/problem/2864 #include using namespace std; int main(){ int A,B; cin >> A>>B; int sum_min=0; int sum_max=0; int x=A; int y=B; int ten=1; //minimize while(x>0 || y>0) { int k=x%10; int l=y%10; if(k==6) k=5; if(l==6) l=5; sum_min += (k+l)*ten; ten*=10; x/=10; y/=10; }ten=1; //maximize while(A>0 || B>0) { int k=A%10; int l=B%10; if(k==5) k=6; if(l==5) l=6; sum_max += (k+l)*..
#include using namespace std;int map[16][16];bool visit[16][16];bool chk;int dx[4]={0,0,1,-1};int dy[4]={1,-1,0,0}; void dfs(int y, int x){ for(int i=0; i tc; for(int i=0; i> input; for(int j=0; j
//https://www.acmicpc.net/problem/1495 #include #include #include using namespace std; bool dp[101][1001]; int V[101]; int main(){ int N, S, M; cin >> N >> S >> M; int x, y; for(int i=1; i> V[i]; dp[0][S]=1; for(int i=1; i
//https://www.acmicpc.net/problem/1495 #include #include #include using namespace std; int max(int a, int b) {return a> b? a:b;} int V[101]; int main(){ int N, S, M; cin >> N >> S >> M; int x, y; for(int i=1; i> V[i]; queue q; q.push(S); for(int i=1; i