id stringlengths 22 24 | content stringlengths 46 1.22k |
|---|---|
g-transeval-cpp_data_101 | bool IsEvenParity ( int x ) { int parity = 0 ; while ( x != 0 ) { if ( x & 1 ) { parity ++ ; } x = x >> 1 ; } if ( parity % 2 == 0 ) { return true ; } else { return false ; } }
|
g-transeval-cpp_data_102 | int IsPerfect ( int n ) { int sum = 1 ; for ( int i = 2 ; i * i <= n ; i ++ ) { if ( n % i == 0 ) { if ( i * i != n ) { sum = sum + i + n / i ; } else { sum = sum + i ; } } } if ( sum == n && n != 1 ) { return n ; } return 0 ; }
|
g-transeval-cpp_data_103 | int LogAToBaseB ( int a , int b ) { return a > b - 1 ? 1 + LogAToBaseB ( a / b , b ) : 0 ; }
|
g-transeval-cpp_data_104 | int UsingBinarySearch ( int start , int end , int n , int s ) { if ( start >= end ) { return start ; } int mid = start + ( end - start ) / 2 ; int total_sum = n * ( n + 1 ) / 2 ; int mid_sum = mid * ( mid + 1 ) / 2 ; if ( total_sum - mid_sum <= s ) { return UsingBinarySearch ( start , mid , n , s ) ; } return UsingBinarySearch ( mid + 1 , end , n , s ) ; }
|
g-transeval-cpp_data_105 | string MinInt ( string s ) { string s1 = s ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( s1 [ i ] >= '5' ) { s1 [ i ] = '9' - s1 [ i ] + '0' ; } } if ( s1 [ 0 ] == '0' ) { s1 [ 0 ] = '9' ; } return s1 ; }
|
g-transeval-cpp_data_106 | int CountTriplets ( int a , int b , int c ) { int ans = 0 ; for ( int i = 1 ; i <= a ; i ++ ) { for ( int j = 1 ; j <= b ; j ++ ) { for ( int k = 1 ; k <= c ; k ++ ) { if ( i * k > j * j ) { ans ++ ; } } } } return ans ; }
|
g-transeval-cpp_data_107 | bool TopsyTurvy ( string s ) { for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( s [ i ] == '2' || s [ i ] == '4' || s [ i ] == '5' || s [ i ] == '6' || s [ i ] == '7' || s [ i ] == '9' ) { return false ; } } return true ; }
|
g-transeval-cpp_data_108 | int SumOfLastDig ( int n , int m ) { int sum = 0 ; int k = n / m ; vector < int > arr ( 10 ) ; for ( int i = 0 ; i < 10 ; i ++ ) { arr [ i ] = m * ( i + 1 ) % 10 ; sum += arr [ i ] ; } int rem = k % 10 ; int ans = k / 10 * sum ; for ( int i = 0 ; i < rem ; i ++ ) { ans += arr [ i ] ; } return ans ; }
|
g-transeval-cpp_data_109 | int TotalPay ( int total_items , int price_of_one_item , int n , int m ) { int freeItems = 0 , actual = 0 ; freeItems = total_items / ( n + m ) ; actual = total_items - freeItems ; int amount = actual * price_of_one_item ; return amount ; }
|
g-transeval-cpp_data_110 | int MinOperations ( int x , int y , int p , int q ) { if ( y % x != 0 ) { return -1 ; } int d = y / x ; int a = 0 ; while ( d % p == 0 ) { d /= p ; a += 1 ; } int b = 0 ; while ( d % q == 0 ) { d /= q ; b += 1 ; } if ( d != 1 ) { return -1 ; } return a + b ; }
|
g-transeval-cpp_data_111 | bool IsMersenne ( int n ) { while ( n != 0 ) { int r = n % 2 ; if ( r == 0 ) { return false ; } n /= 2 ; } return true ; }
|
g-transeval-cpp_data_112 | int FindThirdDigit ( int n ) { if ( n < 3 ) { return 0 ; } return n & 1 ? 1 : 6 ; }
|
g-transeval-cpp_data_113 | bool IsOddLength ( int num ) { int count = 0 ; while ( num > 0 ) { num /= 10 ; count ++ ; } if ( count % 2 != 0 ) { return true ; } return false ; }
|
g-transeval-cpp_data_114 | bool CheckIsPossible ( int l , int r , int k ) { int count = 0 ; for ( int i = l ; i <= r ; i ++ ) { if ( i % k == 0 ) { count ++ ; } } return count > 1 ; }
|
g-transeval-cpp_data_115 | int Bytes ( int kilobytes ) { int b = kilobytes * 1024 ; return b ; }
|
g-transeval-cpp_data_116 | int OctahedralNum ( int n ) { return n * ( 2 * n * n + 1 ) / 3 ; }
|
g-transeval-cpp_data_117 | string CheckEqual ( string s ) { for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( s [ i ] != '1' && s [ i ] != '0' && s [ i ] != '8' ) { return "No" ; } } int start = 0 , end = s . length ( ) - 1 ; while ( start < end ) { if ( s [ start ] != s [ end ] ) { return "No" ; } start ++ ; end -- ; } return "Yes" ; }
|
g-transeval-cpp_data_118 | bool IsUndulating ( string n ) { if ( n . length ( ) <= 2 ) { return false ; } for ( int i = 2 ; i < n . length ( ) ; i ++ ) { if ( n [ i - 2 ] != n [ i ] ) { return false ; } } return true ; }
|
g-transeval-cpp_data_119 | int FirstDigit ( int n ) { while ( n >= 10 ) { n /= 10 ; } return n ; }
|
g-transeval-cpp_data_120 | int CountDigit ( int n ) { if ( n == 0 ) { return 0 ; } return 1 + CountDigit ( n / 10 ) ; }
|
g-transeval-cpp_data_121 | bool IsDivisibleBy5 ( string s ) { int n = s . length ( ) ; return s [ n - 1 ] - '0' == 0 || s [ n - 1 ] - '0' == 5 ; }
|
g-transeval-cpp_data_122 | int Inv ( 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_123 | bool OnlyFirstAndLastAreSet ( int n ) { if ( n == 1 ) { return true ; } if ( n == 2 ) { return false ; } return ( ( n - 1 ) & ( n - 2 ) ) == 0 ; }
|
g-transeval-cpp_data_124 | int Divide ( int dividend , int divisor ) { int sign = ( ( dividend < 0 ) ^ ( divisor < 0 ) ) ? -1 : 1 ; dividend = abs ( dividend ) ; divisor = abs ( divisor ) ; int quotient = 0 ; long long temp = 0 ; for ( int i = 31 ; i >= 0 ; -- i ) { if ( temp + ( ( long long ) divisor << i ) <= dividend ) { temp += ( long long ) divisor << i ; quotient |= 1 << i ; } } if ( sign == -1 ) { quotient = - quotient ; } return quotient ; }
|
g-transeval-cpp_data_125 | char FindProfession ( int level , int pos ) { if ( level == 1 ) { return 'e' ; } if ( FindProfession ( level - 1 , ( pos + 1 ) / 2 ) == 'd' ) { return pos % 2 ? 'd' : 'e' ; } return pos % 2 ? 'e' : 'd' ; }
|
g-transeval-cpp_data_126 | bool HasCloseElements ( vector < double > numbers , double threshold ) { for ( int i = 0 ; i < numbers . size ( ) ; i ++ ) { for ( int j = i + 1 ; j < numbers . size ( ) ; j ++ ) { double distance = abs ( numbers [ i ] - numbers [ j ] ) ; if ( distance < threshold ) { return true ; } } } return false ; }
|
g-transeval-cpp_data_127 | double TruncateNumber ( double number ) { return fmod ( number , 1 ) ; }
|
g-transeval-cpp_data_128 | bool BelowZero ( vector < int > operations ) { int balance = 0 ; for ( auto op : operations ) { balance += op ; if ( balance < 0 ) { return true ; } } return false ; }
|
g-transeval-cpp_data_129 | double MeanAbsoluteDeviation ( vector < double > numbers ) { double sum_num = 0 ; for ( auto num : numbers ) { sum_num += num ; } double mean = sum_num / numbers . size ( ) ; double sum_abs_diff = 0 ; for ( auto num : numbers ) { sum_abs_diff += abs ( num - mean ) ; } return sum_abs_diff / numbers . size ( ) ; }
|
g-transeval-cpp_data_130 | vector < int > Intersperse ( vector < int > numbers , int delimiter ) { vector < int > result ; if ( numbers . empty ( ) ) { return result ; } for ( int i = 0 ; i < numbers . size ( ) - 1 ; i ++ ) { result . push_back ( numbers [ i ] ) ; result . push_back ( delimiter ) ; } result . push_back ( numbers [ numbers . size ( ) - 1 ] ) ; return result ; }
|
g-transeval-cpp_data_131 | vector < int > SumProduct ( vector < int > numbers ) { int sum_value = 0 ; int prod_value = 1 ; for ( int n : numbers ) { sum_value += n ; prod_value *= n ; } return { sum_value , prod_value } ; }
|
g-transeval-cpp_data_132 | vector < string > AllPrefixes ( string s ) { vector < string > result ; for ( int i = 1 ; i <= s . length ( ) ; i ++ ) { result . push_back ( s . substr ( 0 , i ) ) ; } return result ; }
|
g-transeval-cpp_data_133 | vector < int > ParseMusic ( string music_string ) { string current ; vector < int > result ; for ( int i = 0 ; i <= music_string . length ( ) ; i ++ ) { if ( i == music_string . length ( ) || music_string [ i ] == ' ' ) { if ( current == "o" ) { result . push_back ( 4 ) ; } if ( current == "o|" ) { result . push_back ( 2 ) ; } if ( current == ".|" ) { result . push_back ( 1 ) ; } current . clear ( ) ; } else { current += music_string [ i ] ; } } return result ; }
|
g-transeval-cpp_data_134 | int Strlen ( string s ) { return s . length ( ) ; }
|
g-transeval-cpp_data_135 | vector < int > Factorize ( int n ) { vector < int > factors ; for ( int i = 2 ; i <= n ; i ++ ) { if ( n % i == 0 ) { n /= i ; factors . push_back ( i ) ; i -- ; } } return factors ; }
|
g-transeval-cpp_data_136 | string Concatenate ( vector < string > strings ) { string result ; for ( auto & s : strings ) { result += s ; } return result ; }
|
g-transeval-cpp_data_137 | vector < double > GetPositive ( vector < double > l ) { vector < double > result ; for ( int i = 0 ; i < l . size ( ) ; i ++ ) { if ( l [ i ] > 0 ) { result . push_back ( l [ i ] ) ; } } return result ; }
|
g-transeval-cpp_data_138 | vector < double > SortEven ( vector < double > l ) { vector < double > evens ; for ( int i = 0 ; i < l . size ( ) ; i += 2 ) { evens . push_back ( l [ i ] ) ; } sort ( evens . begin ( ) , evens . end ( ) ) ; vector < double > result ; for ( int i = 0 ; i < l . size ( ) ; i ++ ) { if ( i % 2 == 0 ) { result . push_back ( evens [ i / 2 ] ) ; } if ( i % 2 == 1 ) { result . push_back ( l [ i ] ) ; } } return result ; }
|
g-transeval-cpp_data_139 | string DecodeCyclic ( string s ) { string output ; int i = 0 ; while ( i <= s . length ( ) - 3 ) { string x = s [ i + 2 ] + s . substr ( i , 2 ) ; output += x ; i += 3 ; } return output + s . substr ( i ) ; }
|
g-transeval-cpp_data_140 | int CarRaceCollision ( int n ) { return pow ( n , 2 ) ; }
|
g-transeval-cpp_data_141 | vector < int > IncrList ( vector < int > l ) { vector < int > result ; for ( int i : l ) { result . push_back ( i + 1 ) ; } return result ; }
|
g-transeval-cpp_data_142 | bool PairsSumToZero ( vector < int > l ) { for ( int i = 0 ; i < l . size ( ) ; i ++ ) { for ( int j = i + 1 ; j < l . size ( ) ; j ++ ) { if ( l [ i ] + l [ j ] == 0 ) { return true ; } } } return false ; }
|
g-transeval-cpp_data_143 | string ChangeBase ( int x , int b ) { string ret ; while ( x > 0 ) { ret . insert ( 0 , to_string ( x % b ) ) ; x /= b ; } return ret ; }
|
g-transeval-cpp_data_144 | double Median ( vector < double > l ) { sort ( l . begin ( ) , l . end ( ) ) ; if ( l . size ( ) % 2 == 1 ) { return l [ l . size ( ) / 2 ] ; } return ( l [ l . size ( ) / 2 ] + l [ l . size ( ) / 2 - 1 ] ) / 2 ; }
|
g-transeval-cpp_data_145 | string DecodeShift ( string s ) { string result ; for ( char ch : s ) { char w = ( ch + 21 - 'a' ) % 26 + 'a' ; result += w ; } return result ; }
|
g-transeval-cpp_data_146 | bool BelowThreshold ( vector < int > l , int t ) { for ( int n : l ) { if ( n >= t ) { return false ; } } return true ; }
|
g-transeval-cpp_data_147 | bool CorrectBracketing ( string brackets ) { int depth = 0 ; for ( char b : brackets ) { if ( b == '<' ) { depth += 1 ; } if ( b == '>' ) { depth -= 1 ; } if ( depth < 0 ) { return false ; } } return depth == 0 ; }
|
g-transeval-cpp_data_148 | bool Monotonic ( vector < double > l ) { int incr = 0 ; int decr = 0 ; for ( int i = 1 ; i < l . size ( ) ; i ++ ) { if ( l [ i ] > l [ i - 1 ] ) { incr = 1 ; } if ( l [ i ] < l [ i - 1 ] ) { decr = 1 ; } } return incr + decr != 2 ; }
|
g-transeval-cpp_data_149 | vector < double > Derivative ( vector < double > xs ) { vector < double > result ; for ( int i = 1 ; i < xs . size ( ) ; i ++ ) { result . push_back ( i * xs [ i ] ) ; } return result ; }
|
g-transeval-cpp_data_150 | int VowelsCount ( string s ) { string vowels = "aeiouAEIOU" ; int count = 0 ; for ( char ch : s ) { if ( vowels . find ( ch ) != string :: npos ) { count += 1 ; } } if ( s [ s . length ( ) - 1 ] == 'y' || s [ s . length ( ) - 1 ] == 'Y' ) { count += 1 ; } return count ; }
|
g-transeval-cpp_data_151 | int DigitSum ( string s ) { int sum = 0 ; for ( char c : s ) { if ( isupper ( c ) ) { sum += c ; } } return sum ; }
|
g-transeval-cpp_data_152 | int FruitDistribution ( string s , int n ) { string num1 ; string num2 ; bool flag = false ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( isdigit ( s [ i ] ) ) { if ( ! flag ) { num1 += s [ i ] ; } if ( flag ) { num2 += s [ i ] ; } } else if ( ! flag && num1 . length ( ) > 0 ) { flag = true ; } } return n - stoi ( num1 ) - stoi ( num2 ) ; }
|
g-transeval-cpp_data_153 | vector < int > Pluck ( vector < int > arr ) { vector < int > result ; for ( int i = 0 ; i < arr . size ( ) ; i ++ ) { if ( arr [ i ] % 2 == 0 ) { if ( result . empty ( ) ) { result . push_back ( arr [ i ] ) ; result . push_back ( i ) ; } else if ( arr [ i ] < result [ 0 ] ) { result [ 0 ] = arr [ i ] ; result [ 1 ] = i ; } } } return result ; }
|
g-transeval-cpp_data_154 | vector < int > StrangeSortList ( vector < int > lst ) { vector < int > res ; sort ( lst . begin ( ) , lst . end ( ) ) ; int l = 0 ; int r = lst . size ( ) - 1 ; while ( l < r ) { res . push_back ( lst [ l ] ) ; l += 1 ; res . push_back ( lst [ r ] ) ; r -= 1 ; } if ( l == r ) { res . push_back ( lst [ l ] ) ; } return res ; }
|
g-transeval-cpp_data_155 | double TriangleArea ( double a , double b , double c ) { if ( a + b <= c || a + c <= b || b + c <= a ) { return -1 ; } double s = ( a + b + c ) / 2 ; return sqrt ( s * ( s - a ) * ( s - b ) * ( s - c ) ) ; }
|
g-transeval-cpp_data_156 | bool WillItFly ( vector < int > q , int w ) { int sum = 0 ; for ( int i = 0 ; i < q . size ( ) ; i ++ ) { if ( q [ i ] != q [ q . size ( ) - i - 1 ] ) { return false ; } sum += q [ i ] ; } return sum <= w ; }
|
g-transeval-cpp_data_157 | bool IsCube ( int a ) { a = abs ( a ) ; int i = round ( pow ( a , 1.0 / 3 ) ) ; return pow ( i , 3 ) == a ; }
|
g-transeval-cpp_data_158 | int HexKey ( string num ) { string key = "2357BD" ; int total = 0 ; for ( char c : num ) { if ( key . find ( c ) != string :: npos ) { total += 1 ; } } return total ; }
|
g-transeval-cpp_data_159 | string DecimalToBinary ( int dec ) { string ans ; if ( dec != 0 ) { while ( dec > 0 ) { ans . insert ( 0 , to_string ( dec % 2 ) ) ; dec /= 2 ; } } else { ans += "0" ; } return "db" + ans + "db" ; }
|
g-transeval-cpp_data_160 | bool PrimeLength ( string s ) { int l = s . length ( ) ; if ( l < 2 ) { return false ; } for ( int i = 2 ; i < l ; i ++ ) { if ( l % i == 0 ) { return false ; } } return true ; }
|
g-transeval-cpp_data_161 | int StartsOneEnds ( int n ) { if ( n < 1 ) { return 0 ; } if ( n == 1 ) { return 1 ; } return 18 * pow ( 10 , n - 2 ) ; }
|
g-transeval-cpp_data_162 | int Add ( vector < int > lst ) { int sum = 0 ; for ( int i = 1 ; i < lst . size ( ) ; i += 2 ) { if ( lst [ i ] % 2 == 0 ) { sum += lst [ i ] ; } } return sum ; }
|
g-transeval-cpp_data_163 | vector < vector < int > > GetRow ( vector < vector < int > > lst , int x ) { vector < vector < int > > coords ; for ( int i = 0 ; i < lst . size ( ) ; i ++ ) { for ( int j = lst [ i ] . size ( ) - 1 ; j >= 0 ; j -- ) { if ( lst [ i ] [ j ] == x ) { coords . push_back ( { i , j } ) ; } } } return coords ; }
|
g-transeval-cpp_data_164 | int NextSmallest ( vector < int > lst ) { sort ( lst . begin ( ) , lst . end ( ) ) ; for ( int i = 1 ; i < lst . size ( ) ; i ++ ) { if ( lst [ i ] != lst [ i - 1 ] ) { return lst [ i ] ; } } return -1 ; }
|
g-transeval-cpp_data_165 | bool AnyInt ( double a , double b , double c ) { if ( round ( a ) != a || round ( b ) != b || round ( c ) != c ) { return false ; } return a + b == c || a + c == b || b + c == a ; }
|
g-transeval-cpp_data_166 | vector < int > CountUpTo ( int n ) { vector < int > primes ; for ( int i = 2 ; i < n ; i ++ ) { bool is_prime = true ; for ( int j = 2 ; j < i ; j ++ ) { if ( i % j == 0 ) { is_prime = false ; break ; } } if ( is_prime ) { primes . push_back ( i ) ; } } return primes ; }
|
g-transeval-cpp_data_167 | int ClosestInteger ( string value ) { double w = stod ( value ) ; return round ( w ) ; }
|
g-transeval-cpp_data_168 | vector < int > MakeAPile ( int n ) { vector < int > result ; for ( int i = 0 ; i < n ; i ++ ) { result . push_back ( n + 2 * i ) ; } return result ; }
|
g-transeval-cpp_data_169 | vector < string > WordsString ( string s ) { string current ; vector < string > words ; for ( int i = 0 ; i <= s . length ( ) ; i ++ ) { if ( i == s . length ( ) || s [ i ] == ' ' || s [ i ] == ',' ) { if ( current . length ( ) > 0 ) { words . push_back ( current ) ; current . clear ( ) ; } } else { current += s [ i ] ; } } return words ; }
|
g-transeval-cpp_data_170 | string RoundedAvg ( int n , int m ) { if ( n > m ) { return "-1" ; } int num = ( m + n ) / 2 ; string ret ; while ( num > 0 ) { ret . insert ( 0 , to_string ( num % 2 ) ) ; num /= 2 ; } return ret ; }
|
g-transeval-cpp_data_171 | vector < int > UniqueDigits ( vector < int > x ) { vector < int > digits ; for ( int n : x ) { bool is_unique = true ; for ( char c : to_string ( n ) ) { if ( c % 2 == 0 ) { is_unique = false ; break ; } } if ( is_unique ) { digits . push_back ( n ) ; } } sort ( digits . begin ( ) , digits . end ( ) ) ; return digits ; }
|
g-transeval-cpp_data_172 | int CountNums ( vector < int > arr ) { int num = 0 ; for ( int n : arr ) { int neg = n < 0 ? -1 : 1 ; n = abs ( n ) ; vector < int > digits ; for ( char c : to_string ( n ) ) { digits . push_back ( c - '0' ) ; } digits [ 0 ] *= neg ; int sum = 0 ; for ( int d : digits ) { sum += d ; } if ( sum > 0 ) { num += 1 ; } } return num ; }
|
g-transeval-cpp_data_173 | bool MoveOneBall ( vector < int > arr ) { if ( arr . empty ( ) ) { return true ; } int num = 0 ; for ( int i = 1 ; i < arr . size ( ) ; i ++ ) { if ( arr [ i ] < arr [ i - 1 ] ) { num += 1 ; } } if ( arr [ arr . size ( ) - 1 ] > arr [ 0 ] ) { num += 1 ; } if ( num < 2 ) { return true ; } return false ; }
|
g-transeval-cpp_data_174 | string Exchange ( vector < int > lst1 , vector < int > lst2 ) { int odd = 0 ; int even = 0 ; for ( int n : lst1 ) { if ( n % 2 == 1 ) { odd += 1 ; } } for ( int n : lst2 ) { if ( n % 2 == 0 ) { even += 1 ; } } if ( even >= odd ) { return "YES" ; } return "NO" ; }
|
g-transeval-cpp_data_175 | vector < string > OddCount ( vector < string > lst ) { vector < string > results ; string original_str = "the number of odd elements in the string i of the input." ; for ( string & s : lst ) { int sum = 0 ; for ( char d : s ) { if ( isdigit ( d ) && d % 2 == 1 ) { sum += 1 ; } } string result ; for ( char c : original_str ) { if ( c == 'i' ) { result += to_string ( sum ) ; } else { result += c ; } } results . push_back ( result ) ; } return results ; }
|
g-transeval-cpp_data_176 | int MinSubArraySum ( vector < int > nums ) { int min_sum = numeric_limits < int > :: max ( ) ; int sum = 0 ; for ( int num : nums ) { sum += num ; if ( min_sum > sum ) { min_sum = sum ; } if ( sum > 0 ) { sum = 0 ; } } return min_sum ; }
|
g-transeval-cpp_data_177 | int MaxFill ( vector < vector < int > > grid , int capacity ) { int res = 0 ; for ( auto & well : grid ) { int sum = 0 ; for ( int n : well ) { sum += n ; } if ( sum > 0 ) { res += ( sum - 1 ) / capacity + 1 ; } } return res ; }
|
g-transeval-cpp_data_178 | vector < string > SelectWords ( string s , int n ) { string vowels = "aeiouAEIOU" ; string current ; vector < string > result ; int consonant_num = 0 ; for ( int i = 0 ; i <= s . length ( ) ; i ++ ) { if ( i == s . length ( ) || s [ i ] == ' ' ) { if ( consonant_num == n ) { result . push_back ( current ) ; } current . clear ( ) ; consonant_num = 0 ; } else { current += s [ i ] ; if ( vowels . find ( s [ i ] ) == string :: npos ) { consonant_num += 1 ; } } } return result ; }
|
g-transeval-cpp_data_179 | int Solution ( vector < int > lst ) { int sum = 0 ; for ( int i = 0 ; i < lst . size ( ) ; i += 2 ) { if ( lst [ i ] % 2 == 1 ) { sum += lst [ i ] ; } } return sum ; }
|
g-transeval-cpp_data_180 | int AddElements ( vector < int > arr , int k ) { int sum = 0 ; for ( int i = 0 ; i < k ; i ++ ) { if ( arr [ i ] >= -99 && arr [ i ] <= 99 ) { sum += arr [ i ] ; } } return sum ; }
|
g-transeval-cpp_data_181 | vector < int > GetOddCollatz ( int n ) { vector < int > odd_collatz ; while ( n != 1 ) { if ( n % 2 == 1 ) { odd_collatz . push_back ( n ) ; n = n * 3 + 1 ; } else { n /= 2 ; } } odd_collatz . push_back ( 1 ) ; sort ( odd_collatz . begin ( ) , odd_collatz . end ( ) ) ; return odd_collatz ; }
|
g-transeval-cpp_data_182 | bool IsSorted ( vector < int > lst ) { for ( int i = 1 ; i < lst . size ( ) ; i ++ ) { if ( lst [ i ] < lst [ i - 1 ] ) { return false ; } if ( i >= 2 && lst [ i ] == lst [ i - 1 ] && lst [ i ] == lst [ i - 2 ] ) { return false ; } } return true ; }
|
g-transeval-cpp_data_183 | string Intersection ( vector < int > interval1 , vector < int > interval2 ) { int inter1 = max ( interval1 [ 0 ] , interval2 [ 0 ] ) ; int inter2 = min ( interval1 [ 1 ] , interval2 [ 1 ] ) ; int l = inter2 - inter1 ; if ( l < 2 ) { return "NO" ; } for ( int i = 2 ; i < l ; i ++ ) { if ( l % i == 0 ) { return "NO" ; } } return "YES" ; }
|
g-transeval-cpp_data_184 | int ProdSigns ( vector < int > arr ) { if ( arr . empty ( ) ) { return -32768 ; } int sum = 0 ; int prods = 1 ; for ( int i : arr ) { sum += abs ( i ) ; if ( i == 0 ) { prods = 0 ; } if ( i < 0 ) { prods = - prods ; } } return sum * prods ; }
|
g-transeval-cpp_data_185 | vector < int > MinPath ( vector < vector < int > > grid , int k ) { int n = grid . size ( ) ; int min_num = 0 ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 0 ; j < n ; j ++ ) { if ( grid [ i ] [ j ] == 1 ) { vector < int > tmp ; if ( i != 0 ) { tmp . push_back ( grid [ i - 1 ] [ j ] ) ; } if ( j != 0 ) { tmp . push_back ( grid [ i ] [ j - 1 ] ) ; } if ( i != n - 1 ) { tmp . push_back ( grid [ i + 1 ] [ j ] ) ; } if ( j != n - 1 ) { tmp . push_back ( grid [ i ] [ j + 1 ] ) ; } min_num = * min_element ( tmp . begin ( ) , tmp . end ( ) ) ; } } } vector < int > ans ; for ( int i = 0 ; i < k ; i ++ ) { if ( i % 2 == 0 ) { ans . push_back ( 1 ) ; } else { ans . push_back ( min_num ) ; } } return ans ; }
|
g-transeval-cpp_data_186 | int Digits ( int n ) { int prod = 0 ; for ( char digit : to_string ( n ) ) { if ( digit % 2 == 1 ) { if ( prod == 0 ) { prod = 1 ; } prod *= digit - '0' ; } } return prod ; }
|
g-transeval-cpp_data_187 | bool IsNested ( string s ) { int count = 0 ; int max_count = 0 ; for ( char ch : s ) { if ( ch == '[' ) { count += 1 ; } if ( ch == ']' ) { count -= 1 ; } if ( count < 0 ) { count = 0 ; } if ( count > max_count ) { max_count = count ; } if ( count <= max_count - 2 ) { return true ; } } return false ; }
|
g-transeval-cpp_data_188 | int SumSquares ( vector < double > lst ) { int sum = 0 ; for ( double i : lst ) { sum += ceil ( i ) * ceil ( i ) ; } return sum ; }
|
g-transeval-cpp_data_189 | int CanArrange ( vector < int > arr ) { int index = -1 ; for ( int i = 0 ; i < arr . size ( ) ; i ++ ) { if ( arr [ i ] <= i ) { index = i ; } } return index ; }
|
g-transeval-cpp_data_190 | vector < int > LargestSmallestIntegers ( vector < int > lst ) { int max_neg = 0 , min_pos = 0 ; for ( int n : lst ) { if ( n < 0 && ( max_neg == 0 || n > max_neg ) ) { max_neg = n ; } if ( n > 0 && ( min_pos == 0 || n < min_pos ) ) { min_pos = n ; } } return { max_neg , min_pos } ; }
|
g-transeval-cpp_data_191 | string FixSpaces ( string text ) { string res ; int space_len = 0 ; for ( int i = 0 ; i <= text . length ( ) ; i ++ ) { if ( i == text . length ( ) || text [ i ] != ' ' ) { if ( space_len == 1 ) { res += '_' ; } if ( space_len == 2 ) { res += "__" ; } if ( space_len > 2 ) { res += '-' ; } space_len = 0 ; if ( i != text . length ( ) ) { res += text [ i ] ; } } else { space_len += 1 ; } } return res ; }
|
g-transeval-cpp_data_192 | string FileNameCheck ( string file_name ) { int digit_num = 0 , dot_num = 0 ; if ( file_name . length ( ) < 5 || ! isalpha ( file_name [ 0 ] ) ) { return "No" ; } string suffix = file_name . substr ( file_name . length ( ) - 4 ) ; if ( suffix != ".txt" && suffix != ".exe" && suffix != ".dll" ) { return "No" ; } for ( char c : file_name ) { if ( isdigit ( c ) ) { digit_num += 1 ; } if ( c == '.' ) { dot_num += 1 ; } } if ( digit_num > 3 || dot_num != 1 ) { return "No" ; } return "Yes" ; }
|
g-transeval-cpp_data_193 | int SumSquares ( vector < int > lst ) { int sum = 0 ; for ( int i = 0 ; i < lst . size ( ) ; i ++ ) { if ( i % 3 == 0 ) { sum += lst [ i ] * lst [ i ] ; } else if ( i % 4 == 0 ) { sum += lst [ i ] * lst [ i ] * lst [ i ] ; } else { sum += lst [ i ] ; } } return sum ; }
|
g-transeval-cpp_data_194 | string WordsInSentence ( string sentence ) { string result ; string current ; for ( int i = 0 ; i <= sentence . length ( ) ; i ++ ) { if ( i == sentence . length ( ) || sentence [ i ] == ' ' ) { bool is_prime = true ; int l = current . length ( ) ; if ( l < 2 ) { is_prime = false ; } for ( int j = 2 ; j < l ; j ++ ) { if ( l % j == 0 ) { is_prime = false ; break ; } } if ( is_prime ) { result += current + ' ' ; } current . clear ( ) ; } else { current += sentence [ i ] ; } } if ( result . length ( ) > 0 ) { result . pop_back ( ) ; } return result ; }
|
g-transeval-cpp_data_195 | bool Simplify ( string x , string n ) { int a = 0 , b = 0 , c = 0 , d = 0 ; for ( int i = 0 ; i < x . length ( ) ; i ++ ) { if ( x [ i ] == '/' ) { a = stoi ( x . substr ( 0 , i ) ) ; b = stoi ( x . substr ( i + 1 ) ) ; } } for ( int i = 0 ; i < n . length ( ) ; i ++ ) { if ( n [ i ] == '/' ) { c = stoi ( n . substr ( 0 , i ) ) ; d = stoi ( n . substr ( i + 1 ) ) ; } } return ( a * c ) % ( b * d ) == 0 ; }
|
g-transeval-cpp_data_196 | int SpecialFilter ( vector < int > nums ) { int count = 0 ; for ( int num : nums ) { if ( num > 10 ) { string w = to_string ( num ) ; if ( w [ 0 ] % 2 == 1 && w [ w . length ( ) - 1 ] % 2 == 1 ) { count += 1 ; } } } return count ; }
|
g-transeval-cpp_data_197 | int GetMatrixTriples ( int n ) { vector < int > arr ; for ( int i = 1 ; i <= n ; i ++ ) { arr . push_back ( i * i - i + 1 ) ; } int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = i + 1 ; j < n ; j ++ ) { for ( int k = j + 1 ; k < n ; k ++ ) { if ( ( arr [ i ] + arr [ j ] + arr [ k ] ) % 3 == 0 ) { count += 1 ; } } } } return count ; }
|
g-transeval-cpp_data_198 | int DoubleTheDifference ( vector < double > lst ) { int sum = 0 ; for ( double d : lst ) { int num = round ( d ) ; if ( d == num ) { if ( num > 0 && num % 2 == 1 ) { sum += num * num ; } } } return sum ; }
|
g-transeval-cpp_data_199 | vector < int > Compare ( vector < int > game , vector < int > guess ) { vector < int > result ; for ( int i = 0 ; i < game . size ( ) ; i ++ ) { result . push_back ( abs ( game [ i ] - guess [ i ] ) ) ; } return result ; }
|
g-transeval-cpp_data_200 | string StrongestExtension ( string class_name , vector < string > extensions ) { string strongest ; int max = numeric_limits < int > :: min ( ) ; for ( auto & extension : extensions ) { int strength = 0 ; for ( char chr : extension ) { if ( isupper ( chr ) ) { strength += 1 ; } if ( islower ( chr ) ) { strength -= 1 ; } } if ( strength > max ) { max = strength ; strongest = extension ; } } return class_name + '.' + strongest ; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.