kazuyamaa/gemma-2-2b-code-translate-dpo-merged
3B • Updated
prompt stringlengths 188 2.04k | chosen stringlengths 40 1.94k | rejected stringlengths 179 17.2k |
|---|---|---|
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LCS_FORMED_CONSECUTIVE_SEGMENTS_LEAST_LENGTH_K{
static int f_gold ( int k , String s1 , String s2 ) {
int n = s1 . length ( ) ;
int m = s2 . length ( ) ;
int lcs [ ] [ ] = new int [ n + 1 ] [ m + 1 ] ;
int... | def f_gold ( k , s1 , s2 ) :
n = len ( s1 )
m = len ( s2 )
lcs = [ [ 0 for x in range ( m + 1 ) ] for y in range ( n + 1 ) ]
cnt = [ [ 0 for x in range ( m + 1 ) ] for y in range ( n + 1 ) ]
for i in range ( 1 , n + 1 ) :
for j in range ( 1 , m + 1 ) :
lcs [ i ] [ j ] = max ( lcs... | package main
import "fmt"
func lcs(s0, s1 string) string {
n := len(s0)
m := len(s1)
dp := make([][]string, n+1)
for i := range dp {
dp[i] = make([]string, m+1)
}
var z string
for r := 1; r <= n; r++ {
for c := 1; c <= m; c++ {
switch s0[r-1] {
case s1[c-1]:
dp[r][c] = "diagonal"
z = "diagon... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_CHARACTERS_STRING_DISTANCE_ENGLISH_ALPHABETS{
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 ++ ... | def f_gold ( str1 ) :
result = 0 ;
n = len ( str1 )
for i in range ( 0 , n ) :
for j in range ( i + 1 , n ) :
if ( abs ( ord ( str1 [ i ] ) - ord ( str1 [ j ] ) ) == abs ( i - j ) ) :
result += 1 ;
return result ;
| package main
import "fmt"
func f(s string) int {
var count int
for i := range s {
c := s[i]
if c >= 'a' && c <= 'z' || c >= 'A' && c <= 'Z' {
count += int(math.Abs(float64(c - 'a') - float64(i - 'a')))
} else {
continue
}
for j := i + 1; j < len... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_DISTINCT_OCCURRENCES_AS_A_SUBSEQUENCE{
static int f_gold ( String S , String T ) {
int m = T . length ( ) ;
int n = S . length ( ) ;
if ( m > n ) return 0 ;
int mat [ ] [ ] = new int [ m + 1 ] [ n + ... | def f_gold ( S , T ) :
m = len ( T )
n = len ( S )
if m > n :
return 0
mat = [ [ 0 for _ in range ( n + 1 ) ] for __ in range ( m + 1 ) ]
for i in range ( 1 , m + 1 ) :
mat [ i ] [ 0 ] = 0
for j in range ( n + 1 ) :
mat [ 0 ] [ j ] = 1
for i in range ( 1 , m + 1 ) :
... | #include <iostream>
using namespace std;
class Solution {
public:
int countSubstr(string s, string t) {
const int MOD = 1e9+7;
auto f = [&](int x, int y){
long long ans = 0;
while(x && y){
ans += mod(min(y-2*x, x),MOD);
x -= min(y/2, max(y%2,... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_WHETHER_TWO_STRINGS_ARE_ANAGRAM_OF_EACH_OTHER{
static boolean f_gold ( char [ ] str1 , char [ ] str2 ) {
int n1 = str1 . length ;
int n2 = str2 . length ;
if ( n1 != n2 ) return false ;
Arrays . sort... | def f_gold ( str1 , str2 ) :
n1 = len ( str1 )
n2 = len ( str2 )
if n1 != n2 :
return 0
str1 = sorted ( str1 )
str2 = sorted ( str2 )
for i in range ( 0 , n1 ) :
if str1 [ i ] != str2 [ i ] :
return 0
return 1
| #include<iostream>
using namespace std;
bool f_gold(char* a, char* b)
{
int l = 0, r = 0;
while (a[l] == ' ') l++;
while (b[r] == ' ') r++;
const int len = min(l, r);
for (int i = 0; i < len; i++)
if (a[i + l] == b[i + r]) continue;
else return false;
return true;
}
void main()
{
cout << boolalpha << f... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_NUMBERS_CAN_CONSTRUCTED_USING_TWO_NUMBERS{
static int f_gold ( int n , int x , int y ) {
boolean [ ] arr = new boolean [ n + 1 ] ;
if ( x <= n ) arr [ x ] = true ;
if ( y <= n ) arr [ y ] = true ;
in... | def f_gold ( n , x , y ) :
arr = [ False for i in range ( n + 2 ) ]
if ( x <= n ) :
arr [ x ] = True
if ( y <= n ) :
arr [ y ] = True
result = 0
for i in range ( min ( x , y ) , n + 1 ) :
if ( arr [ i ] ) :
if ( i + x <= n ) :
arr [ i + x ] = True
... | #include <iostream>
using namespace std;
template<typename iterator>
void _print(iterator begin, iterator end)
{
for (; begin != end; ++begin) cout << ' ' << *begin);
}
class pair
{
public:
pair() :a_(0), b_(0){};
pair(int a, int b):a_(a),b_(b){}
bool operator ==(const pair& other) const { return ((other.a_)==th... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_PAIRWISE_PRODUCTS{
static int f_gold ( int n ) {
int sum = 0 ;
for ( int i = 1 ;
i <= n ;
i ++ ) for ( int j = i ;
j <= n ;
j ++ ) sum = sum + i * j ;
return sum ;
}
| def f_gold ( n ) :
sm = 0
for i in range ( 1 , n + 1 ) :
for j in range ( i , n + 1 ) :
sm = sm + i * j
return sm
| #include <iostream>
using namespace std;
class Solution {
public:
int pairwiseProductSum(int n) {
const int limit = 2e7;
int ans = 0, left = 1, right = 1;
while (left <= n && right <= n){
ans += left * right;
if (left <= right && right <= limit){
rig... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_SET_BITS_IN_AN_INTEGER{
static int f_gold ( int n ) {
int count = 0 ;
while ( n > 0 ) {
count += n & 1 ;
n >>= 1 ;
}
return count ;
}
| def f_gold ( n ) :
count = 0
while ( n ) :
count += n & 1
n >>= 1
return count
| package main
import "fmt"
func f(n uint64) int {
var bit uint64 = 1
for i := range bits(n) {
if !(bit>>i&1) {
break
}
bit <<= 1
}
return int(bit >> 32)
}
func bits(n uint64) []bool {
r := make([]bool, 64)
for ; n > 0; n >>= 1 {
r[n&31] = true
}
return r
}
func main() {
ints := [...]int{0, 1, 9,... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LONGEST_PALINDROME_SUBSEQUENCE_SPACE{
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 =... | def f_gold ( s ) :
n = len ( s )
a = [ 0 ] * n
for i in range ( n - 1 , - 1 , - 1 ) :
back_up = 0
for j in range ( i , n ) :
if j == i :
a [ j ] = 1
elif s [ i ] == s [ j ] :
temp = a [ j ]
a [ j ] = back_up + 2
... | package main
import "fmt"
func f(s string) []string {
var res [][]byte
b := []byte(s)
for i, c := range b {
res = append(res, append([]byte{}, c, b[i+1:]...))
}
m := make(map[string]bool)
var palindromes []string
for _, r := range res {
k := string(r)
_, seen := m[k]
m[k] = true
if !seen && isPalind... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class DYCK_PATH{
public static int f_gold ( int n ) {
int res = 1 ;
for ( int i = 0 ;
i < n ;
++ i ) {
res *= ( 2 * n - i ) ;
res /= ( i + 1 ) ;
}
return res / ( n + 1 ) ;
}
| def f_gold ( n ) :
res = 1
for i in range ( 0 , n ) :
res *= ( 2 * n - i )
res /= ( i + 1 )
return res / ( n + 1 )
| package main
import "fmt"
func gold(n uint) uint64 {
var r uint64
p := make([]uint, n+3)
d := []struct{ x, y uint }{
{0, 1},
{1, 2},
}
for _, dItem := range d {
x, y := dItem.x, dItem.y
if p[x] != 0 {
r += p[x]
} else if p[y] != 0 {
r -= p[y]
}
for i := x; i <= y; i++ {
p[i] += 1
}
}
... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MOBILE_NUMERIC_KEYPAD_PROBLEM{
static int f_gold ( char keypad [ ] [ ] , int n ) {
if ( keypad == null || n <= 0 ) return 0 ;
if ( n == 1 ) return 10 ;
int [ ] odd = new int [ 10 ] ;
int [ ] even = new int... | def f_gold ( keypad , n ) :
if ( not keypad or n <= 0 ) :
return 0
if ( n == 1 ) :
return 10
odd = [ 0 ] * 10
even = [ 0 ] * 10
i = 0
j = 0
useOdd = 0
totalCount = 0
for i in range ( 10 ) :
odd [ i ] = 1
for j in range ( 2 , n + 1 ) :
useOdd = 1 - ... | def f(n):
s=0
if n==1:
return 10
a=[0]*10
b=[0]*10
max=10**9+7
for i in range(1,10):
a[i]=1
for j in range(2,n+1):
u=1-u
if u==1:
b[0]=a[0]+a[8]
b[1]=a[1]+sum(a[2:]+a[:2])
b[2]=a[2]+sum(a[1:-1]+a[0:2])+a[3]+sum(a[:-2]+a[1:3]... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_VALID_SEQUENCE_DIVISIBLE_M_1{
static int f_gold ( int n , int index , int modulo , int M , int arr [ ] , int dp [ ] [ ] ) {
modulo = ( ( modulo % M ) + M ) % M ;
if ( index == n ) {
if ( modulo == 0 ... | def f_gold ( n , index , modulo , M , arr , dp ) :
modulo = ( ( modulo % M ) + M ) % M
if ( index == n ) :
if ( modulo == 0 ) :
return 1
return 0
if ( dp [ index ] [ modulo ] != - 1 ) :
return dp [ index ] [ modulo ]
placeAdd = f_gold ( n , index + 1 , modulo + arr [ ... | def gold(n,index,modulo,M):
mod = modulo%M+M
res=0
for i in range(len(arr)):
placeAdd=f_gold(n,i+1,modulo+arr[i],M)
placeMinus=f_gold(n,i+1,modulo-arr[i],M)
res+=min(placeAdd,placeMinus)
print("The number of ways to divide the given integer is ",res)
a=[25,49]
call gold 32 0 1 10**6 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class WAYS_TRANSFORMING_ONE_STRING_REMOVING_0_CHARACTERS{
static int f_gold ( String a , String b ) {
int n = a . length ( ) , m = b . length ( ) ;
if ( m == 0 ) {
return 1 ;
}
int dp [ ] [ ] = new int [ m +... | def f_gold ( a , b ) :
n = len ( a )
m = len ( b )
if m == 0 :
return 1
dp = [ [ 0 ] * ( n + 1 ) for _ in range ( m + 1 ) ]
for i in range ( m ) :
for j in range ( i , n ) :
if i == 0 :
if j == 0 :
if a [ j ] == b [ i ] :
... | def getA(N):
a = '0'
while True:
a += '1'
if len(a) != N or not all(c=='1' for c in a):
break
return a,N-len(a)-1
def getB(M):
b = ['0']
while True:
b +=['1']
if len(b[M]) != M and not all(c=='1' for c in b[M]):
break
return ''.join(b),M+1
def waysTransformOneStringRemoveZeroes(sX, sY):
n = l... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MARKOV_MATRIX{
static boolean f_gold ( double m [ ] [ ] ) {
for ( int i = 0 ;
i < m . length ;
i ++ ) {
double sum = 0 ;
for ( int j = 0 ;
j < m [ i ] . length ;
j ++ ) sum = sum + m [ i ] [ ... | def f_gold ( m ) :
for i in range ( 0 , len ( m ) ) :
sm = 0
for j in range ( 0 , len ( m [ i ] ) ) :
sm = sm + m [ i ] [ j ]
if ( sm != 1 ) :
return False
return True
| boolean f_gold ( double m [ ] [ ] ) {
int len = m . length , n = 0 ;
for ( int i = 0 ;
i < len ;
i ++ ) {
n += m [ i ] [ 0 ] ;
m [ i ] [ 0 ] *= - 1 ;
}
for ( int i = 0 ;
i < len ;
i ++ ) {
if ( Math.abs ( n ) > 1e-6 ) return false ;
}
return true ;
}
#include<iostream>
using namespace ... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHOCOLATE_DISTRIBUTION_PROBLEM{
static int f_gold ( int arr [ ] , int n , int m ) {
if ( m == 0 || n == 0 ) return 0 ;
Arrays . sort ( arr ) ;
if ( n < m ) return - 1 ;
int min_diff = Integer . MAX_VALUE ;... | import sys
def f_gold ( arr , n , m ) :
if ( m == 0 or n == 0 ) :
return 0
arr.sort ( )
if ( n < m ) :
return - 1
min_diff = sys.maxsize
first = 0
last = 0
i = 0
while ( i + m - 1 < n ) :
diff = arr [ i + m - 1 ] - arr [ i ]
if ( diff < min_diff ) :
... | f9
#include<iostream>
using namespace std;
template<typename T>T max(T a,T b)
{
return (a>b)?a:b;
}
template<typename T>pair<T,T> partition(const T* begin, const T* end, T key)
{
size_t j=0;
for(size_t i=0;i<end-begin;++i)
if(key<=get(i))j++;
swap(begin[j],end[0]);
while(j<end-begin){
do{
++j;
}whi... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_DIFFERENCE_BETWEEN_SUMS_OF_TWO_DIAGONALS_1{
public static int f_gold ( int arr [ ] [ ] , int n ) {
int d1 = 0 , d2 = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
d1 += arr [ i ] [ i ] ;
d2 += arr [ ... | def f_gold ( arr , n ) :
d1 = 0
d2 = 0
for i in range ( 0 , n ) :
d1 = d1 + arr [ i ] [ i ]
d2 = d2 + arr [ i ] [ n - i - 1 ]
return abs ( d1 - d2 )
| package main
import "fmt"
func f_gold(a []int) int {
var sum int
for _, e := range a {
sum += e
}
return sum / 2
}
type tuple struct {
x, y int
}
func newDiagonal(n int) []tuple {
tps := make([]tuple, n*n)
dl := 0
dr := n - 1
for i := range tps {
e := &tps[i]
if dl <= dr {
e.x = dl
e.y = i + 1... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class ROW_WISE_COMMON_ELEMENTS_TWO_DIAGONALS_SQUARE_MATRIX{
static int f_gold ( int mat [ ] [ ] , int n ) {
int res = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) if ( mat [ i ] [ i ] == mat [ i ] [ n - i - 1 ] ) res ++... | def f_gold ( mat , n ) :
res = 0
for i in range ( n ) :
if mat [ i ] [ i ] == mat [ i ] [ n - i - 1 ] :
res = res + 1
return res
| #include<iostream>
using namespace std;
template<typename iterator1, typename iterator2>
iterator2 find(iterator1 first, iterator1 last, iterator2 result)
{
for (; first != last && *first != *result; ++first);
if (first == last)
return result;
else
return ++first;
}
struct pair
{
int ... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_SUBARRAY_WITH_GIVEN_SUM_1{
static int f_gold ( int arr [ ] , int n , int sum ) {
int curr_sum = arr [ 0 ] , start = 0 , i ;
for ( i = 1 ;
i <= n ;
i ++ ) {
while ( curr_sum > sum && start < i - 1 ... | def f_gold ( arr , n , sum ) :
curr_sum = arr [ 0 ]
start = 0
i = 1
while i <= n :
while curr_sum > sum and start < i - 1 :
curr_sum = curr_sum - arr [ start ]
start += 1
if curr_sum == sum :
print ( "Sum found between indexes" )
print ( "%... | def gold(arr, n, sum):
curr_sum = arr[0]
start = 0
for i in range(1, n):
while curr_sum > sum and start < i-1:
curr_sum -= arr[start]
start += 1
if curr_sum == sum:
print("Sum found between indexes {} and {}".format(start, i-1))
return 1
... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class HYPERCUBE_GRAPH{
static int f_gold ( int n ) {
if ( n == 1 ) return 2 ;
return 2 * f_gold ( n - 1 ) ;
}
| def f_gold ( n ) :
if n == 1 :
return 2
return 2 * f_gold ( n - 1 )
| #include <iostream>
using namespace std;
int main(void)
{
cout << "Hypercube graph: F(n)" << endl;
for ( int i = 0 ; i <= 6 ; i ++ ) cout << i << ": " << f(i) << "\t";
system( "pause" );
return 0;
}
long long hyperCubeGraphF(unsigned N){
std::vector<uint32_t> tree(N);
tree[0] = 1;
size_t count=... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class HEXAGONAL_NUMBER{
static int f_gold ( int n ) {
return n * ( 2 * n - 1 ) ;
}
| def f_gold ( n ) :
return n * ( 2 * n - 1 )
| package main
import "fmt"
func f_gold(n int) int {
return n * (2*n-1)
}
type tuple struct {
i int
j int
}
var h = map[int]map[int]tuple{
0: {0: {0, 0}},
1: {0: {0, 0}},
2: {0: {0, 0}},
3: {0: {0, 0}},
4: {0: {0, 0}},
5: {0: {0, 0}}},
}
func generate(x, y int) []tuple {... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LEXICOGRAPHICALLY_NEXT_STRING{
public static String f_gold ( String str ) {
if ( str == "" ) return "a" ;
int i = str . length ( ) - 1 ;
while ( str . charAt ( i ) == 'z' && i >= 0 ) i -- ;
if ( i == - 1 )... | def f_gold ( s ) :
if ( s == " " ) :
return "a"
i = len ( s ) - 1
while ( s [ i ] == 'z' and i >= 0 ) :
i -= 1
if ( i == - 1 ) :
s = s + 'a'
else :
s = s.replace ( s [ i ] , chr ( ord ( s [ i ] ) + 1 ) , 1 )
return s
| #include <iostream>
#include <string>
std::string f(const std::string& s) {
auto res = "";
for (size_t i=0, l=s.length(); i<l;++i){
char c = toupper(s[i]);
res += isalpha(c-96)? tolower(c):c;
}
return res+('a'+1);
}
void test(std::string expected, const std::string& original) {
... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_BINOMIAL_COEFFICIENTS_1{
static int f_gold ( int n ) {
return ( 1 << n ) ;
}
| def f_gold ( n ) :
return ( 1 << n ) ;
| package main
import "fmt"
func f(n int) []int {
d := make([][]int, n+2)
for i := range d {
d[i] = make([]int, n+2)
}
var z int64
z = 1
for i := 0; i <= n; i++ {
j := 1 + i
if j > len(d[i]) {
for k := i; k <= n; k++ {
d[i][k] = 0
... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class ADD_TWO_NUMBERS_WITHOUT_USING_ARITHMETIC_OPERATORS{
static int f_gold ( int x , int y ) {
while ( y != 0 ) {
int carry = x & y ;
x = x ^ y ;
y = carry << 1 ;
}
return x ;
}
| def f_gold ( x , y ) :
while ( y != 0 ) :
carry = x & y
x = x ^ y
y = carry << 1
return x
| #include <iostream>
using namespace std;
template<typename T>
T f_gold(T a, T b) {
cout << "f_gold(" << a << ',' << b << ")=" << endl;
cin >> a >> b;
return f_gold(a,b);
}
int main() {
auto t = f_gold(23,45); cout << "t= " << t << "\n"; return 0; } |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_OPERATIONS_MAKE_STRINGAB_FREE{
static int f_gold ( char [ ] s ) {
int b_count = 0 ;
int res = 0 ;
for ( int i = 0 ;
i < s . length ;
i ++ ) {
if ( s [ s . length - i - 1 ] == 'a' ) {
res ... | def f_gold ( s ) :
b_count = 0
res = 0
for i in range ( len ( s ) ) :
if s [ ~ i ] == 'a' :
res = ( res + b_count )
b_count = ( b_count * 2 )
else :
b_count += 1
return res
| #include<iostream>
using namespace std;
template<typename iterator>
iterator count(iterator begin, iterator end){
auto it = begin;
while (it != end){
if(*it=='a'){
cout << "A" << endl;
break;
}
it++;
}
return it;
}
string makeStringAbFree(const strin... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SCHEDULE_JOBS_SERVER_GETS_EQUAL_LOAD{
static int f_gold ( int a [ ] , int b [ ] , int n ) {
int i ;
int s = 0 ;
for ( i = 0 ;
i < n ;
i ++ ) s += ( a [ i ] + b [ i ] ) ;
if ( n == 1 ) return a [ 0 ] + ... | def f_gold ( a , b , n ) :
s = 0
for i in range ( 0 , n ) :
s += a [ i ] + b [ i ]
if n == 1 :
return a [ 0 ] + b [ 0 ]
if s % n != 0 :
return - 1
x = s // n
for i in range ( 0 , n ) :
if a [ i ] > x :
return - 1
if i > 0 :
a [ i ] ... | function f_gold ($a, $b) {
$n = count($a);
if ($n === 1) {
return $a[0] + $b[0];
} elseif ($n !== 2) {
throw new \Exception('Not a valid problem');
}
$s = array_sum($a) + array_sum($b);
if ($s % $n !== 0) {
return -1;
}
$x = floor($s / $n);
foreach ($a as &$key => $value) {
if ($value ... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class HOW_TO_CHECK_IF_A_GIVEN_ARRAY_REPRESENTS_A_BINARY_HEAP_1{
static boolean f_gold ( int arr [ ] , int n ) {
for ( int i = 0 ;
i <= ( n - 2 ) / 2 ;
i ++ ) {
if ( arr [ 2 * i + 1 ] > arr [ i ] ) {
retu... | def f_gold ( arr , n ) :
for i in range ( int ( ( n - 2 ) / 2 ) + 1 ) :
if arr [ 2 * i + 1 ] > arr [ i ] :
return False
if ( 2 * i + 2 < n and arr [ 2 * i + 2 ] > arr [ i ] ) :
return False
return True
| #include<iostream>
using namespace std;
bool F(int a[], int n){
for(int i=0;i<(n-1)/2;i++){
if((a[2*i+1]>a[i])&&((a[2*i+2]>a[i]))) return false;
else if(((a[2*i+1]==a[i])&&(a[2*i+2]<a[i]))||((a[2*i+1]<a[i])&&(a[2*i+2]==a[i]]))) return false;
}
return true;
}
void test(string name, int (*arr)(int), bo... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMIZE_SUM_ARRII{
static int f_gold ( int arr [ ] , int n ) {
Arrays . sort ( arr ) ;
int sum = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) sum += ( arr [ i ] * i ) ;
return sum ;
}
| def f_gold ( arr , n ) :
arr.sort ( )
sum = 0
for i in range ( n ) :
sum += arr [ i ] * i
return sum
| package main
import "fmt"
func f_gold(a []int) int {
var res int
m := make(map[int]bool)
maxNum, maxCount := -1, 0
countMaxMap := map[int]int{}
sum: = 0
minSum: = 999999999
for _, num := range a {
if m[num] == true {
delete(m, num)
continue sum
} else {
m[num] = true
}
k := countMaxMap[num]
... |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_WHETHER_GIVEN_DEGREES_VERTICES_REPRESENT_GRAPH_TREE{
static boolean f_gold ( int degree [ ] , int n ) {
int deg_sum = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
deg_sum += degree [ i ] ;
}
return... | def f_gold ( degree , n ) :
deg_sum = sum ( degree )
if ( 2 * ( n - 1 ) == deg_sum ) :
return True
else :
return False
| #include<iostream>
using namespace std;
bool f(int degrees[], int n) {
int sum = 0;
for (int i = 0; i < n; i++) {
sum += degrees[i];
}
if (2 * (n-1) != sum) return false;
else return true;
}
void print(string ans, bool a) {
cout << ans << (a ? "Yes" : "No") << endl;
}
int main() {
int testcases; cin... |
End of preview. Expand in Data Studio
元データセットkazuyamaa/before-dpo-code-translateを二つの言語ペアになるように調整し、そのうえで元のデータをchosen、SFT後のモデルで出力したものをrejectedとして配置。
- Downloads last month
- 6
Models trained or fine-tuned on kazuyamaa/cpp-to-python-rlhf-dataset-ver01