brute force
-
시험 감독백준알고리즘 2019. 7. 17. 21:53
#include #include using namespace std; int n; int a[1000000]; int b, c; long long check(long long a, long long c) { long long result = 0; if (a != 0) { if (a % c == 0) { result += (a / c); } else result += (a / c) + 1; return result; } else return 0; } int main() { scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%d", &a[i]); } scanf("%d %d", &b, &c); long long result = n; for (int i = 0; i..
-
연구소백준알고리즘 2019. 7. 17. 02:23
#include #include #include #include #include #include using namespace std; int n, m; int a[9][9]; vector v1; vector v2; vector v3; int d[9][9]; bool f[9][9]; int dx[] = {0,0,-1,1}; int dy[] = {1,-1,0,0}; void re(){ for(int i = 0; i < v1.size(); i++){ int x = v1[i].first; int y = v1[i].second; d[x][y] = 0; } for(int i = 0; i < v2.size(); i++){ int x = v2[i].first; int y = v2[i].second; d[x][y] = ..