bdfgdfg

#include #include #include using namespace std; vector data2; vector serch; vector check; void BinarySerch() { int mid; int left = 0; int right = data2.size() - 1; static int idx = 0; int value = serch[idx]; while (left value) { right = mid - 1; } else { left = mid + 1; } } idx++; } int main(void) { int N,a; cin >> N; data2.reserve(N + 1); serch.reserve(N + 1); check.resize(N + 1); for (int i = ..

#include #include using namespace std; int solution(vector a, vector b) { int answer = 0; int len = a.size(); for(int i = 0; i < len; ++i) { answer += (a[i] * b[i]); } return answer; }

#include #include using namespace std; int solution(vector absolutes, vector signs) { int answer = 0; int len = absolutes.size(); for(int i = 0; i < len; ++i) { if(signs[i]) answer += absolutes[i]; else answer += (absolutes[i] * -1); } return answer; }

#include #include using namespace std; int solution(int left, int right) { int answer = 0; vector count; count.resize(1001); for(int i = left; i