ohmyfun ohmyfun

이 방법은 int형이 한계치에 도달하면 동작이 안됨... 오버플로우... #include #include using namespace std; int main() { int tmp = 0; int max = 0; int cnt = 0; int result = 1; int N = 0; cin >> N; for (int i = 1; i N; int t = 0; int f = 0; for (int i = 2; i f) { cout

#include #include using namespace std; int main() { int N = 0; int tmp = 0; int j=0; cin >> N; vector arr(N + 1); for (int i = 0; i

#include #include using namespace std; int main() { int max = 0; int cnt = 1; int N=0; cin >> N; vector arr(N); vector arr2(N); for (int i = 0; i > arr[i]; arr2[i] = 1; } for (int i = 1; i < N; i++) { for (int j = 0; j < i; j++) { if (arr[i]

#include #include using namespace std; int main() { int max = 0; int cnt = 1; int N=0; cin >> N; vector arr(N); vector arr2(N); for (int i = 0; i > arr[i]; arr2[i] = 1; } for (int i = 0; i < N; i++) { for (int j = 0; j < N;j++) { if (arr[i] < arr[j]) { arr2[i]++; } } } for (int i = 0; i < N; i++) { cout

#include #include #include using namespace std; int main() { int sum = 0; int N = 0; cin >> N; vector arr(N); vector arr2(N-1); for (int i = 0; i > arr[i]; } for (int i = 0; i < N-1; i++) { arr2[i] = i+1; } for (int i = 0; i < N-1; i++) { for (int j = 0; j < N-1; j++) { if (arr2[j] == abs(arr[i + 1] - arr[i])) { arr2[j] = 0; } } } for (int i = 0; i < N-1; i++) { sum = arr2[i] + ..

#include #include using namespace std; int main() { int N; int max = 0; int temp = 0; int sum = 1; cin >> N; vector arr(N); for (int i = 0; i > arr[i]; } for (int i = 0; i < N-1; i++) { if (arr[i] max) { max = temp; } } else { sum = 1; } } cout

#include #include using namespace std; int main() { int N = 0; int K = 0; int Z = 0; int sum = 0; int max= -2147483648; cin >> N; cin >> K; Z = (N - K) + 1; vector arr(N); vector arr2(Z); for (int i = 0; i > arr[i]; } for (int i = 0; i ..

#include #include using namespace std; int main() { int wincheck = 0; int arrsum = 0; int arr2sum = 0; vector arr(10); vector arr2(10); for (int i = 0; i > arr[j]; } else if (i == 1) { cin >> arr2[j]; } } } for (int i = 0; i arr2[i]) { arrsum = arrsum + 3; wincheck = i; } else if (arr[i] < arr2[i]) { arr2sum ..