눈팅하는 게임개발자 블로그

#include #include #include #include #include using namespace std; int frequent(int b[], int N) { int max = 0; vector v; for (int i = 4000; i >= 0; i--) { if (max < b[i]) { max = b[i]; v.clear(); v.push_back(i*(-1)); } else if (max == b[i]) { v.push_back(i*(-1)); } } for (int i = 4001; i < 8001; i++) { if (max < b[i]) { max = b[i]; v.clear(); v.push_back(i - 4000); } else if (max == b[i]) { v.pus..

#include #include using namespace std; int main() { int N; cin >> N; int count[10001]; memset(&count[0], 0, 10001*4); int num; for (int i = 0; i > num; count[num]++; } for (int i = 0; i < 10001; i++) { for (int j = 0; j < count[i]; j++) { cout

#include using namespace std; int calc(int M, int N, int x, int y); int main() { int cnt = -1; int cnt_temp = 0; int T; cin >> T; int M, N, x, y; for (int i = 0; i > M >> N >> x >> y; cout