id stringlengths 22 24 | content stringlengths 46 1.22k |
|---|---|
g-transeval-cpp_data_201 | string IntToMiniRoman ( int number ) { vector < int > num = { 1000 , 900 , 500 , 400 , 100 , 90 , 50 , 40 , 10 , 9 , 5 , 4 , 1 } ; vector < string > sym = { "m" , "cm" , "d" , "cd" , "c" , "xc" , "l" , "xl" , "x" , "ix" , "v" , "iv" , "i" } ; int pos = 0 ; string res ; while ( number > 0 ) { while ( number >= num [ pos ] ) { res += sym [ pos ] ; number -= num [ pos ] ; } if ( number > 0 ) { pos += 1 ; } } return res ; }
|
g-transeval-cpp_data_202 | vector < int > Eat ( int number , int need , int remaining ) { return need > remaining ? vector < int > { number + remaining , 0 } : vector < int > { number + need , remaining - need } ; }
|
g-transeval-cpp_data_203 | int DoAlgebra ( vector < string > ops , vector < int > operands ) { vector < int > nums ( operands ) ; vector < string > current_ops ( ops ) ; int i = current_ops . size ( ) - 1 ; while ( i >= 0 ) { if ( current_ops [ i ] == "**" ) { nums [ i ] = pow ( nums [ i ] , nums [ i + 1 ] ) ; nums . erase ( nums . begin ( ) + i + 1 ) ; current_ops . erase ( current_ops . begin ( ) + i ) ; } i -- ; } i = 0 ; while ( i < current_ops . size ( ) ) { if ( current_ops [ i ] == "*" ) { nums [ i ] *= nums [ i + 1 ] ; nums . erase ( nums . begin ( ) + i + 1 ) ; current_ops . erase ( current_ops . begin ( ) + i ) ; } else if ( current_ops [ i ] == "//" ) { nums [ i ] /= nums [ i + 1 ] ; nums . erase ( nums . begin ( ) + i + 1 ) ; current_ops . erase ( current_ops . begin ( ) + i ) ; } else { i ++ ; } } i = 0 ; while ( i < current_ops . size ( ) ) { if ( current_ops [ i ] == "+" ) { nums [ i ] += nums [ i + 1 ] ; nums . erase ( nums . begin ( ) + i + 1 ) ; current_ops . erase ( current_ops . begin ( ) + i ) ; } else if ( current_ops [ i ] == "-" ) { nums [ i ] -= nums [ i + 1 ] ; nums . erase ( nums . begin ( ) + i + 1 ) ; current_ops . erase ( current_ops . begin ( ) + i ) ; } else { i ++ ; } } return nums [ 0 ] ; }
|
g-transeval-cpp_data_204 | vector < int > GenerateIntegers ( int a , int b ) { int lower = max ( 2 , min ( a , b ) ) ; int upper = min ( 8 , max ( a , b ) ) ; vector < int > result ; for ( int i = lower ; i <= upper ; i += 2 ) { result . push_back ( i ) ; } return result ; }
|
g-transeval-cpp_data_205 | bool IsStepNum ( int n ) { int prev_digit = -1 ; while ( n > 0 ) { int cur_digit = n % 10 ; if ( prev_digit == -1 ) { prev_digit = cur_digit ; } else { if ( abs ( prev_digit - cur_digit ) != 1 ) { return false ; } } prev_digit = cur_digit ; n /= 10 ; } return true ; }
|
g-transeval-cpp_data_206 | int NumOfWays ( int n , int k ) { int p = 1 ; if ( k % 2 ) { p = -1 ; } return ( pow ( n - 1 , k ) + p * ( n - 1 ) ) / n ; }
|
g-transeval-cpp_data_207 | vector < int > FindDivisors ( int n ) { vector < int > v ; for ( int i = 1 ; i <= sqrt ( n ) ; i ++ ) { if ( n % i == 0 ) { if ( n / i == i ) { v . push_back ( i ) ; } else { v . push_back ( i ) ; v . push_back ( n / i ) ; } } } return v ; }
|
g-transeval-cpp_data_208 | int EggDrop ( int n , int k ) { if ( k == 1 || k == 0 ) { return k ; } if ( n == 1 ) { return k ; } int min = INT_MAX ; for ( int x = 1 ; x <= k ; x ++ ) { int res = max ( EggDrop ( n - 1 , x - 1 ) , EggDrop ( n , k - x ) ) ; if ( res < min ) { min = res ; } } return min + 1 ; }
|
g-transeval-cpp_data_209 | bool IsPowerOfTwo ( int n ) { if ( n == 0 ) { return false ; } return ceil ( log2 ( n ) ) == floor ( log2 ( n ) ) ; }
|
g-transeval-cpp_data_210 | string ShortestPalindrome ( string s ) { int n = s . length ( ) ; vector < string > v ; for ( int i = 0 ; i < n ; i ++ ) { int l = i ; int r = i ; string ans1 ; string ans2 ; while ( l >= 0 && r < n && s [ l ] == s [ r ] ) { ans1 += s [ l ] ; l -- ; r ++ ; } l = i - 1 ; r = i ; while ( l >= 0 && r < n && s [ l ] == s [ r ] ) { ans2 += s [ l ] ; l -- ; r ++ ; } v . push_back ( ans1 ) ; v . push_back ( ans2 ) ; } string ans = v [ 0 ] ; for ( int i = 0 ; i < v . size ( ) ; i ++ ) { if ( v [ i ] != "" ) { ans = min ( ans , v [ i ] ) ; } } return ans ; }
|
g-transeval-cpp_data_211 | int MinimumAdjacentDifference ( vector < int > a , int n , int k ) { int min_diff = INT_MAX ; for ( int i = 0 ; i <= k ; i ++ ) { int max_diff = INT_MIN ; for ( int j = 0 ; j < n - k - 1 ; j ++ ) { for ( int p = i ; p <= i + j ; p ++ ) { max_diff = max ( max_diff , a [ p + 1 ] - a [ p ] ) ; } } min_diff = min ( min_diff , max_diff ) ; } return min_diff ; }
|
g-transeval-cpp_data_212 | int Cal ( vector < int > a , int mid ) { int chocolate = 0 ; for ( auto i : a ) { if ( i >= mid ) { chocolate += i - mid ; } } return chocolate ; }
|
g-transeval-cpp_data_213 | bool Check ( int v , vector < int > a , int m ) { int tec = 0 , ans = 0 ; vector < int > b ( a . size ( ) + 3 ) ; for ( int i = 0 ; i < a . size ( ) ; i ++ ) { tec -= b [ i ] ; if ( a [ i ] + tec < v ) { int mov = v - a [ i ] - tec ; ans = ans + mov ; tec += mov ; b [ i + 2 ] = mov ; } } return ans <= m ; }
|
g-transeval-cpp_data_214 | int LargestNum ( vector < int > arr ) { int res = 0 ; sort ( arr . begin ( ) , arr . end ( ) ) ; int l = 0 , r = arr . size ( ) - 1 ; while ( l < r ) { int sum = arr [ l ] + arr [ r ] ; if ( sum == 0 ) { res = max ( res , max ( arr [ l ] , arr [ r ] ) ) ; return res ; } else if ( sum < 0 ) { l ++ ; } else { r -- ; } } return res ; }
|
g-transeval-cpp_data_215 | int BinarySearch ( vector < int > p , int n ) { int i = 0 ; int j = p . size ( ) - 1 ; int index = -1 ; while ( i <= j ) { int mid = i + ( j - i ) / 2 ; if ( p [ mid ] >= n ) { index = mid ; j = mid - 1 ; } else { i = mid + 1 ; } } return index ; }
|
g-transeval-cpp_data_216 | int FindMinLength ( vector < int > arr ) { int index = arr . size ( ) - 1 ; while ( index > 0 && arr [ index ] >= arr [ index - 1 ] ) { index -- ; } return index ; }
|
g-transeval-cpp_data_217 | int MinDigits ( int n , int k ) { int digits_num = floor ( log10 ( n ) + 1 ) ; int temp_sum = 0 ; int temp = digits_num ; int result = 0 ; int x , v ; int sum = 0 ; int num2 = n ; while ( num2 != 0 ) { sum += num2 % 10 ; num2 /= 10 ; } if ( sum <= k ) { x = 0 ; } else { while ( temp > 0 ) { v = n / pow ( 10 , temp - 1 ) ; temp_sum += v % 10 ; if ( temp_sum >= k ) { v /= 10 ; v ++ ; result = v * pow ( 10 , temp ) ; break ; } temp -- ; } x = result - n ; return x ; } return - 1 ; }
|
g-transeval-cpp_data_218 | int CheckForPerfectSquare ( vector < int > arr , int i , int j ) { int mid , sum = 0 ; for ( int m = i ; m <= j ; m ++ ) { sum += arr [ m ] ; } int low = 0 , high = sum / 2 ; while ( low <= high ) { mid = low + ( high - low ) / 2 ; if ( mid * mid == sum ) { return mid ; } else if ( mid * mid > sum ) { high = mid - 1 ; } else { low = mid + 1 ; } } return -1 ; }
|
g-transeval-cpp_data_219 | int MinFlips ( vector < vector < int > > mat , string s ) { int n = mat . size ( ) ; int m = mat [ 0 ] . size ( ) ; int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 0 ; j < m ; j ++ ) { if ( mat [ i ] [ j ] != s [ i + j ] - '0' ) { count ++ ; } } } return count ; }
|
g-transeval-cpp_data_220 | vector < vector < int > > ConstructTree ( int n , vector < vector < int > > edges ) { vector < vector < int > > adjl ; for ( int i = 0 ; i < n ; i ++ ) { adjl . push_back ( vector < int > ( ) ) ; } for ( auto e : edges ) { int u = e [ 0 ] ; int v = e [ 1 ] ; adjl [ u ] . push_back ( v ) ; adjl [ v ] . push_back ( u ) ; } return adjl ; }
|
g-transeval-cpp_data_221 | int FindSumOfValues ( int v , vector < int > parent , vector < int > values_children ) { int cur_node = v ; int sum = 0 ; while ( cur_node != -1 ) { sum += values_children [ cur_node ] ; cur_node = parent [ cur_node ] ; } return sum ; }
|
g-transeval-cpp_data_222 | int GetDistinct ( int d , int count ) { int num = 0 ; count = pow ( 10 , count - 1 ) ; while ( count > 0 ) { num += count * d ; count /= 10 ; } return num ; }
|
g-transeval-cpp_data_223 | bool IsIncreasing ( vector < int > arr ) { for ( int i = 0 ; i < arr . size ( ) - 1 ; i ++ ) { if ( arr [ i ] > arr [ i + 1 ] ) { return false ; } } return true ; }
|
g-transeval-cpp_data_224 | int MinAdjSwaps ( vector < vector < int > > mat ) { int n = mat . size ( ) ; vector < int > cnt_zero ( n ) ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = n - 1 ; j >= 0 && mat [ i ] [ j ] == 0 ; j -- ) { cnt_zero [ i ] ++ ; } } int cnt_swaps = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( cnt_zero [ i ] < ( n - i - 1 ) ) { int first = i ; while ( first < n && cnt_zero [ first ] < ( n - i - 1 ) ) { first ++ ; } if ( first == n ) { return -1 ; } while ( first > i ) { swap ( cnt_zero [ first ] , cnt_zero [ first - 1 ] ) ; first -- ; cnt_swaps ++ ; } } } return cnt_swaps ; }
|
g-transeval-cpp_data_225 | int Solve ( vector < int > values , vector < int > salary , int mod ) { int ret = 1 ; int amt = 0 ; sort ( values . begin ( ) , values . end ( ) ) ; sort ( salary . begin ( ) , salary . end ( ) ) ; while ( salary . size ( ) > 0 ) { while ( values . size ( ) > 0 && values [ values . size ( ) - 1 ] >= salary [ salary . size ( ) - 1 ] ) { amt ++ ; values . pop_back ( ) ; } if ( amt == 0 ) { return 0 ; } ret *= amt -- ; ret %= mod ; salary . pop_back ( ) ; } return ret ; }
|
g-transeval-cpp_data_226 | vector < int > OrganizeInOrder ( vector < int > vec , vector < char > op , int n ) { vector < int > result ( n ) ; sort ( vec . begin ( ) , vec . end ( ) ) ; int i = 0 , j = n - 1 , k = 0 ; while ( i <= j && k <= n - 2 ) { if ( op [ k ] == '<' ) { result [ k ] = vec [ i ++ ] ; } else { result [ k ] = vec [ j -- ] ; } k ++ ; } result [ n - 1 ] = vec [ i ] ; return result ; }
|
g-transeval-cpp_data_227 | int CountPoints ( int n , int m , vector < int > a , vector < int > b , int x , int y ) { sort ( a . begin ( ) , a . end ( ) ) ; sort ( b . begin ( ) , b . end ( ) ) ; int j = 0 ; int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { while ( j < m ) { if ( a [ i ] + y < b [ j ] ) { break ; } if ( b [ j ] >= a [ i ] - x && b [ j ] <= a [ i ] + y ) { count ++ ; j ++ ; break ; } else { j ++ ; } } } return count ; }
|
g-transeval-cpp_data_228 | bool AreSame ( vector < int > a , vector < int > b ) { sort ( a . begin ( ) , a . end ( ) ) ; sort ( b . begin ( ) , b . end ( ) ) ; return a == b ; }
|
g-transeval-cpp_data_229 | int CountNumberOfStrings ( string s ) { int n = s . length ( ) - 1 ; int count = pow ( 2 , n ) ; return count ; }
|
g-transeval-cpp_data_230 | vector < int > PrimePower ( int x ) { vector < int > prime_pow ; for ( int i = 2 ; i * i <= x ; i ++ ) { if ( x % i == 0 ) { int p = 1 ; while ( x % i == 0 ) { x /= i ; p *= i ; } prime_pow . push_back ( p ) ; } } if ( x > 1 ) { prime_pow . push_back ( x ) ; } return prime_pow ; }
|
g-transeval-cpp_data_231 | bool IsPerfect ( int n0 ) { double n = sqrt ( n0 ) ; if ( floor ( n ) != ceil ( n ) ) { return false ; } return true ; }
|
g-transeval-cpp_data_232 | int FindSum ( int l , int r ) { vector < int > arr ; int i = 0 ; int x = 2 ; while ( i <= r ) { arr . push_back ( i + x ) ; if ( i + 1 <= r ) { arr . push_back ( i + 1 + x ) ; } x *= -1 ; i += 2 ; } int sum = 0 ; for ( i = l ; i <= r ; ++ i ) { sum += arr [ i ] ; } return sum ; }
|
g-transeval-cpp_data_233 | int Results ( int n , int k ) { return round ( pow ( n , 1.0 / pow ( 2 , k ) ) ) ; }
|
g-transeval-cpp_data_234 | vector < int > Factors ( int n ) { vector < int > v ; v . push_back ( 1 ) ; for ( int i = 2 ; i <= sqrt ( n ) ; i ++ ) { if ( n % i == 0 ) { v . push_back ( i ) ; if ( n / i != i ) { v . push_back ( n / i ) ; } } } return v ; }
|
g-transeval-cpp_data_235 | int SmallestNum ( int n ) { double x = pow ( 10.0 , ( n - 1 ) / 2.0 ) ; return ceil ( x ) ; }
|
g-transeval-cpp_data_236 | int Smallest ( string s ) { vector < int > a ( s . length ( ) ) ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { a [ i ] = s [ i ] - '0' ; } vector < int > b ; for ( int i = 0 ; i < a . size ( ) ; i ++ ) { if ( ( a [ i ] ) % 2 != 0 ) { b . push_back ( a [ i ] ) ; } } sort ( b . begin ( ) , b . end ( ) ) ; if ( b . size ( ) > 1 ) { return b [ 0 ] * 10 + b [ 1 ] ; } return -1 ; }
|
g-transeval-cpp_data_237 | vector < double > Diagonals ( double a , double b , double c , double d ) { vector < double > ans ; ans . push_back ( sqrt ( ( a * c + b * d ) * ( a * d + b * c ) / ( a * b + c * d ) ) ) ; ans . push_back ( sqrt ( ( a * c + b * d ) * ( a * b + c * d ) / ( a * d + b * c ) ) ) ; return ans ; }
|
g-transeval-cpp_data_238 | int FindNumberOfDigits ( int n , int bas ) { int dig = floor ( log ( n ) / log ( bas ) ) + 1 ; return dig ; }
|
g-transeval-cpp_data_239 | double NGon ( int n ) { double pro_angle_var ; if ( n % 4 == 0 ) { pro_angle_var = numbers :: pi * ( 180.0 / n ) / 180 ; } else { pro_angle_var = numbers :: pi * ( 180.0 / ( 2 * n ) ) / 180 ; } double neg_x = 1.0e+99 , pos_x = -1.0e+99 , neg_y = 1.0e+99 , pos_y = -1.0e+99 ; for ( int j = 0 ; j < n ; ++ j ) { double px = cos ( 2 * numbers :: pi * j / n + pro_angle_var ) ; double py = sin ( 2 * numbers :: pi * j / n + pro_angle_var ) ; neg_x = min ( neg_x , px ) ; pos_x = max ( pos_x , px ) ; neg_y = min ( neg_y , py ) ; pos_y = max ( pos_y , py ) ; } double opt2 = max ( pos_x - neg_x , pos_y - neg_y ) ; return opt2 / sin ( numbers :: pi / n ) / 2 ; }
|
g-transeval-cpp_data_240 | int FindMaxK ( int n ) { int p = log2 ( n ) ; return pow ( 2 , p ) ; }
|
g-transeval-cpp_data_241 | int NthFibo ( int n ) { double a = ( pow ( 5 , 0.5 ) + 1 ) / 2 ; double b = ( -1 * pow ( 5 , 0.5 ) + 1 ) / 2 ; double r = pow ( 5 , 0.5 ) ; double ans = ( pow ( a , n ) - pow ( b , n ) ) / r ; return ans ; }
|
g-transeval-cpp_data_242 | double FindProb ( int l , int r ) { double count_of_ps = floor ( sqrt ( r ) ) - ceil ( sqrt ( l ) ) + 1 ; double total = r - l + 1 ; double prob = count_of_ps / total ; return prob ; }
|
g-transeval-cpp_data_243 | int PreviousFibonacci ( int n ) { double a = n / ( ( 1 + sqrt ( 5 ) ) / 2.0 ) ; return round ( a ) ; }
|
g-transeval-cpp_data_244 | vector < int > DistPrime ( vector < int > arr , vector < int > all_primes ) { vector < int > list1 ; for ( int i : all_primes ) { for ( int j : arr ) { if ( j % i == 0 ) { list1 . push_back ( i ) ; break ; } } } return list1 ; }
|
g-transeval-cpp_data_245 | vector < int > GetArray ( int n ) { vector < int > ans ; int p2 = 1 ; while ( n > 0 ) { if ( n % 2 == 1 ) { ans . push_back ( p2 ) ; } n >>= 1 ; p2 *= 2 ; } return ans ; }
|
g-transeval-cpp_data_246 | int MaximumLength ( vector < int > a ) { vector < int > counts ( 11 ) ; int ans = 0 ; for ( int index = 0 ; index < a . size ( ) ; index ++ ) { counts [ a [ index ] ] += 1 ; vector < int > k ; for ( auto i : counts ) { if ( i != 0 ) { k . push_back ( i ) ; } } sort ( k . begin ( ) , k . end ( ) ) ; if ( k . size ( ) == 1 || ( k [ 0 ] == k [ k . size ( ) - 2 ] && k [ k . size ( ) - 1 ] - k [ k . size ( ) - 2 ] == 1 ) || ( k [ 0 ] == 1 && k [ 1 ] == k [ k . size ( ) - 1 ] ) ) { ans = index ; } } return ans + 1 ; }
|
g-transeval-cpp_data_247 | int MaxEdges ( int n ) { int edges = floor ( n * n / 4 ) ; return edges ; }
|
g-transeval-cpp_data_248 | int FindK ( int n , int k ) { vector < int > a ; for ( int i = 1 ; i < n ; i ++ ) { if ( i % 2 == 1 ) { a . push_back ( i ) ; } } for ( int i = 1 ; i < n ; i ++ ) { if ( i % 2 == 0 ) { a . push_back ( i ) ; } } return a [ k - 1 ] ; }
|
g-transeval-cpp_data_249 | bool IsKeith ( int x , int temp ) { vector < int > terms ; int n = 0 ; while ( temp > 0 ) { terms . push_back ( temp % 10 ) ; temp = temp / 10 ; n ++ ; } reverse ( terms . begin ( ) , terms . end ( ) ) ; int next_term = 0 , i = n ; while ( next_term < x ) { next_term = 0 ; for ( int j = 1 ; j <= n ; j ++ ) { next_term += terms [ i - j ] ; } terms . push_back ( next_term ) ; i ++ ; } return next_term == x ; }
|
g-transeval-cpp_data_250 | bool Factors ( int n , int k ) { vector < int > v ; while ( n % 2 == 0 ) { v . push_back ( 2 ) ; n /= 2 ; } if ( v . size ( ) >= k ) { return true ; } for ( int i = 3 ; i * i <= n ; i += 2 ) { while ( n % i == 0 ) { n = n / i ; v . push_back ( i ) ; } if ( v . size ( ) >= k ) { return true ; } } if ( n > 2 ) { v . push_back ( n ) ; } if ( v . size ( ) >= k ) { return true ; } return false ; }
|
g-transeval-cpp_data_251 | vector < string > SeparateParenGroups ( string paren_string ) { vector < string > all_parens ; string current_paren ; int current_depth = 0 ; for ( auto c : paren_string ) { if ( c == '(' ) { current_depth += 1 ; current_paren += c ; } else if ( c == ')' ) { current_depth -= 1 ; current_paren += c ; if ( current_depth == 0 ) { all_parens . push_back ( current_paren ) ; current_paren . clear ( ) ; } } } return all_parens ; }
|
g-transeval-cpp_data_252 | vector < int > ParseNestedParens ( string paren_string ) { vector < int > all_levels ; int level = 0 ; int max_level = 0 ; for ( int i = 0 ; i < paren_string . length ( ) ; i ++ ) { char chr = paren_string [ i ] ; if ( chr == '(' ) { level += 1 ; if ( level > max_level ) { max_level = level ; } } if ( chr == ')' ) { level -= 1 ; if ( level == 0 ) { all_levels . push_back ( max_level ) ; max_level = 0 ; } } } return all_levels ; }
|
g-transeval-cpp_data_253 | vector < string > FilterBySubstring ( vector < string > strings , string substring ) { vector < string > result ; for ( auto & s : strings ) { if ( s . find ( substring ) != string :: npos ) { result . push_back ( s ) ; } } return result ; }
|
g-transeval-cpp_data_254 | vector < int > RollingMax ( vector < int > numbers ) { int running_max = 0 ; vector < int > result ; for ( int n : numbers ) { if ( n > running_max ) { running_max = n ; } result . push_back ( running_max ) ; } return result ; }
|
g-transeval-cpp_data_255 | string MakePalindrome ( string s ) { if ( s . empty ( ) ) { return "" ; } for ( int i = 0 ; i < s . length ( ) ; i ++ ) { string r_str = s . substr ( i ) ; if ( r_str == string ( r_str . rbegin ( ) , r_str . rend ( ) ) ) { string n_str = s . substr ( 0 , i ) ; string n2_str ( n_str . rbegin ( ) , n_str . rend ( ) ) ; return s + n2_str ; } } return s . substr ( 0 , s . length ( ) - 1 ) + string ( s . rbegin ( ) , s . rend ( ) ) ; }
|
g-transeval-cpp_data_256 | string StringXor ( string a , string b ) { string result ; for ( int i = 0 ; i < a . length ( ) ; i ++ ) { if ( a [ i ] == b [ i ] ) { result += '0' ; } else { result += '1' ; } } return result ; }
|
g-transeval-cpp_data_257 | string Longest ( vector < string > strings ) { if ( strings . empty ( ) ) { return "" ; } int max_len = ranges :: max ( views :: transform ( strings , & string :: size ) ) ; for ( auto & s : strings ) { if ( s . length ( ) == max_len ) { return s ; } } return "" ; }
|
g-transeval-cpp_data_258 | string StringSequence ( int n ) { string s ; for ( int i = 0 ; i < n ; i ++ ) { s += to_string ( i ) ; s += " " ; } s += to_string ( n ) ; return s ; }
|
g-transeval-cpp_data_259 | int CountDistinctCharacter ( string s ) { unordered_set < char > distinct ; for ( char c : views :: transform ( s , :: tolower ) ) { distinct . insert ( c ) ; } return distinct . size ( ) ; }
|
g-transeval-cpp_data_260 | int HowManyTimes ( string s , string sub ) { int times = 0 ; for ( int i = 0 ; i <= int ( s . length ( ) - sub . length ( ) ) ; i ++ ) { if ( s . substr ( i , sub . length ( ) ) == sub ) { times += 1 ; } } return times ; }
|
g-transeval-cpp_data_261 | string SortNumbers ( string numbers ) { unordered_map < string , int > to_num = { { "zero" , 0 } , { "one" , 1 } , { "two" , 2 } , { "three" , 3 } , { "four" , 4 } , { "five" , 5 } , { "six" , 6 } , { "seven" , 7 } , { "eight" , 8 } , { "nine" , 9 } } ; unordered_map < int , string > from_num = { { 0 , "zero" } , { 1 , "one" } , { 2 , "two" } , { 3 , "three" } , { 4 , "four" } , { 5 , "five" } , { 6 , "six" } , { 7 , "seven" } , { 8 , "eight" } , { 9 , "nine" } } ; vector < int > ints ; string current ; for ( int i = 0 ; i <= numbers . length ( ) ; i ++ ) { if ( i == numbers . length ( ) || numbers [ i ] == ' ' ) { if ( to_num . count ( current ) ) { ints . push_back ( to_num [ current ] ) ; current . clear ( ) ; } } else { current += numbers [ i ] ; } } sort ( ints . begin ( ) , ints . end ( ) ) ; string result ; for ( int i = 0 ; i < ints . size ( ) ; i ++ ) { result += from_num [ ints [ i ] ] ; if ( i != ints . size ( ) - 1 ) { result += " " ; } } return result ; }
|
g-transeval-cpp_data_262 | vector < double > FindClosestElements ( vector < double > numbers ) { vector < double > closest_pair { numbers [ 0 ] , numbers [ 1 ] } ; double distance = abs ( closest_pair [ 0 ] - closest_pair [ 1 ] ) ; for ( int i = 0 ; i < numbers . size ( ) ; i ++ ) { for ( int j = i + 1 ; j < numbers . size ( ) ; j ++ ) { if ( abs ( numbers [ i ] - numbers [ j ] ) < distance ) { closest_pair [ 0 ] = numbers [ i ] ; closest_pair [ 1 ] = numbers [ j ] ; distance = abs ( numbers [ i ] - numbers [ j ] ) ; } } } sort ( closest_pair . begin ( ) , closest_pair . end ( ) ) ; return closest_pair ; }
|
g-transeval-cpp_data_263 | vector < double > RescaleToUnit ( vector < double > numbers ) { double min_num = * min_element ( numbers . begin ( ) , numbers . end ( ) ) ; double max_num = * max_element ( numbers . begin ( ) , numbers . end ( ) ) ; vector < double > result ; for ( double n : numbers ) { result . push_back ( ( n - min_num ) / ( max_num - min_num ) ) ; } return result ; }
|
g-transeval-cpp_data_264 | vector < int > FilterIntegers ( vector < any > values ) { vector < int > result ; for ( auto & e : values ) { if ( e . type ( ) == typeid ( int ) ) { result . push_back ( any_cast < int > ( e ) ) ; } } return result ; }
|
g-transeval-cpp_data_265 | vector < int > removeDuplicates ( vector < int > numbers ) { unordered_map < int , int > counter ; for ( int i : numbers ) { counter [ i ] = counter [ i ] + 1 ; } vector < int > result ; for ( int i : numbers ) { if ( counter [ i ] == 1 ) { result . push_back ( i ) ; } } return result ; }
|
g-transeval-cpp_data_266 | string FlipCase ( string s ) { string result ; for ( char c : s ) { if ( islower ( c ) ) { result += toupper ( c ) ; } else { result += tolower ( c ) ; } } return result ; }
|
g-transeval-cpp_data_267 | vector < string > FilterByPrefix ( vector < string > strings , string prefix ) { vector < string > result ; for ( int i = 0 ; i < strings . size ( ) ; i ++ ) { if ( strings [ i ] . starts_with ( prefix ) ) { result . push_back ( strings [ i ] ) ; } } return result ; }
|
g-transeval-cpp_data_268 | double FindZero ( vector < double > xs ) { double ans = 0 ; double value = 0 ; for ( int i = 0 ; i < xs . size ( ) ; i ++ ) { value += xs [ i ] * pow ( ans , i ) ; } while ( abs ( value ) > 1e-6 ) { double driv = 0 ; for ( int i = 1 ; i < xs . size ( ) ; i ++ ) { driv += xs [ i ] * pow ( ans , i - 1 ) * i ; } ans -= value / driv ; value = 0 ; for ( int i = 0 ; i < xs . size ( ) ; i ++ ) { value += xs [ i ] * pow ( ans , i ) ; } } return ans ; }
|
g-transeval-cpp_data_269 | vector < int > SortThird ( vector < int > l ) { vector < int > thirds ; for ( int i = 0 ; i < l . size ( ) ; i += 3 ) { thirds . push_back ( l [ i ] ) ; } sort ( thirds . begin ( ) , thirds . end ( ) ) ; vector < int > result ; for ( int i = 0 ; i < l . size ( ) ; i ++ ) { if ( i % 3 == 0 ) { result . push_back ( thirds [ i / 3 ] ) ; } else { result . push_back ( l [ i ] ) ; } } return result ; }
|
g-transeval-cpp_data_270 | vector < int > Unique ( vector < int > l ) { unordered_set < int > s ( l . begin ( ) , l . end ( ) ) ; vector < int > result ( s . begin ( ) , s . end ( ) ) ; sort ( result . begin ( ) , result . end ( ) ) ; return result ; }
|
g-transeval-cpp_data_271 | double MaxElement ( vector < double > l ) { return * max_element ( l . begin ( ) , l . end ( ) ) ; }
|
g-transeval-cpp_data_272 | bool TriplesSumToZero ( vector < int > l ) { for ( int i = 0 ; i < l . size ( ) ; i ++ ) { for ( int j = i + 1 ; j < l . size ( ) ; j ++ ) { for ( int k = j + 1 ; k < l . size ( ) ; k ++ ) { if ( l [ i ] + l [ j ] + l [ k ] == 0 ) { return true ; } } } } return false ; }
|
g-transeval-cpp_data_273 | int Fib4 ( int n ) { vector < int > results { 0 , 0 , 2 , 0 } ; for ( int i = 4 ; i <= n ; i ++ ) { results . push_back ( results [ i - 4 ] + results [ i - 3 ] + results [ i - 2 ] + results [ i - 1 ] ) ; } return results [ n ] ; }
|
g-transeval-cpp_data_274 | bool IsPalindrome ( string text ) { string pr ( text . rbegin ( ) , text . rend ( ) ) ; return pr == text ; }
|
g-transeval-cpp_data_275 | string RemoveVowels ( string text ) { string result ; string vowels = "aeiou" ; for ( char ch : text ) { if ( vowels . find ( tolower ( ch ) ) == string :: npos ) { result += ch ; } } return result ; }
|
g-transeval-cpp_data_276 | bool SameChars ( string s0 , string s1 ) { unordered_set < char > set0 ; for ( char c : s0 ) { set0 . insert ( c ) ; } unordered_set < char > set1 ; for ( char c : s1 ) { set1 . insert ( c ) ; } return set0 == set1 ; }
|
g-transeval-cpp_data_277 | vector < int > Common ( vector < int > l1 , vector < int > l2 ) { unordered_set < int > us ; for ( int e1 : l1 ) { for ( int e2 : l2 ) { if ( e1 == e2 ) { us . insert ( e1 ) ; } } } vector < int > ret ( us . begin ( ) , us . end ( ) ) ; sort ( ret . begin ( ) , ret . end ( ) ) ; return ret ; }
|
g-transeval-cpp_data_278 | 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_279 | string CircularShift ( int x , int shift ) { string xs = to_string ( x ) ; if ( shift > xs . length ( ) ) { return string ( xs . rbegin ( ) , xs . rend ( ) ) ; } return xs . substr ( xs . length ( ) - shift ) + xs . substr ( 0 , xs . length ( ) - shift ) ; }
|
g-transeval-cpp_data_280 | int Search ( vector < int > lst ) { unordered_map < int , int > counter ; for ( int i : lst ) { counter [ i ] += 1 ; } int ans = -1 ; for ( auto & [ key , value ] : counter ) { if ( value >= key && key > ans ) { ans = key ; } } return ans ; }
|
g-transeval-cpp_data_281 | int SmallestChange ( vector < int > arr ) { int ans = 0 ; for ( int i = 0 ; i < arr . size ( ) / 2 ; i ++ ) { if ( arr [ i ] != arr [ arr . size ( ) - i - 1 ] ) { ans += 1 ; } } return ans ; }
|
g-transeval-cpp_data_282 | vector < string > TotalMatch ( vector < string > lst1 , vector < string > lst2 ) { int sum1 = 0 ; for ( auto & st : lst1 ) { sum1 += st . length ( ) ; } int sum2 = 0 ; for ( auto & st : lst2 ) { sum2 += st . length ( ) ; } return sum1 > sum2 ? lst2 : lst1 ; }
|
g-transeval-cpp_data_283 | bool IsHappy ( string s ) { if ( s . length ( ) < 3 ) { return false ; } for ( int i = 0 ; i < s . length ( ) - 2 ; i ++ ) { if ( s [ i ] == s [ i + 1 ] || s [ i ] == s [ i + 2 ] || s [ i + 1 ] == s [ i + 2 ] ) { return false ; } } return true ; }
|
g-transeval-cpp_data_284 | vector < string > NumericalLetterGrade ( vector < double > grades ) { vector < string > letter_grade ; for ( double gpa : grades ) { if ( gpa == 4.0 ) { letter_grade . push_back ( "A+" ) ; } else if ( gpa > 3.7 ) { letter_grade . push_back ( "A" ) ; } else if ( gpa > 3.3 ) { letter_grade . push_back ( "A-" ) ; } else if ( gpa > 3.0 ) { letter_grade . push_back ( "B+" ) ; } else if ( gpa > 2.7 ) { letter_grade . push_back ( "B" ) ; } else if ( gpa > 2.3 ) { letter_grade . push_back ( "B-" ) ; } else if ( gpa > 2.0 ) { letter_grade . push_back ( "C+" ) ; } else if ( gpa > 1.7 ) { letter_grade . push_back ( "C" ) ; } else if ( gpa > 1.3 ) { letter_grade . push_back ( "C-" ) ; } else if ( gpa > 1.0 ) { letter_grade . push_back ( "D+" ) ; } else if ( gpa > 0.7 ) { letter_grade . push_back ( "D" ) ; } else if ( gpa > 0.0 ) { letter_grade . push_back ( "D-" ) ; } else { letter_grade . push_back ( "E" ) ; } } return letter_grade ; }
|
g-transeval-cpp_data_285 | string Solve ( int n ) { string bi_str ; int sum = 0 ; for ( char c : to_string ( n ) ) { sum += c - '0' ; } while ( sum > 0 ) { bi_str . insert ( 0 , to_string ( sum % 2 ) ) ; sum /= 2 ; } return bi_str ; }
|
g-transeval-cpp_data_286 | string AntiShuffle ( string s ) { string ret ; string current ; for ( int i = 0 ; i <= s . length ( ) ; i ++ ) { if ( i == s . length ( ) || s [ i ] == ' ' ) { sort ( current . begin ( ) , current . end ( ) ) ; if ( ! ret . empty ( ) ) { ret += ' ' ; } ret += current ; current . clear ( ) ; } else { current += s [ i ] ; } } return ret ; }
|
g-transeval-cpp_data_287 | vector < int > SortArray ( vector < int > array ) { if ( array . empty ( ) ) { return array ; } if ( ( array [ 0 ] + array [ array . size ( ) - 1 ] ) % 2 == 1 ) { sort ( array . begin ( ) , array . end ( ) ) ; } else { sort ( array . begin ( ) , array . end ( ) , greater < > ( ) ) ; } return array ; }
|
g-transeval-cpp_data_288 | string Encrypt ( string s ) { string ans ; for ( char c : s ) { if ( isalpha ( c ) ) { ans += ( char ) ( 'a' + ( c - 'a' + 4 ) % 26 ) ; } else { ans += c ; } } return ans ; }
|
g-transeval-cpp_data_289 | int IsBored ( string s ) { bool is_start = true ; int sum = 0 ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( s [ i ] == '.' || s [ i ] == '?' || s [ i ] == '!' ) { is_start = true ; } else if ( is_start ) { if ( s [ i ] == ' ' ) { continue ; } if ( s . substr ( i , 2 ) == "I " ) { sum += 1 ; } is_start = false ; } } return sum ; }
|
g-transeval-cpp_data_290 | string Encode ( string message ) { string vowels = "aeiouAEIOU" ; string ret ; for ( char c : message ) { if ( isupper ( c ) ) { c = tolower ( c ) ; if ( vowels . find ( c ) != string :: npos ) { c = 'a' + ( c - 'a' + 2 ) % 26 ; } } else if ( islower ( c ) ) { c = toupper ( c ) ; if ( vowels . find ( c ) != string :: npos ) { c = 'A' + ( c - 'A' + 2 ) % 26 ; } } ret += c ; } return ret ; }
|
g-transeval-cpp_data_291 | int Skjkasdkd ( vector < int > lst ) { int largest = 0 ; for ( int n : lst ) { if ( n > largest ) { bool prime = true ; for ( int i = 2 ; i < n ; i ++ ) { if ( n % i == 0 ) { prime = false ; } } if ( prime ) { largest = n ; } } } int sum = 0 ; string s = to_string ( largest ) ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { sum += s [ i ] - '0' ; } return sum ; }
|
g-transeval-cpp_data_292 | bool CheckDictCase ( unordered_map < string , string > dict ) { if ( dict . empty ( ) ) { return false ; } int is_lower = 0 ; int is_upper = 0 ; for ( auto & [ key , value ] : dict ) { for ( char c : key ) { if ( islower ( c ) ) { is_lower = 1 ; } else if ( isupper ( c ) ) { is_upper = 1 ; } else { return false ; } } } return is_lower + is_upper == 1 ; }
|
g-transeval-cpp_data_293 | int Multiply ( int a , int b ) { return ( abs ( a ) % 10 ) * ( abs ( b ) % 10 ) ; }
|
g-transeval-cpp_data_294 | int CountUpper ( string s ) { string u_vowel = "AEIOU" ; int count = 0 ; for ( int i = 0 ; i < s . length ( ) ; i += 2 ) { if ( u_vowel . find ( s [ i ] ) != string :: npos ) { count += 1 ; } } return count ; }
|
g-transeval-cpp_data_295 | vector < string > ByLength ( vector < int > arr ) { map < int , string > num_to = { { 1 , "One" } , { 2 , "Two" } , { 3 , "Three" } , { 4 , "Four" } , { 5 , "Five" } , { 6 , "Six" } , { 7 , "Seven" } , { 8 , "Eight" } , { 9 , "Nine" } } ; vector < int > sorted_arr ( arr ) ; sort ( sorted_arr . begin ( ) , sorted_arr . end ( ) , greater < > ( ) ) ; vector < string > new_arr ; for ( int n : sorted_arr ) { if ( n >= 1 && n <= 9 ) { new_arr . push_back ( num_to [ n ] ) ; } } return new_arr ; }
|
g-transeval-cpp_data_296 | vector < int > f ( int n ) { int sum = 0 ; int prod = 1 ; vector < int > result ; for ( int i = 1 ; i <= n ; i ++ ) { sum += i ; prod *= i ; if ( i % 2 == 0 ) { result . push_back ( prod ) ; } else { result . push_back ( sum ) ; } } return result ; }
|
g-transeval-cpp_data_297 | vector < int > EvenOddPalindrome ( int n ) { int even_count = 0 , odd_count = 0 ; for ( int i = 1 ; i <= n ; i ++ ) { string s = to_string ( i ) ; string r_str ( s . rbegin ( ) , s . rend ( ) ) ; if ( s == r_str ) { if ( i % 2 == 1 ) { odd_count += 1 ; } else { even_count += 1 ; } } } return { even_count , odd_count } ; }
|
g-transeval-cpp_data_298 | unordered_map < char , int > Histogram ( string test ) { unordered_map < char , int > count ; int max = 0 ; for ( int i = 0 ; i < test . length ( ) ; i ++ ) { if ( test [ i ] != ' ' ) { count [ test [ i ] ] += 1 ; if ( count [ test [ i ] ] > max ) { max = count [ test [ i ] ] ; } } } unordered_map < char , int > result ; for ( auto & [ key , value ] : count ) { if ( value == max ) { result [ key ] = value ; } } return result ; }
|
g-transeval-cpp_data_299 | vector < string > ReverseDelete ( string s , string c ) { string ret ; for ( char ch : s ) { if ( c . find ( ch ) == string :: npos ) { ret += ch ; } } string flag = "False" ; if ( ret == string ( ret . rbegin ( ) , ret . rend ( ) ) ) { flag = "True" ; } return { ret , flag } ; }
|
g-transeval-cpp_data_300 | vector < int > SortArray ( vector < int > arr ) { vector < int > bin ; for ( int i : arr ) { int b = 0 ; int n = abs ( i ) ; while ( n > 0 ) { b += n % 2 ; n /= 2 ; } bin . push_back ( b ) ; } for ( int i = 0 ; i < arr . size ( ) ; i ++ ) { for ( int j = 1 ; j < arr . size ( ) ; j ++ ) { if ( bin [ j ] < bin [ j - 1 ] || ( bin [ j ] == bin [ j - 1 ] && arr [ j ] < arr [ j - 1 ] ) ) { swap ( bin [ j ] , bin [ j - 1 ] ) ; swap ( arr [ j ] , arr [ j - 1 ] ) ; } } } return arr ; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.