id
stringlengths 22
24
| content
stringlengths 46
1.22k
|
|---|---|
g-transeval-cpp_data_1
|
int GreatestCommonDivisor ( int a , int b ) { if ( a == 0 || b == 0 ) { return a + b ; } if ( a == b ) { return a ; } if ( a > b ) { return GreatestCommonDivisor ( a % b , b ) ; } else { return GreatestCommonDivisor ( a , b % a ) ; } }
|
g-transeval-cpp_data_2
|
int LargestDivisor ( int n ) { for ( int i = 2 ; i <= n ; i ++ ) { if ( n % i == 0 ) { return n / i ; } } return 1 ; }
|
g-transeval-cpp_data_3
|
bool IsPrime ( int n ) { if ( n < 2 ) { return false ; } for ( int k = 2 ; k < n ; k ++ ) { if ( n % k == 0 ) { return false ; } } return true ; }
|
g-transeval-cpp_data_4
|
int FizzBuzz ( int n ) { int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( i % 11 == 0 || i % 13 == 0 ) { int q = i ; while ( q > 0 ) { if ( q % 10 == 7 ) { count += 1 ; } q /= 10 ; } } } return count ; }
|
g-transeval-cpp_data_5
|
int PrimeFib ( int n ) { int f0 = 0 ; int f1 = 1 ; while ( n > 0 ) { int p = f0 + f1 ; bool is_prime = p >= 2 ; for ( int i = 2 ; i < p ; i ++ ) { if ( p % i == 0 ) { is_prime = false ; break ; } } if ( is_prime ) { n -= 1 ; } f0 = f1 ; f1 = p ; } return f1 ; }
|
g-transeval-cpp_data_6
|
double TriangleArea ( double a , double h ) { return a * h / 2 ; }
|
g-transeval-cpp_data_7
|
int ModP ( int n , int p ) { int ret = 1 ; for ( int i = 0 ; i < n ; i ++ ) { ret = ( ret * 2 ) % p ; } return ret ; }
|
g-transeval-cpp_data_8
|
int Add ( int x , int y ) { return x + y ; }
|
g-transeval-cpp_data_9
|
int Fib ( int n ) { if ( n == 0 ) { return 0 ; } if ( n == 1 ) { return 1 ; } return Fib ( n - 1 ) + Fib ( n - 2 ) ; }
|
g-transeval-cpp_data_10
|
int LargestPrimeFactor ( int n ) { for ( int i = 2 ; i < n ; i ++ ) { while ( n % i == 0 && n > i ) { n /= i ; } } return n ; }
|
g-transeval-cpp_data_11
|
int SumToN ( int n ) { int result = 0 ; for ( int i = 1 ; i <= n ; i ++ ) { result += i ; } return result ; }
|
g-transeval-cpp_data_12
|
int Fibfib ( int n ) { if ( n == 0 ) { return 0 ; } if ( n == 1 ) { return 0 ; } if ( n == 2 ) { return 1 ; } return Fibfib ( n - 1 ) + Fibfib ( n - 2 ) + Fibfib ( n - 3 ) ; }
|
g-transeval-cpp_data_13
|
bool IsMultiplyPrime ( int a ) { int num = 0 ; for ( int i = 2 ; i <= a ; i ++ ) { while ( a % i == 0 && a >= i ) { a /= i ; num += 1 ; } } return num == 3 ; }
|
g-transeval-cpp_data_14
|
bool IsSimplePower ( int x , int n ) { if ( n == 1 ) { return x == 1 ; } int power = 1 ; while ( power < x ) { power *= n ; } return power == x ; }
|
g-transeval-cpp_data_15
|
int ChooseNum ( int x , int y ) { if ( x > y ) { return -1 ; } if ( y % 2 == 0 ) { return y ; } if ( x == y ) { return -1 ; } return y - 1 ; }
|
g-transeval-cpp_data_16
|
bool IsEqualToSumEven ( int n ) { return n % 2 == 0 && n >= 8 ; }
|
g-transeval-cpp_data_17
|
int SpecialFactorial ( int n ) { int fact = 1 ; int special_fact = 1 ; for ( int i = 1 ; i <= n ; i ++ ) { fact *= i ; special_fact *= fact ; } return special_fact ; }
|
g-transeval-cpp_data_18
|
int XOrY ( int n , int x , int y ) { bool is_prime = n >= 2 ; for ( int i = 2 ; i < n ; i ++ ) { if ( n % i == 0 ) { is_prime = false ; break ; } } if ( is_prime ) { return x ; } return y ; }
|
g-transeval-cpp_data_19
|
bool RightAngleTriangle ( int a , int b , int c ) { return a * a == b * b + c * c || b * b == a * a + c * c || c * c == a * a + b * b ; }
|
g-transeval-cpp_data_20
|
int FastPow ( int n , int k ) { if ( k == 0 ) { return 1 ; } int temp = FastPow ( n , k / 2 ) ; if ( k % 2 == 0 ) { return temp * temp ; } else { return n * temp * temp ; } }
|
g-transeval-cpp_data_21
|
bool IsPalin ( string s ) { int l = s . length ( ) / 2 ; for ( int i = 0 ; i < l ; i ++ ) { if ( s [ i ] != s [ s . length ( ) - i - 1 ] ) { return false ; } } return true ; }
|
g-transeval-cpp_data_22
|
int FindSum ( int n ) { int ans = 0 , temp = 0 ; for ( int i = 1 ; i <= n && temp < n ; i ++ ) { temp = i - 1 ; int num = 1 ; while ( temp < n ) { if ( temp + i <= n ) { ans += i * num ; } else { ans += ( n - temp ) * num ; } temp += i ; num += 1 ; } } return ans ; }
|
g-transeval-cpp_data_23
|
int GetNextGap ( int gap ) { gap = gap * 10 / 13 ; if ( gap < 1 ) { return 1 ; } return gap ; }
|
g-transeval-cpp_data_24
|
int CountNonDecreasing ( int n ) { int k = 10 ; int count = 1 ; for ( int i = 1 ; i <= n ; i ++ ) { count *= k + i - 1 ; count /= i ; } return count ; }
|
g-transeval-cpp_data_25
|
int Power ( int x , int y ) { if ( y == 0 ) { return 1 ; } else if ( y % 2 == 0 ) { return Power ( x , y / 2 ) * Power ( x , y / 2 ) ; } else { return x * Power ( x , y / 2 ) * Power ( x , y / 2 ) ; } }
|
g-transeval-cpp_data_26
|
double Power ( double x , int y ) { if ( y == 0 ) { return 1 ; } double temp = Power ( x , y / 2 ) ; if ( y % 2 == 0 ) { return temp * temp ; } else { if ( y > 0 ) { return x * temp * temp ; } else { return temp * temp / x ; } } }
|
g-transeval-cpp_data_27
|
int Multiply ( int x , int y ) { if ( y == 0 ) { return 0 ; } else if ( y > 0 ) { return x + Multiply ( x , y - 1 ) ; } else { return - Multiply ( x , - y ) ; } }
|
g-transeval-cpp_data_28
|
int Smallest ( int x , int y , int z ) { if ( ! ( y / x ) ) { return ! ( y / z ) ? y : z ; } return ! ( x / z ) ? x : z ; }
|
g-transeval-cpp_data_29
|
bool IsPowerOfFour ( int n ) { if ( n == 0 ) { return false ; } while ( n != 1 ) { if ( n % 4 != 0 ) { return false ; } n = n / 4 ; } return true ; }
|
g-transeval-cpp_data_30
|
int ModInverse ( int a , int m ) { int m0 = m ; int x0 = 0 , x1 = 1 ; if ( m == 1 ) { return 0 ; } while ( a > 1 ) { int q = a / m ; int t = m ; m = a % m ; a = t ; t = x0 ; x0 = x1 - q * x0 ; x1 = t ; } if ( x1 < 0 ) { x1 += m0 ; } return x1 ; }
|
g-transeval-cpp_data_31
|
int CntRotations ( string s , int n ) { string s2 = s + s ; vector < int > pre ( 2 * n ) ; for ( int i = 0 ; i < 2 * n ; i ++ ) { if ( i != 0 ) { pre [ i ] += pre [ i - 1 ] ; } if ( s2 [ i ] == 'a' || s2 [ i ] == 'e' || s2 [ i ] == 'i' || s2 [ i ] == 'o' || s2 [ i ] == 'u' ) { pre [ i ] ++ ; } } int ans = 0 ; for ( int i = n - 1 ; i < 2 * n - 1 ; i ++ ) { int r = i , l = i - n ; int x1 = pre [ r ] ; if ( l >= 0 ) { x1 -= pre [ l ] ; } r = i - n / 2 ; int left = pre [ r ] ; if ( l >= 0 ) { left -= pre [ l ] ; } int right = x1 - left ; if ( left > right ) { ans ++ ; } } return ans ; }
|
g-transeval-cpp_data_32
|
int BinomialCoeff ( int n , int k ) { int res = 1 ; if ( k > n - k ) { k = n - k ; } for ( int i = 0 ; i < k ; ++ i ) { res *= n - i ; res /= i + 1 ; } return res ; }
|
g-transeval-cpp_data_33
|
bool IsPrefix ( string temp , string s ) { if ( temp . length ( ) < s . length ( ) ) { return false ; } else { for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( s [ i ] != temp [ i ] ) { return false ; } } return true ; } }
|
g-transeval-cpp_data_34
|
string LexicographicallySmallestString ( string s , int n ) { int last_ze = -1 ; string ans ; for ( int i = n - 1 ; i >= 0 ; i -- ) { if ( s [ i ] == '0' ) { last_ze = i ; break ; } } for ( int i = 0 ; i < n ; i ++ ) { if ( i <= last_ze && s [ i ] == '0' ) { ans += s [ i ] ; } else if ( i > last_ze ) { ans += s [ i ] ; } } return ans ; }
|
g-transeval-cpp_data_35
|
int CalculateMax ( int n , int m , int k ) { int ans = -1 ; int low = 0 , high = m ; while ( low <= high ) { int mid = ( low + high ) / 2 ; int val = 0 ; int l = k - 1 ; int r = n - k ; val += mid ; if ( mid >= l ) { val += l * ( 2 * mid - l - 1 ) / 2 ; } else { val += mid * ( mid - 1 ) / 2 + ( l - mid ) ; } if ( mid >= r ) { val += r * ( 2 * mid - r - 1 ) / 2 ; } else { val += mid * ( mid - 1 ) / 2 + ( r - mid ) ; } if ( val <= m ) { ans = max ( ans , mid ) ; low = mid + 1 ; } else { high = mid - 1 ; } } return ans ; }
|
g-transeval-cpp_data_36
|
int FindLength ( string s , char i , char j ) { char required = i ; int length = 0 ; for ( char curr : s ) { if ( curr == required ) { length += 1 ; if ( required == i ) { required = j ; } else { required = i ; } } } return length ; }
|
g-transeval-cpp_data_37
|
bool CheckReverse ( int left_sum , int right_sum ) { int rev = 0 ; int temp = right_sum ; while ( temp != 0 ) { rev = rev * 10 + temp % 10 ; temp /= 10 ; } if ( rev == left_sum ) { return true ; } return false ; }
|
g-transeval-cpp_data_38
|
bool IsComposite ( int n ) { if ( n <= 1 ) { return false ; } if ( n <= 3 ) { return false ; } if ( n % 2 == 0 || n % 3 == 0 ) { return true ; } for ( int i = 5 ; i * i <= n ; i = i + 6 ) { if ( n % i == 0 || n % ( i + 2 ) == 0 ) { return true ; } } return false ; }
|
g-transeval-cpp_data_39
|
int MinDeletion ( string s ) { int n = s . length ( ) ; int first_idx1 = -1 ; int last_idx0 = -1 ; for ( int i = 0 ; i < n ; i ++ ) { if ( s [ i ] == '1' ) { first_idx1 = i ; break ; } } for ( int i = n - 1 ; i >= 0 ; i -- ) { if ( s [ i ] == '0' ) { last_idx0 = i ; break ; } } if ( first_idx1 == -1 || last_idx0 == -1 ) { return 0 ; } int count1 = 0 , count0 = 0 ; for ( int i = 0 ; i < last_idx0 ; i ++ ) { if ( s [ i ] == '1' ) { count1 ++ ; } } for ( int i = first_idx1 + 1 ; i < n ; i ++ ) { if ( s [ i ] == '1' ) { count0 ++ ; } } return min ( count0 , count1 ) ; }
|
g-transeval-cpp_data_40
|
int MinSteps ( string s , int n ) { int smaller , cost = 0 ; vector < int > f ( 26 ) ; for ( int i = 0 ; i < n ; i ++ ) { int curr_ele = s [ i ] - 'a' ; smaller = 0 ; for ( int j = 0 ; j <= curr_ele ; j ++ ) { if ( f [ j ] != 0 ) { smaller += f [ j ] ; } } if ( smaller == 0 ) { cost += i + 1 ; } else { cost += i - smaller + 1 ; } f [ s [ i ] - 'a' ] ++ ; } return cost ; }
|
g-transeval-cpp_data_41
|
int NumberOfWays ( int n ) { int count = 0 ; for ( int a = 1 ; a < n ; a ++ ) { for ( int b = 1 ; b < n ; b ++ ) { int c = n - ( a + b ) ; if ( a + b > c && a + c > b && b + c > a ) { count ++ ; } } } return count ; }
|
g-transeval-cpp_data_42
|
int SlopeOfNum ( string num , int n ) { int slope = 0 ; for ( int i = 1 ; i < n - 1 ; i ++ ) { if ( num [ i ] > num [ i - 1 ] && num [ i ] > num [ i + 1 ] ) { slope ++ ; } else if ( num [ i ] < num [ i - 1 ] && num [ i ] < num [ i + 1 ] ) { slope ++ ; } } return slope ; }
|
g-transeval-cpp_data_43
|
int MiddleOfThree ( int a , int b , int c ) { int x = a - b ; int y = b - c ; int z = a - c ; if ( x * y > 0 ) { return b ; } else if ( x * z > 0 ) { return c ; } else { return a ; } }
|
g-transeval-cpp_data_44
|
int CountMaxSetBits ( int left , int right ) { while ( ( left | ( left + 1 ) ) <= right ) { left |= left + 1 ; } return left ; }
|
g-transeval-cpp_data_45
|
int FindS ( int s ) { int l = 1 , r = ( s / 2 ) + 1 ; while ( l <= r ) { int mid = ( l + r ) / 2 ; int sum = mid * ( mid + 1 ) / 2 ; if ( sum == s ) { return mid ; } else if ( sum > s ) { r = mid - 1 ; } else { l = mid + 1 ; } } return -1 ; }
|
g-transeval-cpp_data_46
|
bool Check ( string s ) { int min = INT_MAX ; int max = INT_MIN ; int sum = 0 ; for ( int i = 0 ; i < s . size ( ) ; i ++ ) { int ascii = s [ i ] ; if ( ascii < 96 || ascii > 122 ) { return false ; } sum += ascii ; if ( min > ascii ) { min = ascii ; } if ( max < ascii ) { max = ascii ; } } min -= 1 ; int eSum = max * ( max + 1 ) / 2 - min * ( min + 1 ) / 2 ; return sum == eSum ; }
|
g-transeval-cpp_data_47
|
int MinimumPossibleProduct ( int k ) { int res = 1 ; int r = ( 1 << k ) - 1 ; for ( int i = 0 ; i < k ; i ++ ) { res *= r - 1 ; } res *= r ; return res ; }
|
g-transeval-cpp_data_48
|
int FindInGrid ( int i , int j ) { if ( i == j ) { return i * i - ( i - 1 ) ; } else if ( i > j ) { if ( i % 2 == 0 ) { return i * i - ( j - 1 ) ; } else { return ( i - 1 ) * ( i - 1 ) + 1 + ( j - 1 ) ; } } else { if ( j % 2 == 0 ) { return ( j - 1 ) * ( j - 1 ) + 1 + ( i - 1 ) ; } else { return j * j - ( i - 1 ) ; } } }
|
g-transeval-cpp_data_49
|
int FindMinOperationsReqEmpStr ( string s ) { int cnt_one = 0 ; int cnt_zero = 0 ; int n = s . length ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( s [ i ] == '0' ) { if ( cnt_one ) { cnt_one -- ; } cnt_zero ++ ; } else { if ( cnt_zero ) { cnt_zero -- ; } cnt_one ++ ; } } return cnt_one + cnt_zero ; }
|
g-transeval-cpp_data_50
|
bool IsReachable ( int x1 , int y1 , int x2 , int y2 ) { while ( x2 > x1 && y2 > y1 ) { if ( x2 > y2 ) { x2 %= y2 ; } else { y2 %= x2 ; } } if ( x2 == x1 ) { return y2 - y1 >= 0 && ( y2 - y1 ) % x1 == 0 ; } else if ( y2 == y1 ) { return x2 - x1 >= 0 && ( x2 - x1 ) % y1 == 0 ; } else { return false ; } }
|
g-transeval-cpp_data_51
|
int FindMaxSoln ( int n , int x , int y ) { int ans = INT_MIN ; for ( int k = 0 ; k <= n ; k ++ ) { if ( k % x == y ) { ans = max ( ans , k ) ; } } return ans >= 0 && ans <= n ? ans : -1 ; }
|
g-transeval-cpp_data_52
|
int NumberOfPairs ( int n ) { int count = 0 ; int i = 1 , j = n - 1 ; while ( i < j ) { if ( i + j == n ) { count ++ ; } i ++ ; j -- ; } return count ; }
|
g-transeval-cpp_data_53
|
int MinChanges ( string s , int n ) { int count = 0 , zeros = 0 , ones = 0 ; if ( s [ 0 ] != '1' ) { count ++ ; ones ++ ; } for ( int i = 1 ; i < n ; i ++ ) { if ( s [ i ] == '0' ) { zeros ++ ; } else { ones ++ ; } if ( zeros > ones ) { zeros -- ; ones ++ ; count ++ ; } } return count ; }
|
g-transeval-cpp_data_54
|
int KVisibleFromLeft ( int n , int k ) { if ( n == k ) { return 1 ; } if ( k == 1 ) { int ans = 1 ; for ( int i = 1 ; i < n ; i ++ ) { ans *= i ; } return ans ; } return KVisibleFromLeft ( n - 1 , k - 1 ) + ( n - 1 ) * KVisibleFromLeft ( n - 1 , k ) ; }
|
g-transeval-cpp_data_55
|
double Find ( int n , int sum ) { if ( sum > 6 * n || sum < n ) { return 0 ; } if ( n == 1 ) { if ( sum >= 1 && sum <= 6 ) { return 1.0 / 6 ; } else { return 0 ; } } double s = 0 ; for ( int i = 1 ; i <= 6 ; i ++ ) { s += Find ( n - 1 , sum - i ) / 6 ; } return s ; }
|
g-transeval-cpp_data_56
|
int BinCoff ( int n , int r ) { int val = 1 ; if ( r > n - r ) { r = n - r ; } for ( int i = 0 ; i < r ; i ++ ) { val *= n - i ; val /= i + 1 ; } return val ; }
|
g-transeval-cpp_data_57
|
int GetMask ( int val ) { int mask = 0 ; if ( val == 0 ) { return 1 ; } while ( val ) { int d = val % 10 ; mask |= 1 << d ; val /= 10 ; } return mask ; }
|
g-transeval-cpp_data_58
|
int WaysToKAdjacentSetBits ( int n , int k , int current_index , int adjacent_set_bits , int last_bit ) { if ( current_index == n ) { if ( adjacent_set_bits == k ) { return 1 ; } return 0 ; } int no_of_ways = 0 ; if ( last_bit == 1 ) { no_of_ways += WaysToKAdjacentSetBits ( n , k , current_index + 1 , adjacent_set_bits + 1 , 1 ) ; no_of_ways += WaysToKAdjacentSetBits ( n , k , current_index + 1 , adjacent_set_bits , 0 ) ; } else if ( ! last_bit ) { no_of_ways += WaysToKAdjacentSetBits ( n , k , current_index + 1 , adjacent_set_bits , 1 ) ; no_of_ways += WaysToKAdjacentSetBits ( n , k , current_index + 1 , adjacent_set_bits , 0 ) ; } return no_of_ways ; }
|
g-transeval-cpp_data_59
|
int CheckFunc ( int i , int j , string st ) { if ( st [ i ] == '(' && st [ j ] == ')' ) { return 1 ; } if ( st [ i ] == '(' && st [ j ] == '?' ) { return 1 ; } if ( st [ i ] == '?' && st [ j ] == ')' ) { return 1 ; } if ( st [ i ] == '[' && st [ j ] == ']' ) { return 1 ; } if ( st [ i ] == '[' && st [ j ] == '?' ) { return 1 ; } if ( st [ i ] == '?' && st [ j ] == ']' ) { return 1 ; } if ( st [ i ] == '{' && st [ j ] == '}' ) { return 1 ; } if ( st [ i ] == '{' && st [ j ] == '?' ) { return 1 ; } if ( st [ i ] == '?' && st [ j ] == '}' ) { return 1 ; } return 0 ; }
|
g-transeval-cpp_data_60
|
int FindGolomb ( int n ) { if ( n == 1 ) { return 1 ; } return 1 + FindGolomb ( n - FindGolomb ( FindGolomb ( n - 1 ) ) ) ; }
|
g-transeval-cpp_data_61
|
bool AllOnes ( string s , int n ) { int co = 0 ; for ( int i = 0 ; i < s . size ( ) ; i ++ ) { co += s [ i ] == '1' ? 1 : 0 ; } return co == n ; }
|
g-transeval-cpp_data_62
|
int Pad ( int n ) { int p_prev_prev = 1 , p_prev = 1 , p_curr = 1 , p_next = 1 ; for ( int i = 3 ; i <= n ; i ++ ) { p_next = p_prev_prev + p_prev ; p_prev_prev = p_prev ; p_prev = p_curr ; p_curr = p_next ; } return p_next ; }
|
g-transeval-cpp_data_63
|
int OddLengthPalindrome ( int k ) { int palin = k ; k = k / 10 ; while ( k > 0 ) { int rev = k % 10 ; palin = palin * 10 + rev ; k = k / 10 ; } return palin ; }
|
g-transeval-cpp_data_64
|
string ChangeString ( string s0 ) { string s = s0 ; int n = s . length ( ) ; if ( s [ 0 ] == '?' ) { s [ 0 ] = 'a' ; if ( s [ 0 ] == s [ 1 ] ) { s [ 0 ] ++ ; } } for ( int i = 1 ; i < n - 1 ; i ++ ) { if ( s [ i ] == '?' ) { s [ i ] = 'a' ; if ( s [ i ] == s [ i - 1 ] ) { s [ i ] ++ ; } if ( s [ i ] == s [ i + 1 ] ) { s [ i ] ++ ; } if ( s [ i ] == s [ i - 1 ] ) { s [ i ] ++ ; } } } if ( s [ n - 1 ] == '?' ) { s [ n - 1 ] = 'a' ; if ( s [ n - 1 ] == s [ n - 2 ] ) { s [ n - 1 ] ++ ; } } return s ; }
|
g-transeval-cpp_data_65
|
int TotalHammingDistance ( int n ) { int i = 1 , sum = 0 ; while ( n / i > 0 ) { sum = sum + n / i ; i = i * 2 ; } return sum ; }
|
g-transeval-cpp_data_66
|
int CheckBitonic ( string s ) { int i = 1 ; for ( ; i < s . length ( ) ; i ++ ) { if ( s [ i ] > s [ i - 1 ] ) { continue ; } if ( s [ i ] <= s [ i - 1 ] ) { break ; } } if ( i == s . length ( ) - 1 ) { return 1 ; } int j = i + 1 ; for ( ; j < s . length ( ) ; j ++ ) { if ( s [ j ] < s [ j - 1 ] ) { continue ; } if ( s [ j ] >= s [ j - 1 ] ) { break ; } } i = j ; if ( i != s . length ( ) ) { return 0 ; } return 1 ; }
|
g-transeval-cpp_data_67
|
bool EndsWith ( string str , string pat ) { int pat_len = pat . length ( ) ; int str_len = str . length ( ) ; if ( pat_len > str_len ) { return false ; } pat_len -- ; str_len -- ; while ( pat_len >= 0 ) { if ( pat [ pat_len ] != str [ str_len ] ) { return false ; } pat_len -- ; str_len -- ; } return true ; }
|
g-transeval-cpp_data_68
|
int GetSum ( int n , int d ) { if ( n < d ) { return 0 ; } while ( n % 10 != d ) { n -- ; } int k = n / 10 ; return ( k + 1 ) * d + ( k * 10 + 10 * k * k ) / 2 ; }
|
g-transeval-cpp_data_69
|
int BalancedStringBySwapping ( string s ) { int unbalanced_pair = 0 ; for ( int i = 0 ; i < s . length ( ) ; ++ i ) { if ( unbalanced_pair > 0 && s [ i ] == ']' ) { -- unbalanced_pair ; } else if ( s [ i ] == '[' ) { ++ unbalanced_pair ; } } return ( unbalanced_pair + 1 ) / 2 ; }
|
g-transeval-cpp_data_70
|
int ComputeHash ( string s ) { int p = 31 ; long long mod = 1e9 + 7 ; long long hash_val = 0 ; long long mul = 1 ; for ( char ch : s ) { hash_val = ( hash_val + ( ch - 'a' + 1 ) * mul ) % mod ; mul = mul * p % mod ; } return hash_val ; }
|
g-transeval-cpp_data_71
|
int CountOfSubstringWithOnlyOnes ( string s ) { int res = 0 , count = 0 ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { count = s [ i ] == '1' ? count + 1 : 0 ; res = res + count ; } return res ; }
|
g-transeval-cpp_data_72
|
int Composite ( int n ) { int flag = 0 ; int c = 0 ; for ( int j = 1 ; j <= n ; j ++ ) { if ( n % j == 0 ) { c += 1 ; } } if ( c >= 3 ) { flag = 1 ; } return flag ; }
|
g-transeval-cpp_data_73
|
bool IsDivBySix ( string s , int n ) { int sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { sum += s [ i ] - 'a' + 1 ; } if ( sum % 3 != 0 ) { return false ; } int last_digit = ( s [ n - 1 ] - 'a' + 1 ) % 10 ; if ( last_digit % 2 != 0 ) { return false ; } return true ; }
|
g-transeval-cpp_data_74
|
bool IsRedundantBraces ( string s ) { int a = 0 , b = 0 ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( s [ i ] == '(' && s [ i + 2 ] == ')' ) { return true ; } if ( s [ i ] == '*' || s [ i ] == '+' || s [ i ] == '-' || s [ i ] == '/' ) { a ++ ; } if ( s [ i ] == '(' ) { b ++ ; } } if ( b > a ) { return true ; } return false ; }
|
g-transeval-cpp_data_75
|
int CountSubStr ( string s , int n ) { int count = 0 ; for ( int i = 0 ; i < n - 2 ; ) { if ( s [ i ] == '0' && s [ i + 1 ] == '1' && s [ i + 2 ] == '0' ) { count ++ ; i += 3 ; } else if ( s [ i ] == '1' && s [ i + 1 ] == '0' && s [ i + 2 ] == '1' ) { count ++ ; i += 3 ; } else { i ++ ; } } return count ; }
|
g-transeval-cpp_data_76
|
int PrefixOccurrences ( string s ) { char c = s [ 0 ] ; int count_c = 0 ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( s [ i ] == c ) { count_c ++ ; } } return count_c ; }
|
g-transeval-cpp_data_77
|
bool IsValid ( string s , int len ) { for ( int i = 1 ; i < len ; i ++ ) { if ( s [ i ] == s [ i - 1 ] ) { return false ; } } return true ; }
|
g-transeval-cpp_data_78
|
int Count ( string s , int k ) { int n = s . length ( ) ; int d = 0 ; int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { d += s [ i ] ; } if ( d % k == 0 ) { count += 1 ; } for ( int i = k ; i < n ; i ++ ) { int prev = s [ i - k ] ; d -= prev ; d += s [ i ] ; if ( d % k == 0 ) { count += 1 ; } } return count ; }
|
g-transeval-cpp_data_79
|
int FindSubstringCount ( string s ) { int result = 0 ; int n = s . length ( ) ; int i = 0 ; while ( i < n - 1 ) { if ( s [ i ] + 1 == s [ i + 1 ] ) { result ++ ; while ( i < n - 1 && s [ i ] + 1 == s [ i + 1 ] ) { i ++ ; } } i ++ ; } return result ; }
|
g-transeval-cpp_data_80
|
bool Find ( string s1 , string s2 ) { int len1 = s1 . length ( ) , len2 = s2 . length ( ) ; if ( len1 != len2 ) { return false ; } vector < int > d ( len1 ) ; d [ 0 ] = s2 [ 0 ] - s1 [ 0 ] ; for ( int i = 1 ; i < len1 ; i ++ ) { if ( s1 [ i ] > s2 [ i ] ) { return false ; } else { d [ i ] = s2 [ i ] - s1 [ i ] ; } } for ( int i = 0 ; i < len1 - 1 ; i ++ ) { if ( d [ i ] < d [ i + 1 ] ) { return false ; } } return true ; }
|
g-transeval-cpp_data_81
|
bool IsInGivenBase ( string s , int bas ) { if ( bas > 16 ) { return false ; } else if ( bas <= 10 ) { for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( ! ( s [ i ] >= '0' && s [ i ] < '0' + bas ) ) { return false ; } } } else { for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( ! ( ( s [ i ] >= '0' && s [ i ] < '0' + bas ) || ( s [ i ] >= 'A' && s [ i ] < ( 'A' + bas - 10 ) ) ) ) { return false ; } } } return true ; }
|
g-transeval-cpp_data_82
|
int CountNonEmptySubstr ( string s ) { int n = s . length ( ) ; return n * ( n + 1 ) / 2 ; }
|
g-transeval-cpp_data_83
|
int EvenDecimalValue ( string s , int n ) { int result = 0 ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = i ; j < n ; j ++ ) { int decimal_value = 0 ; int power_of_2 = 1 ; for ( int k = i ; k <= j ; k ++ ) { decimal_value += ( s [ k ] - '0' ) * power_of_2 ; power_of_2 *= 2 ; } if ( decimal_value % 2 == 0 ) { result ++ ; } } } return result ; }
|
g-transeval-cpp_data_84
|
int Calculate ( string s ) { int ans = 6 ; for ( int i = 0 ; i < 10 ; ++ i ) { for ( int j = 0 ; j < 10 ; ++ j ) { for ( int k = 0 ; k < 10 ; ++ k ) { for ( int l = 0 ; l < 10 ; ++ l ) { for ( int m = 0 ; m < 10 ; ++ m ) { for ( int n = 0 ; n < 10 ; ++ n ) { if ( i + j + k == l + m + n ) { int c = 0 ; if ( i != s [ 0 ] - '0' ) { c ++ ; } if ( j != s [ 1 ] - '0' ) { c ++ ; } if ( k != s [ 2 ] - '0' ) { c ++ ; } if ( l != s [ 3 ] - '0' ) { c ++ ; } if ( m != s [ 4 ] - '0' ) { c ++ ; } if ( n != s [ 5 ] - '0' ) { c ++ ; } if ( c < ans ) { ans = c ; } } } } } } } } return ans ; }
|
g-transeval-cpp_data_85
|
int XorZero ( string s ) { int one_count = 0 , zero_count = 0 ; int n = s . length ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( s [ i ] == '1' ) { one_count ++ ; } else { zero_count ++ ; } } if ( one_count % 2 == 0 ) { return zero_count ; } return one_count ; }
|
g-transeval-cpp_data_86
|
string EvenLength ( string n ) { string res = n ; for ( int j = n . length ( ) - 1 ; j >= 0 ; -- j ) { res += n [ j ] ; } return res ; }
|
g-transeval-cpp_data_87
|
int CountSubstringWithEqualEnds ( string s ) { int result = 0 ; int n = s . length ( ) ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = i ; j < n ; j ++ ) { if ( s [ i ] == s [ j ] ) { result ++ ; } } } return result ; }
|
g-transeval-cpp_data_88
|
double NormalSlope ( double a , double b , double x1 , double y1 ) { double g = a / 2 ; double f = b / 2 ; if ( g - x1 == 0 ) { return -1 ; } double slope = ( f - y1 ) / ( g - x1 ) ; if ( slope == 0 ) { return -2 ; } return slope ; }
|
g-transeval-cpp_data_89
|
bool Orthogonality ( int x1 , int y1 , int x2 , int y2 , int r1 , int r2 ) { int dsquare = ( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 ) ; if ( dsquare == r1 * r1 + r2 * r2 ) { return true ; } else { return false ; } }
|
g-transeval-cpp_data_90
|
double FindAreaShaded ( double a ) { double sq_area = a * a ; double semi_circle_area = 3.14 * ( a * a ) / 8 ; double shaded_area = 4 * semi_circle_area - sq_area ; return shaded_area ; }
|
g-transeval-cpp_data_91
|
int Factorial ( int a , int b ) { int res = 1 ; for ( int i = 1 ; i <= a + b ; i ++ ) { res = res * i ; } for ( int i = 1 ; i <= a ; i ++ ) { res = res / i ; } for ( int i = 1 ; i <= b ; i ++ ) { res = res / i ; } return res ; }
|
g-transeval-cpp_data_92
|
int FactorTree ( int n ) { int height = 0 ; while ( n > 1 ) { bool flag = false ; for ( int i = 2 ; i <= sqrt ( n ) ; i ++ ) { if ( n % i == 0 ) { n = n / i ; flag = true ; break ; } } height ++ ; if ( ! flag ) { break ; } } return height ; }
|
g-transeval-cpp_data_93
|
string FindIfPossible ( int n , int s , int x ) { if ( s >= x && s % 2 == x % 2 ) { if ( n >= 3 ) { return "Yes" ; } if ( n == 1 ) { if ( s == x ) { return "Yes" ; } else { return "No" ; } } if ( n == 2 ) { int c = ( s - x ) / 2 ; int a = c ; int b = c ; a = a + x ; if ( ( a ^ b ) == x ) { return "Yes" ; } else { return "No" ; } } } return "No" ; }
|
g-transeval-cpp_data_94
|
int MaximumTripletXor ( int a , int b , int c ) { int ans = 0 ; for ( int i = 30 ; i >= 0 ; i -- ) { int cur = 1 << i ; if ( a >= cur ) { ans += cur ; a -= cur ; } else if ( b >= cur ) { ans += cur ; b -= cur ; } else if ( c >= cur ) { ans += cur ; c -= cur ; } } return ans ; }
|
g-transeval-cpp_data_95
|
int ItemType ( int n ) { int count = 0 ; int day = 1 ; while ( count + day * ( day + 1 ) / 2 < n ) { count += day * ( day + 1 ) / 2 ; day ++ ; } for ( int type = day ; type > 0 ; type -- ) { count += type ; if ( count >= n ) { return type ; } } return 0 ; }
|
g-transeval-cpp_data_96
|
int MaxGcdInRange ( int l , int r ) { int ans = 1 ; for ( int z = r ; z >= 1 ; z -- ) { if ( r / z - ( l - 1 ) / z > 1 ) { ans = z ; break ; } } return ans ; }
|
g-transeval-cpp_data_97
|
int SumOfDigits ( int n ) { int sum = 0 ; while ( n != 0 ) { sum += n % 10 ; n = n / 10 ; } return sum ; }
|
g-transeval-cpp_data_98
|
bool IsRepUnitNum ( int n , int b ) { int length = 0 ; int count_one = 0 ; while ( n != 0 ) { int r = n % b ; length ++ ; if ( r == 1 ) { count_one ++ ; } n = n / b ; } return count_one >= 3 && count_one == length ; }
|
g-transeval-cpp_data_99
|
bool IsStraightLineNum ( int n ) { if ( n <= 99 ) { return false ; } string s = to_string ( n ) ; int d = s [ 1 ] - s [ 0 ] ; for ( int i = 2 ; i < s . length ( ) ; i ++ ) { if ( s [ i ] - s [ i - 1 ] != d ) { return false ; } } return true ; }
|
g-transeval-cpp_data_100
|
int GetCount ( int d , int n ) { int no = n / d ; int result = no ; for ( int p = 2 ; p * p <= no ; ++ p ) { if ( no % p == 0 ) { while ( no % p == 0 ) { no /= p ; } result -= result / p ; } } if ( no > 1 ) { result -= result / no ; } return result ; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.