알고리즘

#include #include using namespace std; bool find_prime_num(int n){ if(n == 1) return false; for(int i = 2; i < n; ++i){ if(n % i == 0) return false; } return true; } int main(){ int M, N; scanf("%d %d", &M, &N); int sum = 0, min = 0; bool check = false; for(int i = M; i

#include #include #include using namespace std; int main(){ int T; scanf("%d", &T); for(int i = 0; i > x >> y; long long move, max = 0; while(max * max

#include #include #include using namespace std; int main(){ int T; scanf("%d", &T); for(int i = 0; i > x >> y; long long move, max = 0; while(max * max

#include #include #include #include using namespace std; int dp[31][31]; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); for (int i = 1; i t; while (t--) { int n, m; cin >> n >> m; cout