id
stringlengths 23
25
| content
stringlengths 46
1.27k
|
|---|---|
g-transeval-java_data_101
|
boolean isEvenParity ( int x ) { int parity = 0 ; while ( x != 0 ) { if ( x % 2 == 1 ) { parity ++ ; } x = x >> 1 ; } if ( parity % 2 == 0 ) { return true ; } else { return false ; } }
|
g-transeval-java_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-java_data_103
|
int logAToBaseB ( int a , int b ) { return a > b - 1 ? 1 + logAToBaseB ( a / b , b ) : 0 ; }
|
g-transeval-java_data_104
|
int usingBinarySearch ( int start , int end , int n , int s ) { if ( start >= end ) { return start ; } int mid = start + ( end - start ) / 2 ; int totalSum = n * ( n + 1 ) / 2 ; int midSum = mid * ( mid + 1 ) / 2 ; if ( totalSum - midSum <= s ) { return usingBinarySearch ( start , mid , n , s ) ; } return usingBinarySearch ( mid + 1 , end , n , s ) ; }
|
g-transeval-java_data_105
|
String minInt ( String s ) { char [ ] s1 = s . toCharArray ( ) ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( s1 [ i ] >= '5' ) { s1 [ i ] = ( char ) ( '9' - s1 [ i ] + '0' ) ; } } if ( s1 [ 0 ] == '0' ) { s1 [ 0 ] = '9' ; } return new String ( s1 ) ; }
|
g-transeval-java_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-java_data_107
|
boolean topsyTurvy ( String s ) { for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( s . charAt ( i ) == '2' || s . charAt ( i ) == '4' || s . charAt ( i ) == '5' || s . charAt ( i ) == '6' || s . charAt ( i ) == '7' || s . charAt ( i ) == '9' ) { return false ; } } return true ; }
|
g-transeval-java_data_108
|
int sumOfLastDig ( int n , int m ) { int sum = 0 ; int k = n / m ; int [ ] arr = new int [ 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-java_data_109
|
int totalPay ( int totalItems , int priceOfOneItem , int n , int m ) { int freeItems = 0 , actual = 0 ; freeItems = totalItems / ( n + m ) ; actual = totalItems - freeItems ; int amount = actual * priceOfOneItem ; return amount ; }
|
g-transeval-java_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-java_data_111
|
boolean isMersenne ( int n ) { while ( n != 0 ) { int r = n % 2 ; if ( r == 0 ) { return false ; } n /= 2 ; } return true ; }
|
g-transeval-java_data_112
|
int findThirdDigit ( int n ) { if ( n < 3 ) { return 0 ; } return ( n & 1 ) != 0 ? 1 : 6 ; }
|
g-transeval-java_data_113
|
boolean isOddLength ( int num ) { int count = 0 ; while ( num > 0 ) { num /= 10 ; count ++ ; } if ( count % 2 != 0 ) { return true ; } return false ; }
|
g-transeval-java_data_114
|
boolean 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-java_data_115
|
int bytes ( int kilobytes ) { int b = kilobytes * 1024 ; return b ; }
|
g-transeval-java_data_116
|
int octahedralNum ( int n ) { return n * ( 2 * n * n + 1 ) / 3 ; }
|
g-transeval-java_data_117
|
String checkEqual ( String s ) { for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( s . charAt ( i ) != '1' && s . charAt ( i ) != '0' && s . charAt ( i ) != '8' ) { return "No" ; } } int start = 0 , end = s . length ( ) - 1 ; while ( start < end ) { if ( s . charAt ( start ) != s . charAt ( end ) ) { return "No" ; } start ++ ; end -- ; } return "Yes" ; }
|
g-transeval-java_data_118
|
boolean isUndulating ( String n ) { if ( n . length ( ) <= 2 ) { return false ; } for ( int i = 2 ; i < n . length ( ) ; i ++ ) { if ( n . charAt ( i - 2 ) != n . charAt ( i ) ) { return false ; } } return true ; }
|
g-transeval-java_data_119
|
int firstDigit ( int n ) { while ( n >= 10 ) { n /= 10 ; } return n ; }
|
g-transeval-java_data_120
|
int countDigit ( int n ) { if ( n == 0 ) { return 0 ; } return 1 + countDigit ( n / 10 ) ; }
|
g-transeval-java_data_121
|
boolean isDivisibleBy5 ( String s ) { int n = s . length ( ) ; return s . charAt ( n - 1 ) - '0' == 0 || s . charAt ( n - 1 ) - '0' == 5 ; }
|
g-transeval-java_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-java_data_123
|
boolean onlyFirstAndLastAreSet ( int n ) { if ( n == 1 ) { return true ; } if ( n == 2 ) { return false ; } return ( ( n - 1 ) & ( n - 2 ) ) == 0 ; }
|
g-transeval-java_data_124
|
int divide ( int dividend , int divisor ) { int sign = ( ( dividend < 0 ) ^ ( divisor < 0 ) ) ? - 1 : 1 ; dividend = Math . abs ( dividend ) ; divisor = Math . abs ( divisor ) ; int quotient = 0 ; long temp = 0 ; for ( int i = 31 ; i >= 0 ; -- i ) { if ( temp + ( ( long ) divisor << i ) <= dividend ) { temp += ( long ) divisor << i ; quotient |= 1 << i ; } } if ( sign == - 1 ) { quotient = - quotient ; } return quotient ; }
|
g-transeval-java_data_125
|
char findProfession ( int level , int pos ) { if ( level == 1 ) { return 'e' ; } if ( findProfession ( level - 1 , ( pos + 1 ) / 2 ) == 'd' ) { return pos % 2 != 0 ? 'd' : 'e' ; } return pos % 2 != 0 ? 'e' : 'd' ; }
|
g-transeval-java_data_126
|
boolean hasCloseElements ( List < Double > numbers , double threshold ) { for ( int i = 0 ; i < numbers . size ( ) ; i ++ ) { for ( int j = i + 1 ; j < numbers . size ( ) ; j ++ ) { double distance = Math . abs ( numbers . get ( i ) - numbers . get ( j ) ) ; if ( distance < threshold ) return true ; } } return false ; }
|
g-transeval-java_data_127
|
double truncateNumber ( double number ) { return number % 1.0 ; }
|
g-transeval-java_data_128
|
boolean belowZero ( List < Integer > operations ) { int balance = 0 ; for ( var op : operations ) { balance += op ; if ( balance < 0 ) { return true ; } } return false ; }
|
g-transeval-java_data_129
|
double meanAbsoluteDeviation ( List < Double > numbers ) { double sumNum = 0 ; for ( var num : numbers ) { sumNum += num ; } double mean = sumNum / numbers . size ( ) ; double sumAbsDiff = 0 ; for ( var num : numbers ) { sumAbsDiff += Math . abs ( num - mean ) ; } return sumAbsDiff / numbers . size ( ) ; }
|
g-transeval-java_data_130
|
List < Integer > intersperse ( List < Integer > numbers , int delimiter ) { List < Integer > result = new ArrayList < > ( ) ; if ( numbers . isEmpty ( ) ) { return result ; } for ( int i = 0 ; i < numbers . size ( ) - 1 ; i ++ ) { result . add ( numbers . get ( i ) ) ; result . add ( delimiter ) ; } result . add ( numbers . get ( numbers . size ( ) - 1 ) ) ; return result ; }
|
g-transeval-java_data_131
|
List < Integer > sumProduct ( List < Integer > numbers ) { int sumValue = 0 ; int prodValue = 1 ; for ( Integer n : numbers ) { sumValue += n ; prodValue *= n ; } return Arrays . asList ( sumValue , prodValue ) ; }
|
g-transeval-java_data_132
|
List < String > allPrefixes ( String s ) { List < String > result = new ArrayList < > ( ) ; for ( int i = 1 ; i <= s . length ( ) ; i ++ ) { result . add ( s . substring ( 0 , i ) ) ; } return result ; }
|
g-transeval-java_data_133
|
List < Integer > parseMusic ( String musicString ) { StringBuilder current = new StringBuilder ( ) ; List < Integer > result = new ArrayList < > ( ) ; for ( int i = 0 ; i <= musicString . length ( ) ; i ++ ) { if ( i == musicString . length ( ) || musicString . charAt ( i ) == ' ' ) { if ( current . toString ( ) . equals ( "o" ) ) { result . add ( 4 ) ; } if ( current . toString ( ) . equals ( "o|" ) ) { result . add ( 2 ) ; } if ( current . toString ( ) . equals ( ".|" ) ) { result . add ( 1 ) ; } current . setLength ( 0 ) ; } else { current . append ( musicString . charAt ( i ) ) ; } } return result ; }
|
g-transeval-java_data_134
|
int strlen ( String s ) { return s . length ( ) ; }
|
g-transeval-java_data_135
|
List < Integer > factorize ( int n ) { List < Integer > factors = new ArrayList < > ( ) ; for ( int i = 2 ; i <= n ; i ++ ) { if ( n % i == 0 ) { n /= i ; factors . add ( i ) ; i -- ; } } return factors ; }
|
g-transeval-java_data_136
|
String concatenate ( List < String > strings ) { StringBuilder result = new StringBuilder ( ) ; for ( var s : strings ) { result . append ( s ) ; } return result . toString ( ) ; }
|
g-transeval-java_data_137
|
List < Double > getPositive ( List < Double > l ) { List < Double > result = new ArrayList < > ( ) ; for ( int i = 0 ; i < l . size ( ) ; i ++ ) { if ( l . get ( i ) > 0 ) { result . add ( l . get ( i ) ) ; } } return result ; }
|
g-transeval-java_data_138
|
List < Double > sortEven ( List < Double > l ) { List < Double > evens = new ArrayList < > ( ) ; for ( int i = 0 ; i < l . size ( ) ; i += 2 ) { evens . add ( l . get ( i ) ) ; } Collections . sort ( evens ) ; List < Double > result = new ArrayList < > ( ) ; for ( int i = 0 ; i < l . size ( ) ; i ++ ) { if ( i % 2 == 0 ) { result . add ( evens . get ( i / 2 ) ) ; } if ( i % 2 == 1 ) { result . add ( l . get ( i ) ) ; } } return result ; }
|
g-transeval-java_data_139
|
String decodeCyclic ( String s ) { StringBuilder output = new StringBuilder ( ) ; int i = 0 ; while ( i <= s . length ( ) - 3 ) { String x = s . charAt ( i + 2 ) + s . substring ( i , i + 2 ) ; output . append ( x ) ; i += 3 ; } return output . toString ( ) + s . substring ( i ) ; }
|
g-transeval-java_data_140
|
int carRaceCollision ( int n ) { return ( int ) Math . pow ( n , 2 ) ; }
|
g-transeval-java_data_141
|
List < Integer > incrList ( List < Integer > l ) { List < Integer > result = new ArrayList < > ( ) ; for ( int i : l ) { result . add ( i + 1 ) ; } return result ; }
|
g-transeval-java_data_142
|
boolean pairsSumToZero ( List < Integer > l ) { for ( int i = 0 ; i < l . size ( ) ; i ++ ) { for ( int j = i + 1 ; j < l . size ( ) ; j ++ ) { if ( l . get ( i ) + l . get ( j ) == 0 ) { return true ; } } } return false ; }
|
g-transeval-java_data_143
|
String changeBase ( int x , int b ) { StringBuilder ret = new StringBuilder ( ) ; while ( x > 0 ) { ret . insert ( 0 , x % b ) ; x /= b ; } return ret . toString ( ) ; }
|
g-transeval-java_data_144
|
double median ( List < Double > l ) { Collections . sort ( l ) ; if ( l . size ( ) % 2 == 1 ) { return l . get ( l . size ( ) / 2 ) ; } return ( l . get ( l . size ( ) / 2 - 1 ) + l . get ( l . size ( ) / 2 ) ) / 2.0 ; }
|
g-transeval-java_data_145
|
String decodeShift ( String s ) { StringBuilder sb = new StringBuilder ( ) ; for ( char ch : s . toCharArray ( ) ) { char w = ( char ) ( ( ch + 21 - 'a' ) % 26 + 'a' ) ; sb . append ( w ) ; } return sb . toString ( ) ; }
|
g-transeval-java_data_146
|
boolean belowThreshold ( List < Integer > l , int t ) { for ( int n : l ) { if ( n >= t ) { return false ; } } return true ; }
|
g-transeval-java_data_147
|
boolean correctBracketing ( String brackets ) { int depth = 0 ; for ( char b : brackets . toCharArray ( ) ) { if ( b == '<' ) { depth += 1 ; } if ( b == '>' ) { depth -= 1 ; } if ( depth < 0 ) { return false ; } } return depth == 0 ; }
|
g-transeval-java_data_148
|
boolean monotonic ( List < Double > l ) { int incr = 0 ; int decr = 0 ; for ( int i = 1 ; i < l . size ( ) ; i ++ ) { if ( l . get ( i ) > l . get ( i - 1 ) ) { incr = 1 ; } if ( l . get ( i ) < l . get ( i - 1 ) ) { decr = 1 ; } } return incr + decr != 2 ; }
|
g-transeval-java_data_149
|
List < Double > derivative ( List < Double > xs ) { List < Double > result = new ArrayList < > ( ) ; for ( int i = 1 ; i < xs . size ( ) ; i ++ ) { result . add ( i * xs . get ( i ) ) ; } return result ; }
|
g-transeval-java_data_150
|
int vowelsCount ( String s ) { String vowels = "aeiouAEIOU" ; int count = 0 ; for ( char ch : s . toCharArray ( ) ) { if ( vowels . indexOf ( ch ) != - 1 ) { count += 1 ; } } if ( s . charAt ( s . length ( ) - 1 ) == 'y' || s . charAt ( s . length ( ) - 1 ) == 'Y' ) { count += 1 ; } return count ; }
|
g-transeval-java_data_151
|
int digitSum ( String s ) { int sum = 0 ; for ( char c : s . toCharArray ( ) ) { if ( Character . isUpperCase ( c ) ) { sum += c ; } } return sum ; }
|
g-transeval-java_data_152
|
int fruitDistribution ( String s , int n ) { StringBuilder num1 = new StringBuilder ( ) ; StringBuilder num2 = new StringBuilder ( ) ; boolean flag = false ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( Character . isDigit ( s . charAt ( i ) ) ) { if ( ! flag ) { num1 . append ( s . charAt ( i ) ) ; } if ( flag ) { num2 . append ( s . charAt ( i ) ) ; } } else if ( ! flag && num1 . length ( ) > 0 ) { flag = true ; } } return n - Integer . parseInt ( num1 . toString ( ) ) - Integer . parseInt ( num2 . toString ( ) ) ; }
|
g-transeval-java_data_153
|
List < Integer > pluck ( List < Integer > arr ) { List < Integer > result = new ArrayList < > ( ) ; for ( int i = 0 ; i < arr . size ( ) ; i ++ ) { if ( arr . get ( i ) % 2 == 0 ) { if ( result . isEmpty ( ) ) { result . add ( arr . get ( i ) ) ; result . add ( i ) ; } else if ( arr . get ( i ) < result . get ( 0 ) ) { result . set ( 0 , arr . get ( i ) ) ; result . set ( 1 , i ) ; } } } return result ; }
|
g-transeval-java_data_154
|
List < Integer > strangeSortList ( List < Integer > lst ) { List < Integer > res = new ArrayList < > ( ) ; Collections . sort ( lst ) ; int l = 0 ; int r = lst . size ( ) - 1 ; while ( l < r ) { res . add ( lst . get ( l ) ) ; l += 1 ; res . add ( lst . get ( r ) ) ; r -= 1 ; } if ( l == r ) { res . add ( lst . get ( l ) ) ; } return res ; }
|
g-transeval-java_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 Math . sqrt ( s * ( s - a ) * ( s - b ) * ( s - c ) ) ; }
|
g-transeval-java_data_156
|
boolean willItFly ( List < Integer > q , int w ) { int sum = 0 ; for ( int i = 0 ; i < q . size ( ) ; i ++ ) { if ( ! q . get ( i ) . equals ( q . get ( q . size ( ) - i - 1 ) ) ) { return false ; } sum += q . get ( i ) ; } return sum <= w ; }
|
g-transeval-java_data_157
|
boolean isCube ( int a ) { a = Math . abs ( a ) ; int i = ( int ) Math . round ( Math . pow ( a , 1.0 / 3 ) ) ; return ( int ) Math . pow ( i , 3 ) == a ; }
|
g-transeval-java_data_158
|
int hexKey ( String num ) { String key = "2357BD" ; int total = 0 ; for ( char c : num . toCharArray ( ) ) { if ( key . indexOf ( c ) != - 1 ) { total += 1 ; } } return total ; }
|
g-transeval-java_data_159
|
String decimalToBinary ( int dec ) { StringBuilder ans = new StringBuilder ( ) ; if ( dec != 0 ) { while ( dec > 0 ) { ans . insert ( 0 , dec % 2 ) ; dec /= 2 ; } } else { ans . append ( "0" ) ; } return "db" + ans . toString ( ) + "db" ; }
|
g-transeval-java_data_160
|
boolean 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-java_data_161
|
int startsOneEnds ( int n ) { if ( n < 1 ) { return 0 ; } if ( n == 1 ) { return 1 ; } return ( int ) ( 18 * Math . pow ( 10 , n - 2 ) ) ; }
|
g-transeval-java_data_162
|
int add ( List < Integer > lst ) { int sum = 0 ; for ( int i = 1 ; i < lst . size ( ) ; i += 2 ) { if ( lst . get ( i ) % 2 == 0 ) { sum += lst . get ( i ) ; } } return sum ; }
|
g-transeval-java_data_163
|
List < List < Integer > > getRow ( List < List < Integer > > lst , int x ) { List < List < Integer > > coords = new ArrayList < > ( ) ; for ( int i = 0 ; i < lst . size ( ) ; i ++ ) { for ( int j = lst . get ( i ) . size ( ) - 1 ; j >= 0 ; j -- ) { if ( lst . get ( i ) . get ( j ) == x ) { coords . add ( Arrays . asList ( i , j ) ) ; } } } return coords ; }
|
g-transeval-java_data_164
|
int nextSmallest ( List < Integer > lst ) { Collections . sort ( lst ) ; for ( int i = 1 ; i < lst . size ( ) ; i ++ ) { if ( ! lst . get ( i ) . equals ( lst . get ( i - 1 ) ) ) { return lst . get ( i ) ; } } return - 1 ; }
|
g-transeval-java_data_165
|
boolean anyInt ( double a , double b , double c ) { if ( Math . round ( a ) != a || Math . round ( b ) != b || Math . round ( c ) != c ) { return false ; } return a + b == c || a + c == b || b + c == a ; }
|
g-transeval-java_data_166
|
List < Integer > countUpTo ( int n ) { List < Integer > primes = new ArrayList < > ( ) ; for ( int i = 2 ; i < n ; i ++ ) { boolean isPrime = true ; for ( int j = 2 ; j < i ; j ++ ) { if ( i % j == 0 ) { isPrime = false ; break ; } } if ( isPrime ) { primes . add ( i ) ; } } return primes ; }
|
g-transeval-java_data_167
|
int closestInteger ( String value ) { double w = Double . parseDouble ( value ) ; return ( int ) Math . round ( w ) ; }
|
g-transeval-java_data_168
|
List < Integer > makeAPile ( int n ) { List < Integer > result = new ArrayList < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { result . add ( n + 2 * i ) ; } return result ; }
|
g-transeval-java_data_169
|
List < String > wordStrings ( String s ) { StringBuilder current = new StringBuilder ( ) ; List < String > words = new ArrayList < > ( ) ; for ( int i = 0 ; i <= s . length ( ) ; i ++ ) { if ( i == s . length ( ) || s . charAt ( i ) == ' ' || s . charAt ( i ) == ',' ) { if ( current . length ( ) > 0 ) { words . add ( current . toString ( ) ) ; current . setLength ( 0 ) ; } } else { current . append ( s . charAt ( i ) ) ; } } return words ; }
|
g-transeval-java_data_170
|
String roundedAvg ( int n , int m ) { if ( n > m ) { return "-1" ; } int num = ( m + n ) / 2 ; StringBuilder ret = new StringBuilder ( ) ; while ( num > 0 ) { ret . insert ( 0 , num % 2 ) ; num /= 2 ; } return ret . toString ( ) ; }
|
g-transeval-java_data_171
|
List < Integer > uniqueDigits ( List < Integer > x ) { List < Integer > digits = new ArrayList < > ( ) ; for ( int i : x ) { boolean isUnique = true ; for ( char c : String . valueOf ( i ) . toCharArray ( ) ) { if ( c % 2 == 0 ) { isUnique = false ; break ; } } if ( isUnique ) { digits . add ( i ) ; } } Collections . sort ( digits ) ; return digits ; }
|
g-transeval-java_data_172
|
int countNums ( List < Integer > arr ) { int num = 0 ; for ( int n : arr ) { int neg = n < 0 ? - 1 : 1 ; n = Math . abs ( n ) ; List < Integer > digits = new ArrayList < > ( ) ; for ( char c : String . valueOf ( n ) . toCharArray ( ) ) { digits . add ( c - '0' ) ; } digits . set ( 0 , digits . get ( 0 ) * neg ) ; int sum = 0 ; for ( int d : digits ) { sum += d ; } if ( sum > 0 ) { num += 1 ; } } return num ; }
|
g-transeval-java_data_173
|
boolean moveOneBall ( List < Integer > arr ) { if ( arr . isEmpty ( ) ) { return true ; } int num = 0 ; for ( int i = 1 ; i < arr . size ( ) ; i ++ ) { if ( arr . get ( i ) < arr . get ( i - 1 ) ) { num += 1 ; } } if ( arr . get ( arr . size ( ) - 1 ) > arr . get ( 0 ) ) { num += 1 ; } if ( num < 2 ) { return true ; } return false ; }
|
g-transeval-java_data_174
|
String exchange ( List < Integer > lst1 , List < Integer > 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-java_data_175
|
List < String > oddCount ( List < String > lst ) { List < String > results = new ArrayList < > ( ) ; String originalStr = "the number of odd elements in the string i of the input." ; for ( String s : lst ) { int sum = 0 ; for ( char d : s . toCharArray ( ) ) { if ( Character . isDigit ( d ) && d % 2 == 1 ) { sum += 1 ; } } StringBuilder result = new StringBuilder ( ) ; for ( char c : originalStr . toCharArray ( ) ) { if ( c == 'i' ) { result . append ( sum ) ; } else { result . append ( c ) ; } } results . add ( result . toString ( ) ) ; } return results ; }
|
g-transeval-java_data_176
|
int minSubArraySum ( List < Integer > nums ) { int minSum = Integer . MAX_VALUE ; int sum = 0 ; for ( int num : nums ) { sum += num ; if ( minSum > sum ) { minSum = sum ; } if ( sum > 0 ) { sum = 0 ; } } return minSum ; }
|
g-transeval-java_data_177
|
int maxFill ( List < List < Integer > > grid , int capacity ) { int res = 0 ; for ( var well : grid ) { int sum = 0 ; for ( int n : well ) { sum += n ; } if ( sum > 0 ) { res += ( sum - 1 ) / capacity + 1 ; } } return res ; }
|
g-transeval-java_data_178
|
List < String > selectWords ( String s , int n ) { String vowels = "aeiouAEIOU" ; StringBuilder current = new StringBuilder ( ) ; List < String > result = new ArrayList < > ( ) ; int consonantNum = 0 ; for ( int i = 0 ; i <= s . length ( ) ; i ++ ) { if ( i == s . length ( ) || s . charAt ( i ) == ' ' ) { if ( consonantNum == n ) { result . add ( current . toString ( ) ) ; } current . setLength ( 0 ) ; consonantNum = 0 ; } else { current . append ( s . charAt ( i ) ) ; if ( vowels . indexOf ( s . charAt ( i ) ) == - 1 ) { consonantNum += 1 ; } } } return result ; }
|
g-transeval-java_data_179
|
int solution ( List < Integer > lst ) { int sum = 0 ; for ( int i = 0 ; i < lst . size ( ) ; i += 2 ) { if ( ( lst . get ( i ) % 2 ) == 1 ) { sum += lst . get ( i ) ; } } return sum ; }
|
g-transeval-java_data_180
|
int addElements ( List < Integer > arr , int k ) { int sum = 0 ; for ( int i = 0 ; i < k ; i ++ ) { if ( arr . get ( i ) >= - 99 && arr . get ( i ) <= 99 ) { sum += arr . get ( i ) ; } } return sum ; }
|
g-transeval-java_data_181
|
List < Integer > getOddCollatz ( int n ) { List < Integer > oddCollatz = new ArrayList < > ( ) ; while ( n != 1 ) { if ( n % 2 == 1 ) { oddCollatz . add ( n ) ; n = n * 3 + 1 ; } else { n /= 2 ; } } oddCollatz . add ( 1 ) ; Collections . sort ( oddCollatz ) ; return oddCollatz ; }
|
g-transeval-java_data_182
|
boolean isSorted ( List < Integer > lst ) { for ( int i = 1 ; i < lst . size ( ) ; i ++ ) { if ( lst . get ( i ) < lst . get ( i - 1 ) ) { return false ; } if ( i >= 2 && lst . get ( i ) == lst . get ( i - 1 ) && lst . get ( i ) == lst . get ( i - 2 ) ) { return false ; } } return true ; }
|
g-transeval-java_data_183
|
String intersection ( List < Integer > interval1 , List < Integer > interval2 ) { int inter1 = Math . max ( interval1 . get ( 0 ) , interval2 . get ( 0 ) ) ; int inter2 = Math . min ( interval1 . get ( 1 ) , interval2 . get ( 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-java_data_184
|
int prodSigns ( List < Integer > arr ) { if ( arr . isEmpty ( ) ) { return - 32768 ; } int sum = 0 ; int prods = 1 ; for ( int i : arr ) { sum += Math . abs ( i ) ; if ( i == 0 ) { prods = 0 ; } if ( i < 0 ) { prods = - prods ; } } return sum * prods ; }
|
g-transeval-java_data_185
|
List < Integer > minPath ( List < List < Integer > > grid , int k ) { int n = grid . size ( ) ; int minNum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 0 ; j < n ; j ++ ) { if ( grid . get ( i ) . get ( j ) == 1 ) { List < Integer > tmp = new ArrayList < > ( ) ; if ( i != 0 ) { tmp . add ( grid . get ( i - 1 ) . get ( j ) ) ; } if ( j != 0 ) { tmp . add ( grid . get ( i ) . get ( j - 1 ) ) ; } if ( i != n - 1 ) { tmp . add ( grid . get ( i + 1 ) . get ( j ) ) ; } if ( j != n - 1 ) { tmp . add ( grid . get ( i ) . get ( j + 1 ) ) ; } minNum = Collections . min ( tmp ) ; } } } List < Integer > ans = new ArrayList < > ( ) ; for ( int i = 0 ; i < k ; i ++ ) { if ( i % 2 == 0 ) { ans . add ( 1 ) ; } else { ans . add ( minNum ) ; } } return ans ; }
|
g-transeval-java_data_186
|
int digits ( int n ) { int prod = 0 ; for ( char digit : String . valueOf ( n ) . toCharArray ( ) ) { if ( digit % 2 == 1 ) { if ( prod == 0 ) { prod = 1 ; } prod *= digit - '0' ; } } return prod ; }
|
g-transeval-java_data_187
|
boolean isNested ( String s ) { int count = 0 ; int maxCount = 0 ; for ( char ch : s . toCharArray ( ) ) { if ( ch == '[' ) { count += 1 ; } if ( ch == ']' ) { count -= 1 ; } if ( count < 0 ) { count = 0 ; } if ( count > maxCount ) { maxCount = count ; } if ( count <= maxCount - 2 ) { return true ; } } return false ; }
|
g-transeval-java_data_188
|
int sumSquares ( List < Double > lst ) { int sum = 0 ; for ( double i : lst ) { sum += Math . ceil ( i ) * Math . ceil ( i ) ; } return sum ; }
|
g-transeval-java_data_189
|
int canArrange ( List < Integer > arr ) { int index = - 1 ; for ( int i = 0 ; i < arr . size ( ) ; i ++ ) { if ( arr . get ( i ) <= i ) { index = i ; } } return index ; }
|
g-transeval-java_data_190
|
List < Integer > largestSmallestIntegers ( List < Integer > lst ) { int maxNeg = 0 , minPos = 0 ; for ( int n : lst ) { if ( n < 0 && ( maxNeg == 0 || n > maxNeg ) ) { maxNeg = n ; } if ( n > 0 && ( minPos == 0 || n < minPos ) ) { minPos = n ; } } return Arrays . asList ( maxNeg , minPos ) ; }
|
g-transeval-java_data_191
|
String fixSpaces ( String text ) { StringBuilder res = new StringBuilder ( ) ; int spaceLen = 0 ; for ( int i = 0 ; i <= text . length ( ) ; i ++ ) { if ( i == text . length ( ) || text . charAt ( i ) != ' ' ) { if ( spaceLen == 1 ) { res . append ( '_' ) ; } if ( spaceLen == 2 ) { res . append ( "__" ) ; } if ( spaceLen > 2 ) { res . append ( '-' ) ; } spaceLen = 0 ; if ( i != text . length ( ) ) { res . append ( text . charAt ( i ) ) ; } } else { spaceLen += 1 ; } } return res . toString ( ) ; }
|
g-transeval-java_data_192
|
String filenameCheck ( String fileName ) { int digitNum = 0 , dotNum = 0 ; if ( fileName . length ( ) < 5 || ! Character . isLetter ( fileName . charAt ( 0 ) ) ) { return "No" ; } String suffix = fileName . substring ( fileName . length ( ) - 4 ) ; if ( ! suffix . equals ( ".txt" ) && ! suffix . equals ( ".exe" ) && ! suffix . equals ( ".dll" ) ) { return "No" ; } for ( char c : fileName . toCharArray ( ) ) { if ( Character . isDigit ( c ) ) { digitNum += 1 ; } if ( c == '.' ) { dotNum += 1 ; } } if ( digitNum > 3 || dotNum != 1 ) { return "No" ; } return "Yes" ; }
|
g-transeval-java_data_193
|
int sumSquares ( List < Integer > lst ) { int sum = 0 ; for ( int i = 0 ; i < lst . size ( ) ; i ++ ) { if ( i % 3 == 0 ) { sum += lst . get ( i ) * lst . get ( i ) ; } else if ( i % 4 == 0 ) { sum += lst . get ( i ) * lst . get ( i ) * lst . get ( i ) ; } else { sum += lst . get ( i ) ; } } return sum ; }
|
g-transeval-java_data_194
|
String wordsInSentence ( String sentence ) { StringBuilder result = new StringBuilder ( ) ; StringBuilder current = new StringBuilder ( ) ; for ( int i = 0 ; i <= sentence . length ( ) ; i ++ ) { if ( i == sentence . length ( ) || sentence . charAt ( i ) == ' ' ) { boolean isPrime = true ; int l = current . length ( ) ; if ( l < 2 ) { isPrime = false ; } for ( int j = 2 ; j < l ; j ++ ) { if ( l % j == 0 ) { isPrime = false ; break ; } } if ( isPrime ) { result . append ( current . toString ( ) ) . append ( ' ' ) ; } current . setLength ( 0 ) ; } else { current . append ( sentence . charAt ( i ) ) ; } } if ( result . length ( ) > 0 ) { result . deleteCharAt ( result . length ( ) - 1 ) ; } return result . toString ( ) ; }
|
g-transeval-java_data_195
|
boolean simplify ( String x , String n ) { int a = 0 , b = 0 , c = 0 , d = 0 ; for ( int i = 0 ; i < x . length ( ) ; i ++ ) { if ( x . charAt ( i ) == '/' ) { a = Integer . parseInt ( x . substring ( 0 , i ) ) ; b = Integer . parseInt ( x . substring ( i + 1 ) ) ; } } for ( int i = 0 ; i < n . length ( ) ; i ++ ) { if ( n . charAt ( i ) == '/' ) { c = Integer . parseInt ( n . substring ( 0 , i ) ) ; d = Integer . parseInt ( n . substring ( i + 1 ) ) ; } } return ( a * c ) % ( b * d ) == 0 ; }
|
g-transeval-java_data_196
|
int specialFilter ( List < Integer > nums ) { int count = 0 ; for ( int num : nums ) { if ( num > 10 ) { String w = String . valueOf ( num ) ; if ( w . charAt ( 0 ) % 2 == 1 && w . charAt ( w . length ( ) - 1 ) % 2 == 1 ) { count += 1 ; } } } return count ; }
|
g-transeval-java_data_197
|
int getMaxTriples ( int n ) { List < Integer > arr = new ArrayList < > ( ) ; for ( int i = 1 ; i <= n ; i ++ ) { arr . add ( 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 . get ( i ) + arr . get ( j ) + arr . get ( k ) ) % 3 == 0 ) { count += 1 ; } } } } return count ; }
|
g-transeval-java_data_198
|
int doubleTheDifference ( List < Double > lst ) { int sum = 0 ; for ( double d : lst ) { int num = ( int ) Math . round ( d ) ; if ( d == num ) { if ( num > 0 && num % 2 == 1 ) { sum += num * num ; } } } return sum ; }
|
g-transeval-java_data_199
|
List < Integer > compare ( List < Integer > game , List < Integer > guess ) { List < Integer > result = new ArrayList < > ( ) ; for ( int i = 0 ; i < game . size ( ) ; i ++ ) { result . add ( Math . abs ( game . get ( i ) - guess . get ( i ) ) ) ; } return result ; }
|
g-transeval-java_data_200
|
String strongestExtension ( String className , List < String > extensions ) { String strongest = "" ; int max = Integer . MIN_VALUE ; for ( var extension : extensions ) { int strength = 0 ; for ( char chr : extension . toCharArray ( ) ) { if ( Character . isUpperCase ( chr ) ) { strength += 1 ; } if ( Character . isLowerCase ( chr ) ) { strength -= 1 ; } } if ( strength > max ) { max = strength ; strongest = extension ; } } return className + '.' + strongest ; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.