fatalite

m 크기의 연속된 부분 배열의 합이 d인 개수를 찾는 것이다. 이거 근데, 나는 연속되었다는 걸 인지 못하고 불연속된 것도 포함해서 구하다가 시간을 많이 까먹었다. 재귀랑 DP가 섞인 코드였는데 나중에 한 번 완성 시켜봐야겠다.. int cnt = 0; int birthday(vector s, int d, int m) { for(int i = 0; i < s.size(); i = i + 1){ int sum = 0; for(int k = 0; k < m; k++){ sum = sum + s[k+i]; } if(sum == d){ cnt++; cout

규칙 발견, Constrait 발견 Solution Code string twoArrays(int k, vector A, vector B) { std::sort(A.begin(),A.end()); std::sort(B.begin(),B.end()); reverse(B.begin(),B.end()); for(int i = 0; i < A.size(); i++){ if(A[i] + B[i] < k) return "NO"; } return "YES"; }

Letters in some of the SOS messages are altered by cosmic radiation during transmission. Given the signal received by Earth as a string, s, determine how many letters of the SOS message have been changed by radiation. Example The original message was SOSSOS. Two of the message's characters were changed in transit. Function Description Complete the marsExploration function in the editor below. ma..

An avid hiker keeps meticulous records of their hikes. During the last hike that took exactly steps, for every step it was noted if it was an uphill, , or a downhill, step. Hikes always start and end at sea level, and each step up or down represents a unit change in altitude. We define the following terms: A mountain is a sequence of consecutive steps above sea level, starting with a step up fro..

/* * Complete the 'diagonalDifference' function below. * * The function is expected to return an INTEGER. * The function accepts 2D_INTEGER_ARRAY arr as parameter. */ int diagonalDifference(vector arr) { int LeftToRight = 0; int RightToLeft = 0; for(int i = 0; i < arr.size(); i++){ LeftToRight += arr[i][i]; //cout

Function Description Complete the flippingBits function in the editor below. flippingBits has the following parameter(s): int n: an integer Solution Code long flippingBits(long n) { //32bit bool a[32]; for(int i = 31; i >= 0; i--){ if(pow(2,i)