Dataset Viewer
text
stringlengths 72
840
|
|---|
static int f_gold ( String tree , int k ) { int level = - 1 ; int product = 1 ; int n = tree . length ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( tree . charAt ( i ) == '(' ) level ++ ; else if ( tree . charAt ( i ) == ')' ) level -- ; else { if ( level == k ) product *= ( tree . charAt ( i ) - '0' ) ; } } return product ; } |
static int f_gold ( String s ) { int n = s . length ( ) ; int [ ] auxArr = new int [ n ] ; if ( s . charAt ( 0 ) == '1' ) auxArr [ 0 ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) { if ( s . charAt ( i ) == '1' ) auxArr [ i ] = auxArr [ i - 1 ] + 1 ; else auxArr [ i ] = auxArr [ i - 1 ] ; } int count = 0 ; for ( int i = n - 1 ; i >= 0 ; i -- ) if ( s . charAt ( i ) == '1' ) count += auxArr [ i ] ; return count ; } |
static boolean f_gold ( String str , int n ) { int len = str . length ( ) ; if ( len >= n ) return true ; return false ; } |
static String f_gold ( String str ) { int n = str . length ( ) ; int [ ] [ ] dp = new int [ n + 1 ] [ n + 1 ] ; for ( int i = 0 ; i <= n ; i ++ ) for ( int j = 0 ; j <= n ; j ++ ) dp [ i ] [ j ] = 0 ; for ( int i = 1 ; i <= n ; i ++ ) for ( int j = 1 ; j <= n ; j ++ ) if ( str . charAt ( i - 1 ) == str . charAt ( j - 1 ) && i != j ) dp [ i ] [ j ] = 1 + dp [ i - 1 ] [ j - 1 ] ; else dp [ i ] [ j ] = Math . max ( dp [ i ] [ j - 1 ] , dp [ i - 1 ] [ j ] ) ; String res = "" ; int i = n , j = n ; while ( i > 0 && j > 0 ) { if ( dp [ i ] [ j ] == dp [ i - 1 ] [ j - 1 ] + 1 ) { res = res + str . charAt ( i - 1 ) ; i -- ; j -- ; } else if ( dp [ i ] [ j ] == dp [ i - 1 ] [ j ] ) i -- ; else j -- ; } String reverse = "" ; for ( int k = res . length ( ) - 1 ; k >= 0 ; k -- ) { reverse = reverse + res . charAt ( k ) ; } return reverse ; } |
static boolean f_gold ( String str ) { int l = 0 ; int h = str . length ( ) - 1 ; while ( h > l ) if ( str . charAt ( l ++ ) != str . charAt ( h -- ) ) return false ; return true ; } |
static int f_gold ( int a , int b ) { String s = String . valueOf ( b ) ; int i ; for ( i = 0 ; i < s . length ( ) ; i ++ ) { if ( s . charAt ( i ) != '9' ) break ; } int result ; if ( i == s . length ( ) ) result = a * s . length ( ) ; else result = a * ( s . length ( ) - 1 ) ; return result ; } |
static int f_gold ( String str ) { int n = str . length ( ) ; int [ ] [ ] dp = new int [ n + 1 ] [ n + 1 ] ; for ( int i = 1 ; i <= n ; i ++ ) { for ( int j = 1 ; j <= n ; j ++ ) { if ( str . charAt ( i - 1 ) == str . charAt ( j - 1 ) && i != j ) dp [ i ] [ j ] = 1 + dp [ i - 1 ] [ j - 1 ] ; else dp [ i ] [ j ] = Math . max ( dp [ i ] [ j - 1 ] , dp [ i - 1 ] [ j ] ) ; } } return dp [ n ] [ n ] ; } |
static boolean f_gold ( String s , char c ) { boolean oneSeen = false ; int i = 0 , n = s . length ( ) ; while ( i < n ) { if ( s . charAt ( i ) == c ) { if ( oneSeen == true ) return false ; while ( i < n && s . charAt ( i ) == c ) i ++ ; oneSeen = true ; } else i ++ ; } return true ; } |
static String f_gold ( String s ) { int n = s . length ( ) ; String s1 = "" ; s1 = s1 + Character . toLowerCase ( s . charAt ( 0 ) ) ; for ( int i = 1 ; i < n ; i ++ ) { if ( s . charAt ( i ) == ' ' && i < n ) { s1 = s1 + " " + Character . toLowerCase ( s . charAt ( i + 1 ) ) ; i ++ ; } else s1 = s1 + Character . toUpperCase ( s . charAt ( i ) ) ; } return s1 ; } |
static int f_gold ( String str ) { int n = str . length ( ) ; int [ ] [ ] C = new int [ n ] [ n ] ; boolean [ ] [ ] P = new boolean [ n ] [ n ] ; int i , j , k , L ; for ( i = 0 ; i < n ; i ++ ) { P [ i ] [ i ] = true ; C [ i ] [ i ] = 0 ; } for ( L = 2 ; L <= n ; L ++ ) { for ( i = 0 ; i < n - L + 1 ; i ++ ) { j = i + L - 1 ; if ( L == 2 ) P [ i ] [ j ] = ( str . charAt ( i ) == str . charAt ( j ) ) ; else P [ i ] [ j ] = ( str . charAt ( i ) == str . charAt ( j ) ) && P [ i + 1 ] [ j - 1 ] ; if ( P [ i ] [ j ] == true ) C [ i ] [ j ] = 0 ; else { C [ i ] [ j ] = Integer . MAX_VALUE ; for ( k = i ; k <= j - 1 ; k ++ ) C [ i ] [ j ] = Integer . min ( C [ i ] [ j ] , C [ i ] [ k ] + C [ k + 1 ] [ j ] + 1 ) ; } } } return C [ 0 ] [ n - 1 ] ; } |
static boolean f_gold ( String num ) { int length = num . length ( ) ; if ( length == 1 && num . charAt ( 0 ) == '0' ) return true ; if ( length % 3 == 1 ) { num += "00" ; length += 2 ; } else if ( length % 3 == 2 ) { num += "0" ; length += 1 ; } int sum = 0 , p = 1 ; for ( int i = length - 1 ; i >= 0 ; i -- ) { int group = 0 ; group += num . charAt ( i -- ) - '0' ; group += ( num . charAt ( i -- ) - '0' ) * 10 ; group += ( num . charAt ( i ) - '0' ) * 100 ; sum = sum + group * p ; p *= ( - 1 ) ; } sum = Math . abs ( sum ) ; return ( sum % 13 == 0 ) ; } |
static int f_gold ( String str ) { int N = str . length ( ) ; int [ ] [ ] cps = new int [ N + 1 ] [ N + 1 ] ; for ( int i = 0 ; i < N ; i ++ ) cps [ i ] [ i ] = 1 ; for ( int L = 2 ; L <= N ; L ++ ) { for ( int i = 0 ; i < N ; i ++ ) { int k = L + i - 1 ; if ( k < N ) { if ( str . charAt ( i ) == str . charAt ( k ) ) cps [ i ] [ k ] = cps [ i ] [ k - 1 ] + cps [ i + 1 ] [ k ] + 1 ; else cps [ i ] [ k ] = cps [ i ] [ k - 1 ] + cps [ i + 1 ] [ k ] - cps [ i + 1 ] [ k - 1 ] ; } } } return cps [ 0 ] [ N - 1 ] ; } |
static boolean f_gold ( String str ) { int i = 0 , j = str . length ( ) - 1 ; while ( i < j ) { if ( str . charAt ( i ) != str . charAt ( j ) ) return false ; i ++ ; j -- ; } return true ; } |
static boolean f_gold ( char [ ] str1 , char [ ] str2 ) { int n1 = str1 . length ; int n2 = str2 . length ; if ( n1 != n2 ) return false ; Arrays . sort ( str1 ) ; Arrays . sort ( str2 ) ; for ( int i = 0 ; i < n1 ; i ++ ) if ( str1 [ i ] != str2 [ i ] ) return false ; return true ; } |
static int f_gold ( String str ) { int len = str . length ( ) ; int open [ ] = new int [ len + 1 ] ; int close [ ] = new int [ len + 1 ] ; int index = - 1 ; open [ 0 ] = 0 ; close [ len ] = 0 ; if ( str . charAt ( 0 ) == '(' ) open [ 1 ] = 1 ; if ( str . charAt ( len - 1 ) == ')' ) close [ len - 1 ] = 1 ; for ( int i = 1 ; i < len ; i ++ ) { if ( str . charAt ( i ) == '(' ) open [ i + 1 ] = open [ i ] + 1 ; else open [ i + 1 ] = open [ i ] ; } for ( int i = len - 2 ; i >= 0 ; i -- ) { if ( str . charAt ( i ) == ')' ) close [ i ] = close [ i + 1 ] + 1 ; else close [ i ] = close [ i + 1 ] ; } if ( open [ len ] == 0 ) return len ; if ( close [ 0 ] == 0 ) return 0 ; for ( int i = 0 ; i <= len ; i ++ ) if ( open [ i ] == close [ i ] ) index = i ; return index ; } |
static char f_gold ( String str ) { int len = str . length ( ) ; int count = 0 ; char res = str . charAt ( 0 ) ; for ( int i = 0 ; i < len ; i ++ ) { int cur_count = 1 ; for ( int j = i + 1 ; j < len ; j ++ ) { if ( str . charAt ( i ) != str . charAt ( j ) ) break ; cur_count ++ ; } if ( cur_count > count ) { count = cur_count ; res = str . charAt ( i ) ; } } return res ; } |
static int f_gold ( String str ) { int n = str . length ( ) ; int res = - 1 ; for ( int i = 0 ; i < n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( str . charAt ( i ) == str . charAt ( j ) ) res = Math . max ( res , Math . abs ( j - i - 1 ) ) ; return res ; } |
static boolean f_gold ( String str1 , String str2 ) { if ( str1 . length ( ) != str2 . length ( ) ) return false ; String clock_rot = "" ; String anticlock_rot = "" ; int len = str2 . length ( ) ; anticlock_rot = anticlock_rot + str2 . substring ( len - 2 , len ) + str2 . substring ( 0 , len - 2 ) ; clock_rot = clock_rot + str2 . substring ( 2 ) + str2 . substring ( 0 , 2 ) ; return ( str1 . equals ( clock_rot ) || str1 . equals ( anticlock_rot ) ) ; } |
static int f_gold ( String str ) { int len = str . length ( ) ; boolean oneSeen = false ; int count = 0 ; for ( int i = 0 ; i < len ; i ++ ) { char getChar = str . charAt ( i ) ; if ( getChar == '1' && oneSeen == true ) { if ( str . charAt ( i - 1 ) == '0' ) count ++ ; } if ( getChar == '1' && oneSeen == false ) oneSeen = true ; if ( getChar != '0' && str . charAt ( i ) != '1' ) oneSeen = false ; } return count ; } |
static int f_gold ( String str ) { int n = str . length ( ) ; int [ ] C = new int [ n ] ; boolean [ ] [ ] P = new boolean [ n ] [ n ] ; int i , j , k , L ; for ( i = 0 ; i < n ; i ++ ) { P [ i ] [ i ] = true ; } for ( L = 2 ; L <= n ; L ++ ) { for ( i = 0 ; i < n - L + 1 ; i ++ ) { j = i + L - 1 ; if ( L == 2 ) P [ i ] [ j ] = ( str . charAt ( i ) == str . charAt ( j ) ) ; else P [ i ] [ j ] = ( str . charAt ( i ) == str . charAt ( j ) ) && P [ i + 1 ] [ j - 1 ] ; } } for ( i = 0 ; i < n ; i ++ ) { if ( P [ 0 ] [ i ] == true ) C [ i ] = 0 ; else { C [ i ] = Integer . MAX_VALUE ; for ( j = 0 ; j < i ; j ++ ) { if ( P [ j + 1 ] [ i ] == true && 1 + C [ j ] < C [ i ] ) C [ i ] = 1 + C [ j ] ; } } } return C [ n - 1 ] ; } |
static int f_gold ( String N ) { int len = N . length ( ) ; int l = ( len ) / 2 ; int count = 0 ; for ( int i = 1 ; i <= l ; i ++ ) { String s = N . substring ( 0 , i ) ; int l1 = s . length ( ) ; String t = N . substring ( i , l1 + i ) ; if ( s . charAt ( 0 ) == '0' || t . charAt ( 0 ) == '0' ) continue ; if ( s . compareTo ( t ) == 0 ) count ++ ; } return count ; } |
public static boolean f_gold ( String s ) { int l = s . length ( ) ; if ( l % 2 == 1 ) { return false ; } int i = 0 ; int j = l - 1 ; while ( i < j ) { if ( s . charAt ( i ) != 'a' || s . charAt ( j ) != 'b' ) { return false ; } i ++ ; j -- ; } return true ; } |
static boolean f_gold ( String str , String corner ) { int n = str . length ( ) ; int cl = corner . length ( ) ; if ( n < cl ) return false ; return ( str . substring ( 0 , cl ) . equals ( corner ) && str . substring ( n - cl , n ) . equals ( corner ) ) ; } |
static String f_gold ( String s ) { int l = s . length ( ) ; String s1 = "" ; boolean isEven = ( l % 2 == 0 ) ? true : false ; for ( int i = 0 ; i < l ; i += 2 ) { if ( isEven ) { s1 = s . charAt ( i ) + s1 ; s1 += s . charAt ( i + 1 ) ; } else { if ( l - i > 1 ) { s1 += s . charAt ( i ) ; s1 = s . charAt ( i + 1 ) + s1 ; } else { s1 += s . charAt ( i ) ; } } } return s1 ; } |
static boolean f_gold ( String str ) { int i , j , k , l = str . length ( ) ; int arr [ ] = new int [ l ] ; for ( i = 0 ; i < l ; i ++ ) { for ( j = i ; j < l ; j ++ ) { for ( k = j ; k < l ; k ++ ) { if ( arr [ i ] % 8 == 0 ) return true ; else if ( ( arr [ i ] * 10 + arr [ j ] ) % 8 == 0 && i != j ) return true ; else if ( ( arr [ i ] * 100 + arr [ j ] * 10 + arr [ k ] ) % 8 == 0 && i != j && j != k && i != k ) return true ; } } } return false ; } |
static String f_gold ( String n ) { String res = n ; for ( int j = n . length ( ) - 1 ; j >= 0 ; -- j ) res += n . charAt ( j ) ; return res ; } |
static int f_gold ( String s ) { int n = s . length ( ) ; int a [ ] = new int [ n ] ; for ( int i = n - 1 ; i >= 0 ; i -- ) { int back_up = 0 ; for ( int j = i ; j < n ; j ++ ) { if ( j == i ) a [ j ] = 1 ; else if ( s . charAt ( i ) == s . charAt ( j ) ) { int temp = a [ j ] ; a [ j ] = back_up + 2 ; back_up = temp ; } else { back_up = a [ j ] ; a [ j ] = Math . max ( a [ j - 1 ] , a [ j ] ) ; } } } return a [ n - 1 ] ; } |
static String f_gold ( String s ) { int n = s . length ( ) ; int sub_count = n * ( n + 1 ) / 2 ; String [ ] arr = new String [ sub_count ] ; int index = 0 ; for ( int i = 0 ; i < n ; i ++ ) for ( int len = 1 ; len <= n - i ; len ++ ) { arr [ index ++ ] = s . substring ( i , i + len ) ; } Arrays . sort ( arr ) ; String res = "" ; for ( int i = 0 ; i < sub_count ; i ++ ) res += arr [ i ] ; return res ; } |
static boolean f_gold ( String s ) { int l = s . length ( ) ; for ( int i = 0 , j = l - 1 ; i <= j ; i ++ , j -- ) { if ( s . charAt ( i ) != s . charAt ( j ) ) { return false ; } } return true ; } |
static int f_gold ( String tree , int k ) { int level = - 1 ; int sum = 0 ; int n = tree . length ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( tree . charAt ( i ) == '(' ) level ++ ; else if ( tree . charAt ( i ) == ')' ) level -- ; else { if ( level == k ) sum += ( tree . charAt ( i ) - '0' ) ; } } return sum ; } |
static String f_gold ( String str ) { int i = str . length ( ) - 1 ; int start , end = i + 1 ; String result = "" ; while ( i >= 0 ) { if ( str . charAt ( i ) == ' ' ) { start = i + 1 ; while ( start != end ) result += str . charAt ( start ++ ) ; result += ' ' ; end = i ; } i -- ; } start = 0 ; while ( start != end ) result += str . charAt ( start ++ ) ; return result ; } |
static int f_gold ( String num ) { int len = num . length ( ) ; int count_zero = 0 ; char ch ; for ( int i = 1 ; i < len ; i ++ ) { ch = num . charAt ( i ) ; if ( ch == '0' ) count_zero ++ ; } return count_zero ; } |
static int f_gold ( String str ) { int N = str . length ( ) ; int [ ] [ ] dp = new int [ N + 1 ] [ N + 1 ] ; for ( int i = 0 ; i <= N ; i ++ ) for ( int j = 0 ; j <= N ; j ++ ) dp [ i ] [ j ] = 0 ; for ( int len = 1 ; len <= N ; len ++ ) { for ( int i = 0 , j = len - 1 ; j < N ; i ++ , j ++ ) { if ( len == 1 ) dp [ i ] [ j ] = 1 ; else { dp [ i ] [ j ] = 1 + dp [ i + 1 ] [ j ] ; if ( str . charAt ( i ) == str . charAt ( i + 1 ) ) dp [ i ] [ j ] = Math . min ( 1 + dp [ i + 2 ] [ j ] , dp [ i ] [ j ] ) ; for ( int K = i + 2 ; K <= j ; K ++ ) if ( str . charAt ( i ) == str . charAt ( K ) ) dp [ i ] [ j ] = Math . min ( dp [ i + 1 ] [ K - 1 ] + dp [ K + 1 ] [ j ] , dp [ i ] [ j ] ) ; } } } return dp [ 0 ] [ N - 1 ] ; } |
static String f_gold ( String num ) { int l = num . length ( ) ; int i ; for ( i = l - 1 ; i >= 0 ; i -- ) { if ( num . charAt ( i ) == '0' ) { num = num . substring ( 0 , i ) + '1' + num . substring ( i + 1 ) ; break ; } else { num = num . substring ( 0 , i ) + '0' + num . substring ( i + 1 ) ; } } if ( i < 0 ) { num = "1" + num ; } return num ; } |
static boolean f_gold ( String s ) { int n = s . length ( ) ; for ( int i = 1 ; i < n ; i ++ ) if ( s . charAt ( i ) != s . charAt ( 0 ) ) return false ; return true ; } |
static String f_gold ( String str ) { int n = str . length ( ) ; String arr [ ] = new String [ n ] ; String concat = str + str ; for ( int i = 0 ; i < n ; i ++ ) { arr [ i ] = concat . substring ( i , i + n ) ; } Arrays . sort ( arr ) ; return arr [ 0 ] ; } |
static boolean f_gold ( String bin ) { int n = bin . length ( ) ; if ( bin . charAt ( n - 1 ) == '1' ) return false ; int sum = 0 ; for ( int i = n - 2 ; i >= 0 ; i -- ) { if ( bin . charAt ( i ) == '1' ) { int posFromRight = n - i - 1 ; if ( posFromRight % 4 == 1 ) sum = sum + 2 ; else if ( posFromRight % 4 == 2 ) sum = sum + 4 ; else if ( posFromRight % 4 == 3 ) sum = sum + 8 ; else if ( posFromRight % 4 == 0 ) sum = sum + 6 ; } } if ( sum % 10 == 0 ) return true ; return false ; } |
static char f_gold ( String str ) { for ( int i = 0 ; i < str . length ( ) ; i ++ ) if ( Character . isUpperCase ( str . charAt ( i ) ) ) return str . charAt ( i ) ; return 0 ; } |
static int f_gold ( String s , int K ) { int n = s . length ( ) ; int C = 0 , c1 = 0 , c2 = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( s . charAt ( i ) == 'a' ) c1 ++ ; if ( s . charAt ( i ) == 'b' ) { c2 ++ ; C += c1 ; } } return C * K + ( K * ( K - 1 ) / 2 ) * c1 * c2 ; } |
static char f_gold ( String str ) { int n = str . length ( ) ; int count = 0 ; char res = str . charAt ( 0 ) ; int cur_count = 1 ; for ( int i = 0 ; i < n ; i ++ ) { if ( i < n - 1 && str . charAt ( i ) == str . charAt ( i + 1 ) ) cur_count ++ ; else { if ( cur_count > count ) { count = cur_count ; res = str . charAt ( i ) ; } cur_count = 1 ; } } return res ; } |
static int f_gold ( String s ) { int n = s . length ( ) ; int lps [ ] = new int [ n ] ; lps [ 0 ] = 0 ; int len = 0 ; int i = 1 ; while ( i < n ) { if ( s . charAt ( i ) == s . charAt ( len ) ) { len ++ ; lps [ i ] = len ; i ++ ; } else { if ( len != 0 ) { len = lps [ len - 1 ] ; } else { lps [ i ] = 0 ; i ++ ; } } } int res = lps [ n - 1 ] ; return ( res > n / 2 ) ? n / 2 : res ; } |
static int f_gold ( 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 . charAt ( i ) == s . charAt ( j ) ) result ++ ; return result ; } |
static double f_gold ( int [ ] A , int K ) { int n = A . length ; double [ ] pre_sum = new double [ n + 1 ] ; pre_sum [ 0 ] = 0 ; for ( int i = 0 ; i < n ; i ++ ) pre_sum [ i + 1 ] = pre_sum [ i ] + A [ i ] ; double [ ] dp = new double [ n ] ; double sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) dp [ i ] = ( pre_sum [ n ] - pre_sum [ i ] ) / ( n - i ) ; for ( int k = 0 ; k < K - 1 ; k ++ ) for ( int i = 0 ; i < n ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) dp [ i ] = Math . max ( dp [ i ] , ( pre_sum [ j ] - pre_sum [ i ] ) / ( j - i ) + dp [ j ] ) ; return dp [ 0 ] ; } |
static int f_gold ( String str ) { int n = str . length ( ) ; return n * ( n + 1 ) / 2 ; } |
static int f_gold ( String str ) { int result = 0 ; int n = str . length ( ) ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( Math . abs ( str . charAt ( i ) - str . charAt ( j ) ) == Math . abs ( i - j ) ) result ++ ; return result ; } |
int f_filled (string tree, int k) { int level = -1; int product = 1; int n = tree.length; for (int i = 0; i < n; i++) { if (tree[i] == '(') level++; else if (tree[i] == ')') level--; else { if (level == k) product *= (tree[i] - '0'); } } return product; } |
int f_filled(string s) { int n = s.length; int[] auxArr = new int[n]; if (s[0] == '1') auxArr[0] = 1; for (int i = 1; i < n; i++) { if (s[i] == '1') auxArr[i] = auxArr[i - 1] + 1; else auxArr[i] = auxArr[i - 1]; } int count = 0; for (int i = n - 1; i >= 0; i--) if (s[i] == '1') count += auxArr[i]; return count; } |
bool f_filled (string str, int n) { int len = str.length; if (len >= n) return true; return false; } |
string f_filled(string str) { int n = str.length; int[][] dp = new int[n + 1][n + 1]; for (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++) dp[i][j] = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (str[i - 1] == str[j - 1] && i != j) dp[i][j] = 1 + dp[i - 1][j - 1]; else dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]); string res = ""; int i = n, j = n; while (i > 0 && j > 0) { if (dp[i][j] == dp[i - 1][j - 1] + 1) { res = res + str[i - 1]; i--; j--; } else if (dp[i][j] == dp[i - 1][j]) i--; else j--; } string reverse = ""; for (int k = res.length - 1; k >= 0; k--) reverse = reverse + res[k]; return reverse; } |
bool f_filled(string str) { int l = 0; int h = str.length - 1; while (h > l) { if (str[l++] != str[h--]) return false; } return true; } |
int f_filled(int a, int b) { string s = to!string(b); int i; for (i = 0; i < s.length; i++) { if (s[i] != '9') break; } int result; if (i == s.length) result = a * s.length; else result = a * (s.length - 1); return result; } |
int f_filled(string str) { int n = str.length; int[][] dp = new int[n + 1][n + 1]; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (str[i - 1] == str[j - 1] && i != j) dp[i][j] = 1 + dp[i - 1][j - 1]; else dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]); } } return dp[n][n]; } |
bool f_filled (string s, char c) { bool oneSeen = false; int i = 0, n = s.length; while (i < n) { if (s[i] == c) { if (oneSeen) return false; while (i < n && s[i] == c) i++; oneSeen = true; } else i++; } return true; } |
string f_filled(string s) { int n = s.length; string s1 = ""; s1 = s1 + toLower(s[0]); for (int i = 1; i < n; i++) { if (s[i] == ' ' && i < n) { s1 = s1 + toLower(s[i + 1]); i++; } else s1 = s1 + toUpper(s[i]); } return s1; } |
int f_filled(string str) { int n = str.length; int[][] C = new int[n][n]; bool[][] P = new bool[n][n]; int i, j, k, L; for (i = 0; i < n; i++) { P[i][i] = true; C[i][i] = 0; } for (L = 2; L <= n; L++) { for (i = 0; i < n - L + 1; i++) { j = i + L - 1; if (L == 2) P[i][j] = (str[i] == str[j]); else P[i][j] = (str[i] == str[j]) && P[i + 1][j - 1]; if (P[i][j] == true) C[i][j] = 0; else { C[i][j] = int.max; for (k = i; k <= j - 1; k++) C[i][j] = min(C[i][j], C[i][k] + C[k + 1][j] + 1); } } } return C[0][n - 1]; } |
bool f_filled (string num) { int length = num.length; if (length == 1 && num[0] == '0') return true; if (length % 3 == 1) { num += "00"; length += 2; } else if (length % 3 == 2) { num += "0"; length += 1; } int sum = 0, p = 1; for (int i = length - 1; i >= 0; i--) { int group = 0; group += num[i--] - '0'; group += (num[i--] - '0') * 10; group += (num[i] - '0') * 100; sum = sum + group * p; p *= -1; } sum = abs(sum); return (sum % 13 == 0); } |
int f_filled(string str) { int N = str.length; int[][] cps = new int[N + 1][N + 1]; for (int i = 0; i < N; i++) cps[i][i] = 1; for (int L = 2; L <= N; L++) { for (int i = 0; i < N; i++) { int k = L + i - 1; if (k < N) { if (str[i] == str[k]) cps[i][k] = cps[i][k - 1] + cps[i + 1][k] + 1; else cps[i][k] = cps[i][k - 1] + cps[i + 1][k] - cps[i + 1][k - 1]; } } } return cps[0][N - 1]; } |
bool f_filled(string str) { int i = 0, j = str.length - 1; while (i < j) { if (str[i] != str[j]) return false; i++; j--; } return true; } |
bool f_filled (string[] str1, string[] str2) { int n1 = str1.length; int n2 = str2.length; if (n1 != n2) return false; sort (str1); sort (str2); for (int i = 0; i < n1; i++) if (str1[i] != str2[i]) return false; return true; } |
int f_filled(string str) { int len = str.length; int[] open = new int[len + 1]; int[] close = new int[len + 1]; int index = -1; open[0] = 0; close[len] = 0; if (str[0] == '(') open[1] = 1; if (str[len - 1] == ')') close[len - 1] = 1; for (int i = 1; i < len; i++) { if (str[i] == '(') open[i + 1] = open[i] + 1; else open[i + 1] = open[i]; } for (int i = len - 2; i >= 0; i--) { if (str[i] == ')') close[i] = close[i + 1] + 1; else close[i] = close[i + 1]; } if (open[len] == 0) return len; if (close[0] == 0) return 0; for (int i = 0; i <= len; i++) if (open[i] == close[i]) index = i; return index; } |
char f_filled(string str) { int len = str.length; int count = 0; char res = str[0]; for (int i = 0; i < len; i++) { int cur_count = 1; for (int j = i + 1; j < len; j++) { if (str[i] != str[j]) break; cur_count++; } if (cur_count > count) { count = cur_count; res = str[i]; } } return res; } |
int f_filled (string str) { int n = str.length; int res = -1; for (int i = 0; i < n - 1; i++) { for (int j = i + 1; j < n; j++) { if (str[i] == str[j]) { res = max(res, abs(j - i - 1)); } } } return res; } |
bool f_filled (string str1, string str2) { if (str1.length != str2.length) return false; string clock_rot = ""; string anticlock_rot = ""; int len = str2.length; anticlock_rot = anticlock_rot + str2.substring (len - 2, len) + str2.substring (0, len - 2); clock_rot = clock_rot + str2.substring (2) + str2.substring (0, 2); return (str1 == clock_rot || str1 == anticlock_rot); } |
int f_filled (string str) { int len = str.length; bool oneSeen = false; int count = 0; for (int i = 0; i < len; i++) { char getChar = str[i]; if (getChar == '1' && oneSeen) { if (str[i - 1] == '0') count++; } if (getChar == '1' && !oneSeen) oneSeen = true; if (getChar != '0' && str[i] != '1') oneSeen = false; } return count; } |
int f_filled(string str) { int n = str.length; int[] C = new int[n]; bool[][] P = new bool[n][n]; int i, j, k, L; for (i = 0; i < n; i++) { P[i][i] = true; } for (L = 2; L <= n; L++) { for (i = 0; i < n - L + 1; i++) { j = i + L - 1; if (L == 2) P[i][j] = (str[i] == str[j]); else P[i][j] = (str[i] == str[j]) && P[i + 1][j - 1]; } } for (i = 0; i < n; i++) { if (P[0][i] == true) C[i] = 0; else { C[i] = int.max; for (j = 0; j < i; j++) { if (P[j + 1][i] == true && 1 + C[j] < C[i]) C[i] = 1 + C[j]; } } } return C[n - 1]; } |
int f_filled (string N) { int len = N.length; int l = len / 2; int count = 0; for (int i = 1; i <= l; i++) { string s = N.substring(0, i); int l1 = s.length; string t = N.substring(i, l1 + i); if (s[0] == '0' || t[0] == '0') continue; if (s == t) count++; } return count; } |
bool f_filled (string s) { int l = s.length; if (l % 2 == 1) { return false; } int i = 0; int j = l - 1; while (i < j) { if (s[i] != 'a' || s[j] != 'b') { return false; } i++; j--; } return true; } |
bool f_filled (string str, string corner) { int n = str.length; int cl = corner.length; if (n < cl) return false; return (str.substring(0, cl) == corner && str.substring(n - cl, n) == corner); } |
string f_filled(string s) { int l = s.length; string s1 = ""; bool isEven = l % 2 == 0; for (int i = 0; i < l; i += 2) { if (isEven) { s1 += s[i] + s[i + 1]; } else { if (l - i > 1) { s1 += s[i]; s1 = s[i + 1] + s1; } else { s1 += s[i]; } } } return s1; } |
bool f_filled(string str) { int i, j, k, l = str.length; int[] arr = new int[l]; for (i = 0; i < l; i++) { for (j = i; j < l; j++) { for (k = j; k < l; k++) { if (arr[i] % 8 == 0) return true; else if ((arr[i] * 10 + arr[j]) % 8 == 0 && i != j) return true; else if ((arr[i] * 100 + arr[j] * 10 + arr[k]) % 8 == 0 && i != j && j != k && i != k) return true; } } } return false; } |
string f_filled(string n) { string res = n; for (int j = n.length - 1; j >= 0; --j) res += n[j]; return res; } |
int f_filled(string s) { int n = s.length; int[] a = new int[n]; for (int i = n - 1; i >= 0; i--) { int back_up = 0; for (int j = i; j < n; j++) { if (j == i) a[j] = 1; else if (s[i] == s[j]) { int temp = a[j]; a[j] = back_up + 2; back_up = temp; } else { back_up = a[j]; a[j] = max(a[j - 1], a[j]); } } } return a[n - 1]; } |
string f_filled(string s) { int n = s.length; int sub_count = n * (n + 1) / 2; string[] arr = new string[sub_count]; int index = 0; for (int i = 0; i < n; i++) { for (int len = 1; len <= n - i; len++) { arr[index++] = s.substring(i, i + len); } } sort(arr); string res = ""; for (int i = 0; i < sub_count; i++) { res += arr[i]; } return res; } |
bool f_filled (string s) { int l = s.length; for (int i = 0, j = l - 1; i <= j; i++, j--) { if (s[i] != s[j]) { return false; } } return true; } |
int f_filled(string tree, int k) { int level = -1; int sum = 0; int n = tree.length; for (int i = 0; i < n; i++) { if (tree[i] == '(') level++; else if (tree[i] == ')') level--; else if (level == k) sum += (tree[i] - '0'); } return sum; } |
string f_filled(string str) { int i = str.length - 1; int start, end = i + 1; string result = ""; while (i >= 0) { if (str[i] == ' ') { start = i + 1; while (start != end) result ~= str[start++]; result ~= ' '; end = i; } i--; } start = 0; while (start != end) result ~= str[start++]; return result; } |
int f_filled (string num) { int len = num.length; int count_zero = 0; char ch; for (int i = 1; i < len; i++) { ch = num[i]; if (ch == '0') count_zero++; } return count_zero; } |
int f_filled(string str) { int N = str.length; int[][] dp = new int[N + 1][N + 1]; for (int i = 0; i <= N; i++) for (int j = 0; j <= N; j++) dp[i][j] = 0; for (int len = 1; len <= N; len++) { for (int i = 0, j = len - 1; j < N; i++, j++) { if (len == 1) dp[i][j] = 1; else { dp[i][j] = 1 + dp[i + 1][j]; if (str[i] == str[i + 1]) dp[i][j] = min(1 + dp[i + 2][j], dp[i][j]); for (int K = i + 2; K <= j; K++) if (str[i] == str[K]) dp[i][j] = min(dp[i + 1][K - 1] + dp[K + 1][j], dp[i][j]); } } } return dp[0][N - 1]; } |
string f_filled(string num) { int l = num.length; int i; for (i = l - 1; i >= 0; i--) { if (num[i] == '0') { num = num.substring(0, i) ~ "1" ~ num.substring(i + 1); break; } else { num = num.substring(0, i) ~ "0" ~ num.substring(i + 1); } } if (i < 0) { num = "1" ~ num; } return num; } |
bool f_filled (string s) { int n = s.length; for (int i = 1; i < n; i++) if (s[i] != s[0]) return false; return true; } |
string f_filled (string str) { int n = str.length; string[] arr = new string[n]; string concat = str + str; for (int i = 0; i < n; i++) { arr[i] = concat.substring(i, i + n); } sort(arr); return arr[0]; } |
bool f_filled(string bin) { int n = bin.length; if (bin[n - 1] == '1') return false; int sum = 0; for (int i = n - 2; i >= 0; i--) { if (bin[i] == '1') { int posFromRight = n - i - 1; if (posFromRight % 4 == 1) sum += 2; else if (posFromRight % 4 == 2) sum += 4; else if (posFromRight % 4 == 3) sum += 8; else if (posFromRight % 4 == 0) sum += 6; } } return sum % 10 == 0; } |
char f_filled (string str) { foreach (int i; 0 .. str.length) { if (str[i].isUpperCase) return str[i]; } return 0; } |
int f_filled (string s, int K) { int n = s.length; int C = 0, c1 = 0, c2 = 0; for (int i = 0; i < n; i++) { if (s[i] == 'a') c1++; if (s[i] == 'b') { c2++; C += c1; } } return C * K + (K * (K - 1) / 2) * c1 * c2; } |
char f_filled(string str) { int n = str.length; int count = 0; char res = str[0]; int cur_count = 1; for (int i = 0; i < n; i++) { if (i < n - 1 && str[i] == str[i + 1]) cur_count++; else { if (cur_count > count) { count = cur_count; res = str[i]; } cur_count = 1; } } return res; } |
int f_filled(string s) { int n = s.length; int[] lps = new int[n]; lps[0] = 0; int len = 0; int i = 1; while (i < n) { if (s[i] == s[len]) { len++; lps[i] = len; i++; } else { if (len != 0) { len = lps[len - 1]; } else { lps[i] = 0; i++; } } } int res = lps[n - 1]; return res > n / 2 ? n / 2 : res; } |
int f_filled (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; } |
double f_filled(int[] A, int K) { int n = A.length; double[] pre_sum = new double[n + 1]; pre_sum[0] = 0; for (int i = 0; i < n; i++) pre_sum[i + 1] = pre_sum[i] + A[i]; double[] dp = new double[n]; double sum = 0; for (int i = 0; i < n; i++) dp[i] = (pre_sum[n] - pre_sum[i]) / (n - i); for (int k = 0; k < K - 1; k++) for (int i = 0; i < n; i++) for (int j = i + 1; j < n; j++) dp[i] = Math.max(dp[i], (pre_sum[j] - pre_sum[i]) / (j - i) + dp[j]); return dp[0]; } |
int f_filled(string str) { int n = str.length; return n * (n + 1) / 2; } |
int f_filled (string str) { int result = 0; int n = str.length; for (int i = 0; i < n; i++) for (int j = i + 1; j < n; j++) if (abs(str[i] - str[j]) == abs(i - j)) result++; return result; } |
No dataset card yet
- Downloads last month
- 7