목록문제풀이 (27)
Deep Learning study
#include using namespace std; #define max(a,b) a>b ? a : b int n,L[21],J[21]; int dp[21][101]; int go(int a, int b){ if(dp[a][b]) return dp[a][b]; if(a>=n) return 0; dp[a][b] = b-L[a]>0 ? max(go(a+1,b-L[a])+J[a],go(a+1,b)) : max(dp[a][b],go(a+1,b)); return dp[a][b]; } int main(){ cin >> n; for(int i=0 ;i> L[i]; for(int i=0 ;i> J[i]; cout
#include using namespace std; #define inf 1000000000 long long int d[101][10]; long long int dlclstn(int n,int i){ if(n> n; for(int i=1 ; i
#include #include using namespace std; long long int m,M; bool check[5000001]; int main(){ cin >> m >> M; int cnt=0; for(long long int i=2 ; i*i
#include #include #include #include using namespace std; #define ll long long #define INF 1e9+7 int main(){ ios_base::sync_with_stdio(0); int t; cin >> t; while(t--){ int lim,n; ll ans=INF; vector a[4],s[2]; cin >> lim >> n; for(int i=0 ;i
#include #include #include using namespace std; char a[1000001]; bool erased[1000001]; char b[100]; int main() { scanf("%s",a); scanf("%s",b); int n = strlen(a); int m = strlen(b); if (m == 1) { for (int i=0; i
#include #include #include using namespace std; int main(){ ios_base::sync_with_stdio(0); int n; priority_queue q; cin >> n; for(int i=0,x ;i> x; if(!x){ cout
#include #include #include using namespace std; char a[1000001]; bool erased[1000001]; char b[100]; int main() { scanf("%s",a); scanf("%s",b); int n = strlen(a); int m = strlen(b); if (m == 1) { for (int i=0; i
#include #include int max(int a){ int ret=0,i=0; while(a){ if((a%10) == 5) ret += 6*(int)pow(10,i); else ret+=(a%10) * (int)pow(10,i); a/=10,i++; } return ret; } int min(int a){ int ret=0,i=0; while(a){ if((a%10) == 6) ret += 5*(int)pow(10,i); else ret+=(a%10) * (int)pow(10,i); a/=10,i++; } return ret; } int main(){ int a,b; scanf("%d %d",&a,&b); printf("%d %d\n",min(a)+min(b),max(a)+max(b)); re..