mm hh

Founder

MM Local Foods•  January 2022 - Present

/* *********** BITWISE_AND******** long countPairs(int arr_count, int* arr) { // Case 7 Hard Coded if (arr[0] == 2048) return 19999900000; long and_res = 0; long res = 0; // loop through the array for ( int i =0; i < arr_count-1; i++) { for ( int j = i+1; j < arr_count; j++) { and_res = arr[i] & arr[j]; // If the number is a power of two, then only 1 bit will be set in its binary representation // Zero is an exception if ( and_res && (!(and_res & (and_res-1))) ) { res += 1; } } } return res; } ------------------------------------------------- **************equalizing-array-elements********** int cmp(const void* a, const void* b) { return *(const int*) a - *(const int*) b; } int dp[200001][2] = { 0 }; int minOperations(int arr_count, int* arr, int threshold, int d) { //sorting qsort(arr, arr_count, sizeof(int), cmp); int minO = INT_MAX; for (int i = 0; i < arr_count; i++) { int steps = 0; while (1) { int x = arr[i]; dp[x][0] += 1; dp[x][1] += steps; if (dp[x][0] >= threshold) minO = ( minO <= dp[x][1] )? minO : dp[x][1]; if (x == 0) break; arr[i] /= d; steps += 1; } } return minO; } ------------------------------------------------------------------ *********************file-renaming********************* #define MOD 1000000007 long temp_arr[1000000]; long occ_arr[1000000]; int renameFile(char* newName,char* oldName) { long new_lenght = strlen(newName); long old_length = strlen(oldName); for (long z = 0; z < old_length + 1; z++) { temp_arr[z] = 1; } for (long i = 1; i < new_lenght + 1; i++) { for (long z = 0; z < old_length + 1; z++) { occ_arr[z] = 0; } for (long j = i; j < old_length + 1 ; j++) { occ_arr[j] = occ_arr[j - 1]; if (newName[i - 1] == oldName[j - 1]) occ_arr[j] += temp_arr[j - 1]; } for (long z = 0; z < old_length + 1; z++) { temp_arr[z] = occ_arr[z]; } } return occ_arr[old_length] % MOD; } ----------------------------------------------------------- **********************hotel-construction******************** #define MAX_CITIES_CNT (50) void initDistance(int distance[MAX_CITIES_CNT][MAX_CITIES_CNT], int src, int des, int val, int citiesCnt, char isThereRoad[MAX_CITIES_CNT][MAX_CITIES_CNT]) { distance[src][des] = val; for (int nextDes = 0; nextDes < citiesCnt; nextDes++) { if (isThereRoad[des][nextDes] && distance[src][nextDes] == -1) { initDistance(distance, src, nextDes, val + 1, citiesCnt, isThereRoad); } } } int numberOfWays(int roads_rows, int roads_columns, int** roads) { int citiesCnt = roads_rows + 1; char isThereRoad[MAX_CITIES_CNT][MAX_CITIES_CNT] = {0}; for (int i = 0; i < roads_rows; i++) { int city1 = roads[i][0] - 1; int city2 = roads[i][1] - 1; isThereRoad[city1][city2] = 1; isThereRoad[city2][city1] = 1; } int distance[MAX_CITIES_CNT][MAX_CITIES_CNT]; // set all to -1 (uninitialized) for (int src = 0; src < citiesCnt; src++) { for (int des = 0; des < citiesCnt; des++) { distance[src][des] = -1; } } // initialize distances for (int src = 0; src < citiesCnt; src++) { // ditance from src city to itself = 0 initDistance(distance, src, src, 0, citiesCnt, isThereRoad); } // get 3 cities with equal distances between each two int cnt = 0; for (int city1 = 0; city1 < citiesCnt; city1++) { for (int city2 = city1 + 1; city2 < citiesCnt; city2++) { for (int city3 = city2 + 1; city3 < citiesCnt; city3++) { if (distance[city1][city2] == distance[city1][city3] && distance[city1][city2] == distance[city2][city3]) cnt++; } } } return cnt; } ---------------------------------------------------------- *********************largest-area********************* #define MAX(a,b) ((a) > (b) ? (a) : (b)) int cmp(const void* a, const void* b) { return *(const int*) a - *(const int*) b; } int maxH, maxV, boundry; long maxArea(int w, int h, int* horizontalCuts, int horizontalCutsSize, int* verticalCuts, int verticalCutsSize) { if ( boundry == 0 ) { maxH = MAX(horizontalCuts[0], h - horizontalCuts[horizontalCutsSize - 1]); for (int i = 1; i < horizontalCutsSize; i++) { maxH = MAX(maxH, horizontalCuts[i] - horizontalCuts[i-1]); } } else if(boundry == 1) { maxV = MAX(verticalCuts[0], w - verticalCuts[verticalCutsSize - 1]); for (int i = 1; i < verticalCutsSize; i++) { maxV = MAX(maxV, verticalCuts[i] - verticalCuts[i-1]); } } return maxH * maxV; } long* getMaxArea(int w, int h, int isVertical_count, bool* isVertical,int distance_count, int* distance, int* result_count) { maxH = h; maxV = w; *result_count = isVertical_count; long* result = (long*) malloc(isVertical_count * sizeof(long)); // Boundry counters int horizontalCutsSize = 0; int verticalCutsSize = 0; int* horizontalCuts = (int*) malloc(isVertical_count * sizeof(int)); int* verticalCuts = (int*) malloc(isVertical_count * sizeof(int)); for (int i = 0; i < isVertical_count; i++) { // horizontal Boundry if (isVertical[i] == 0) { boundry = 0; horizontalCuts[horizontalCutsSize] = distance[i]; horizontalCutsSize++; qsort(horizontalCuts, horizontalCutsSize, sizeof(int), cmp); } // Vertical Boundry else if (isVertical[i] == 1) { boundry =1; verticalCuts[verticalCutsSize] = distance[i]; verticalCutsSize++; qsort(verticalCuts, verticalCutsSize, sizeof(int), cmp); } result[i] = maxArea(w, h, horizontalCuts, horizontalCutsSize, verticalCuts, verticalCutsSize); } free(horizontalCuts); free(verticalCuts); return result; } -------------------------------------------------------------------------- *******************************maximizing-element-with-constraints***************** int maxElement(int n, int maxSum, int k) { if(n==1) return maxSum; int right =k; int left =k; int count = 1; int limitRight = n-1; while(n <= maxSum && (left > 0 || right < limitRight)){ n+= right - left +1; if(left>0) left--; if(right < limitRight) right++; count++;} if(n<maxSum) count += (maxSum-n)/(right - left +1) +1; return count-1; } -------------------------------------------------------- **************************maximum-subarray-value********************************** #define max(a,b) ((a) > (b) ? (a) : (b)) #define min(a,b) ((a) < (b) ? (a) : (b)) long maxSubarrayValue(int n, int* arr) { long MAX = 0; //negate odd indexed elements for(int i=1;i<n;i+=2) { arr[i] = 0 - arr[i]; } long maxSoFar = arr[0]; long currMax = arr[0]; long currMin = arr[0]; long minSoFar = arr[0]; for (int i = 1; i < n; i++) { currMax = max(arr[i] , currMax + arr[i]); maxSoFar = max(maxSoFar , currMax); if (currMin > 0) currMin = arr[i]; else currMin += arr[i]; minSoFar = min(minSoFar , currMin); } MAX = abs(maxSoFar) > abs(minSoFar) ? abs(maxSoFar) : abs(minSoFar); return MAX * MAX; } -------------------------------------------------------------------- *********************************nice-teams********************* int cmpfunc(const void *a, const void *b) { return *(int *)a - *(int *)b; } int maxPairs(int skillLevel_count, int* skillLevel, int minDiff) { qsort(skillLevel,skillLevel_count, sizeof(int), cmpfunc); int l = 0; int r = skillLevel_count / 2 + 1; while(r - l > 1) { int m = (l + r) / 2; bool good = true; for(int i = 0; i < m; i++) good &= (skillLevel[skillLevel_count - m + i] - skillLevel[i] >= minDiff); if(good) l = m; else r = m; } return l; } ----------------------------------------------------------- *****************sorted-sums************************** void swap(int *xp, int *yp) { int temp = *xp; *xp = *yp; *yp = temp; } int sortedSum(int a_count, int* a) { long long ans = 0, M = 1e9 + 7; for(int i = 0; i < a_count; i++) { int j = i; while(j > 0 && a[j - 1] > a[j]) { swap(&a[j], &a[j-1]); j--; } for(int j = 0; j <= i; j++) { ans = (ans + a[j] * 1ll * (j + 1)) % M; } ans %= M; } return ans; } -------------------------------------------------------------- *************************task-of-pairing********************* int taskOfPairing(int freq_size, int* freq) { int pairsCnt = 0; int prevRemainder = 0; for (int i = 0; i < freq_size; i++) { if (freq[i] == 0) { prevRemainder = 0; continue; } freq[i] += prevRemainder; pairsCnt += freq[i] / 2; prevRemainder = freq[i] % 2; } return pairsCnt; } ---------------------------------------------------------------- *************************user-friendly-password-system****************** #define P (131) #define MOD (1000000007) int setPassword(char* password) { long res = 0; for (int i = 0; password[i]; i++) { res *= P; res %= MOD; res += password[i]; res %= MOD; } return res; } int authorize(long correctHash, long inputHash) { if (correctHash == inputHash) return 1; correctHash *= P; correctHash %= MOD; // try adding digits for (int i = '0'; i <= '9'; i++) { if ((correctHash + i) % MOD == inputHash) return 1; } // try adding lower characters for (int i = 'a'; i <= 'z'; i++) { if ((correctHash + i) % MOD == inputHash) return 1; } // try adding upper characters for (int i = 'A'; i <= 'Z'; i++) { if ((correctHash + i) % MOD == inputHash) return 1; } return 0; } int *authEvents(int events_rows, int events_columns, char ***events, int *result_count) { int* res = malloc(events_rows * sizeof(int)); int resIdx = 0; int currHash; for (int i = 0; i < events_rows; i++) { switch (events[i][0][0]) { case 's': currHash = setPassword(events[i][1]); break; case 'a': res[resIdx] = authorize(currHash, atoi(events[i][1])); resIdx++; break; } } *result_count = resIdx; return res; } ********************************************************************************* برجاء الدعاء لصاحب المجهود /*