d4
-
6731. 홍익이의 오델로 게임SWexpertAcademy 2019. 8. 13. 22:14
#include #include #include using namespace std; int tc; int n; char map[1000][1000]; int ans; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>tc; for(int t = 1; t>n; for(int i = 0; i >map[i][j]; if(map[i][j] == 'B'){ r[i]++; c[j]++; } } } for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ int x = r[i] + c[j]; if(ma..
-
1486. 장훈이의 높은 선반SWexpertAcademy 2019. 7. 15. 04:11
#include #include #include using namespace std; int t; int n, b; int g[10000000]; int a[20]; void dfs(int i, int k, int j,int t,vector&result,int temp) { if (temp >= 0) { result.push_back(temp); return; } if (i == t){ if (temp >= 0) { result.push_back(temp); } else return; } else { dfs(i + 1,k + a[i + 1],j,t,result, k - j); dfs(i + 1,k,j,t,result, k - j); } } int main() { cin >> t; for (int alp ..