Instruction stringlengths 45 106 | input_code stringlengths 1 13.7k | output_code stringlengths 1 13.7k |
|---|---|---|
Can you help me rewrite this code in C instead of Pascal, keeping it the same logically? | program Derangements_RC;
function FirstDerangement( var val : array of integer) : boolean;
var
n, j : integer;
begin
n := Length( val);
result := (n <> 1);
if n < 2 then exit;
if Odd(n) then begin
val[n - 3] := n - 2;
val[n - 2] := n - 1;
val[n - 1] := n - 3;
dec( n, 3);
end;
j := 0;
... | #include <stdio.h>
typedef unsigned long long LONG;
LONG deranged(int depth, int len, int *d, int show)
{
int i;
char tmp;
LONG count = 0;
if (depth == len) {
if (show) {
for (i = 0; i < len; i++) putchar(d[i] + 'a');
putc... |
Transform the following Pascal implementation into C, maintaining the same output and logic. | program Derangements_RC;
function FirstDerangement( var val : array of integer) : boolean;
var
n, j : integer;
begin
n := Length( val);
result := (n <> 1);
if n < 2 then exit;
if Odd(n) then begin
val[n - 3] := n - 2;
val[n - 2] := n - 1;
val[n - 1] := n - 3;
dec( n, 3);
end;
j := 0;
... | #include <stdio.h>
typedef unsigned long long LONG;
LONG deranged(int depth, int len, int *d, int show)
{
int i;
char tmp;
LONG count = 0;
if (depth == len) {
if (show) {
for (i = 0; i < len; i++) putchar(d[i] + 'a');
putc... |
Ensure the translated C# code behaves exactly like the original Pascal snippet. | program Derangements_RC;
function FirstDerangement( var val : array of integer) : boolean;
var
n, j : integer;
begin
n := Length( val);
result := (n <> 1);
if n < 2 then exit;
if Odd(n) then begin
val[n - 3] := n - 2;
val[n - 2] := n - 1;
val[n - 1] := n - 3;
dec( n, 3);
end;
j := 0;
... | using System;
class Derangements
{
static int n = 4;
static int [] buf = new int [n];
static bool [] used = new bool [n];
static void Main()
{
for (int i = 0; i < n; i++) used [i] = false;
rec(0);
}
static void rec(int ind)
{
for (int i = 0; i < n; i++)
{
if (!used [i] && i != in... |
Convert this Pascal snippet to C# and keep its semantics consistent. | program Derangements_RC;
function FirstDerangement( var val : array of integer) : boolean;
var
n, j : integer;
begin
n := Length( val);
result := (n <> 1);
if n < 2 then exit;
if Odd(n) then begin
val[n - 3] := n - 2;
val[n - 2] := n - 1;
val[n - 1] := n - 3;
dec( n, 3);
end;
j := 0;
... | using System;
class Derangements
{
static int n = 4;
static int [] buf = new int [n];
static bool [] used = new bool [n];
static void Main()
{
for (int i = 0; i < n; i++) used [i] = false;
rec(0);
}
static void rec(int ind)
{
for (int i = 0; i < n; i++)
{
if (!used [i] && i != in... |
Please provide an equivalent version of this Pascal code in Java. | program Derangements_RC;
function FirstDerangement( var val : array of integer) : boolean;
var
n, j : integer;
begin
n := Length( val);
result := (n <> 1);
if n < 2 then exit;
if Odd(n) then begin
val[n - 3] := n - 2;
val[n - 2] := n - 1;
val[n - 1] := n - 3;
dec( n, 3);
end;
j := 0;
... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Derangement {
public static void main(String[] args) {
System.out.println("derangements for n = 4\n");
for (Object d : (ArrayList)(derangements(4, false)[0])) {
System.out.println(Arrays.toString(... |
Please provide an equivalent version of this Pascal code in Java. | program Derangements_RC;
function FirstDerangement( var val : array of integer) : boolean;
var
n, j : integer;
begin
n := Length( val);
result := (n <> 1);
if n < 2 then exit;
if Odd(n) then begin
val[n - 3] := n - 2;
val[n - 2] := n - 1;
val[n - 1] := n - 3;
dec( n, 3);
end;
j := 0;
... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Derangement {
public static void main(String[] args) {
System.out.println("derangements for n = 4\n");
for (Object d : (ArrayList)(derangements(4, false)[0])) {
System.out.println(Arrays.toString(... |
Generate a Python translation of this Pascal snippet without changing its computational steps. | program Derangements_RC;
function FirstDerangement( var val : array of integer) : boolean;
var
n, j : integer;
begin
n := Length( val);
result := (n <> 1);
if n < 2 then exit;
if Odd(n) then begin
val[n - 3] := n - 2;
val[n - 2] := n - 1;
val[n - 1] := n - 3;
dec( n, 3);
end;
j := 0;
... | from itertools import permutations
import math
def derangements(n):
'All deranged permutations of the integers 0..n-1 inclusive'
return ( perm for perm in permutations(range(n))
if all(indx != p for indx, p in enumerate(perm)) )
def subfact(n):
if n == 2 or n == 0:
return 1
elif ... |
Port the following code from Pascal to Python with equivalent syntax and logic. | program Derangements_RC;
function FirstDerangement( var val : array of integer) : boolean;
var
n, j : integer;
begin
n := Length( val);
result := (n <> 1);
if n < 2 then exit;
if Odd(n) then begin
val[n - 3] := n - 2;
val[n - 2] := n - 1;
val[n - 1] := n - 3;
dec( n, 3);
end;
j := 0;
... | from itertools import permutations
import math
def derangements(n):
'All deranged permutations of the integers 0..n-1 inclusive'
return ( perm for perm in permutations(range(n))
if all(indx != p for indx, p in enumerate(perm)) )
def subfact(n):
if n == 2 or n == 0:
return 1
elif ... |
Port the provided Pascal code into Go while preserving the original functionality. | program Derangements_RC;
function FirstDerangement( var val : array of integer) : boolean;
var
n, j : integer;
begin
n := Length( val);
result := (n <> 1);
if n < 2 then exit;
if Odd(n) then begin
val[n - 3] := n - 2;
val[n - 2] := n - 1;
val[n - 1] := n - 3;
dec( n, 3);
end;
j := 0;
... | package main
import (
"fmt"
"math/big"
)
func dList(n int) (r [][]int) {
a := make([]int, n)
for i := range a {
a[i] = i
}
var recurse func(last int)
recurse = func(last int) {
if last == 0 {
for j, v := range a {
... |
Write a version of this Pascal function in Go with identical behavior. | program Derangements_RC;
function FirstDerangement( var val : array of integer) : boolean;
var
n, j : integer;
begin
n := Length( val);
result := (n <> 1);
if n < 2 then exit;
if Odd(n) then begin
val[n - 3] := n - 2;
val[n - 2] := n - 1;
val[n - 1] := n - 3;
dec( n, 3);
end;
j := 0;
... | package main
import (
"fmt"
"math/big"
)
func dList(n int) (r [][]int) {
a := make([]int, n)
for i := range a {
a[i] = i
}
var recurse func(last int)
recurse = func(last int) {
if last == 0 {
for j, v := range a {
... |
Preserve the algorithm and functionality while converting the code from Perl to C. | sub d {
$
grep { $_[$_] != @{$_[0]} } 1 .. $
: $_[0]
}
sub deranged {
my ($result, @avail) = @_;
return $result if !@avail;
my @list;
for my $i (0 .. $
next if $... | #include <stdio.h>
typedef unsigned long long LONG;
LONG deranged(int depth, int len, int *d, int show)
{
int i;
char tmp;
LONG count = 0;
if (depth == len) {
if (show) {
for (i = 0; i < len; i++) putchar(d[i] + 'a');
putc... |
Rewrite this program in C while keeping its functionality equivalent to the Perl version. | sub d {
$
grep { $_[$_] != @{$_[0]} } 1 .. $
: $_[0]
}
sub deranged {
my ($result, @avail) = @_;
return $result if !@avail;
my @list;
for my $i (0 .. $
next if $... | #include <stdio.h>
typedef unsigned long long LONG;
LONG deranged(int depth, int len, int *d, int show)
{
int i;
char tmp;
LONG count = 0;
if (depth == len) {
if (show) {
for (i = 0; i < len; i++) putchar(d[i] + 'a');
putc... |
Preserve the algorithm and functionality while converting the code from Perl to C#. | sub d {
$
grep { $_[$_] != @{$_[0]} } 1 .. $
: $_[0]
}
sub deranged {
my ($result, @avail) = @_;
return $result if !@avail;
my @list;
for my $i (0 .. $
next if $... | using System;
class Derangements
{
static int n = 4;
static int [] buf = new int [n];
static bool [] used = new bool [n];
static void Main()
{
for (int i = 0; i < n; i++) used [i] = false;
rec(0);
}
static void rec(int ind)
{
for (int i = 0; i < n; i++)
{
if (!used [i] && i != in... |
Convert this Perl snippet to C# and keep its semantics consistent. | sub d {
$
grep { $_[$_] != @{$_[0]} } 1 .. $
: $_[0]
}
sub deranged {
my ($result, @avail) = @_;
return $result if !@avail;
my @list;
for my $i (0 .. $
next if $... | using System;
class Derangements
{
static int n = 4;
static int [] buf = new int [n];
static bool [] used = new bool [n];
static void Main()
{
for (int i = 0; i < n; i++) used [i] = false;
rec(0);
}
static void rec(int ind)
{
for (int i = 0; i < n; i++)
{
if (!used [i] && i != in... |
Convert this Perl block to Java, preserving its control flow and logic. | sub d {
$
grep { $_[$_] != @{$_[0]} } 1 .. $
: $_[0]
}
sub deranged {
my ($result, @avail) = @_;
return $result if !@avail;
my @list;
for my $i (0 .. $
next if $... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Derangement {
public static void main(String[] args) {
System.out.println("derangements for n = 4\n");
for (Object d : (ArrayList)(derangements(4, false)[0])) {
System.out.println(Arrays.toString(... |
Convert this Perl block to Java, preserving its control flow and logic. | sub d {
$
grep { $_[$_] != @{$_[0]} } 1 .. $
: $_[0]
}
sub deranged {
my ($result, @avail) = @_;
return $result if !@avail;
my @list;
for my $i (0 .. $
next if $... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Derangement {
public static void main(String[] args) {
System.out.println("derangements for n = 4\n");
for (Object d : (ArrayList)(derangements(4, false)[0])) {
System.out.println(Arrays.toString(... |
Rewrite the snippet below in Python so it works the same as the original Perl code. | sub d {
$
grep { $_[$_] != @{$_[0]} } 1 .. $
: $_[0]
}
sub deranged {
my ($result, @avail) = @_;
return $result if !@avail;
my @list;
for my $i (0 .. $
next if $... | from itertools import permutations
import math
def derangements(n):
'All deranged permutations of the integers 0..n-1 inclusive'
return ( perm for perm in permutations(range(n))
if all(indx != p for indx, p in enumerate(perm)) )
def subfact(n):
if n == 2 or n == 0:
return 1
elif ... |
Rewrite the snippet below in Python so it works the same as the original Perl code. | sub d {
$
grep { $_[$_] != @{$_[0]} } 1 .. $
: $_[0]
}
sub deranged {
my ($result, @avail) = @_;
return $result if !@avail;
my @list;
for my $i (0 .. $
next if $... | from itertools import permutations
import math
def derangements(n):
'All deranged permutations of the integers 0..n-1 inclusive'
return ( perm for perm in permutations(range(n))
if all(indx != p for indx, p in enumerate(perm)) )
def subfact(n):
if n == 2 or n == 0:
return 1
elif ... |
Maintain the same structure and functionality when rewriting this code in Go. | sub d {
$
grep { $_[$_] != @{$_[0]} } 1 .. $
: $_[0]
}
sub deranged {
my ($result, @avail) = @_;
return $result if !@avail;
my @list;
for my $i (0 .. $
next if $... | package main
import (
"fmt"
"math/big"
)
func dList(n int) (r [][]int) {
a := make([]int, n)
for i := range a {
a[i] = i
}
var recurse func(last int)
recurse = func(last int) {
if last == 0 {
for j, v := range a {
... |
Rewrite this program in Go while keeping its functionality equivalent to the Perl version. | sub d {
$
grep { $_[$_] != @{$_[0]} } 1 .. $
: $_[0]
}
sub deranged {
my ($result, @avail) = @_;
return $result if !@avail;
my @list;
for my $i (0 .. $
next if $... | package main
import (
"fmt"
"math/big"
)
func dList(n int) (r [][]int) {
a := make([]int, n)
for i := range a {
a[i] = i
}
var recurse func(last int)
recurse = func(last int) {
if last == 0 {
for j, v := range a {
... |
Write a version of this Racket function in C with identical behavior. | #lang racket
(define (all-misplaced? l)
(for/and ([x (in-list l)] [n (in-naturals 1)]) (not (= x n))))
(define (derangements n)
(define (all-misplaced? l1 l2)
(or (null? l1)
(and (not (eq? (car l1) (car l2)))
(all-misplaced? (cdr l1) (cdr l2)))))
(define l (range n))
(for/list ([p (p... | #include <stdio.h>
typedef unsigned long long LONG;
LONG deranged(int depth, int len, int *d, int show)
{
int i;
char tmp;
LONG count = 0;
if (depth == len) {
if (show) {
for (i = 0; i < len; i++) putchar(d[i] + 'a');
putc... |
Translate the given Racket code snippet into C without altering its behavior. | #lang racket
(define (all-misplaced? l)
(for/and ([x (in-list l)] [n (in-naturals 1)]) (not (= x n))))
(define (derangements n)
(define (all-misplaced? l1 l2)
(or (null? l1)
(and (not (eq? (car l1) (car l2)))
(all-misplaced? (cdr l1) (cdr l2)))))
(define l (range n))
(for/list ([p (p... | #include <stdio.h>
typedef unsigned long long LONG;
LONG deranged(int depth, int len, int *d, int show)
{
int i;
char tmp;
LONG count = 0;
if (depth == len) {
if (show) {
for (i = 0; i < len; i++) putchar(d[i] + 'a');
putc... |
Generate an equivalent C# version of this Racket code. | #lang racket
(define (all-misplaced? l)
(for/and ([x (in-list l)] [n (in-naturals 1)]) (not (= x n))))
(define (derangements n)
(define (all-misplaced? l1 l2)
(or (null? l1)
(and (not (eq? (car l1) (car l2)))
(all-misplaced? (cdr l1) (cdr l2)))))
(define l (range n))
(for/list ([p (p... | using System;
class Derangements
{
static int n = 4;
static int [] buf = new int [n];
static bool [] used = new bool [n];
static void Main()
{
for (int i = 0; i < n; i++) used [i] = false;
rec(0);
}
static void rec(int ind)
{
for (int i = 0; i < n; i++)
{
if (!used [i] && i != in... |
Keep all operations the same but rewrite the snippet in C#. | #lang racket
(define (all-misplaced? l)
(for/and ([x (in-list l)] [n (in-naturals 1)]) (not (= x n))))
(define (derangements n)
(define (all-misplaced? l1 l2)
(or (null? l1)
(and (not (eq? (car l1) (car l2)))
(all-misplaced? (cdr l1) (cdr l2)))))
(define l (range n))
(for/list ([p (p... | using System;
class Derangements
{
static int n = 4;
static int [] buf = new int [n];
static bool [] used = new bool [n];
static void Main()
{
for (int i = 0; i < n; i++) used [i] = false;
rec(0);
}
static void rec(int ind)
{
for (int i = 0; i < n; i++)
{
if (!used [i] && i != in... |
Change the programming language of this snippet from Racket to Java without modifying what it does. | #lang racket
(define (all-misplaced? l)
(for/and ([x (in-list l)] [n (in-naturals 1)]) (not (= x n))))
(define (derangements n)
(define (all-misplaced? l1 l2)
(or (null? l1)
(and (not (eq? (car l1) (car l2)))
(all-misplaced? (cdr l1) (cdr l2)))))
(define l (range n))
(for/list ([p (p... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Derangement {
public static void main(String[] args) {
System.out.println("derangements for n = 4\n");
for (Object d : (ArrayList)(derangements(4, false)[0])) {
System.out.println(Arrays.toString(... |
Transform the following Racket implementation into Java, maintaining the same output and logic. | #lang racket
(define (all-misplaced? l)
(for/and ([x (in-list l)] [n (in-naturals 1)]) (not (= x n))))
(define (derangements n)
(define (all-misplaced? l1 l2)
(or (null? l1)
(and (not (eq? (car l1) (car l2)))
(all-misplaced? (cdr l1) (cdr l2)))))
(define l (range n))
(for/list ([p (p... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Derangement {
public static void main(String[] args) {
System.out.println("derangements for n = 4\n");
for (Object d : (ArrayList)(derangements(4, false)[0])) {
System.out.println(Arrays.toString(... |
Port the following code from Racket to Python with equivalent syntax and logic. | #lang racket
(define (all-misplaced? l)
(for/and ([x (in-list l)] [n (in-naturals 1)]) (not (= x n))))
(define (derangements n)
(define (all-misplaced? l1 l2)
(or (null? l1)
(and (not (eq? (car l1) (car l2)))
(all-misplaced? (cdr l1) (cdr l2)))))
(define l (range n))
(for/list ([p (p... | from itertools import permutations
import math
def derangements(n):
'All deranged permutations of the integers 0..n-1 inclusive'
return ( perm for perm in permutations(range(n))
if all(indx != p for indx, p in enumerate(perm)) )
def subfact(n):
if n == 2 or n == 0:
return 1
elif ... |
Preserve the algorithm and functionality while converting the code from Racket to Python. | #lang racket
(define (all-misplaced? l)
(for/and ([x (in-list l)] [n (in-naturals 1)]) (not (= x n))))
(define (derangements n)
(define (all-misplaced? l1 l2)
(or (null? l1)
(and (not (eq? (car l1) (car l2)))
(all-misplaced? (cdr l1) (cdr l2)))))
(define l (range n))
(for/list ([p (p... | from itertools import permutations
import math
def derangements(n):
'All deranged permutations of the integers 0..n-1 inclusive'
return ( perm for perm in permutations(range(n))
if all(indx != p for indx, p in enumerate(perm)) )
def subfact(n):
if n == 2 or n == 0:
return 1
elif ... |
Write a version of this Racket function in Go with identical behavior. | #lang racket
(define (all-misplaced? l)
(for/and ([x (in-list l)] [n (in-naturals 1)]) (not (= x n))))
(define (derangements n)
(define (all-misplaced? l1 l2)
(or (null? l1)
(and (not (eq? (car l1) (car l2)))
(all-misplaced? (cdr l1) (cdr l2)))))
(define l (range n))
(for/list ([p (p... | package main
import (
"fmt"
"math/big"
)
func dList(n int) (r [][]int) {
a := make([]int, n)
for i := range a {
a[i] = i
}
var recurse func(last int)
recurse = func(last int) {
if last == 0 {
for j, v := range a {
... |
Maintain the same structure and functionality when rewriting this code in Go. | #lang racket
(define (all-misplaced? l)
(for/and ([x (in-list l)] [n (in-naturals 1)]) (not (= x n))))
(define (derangements n)
(define (all-misplaced? l1 l2)
(or (null? l1)
(and (not (eq? (car l1) (car l2)))
(all-misplaced? (cdr l1) (cdr l2)))))
(define l (range n))
(for/list ([p (p... | package main
import (
"fmt"
"math/big"
)
func dList(n int) (r [][]int) {
a := make([]int, n)
for i := range a {
a[i] = i
}
var recurse func(last int)
recurse = func(last int) {
if last == 0 {
for j, v := range a {
... |
Convert the following code from REXX to C, ensuring the logic remains intact. |
numeric digits 1000
parse arg N .; if N=='' | N=="," then N=4
d= derangeSet(N)
say d 'derangements for' N "items are:"
say
do i=1 for d
say right('derangement', 22) right(i, length(d) ) ... | #include <stdio.h>
typedef unsigned long long LONG;
LONG deranged(int depth, int len, int *d, int show)
{
int i;
char tmp;
LONG count = 0;
if (depth == len) {
if (show) {
for (i = 0; i < len; i++) putchar(d[i] + 'a');
putc... |
Rewrite this program in C while keeping its functionality equivalent to the REXX version. |
numeric digits 1000
parse arg N .; if N=='' | N=="," then N=4
d= derangeSet(N)
say d 'derangements for' N "items are:"
say
do i=1 for d
say right('derangement', 22) right(i, length(d) ) ... | #include <stdio.h>
typedef unsigned long long LONG;
LONG deranged(int depth, int len, int *d, int show)
{
int i;
char tmp;
LONG count = 0;
if (depth == len) {
if (show) {
for (i = 0; i < len; i++) putchar(d[i] + 'a');
putc... |
Preserve the algorithm and functionality while converting the code from REXX to C#. |
numeric digits 1000
parse arg N .; if N=='' | N=="," then N=4
d= derangeSet(N)
say d 'derangements for' N "items are:"
say
do i=1 for d
say right('derangement', 22) right(i, length(d) ) ... | using System;
class Derangements
{
static int n = 4;
static int [] buf = new int [n];
static bool [] used = new bool [n];
static void Main()
{
for (int i = 0; i < n; i++) used [i] = false;
rec(0);
}
static void rec(int ind)
{
for (int i = 0; i < n; i++)
{
if (!used [i] && i != in... |
Maintain the same structure and functionality when rewriting this code in C#. |
numeric digits 1000
parse arg N .; if N=='' | N=="," then N=4
d= derangeSet(N)
say d 'derangements for' N "items are:"
say
do i=1 for d
say right('derangement', 22) right(i, length(d) ) ... | using System;
class Derangements
{
static int n = 4;
static int [] buf = new int [n];
static bool [] used = new bool [n];
static void Main()
{
for (int i = 0; i < n; i++) used [i] = false;
rec(0);
}
static void rec(int ind)
{
for (int i = 0; i < n; i++)
{
if (!used [i] && i != in... |
Produce a language-to-language conversion: from REXX to Java, same semantics. |
numeric digits 1000
parse arg N .; if N=='' | N=="," then N=4
d= derangeSet(N)
say d 'derangements for' N "items are:"
say
do i=1 for d
say right('derangement', 22) right(i, length(d) ) ... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Derangement {
public static void main(String[] args) {
System.out.println("derangements for n = 4\n");
for (Object d : (ArrayList)(derangements(4, false)[0])) {
System.out.println(Arrays.toString(... |
Convert the following code from REXX to Java, ensuring the logic remains intact. |
numeric digits 1000
parse arg N .; if N=='' | N=="," then N=4
d= derangeSet(N)
say d 'derangements for' N "items are:"
say
do i=1 for d
say right('derangement', 22) right(i, length(d) ) ... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Derangement {
public static void main(String[] args) {
System.out.println("derangements for n = 4\n");
for (Object d : (ArrayList)(derangements(4, false)[0])) {
System.out.println(Arrays.toString(... |
Change the programming language of this snippet from REXX to Python without modifying what it does. |
numeric digits 1000
parse arg N .; if N=='' | N=="," then N=4
d= derangeSet(N)
say d 'derangements for' N "items are:"
say
do i=1 for d
say right('derangement', 22) right(i, length(d) ) ... | from itertools import permutations
import math
def derangements(n):
'All deranged permutations of the integers 0..n-1 inclusive'
return ( perm for perm in permutations(range(n))
if all(indx != p for indx, p in enumerate(perm)) )
def subfact(n):
if n == 2 or n == 0:
return 1
elif ... |
Write the same algorithm in Python as shown in this REXX implementation. |
numeric digits 1000
parse arg N .; if N=='' | N=="," then N=4
d= derangeSet(N)
say d 'derangements for' N "items are:"
say
do i=1 for d
say right('derangement', 22) right(i, length(d) ) ... | from itertools import permutations
import math
def derangements(n):
'All deranged permutations of the integers 0..n-1 inclusive'
return ( perm for perm in permutations(range(n))
if all(indx != p for indx, p in enumerate(perm)) )
def subfact(n):
if n == 2 or n == 0:
return 1
elif ... |
Convert the following code from REXX to Go, ensuring the logic remains intact. |
numeric digits 1000
parse arg N .; if N=='' | N=="," then N=4
d= derangeSet(N)
say d 'derangements for' N "items are:"
say
do i=1 for d
say right('derangement', 22) right(i, length(d) ) ... | package main
import (
"fmt"
"math/big"
)
func dList(n int) (r [][]int) {
a := make([]int, n)
for i := range a {
a[i] = i
}
var recurse func(last int)
recurse = func(last int) {
if last == 0 {
for j, v := range a {
... |
Generate a Go translation of this REXX snippet without changing its computational steps. |
numeric digits 1000
parse arg N .; if N=='' | N=="," then N=4
d= derangeSet(N)
say d 'derangements for' N "items are:"
say
do i=1 for d
say right('derangement', 22) right(i, length(d) ) ... | package main
import (
"fmt"
"math/big"
)
func dList(n int) (r [][]int) {
a := make([]int, n)
for i := range a {
a[i] = i
}
var recurse func(last int)
recurse = func(last int) {
if last == 0 {
for j, v := range a {
... |
Can you help me rewrite this code in C instead of Ruby, keeping it the same logically? | def derangements(n)
ary = (1 .. n).to_a
ary.permutation.select do |perm|
ary.zip(perm).all? {|a,b| a != b}
end
end
def subfact(n)
case n
when 0 then 1
when 1 then 0
else (n-1)*(subfact(n-1) + subfact(n-2))
end
end
puts "derangements for n = 4"
derangements(4).each{|d|p d}
puts "\n n derange su... | #include <stdio.h>
typedef unsigned long long LONG;
LONG deranged(int depth, int len, int *d, int show)
{
int i;
char tmp;
LONG count = 0;
if (depth == len) {
if (show) {
for (i = 0; i < len; i++) putchar(d[i] + 'a');
putc... |
Transform the following Ruby implementation into C, maintaining the same output and logic. | def derangements(n)
ary = (1 .. n).to_a
ary.permutation.select do |perm|
ary.zip(perm).all? {|a,b| a != b}
end
end
def subfact(n)
case n
when 0 then 1
when 1 then 0
else (n-1)*(subfact(n-1) + subfact(n-2))
end
end
puts "derangements for n = 4"
derangements(4).each{|d|p d}
puts "\n n derange su... | #include <stdio.h>
typedef unsigned long long LONG;
LONG deranged(int depth, int len, int *d, int show)
{
int i;
char tmp;
LONG count = 0;
if (depth == len) {
if (show) {
for (i = 0; i < len; i++) putchar(d[i] + 'a');
putc... |
Preserve the algorithm and functionality while converting the code from Ruby to C#. | def derangements(n)
ary = (1 .. n).to_a
ary.permutation.select do |perm|
ary.zip(perm).all? {|a,b| a != b}
end
end
def subfact(n)
case n
when 0 then 1
when 1 then 0
else (n-1)*(subfact(n-1) + subfact(n-2))
end
end
puts "derangements for n = 4"
derangements(4).each{|d|p d}
puts "\n n derange su... | using System;
class Derangements
{
static int n = 4;
static int [] buf = new int [n];
static bool [] used = new bool [n];
static void Main()
{
for (int i = 0; i < n; i++) used [i] = false;
rec(0);
}
static void rec(int ind)
{
for (int i = 0; i < n; i++)
{
if (!used [i] && i != in... |
Convert this Ruby snippet to C# and keep its semantics consistent. | def derangements(n)
ary = (1 .. n).to_a
ary.permutation.select do |perm|
ary.zip(perm).all? {|a,b| a != b}
end
end
def subfact(n)
case n
when 0 then 1
when 1 then 0
else (n-1)*(subfact(n-1) + subfact(n-2))
end
end
puts "derangements for n = 4"
derangements(4).each{|d|p d}
puts "\n n derange su... | using System;
class Derangements
{
static int n = 4;
static int [] buf = new int [n];
static bool [] used = new bool [n];
static void Main()
{
for (int i = 0; i < n; i++) used [i] = false;
rec(0);
}
static void rec(int ind)
{
for (int i = 0; i < n; i++)
{
if (!used [i] && i != in... |
Change the programming language of this snippet from Ruby to Java without modifying what it does. | def derangements(n)
ary = (1 .. n).to_a
ary.permutation.select do |perm|
ary.zip(perm).all? {|a,b| a != b}
end
end
def subfact(n)
case n
when 0 then 1
when 1 then 0
else (n-1)*(subfact(n-1) + subfact(n-2))
end
end
puts "derangements for n = 4"
derangements(4).each{|d|p d}
puts "\n n derange su... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Derangement {
public static void main(String[] args) {
System.out.println("derangements for n = 4\n");
for (Object d : (ArrayList)(derangements(4, false)[0])) {
System.out.println(Arrays.toString(... |
Generate an equivalent Java version of this Ruby code. | def derangements(n)
ary = (1 .. n).to_a
ary.permutation.select do |perm|
ary.zip(perm).all? {|a,b| a != b}
end
end
def subfact(n)
case n
when 0 then 1
when 1 then 0
else (n-1)*(subfact(n-1) + subfact(n-2))
end
end
puts "derangements for n = 4"
derangements(4).each{|d|p d}
puts "\n n derange su... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Derangement {
public static void main(String[] args) {
System.out.println("derangements for n = 4\n");
for (Object d : (ArrayList)(derangements(4, false)[0])) {
System.out.println(Arrays.toString(... |
Can you help me rewrite this code in Python instead of Ruby, keeping it the same logically? | def derangements(n)
ary = (1 .. n).to_a
ary.permutation.select do |perm|
ary.zip(perm).all? {|a,b| a != b}
end
end
def subfact(n)
case n
when 0 then 1
when 1 then 0
else (n-1)*(subfact(n-1) + subfact(n-2))
end
end
puts "derangements for n = 4"
derangements(4).each{|d|p d}
puts "\n n derange su... | from itertools import permutations
import math
def derangements(n):
'All deranged permutations of the integers 0..n-1 inclusive'
return ( perm for perm in permutations(range(n))
if all(indx != p for indx, p in enumerate(perm)) )
def subfact(n):
if n == 2 or n == 0:
return 1
elif ... |
Translate the given Ruby code snippet into Python without altering its behavior. | def derangements(n)
ary = (1 .. n).to_a
ary.permutation.select do |perm|
ary.zip(perm).all? {|a,b| a != b}
end
end
def subfact(n)
case n
when 0 then 1
when 1 then 0
else (n-1)*(subfact(n-1) + subfact(n-2))
end
end
puts "derangements for n = 4"
derangements(4).each{|d|p d}
puts "\n n derange su... | from itertools import permutations
import math
def derangements(n):
'All deranged permutations of the integers 0..n-1 inclusive'
return ( perm for perm in permutations(range(n))
if all(indx != p for indx, p in enumerate(perm)) )
def subfact(n):
if n == 2 or n == 0:
return 1
elif ... |
Transform the following Ruby implementation into Go, maintaining the same output and logic. | def derangements(n)
ary = (1 .. n).to_a
ary.permutation.select do |perm|
ary.zip(perm).all? {|a,b| a != b}
end
end
def subfact(n)
case n
when 0 then 1
when 1 then 0
else (n-1)*(subfact(n-1) + subfact(n-2))
end
end
puts "derangements for n = 4"
derangements(4).each{|d|p d}
puts "\n n derange su... | package main
import (
"fmt"
"math/big"
)
func dList(n int) (r [][]int) {
a := make([]int, n)
for i := range a {
a[i] = i
}
var recurse func(last int)
recurse = func(last int) {
if last == 0 {
for j, v := range a {
... |
Produce a language-to-language conversion: from Ruby to Go, same semantics. | def derangements(n)
ary = (1 .. n).to_a
ary.permutation.select do |perm|
ary.zip(perm).all? {|a,b| a != b}
end
end
def subfact(n)
case n
when 0 then 1
when 1 then 0
else (n-1)*(subfact(n-1) + subfact(n-2))
end
end
puts "derangements for n = 4"
derangements(4).each{|d|p d}
puts "\n n derange su... | package main
import (
"fmt"
"math/big"
)
func dList(n int) (r [][]int) {
a := make([]int, n)
for i := range a {
a[i] = i
}
var recurse func(last int)
recurse = func(last int) {
if last == 0 {
for j, v := range a {
... |
Convert this Scala snippet to C and keep its semantics consistent. |
fun <T> permute(input: List<T>): List<List<T>> {
if (input.size == 1) return listOf(input)
val perms = mutableListOf<List<T>>()
val toInsert = input[0]
for (perm in permute(input.drop(1))) {
for (i in 0..perm.size) {
val newPerm = perm.toMutableList()
newPerm.add(i, toI... | #include <stdio.h>
typedef unsigned long long LONG;
LONG deranged(int depth, int len, int *d, int show)
{
int i;
char tmp;
LONG count = 0;
if (depth == len) {
if (show) {
for (i = 0; i < len; i++) putchar(d[i] + 'a');
putc... |
Please provide an equivalent version of this Scala code in C. |
fun <T> permute(input: List<T>): List<List<T>> {
if (input.size == 1) return listOf(input)
val perms = mutableListOf<List<T>>()
val toInsert = input[0]
for (perm in permute(input.drop(1))) {
for (i in 0..perm.size) {
val newPerm = perm.toMutableList()
newPerm.add(i, toI... | #include <stdio.h>
typedef unsigned long long LONG;
LONG deranged(int depth, int len, int *d, int show)
{
int i;
char tmp;
LONG count = 0;
if (depth == len) {
if (show) {
for (i = 0; i < len; i++) putchar(d[i] + 'a');
putc... |
Produce a language-to-language conversion: from Scala to C#, same semantics. |
fun <T> permute(input: List<T>): List<List<T>> {
if (input.size == 1) return listOf(input)
val perms = mutableListOf<List<T>>()
val toInsert = input[0]
for (perm in permute(input.drop(1))) {
for (i in 0..perm.size) {
val newPerm = perm.toMutableList()
newPerm.add(i, toI... | using System;
class Derangements
{
static int n = 4;
static int [] buf = new int [n];
static bool [] used = new bool [n];
static void Main()
{
for (int i = 0; i < n; i++) used [i] = false;
rec(0);
}
static void rec(int ind)
{
for (int i = 0; i < n; i++)
{
if (!used [i] && i != in... |
Transform the following Scala implementation into C#, maintaining the same output and logic. |
fun <T> permute(input: List<T>): List<List<T>> {
if (input.size == 1) return listOf(input)
val perms = mutableListOf<List<T>>()
val toInsert = input[0]
for (perm in permute(input.drop(1))) {
for (i in 0..perm.size) {
val newPerm = perm.toMutableList()
newPerm.add(i, toI... | using System;
class Derangements
{
static int n = 4;
static int [] buf = new int [n];
static bool [] used = new bool [n];
static void Main()
{
for (int i = 0; i < n; i++) used [i] = false;
rec(0);
}
static void rec(int ind)
{
for (int i = 0; i < n; i++)
{
if (!used [i] && i != in... |
Write the same code in Java as shown below in Scala. |
fun <T> permute(input: List<T>): List<List<T>> {
if (input.size == 1) return listOf(input)
val perms = mutableListOf<List<T>>()
val toInsert = input[0]
for (perm in permute(input.drop(1))) {
for (i in 0..perm.size) {
val newPerm = perm.toMutableList()
newPerm.add(i, toI... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Derangement {
public static void main(String[] args) {
System.out.println("derangements for n = 4\n");
for (Object d : (ArrayList)(derangements(4, false)[0])) {
System.out.println(Arrays.toString(... |
Translate this program into Java but keep the logic exactly as in Scala. |
fun <T> permute(input: List<T>): List<List<T>> {
if (input.size == 1) return listOf(input)
val perms = mutableListOf<List<T>>()
val toInsert = input[0]
for (perm in permute(input.drop(1))) {
for (i in 0..perm.size) {
val newPerm = perm.toMutableList()
newPerm.add(i, toI... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Derangement {
public static void main(String[] args) {
System.out.println("derangements for n = 4\n");
for (Object d : (ArrayList)(derangements(4, false)[0])) {
System.out.println(Arrays.toString(... |
Write the same algorithm in Python as shown in this Scala implementation. |
fun <T> permute(input: List<T>): List<List<T>> {
if (input.size == 1) return listOf(input)
val perms = mutableListOf<List<T>>()
val toInsert = input[0]
for (perm in permute(input.drop(1))) {
for (i in 0..perm.size) {
val newPerm = perm.toMutableList()
newPerm.add(i, toI... | from itertools import permutations
import math
def derangements(n):
'All deranged permutations of the integers 0..n-1 inclusive'
return ( perm for perm in permutations(range(n))
if all(indx != p for indx, p in enumerate(perm)) )
def subfact(n):
if n == 2 or n == 0:
return 1
elif ... |
Preserve the algorithm and functionality while converting the code from Scala to Python. |
fun <T> permute(input: List<T>): List<List<T>> {
if (input.size == 1) return listOf(input)
val perms = mutableListOf<List<T>>()
val toInsert = input[0]
for (perm in permute(input.drop(1))) {
for (i in 0..perm.size) {
val newPerm = perm.toMutableList()
newPerm.add(i, toI... | from itertools import permutations
import math
def derangements(n):
'All deranged permutations of the integers 0..n-1 inclusive'
return ( perm for perm in permutations(range(n))
if all(indx != p for indx, p in enumerate(perm)) )
def subfact(n):
if n == 2 or n == 0:
return 1
elif ... |
Rewrite the snippet below in Go so it works the same as the original Scala code. |
fun <T> permute(input: List<T>): List<List<T>> {
if (input.size == 1) return listOf(input)
val perms = mutableListOf<List<T>>()
val toInsert = input[0]
for (perm in permute(input.drop(1))) {
for (i in 0..perm.size) {
val newPerm = perm.toMutableList()
newPerm.add(i, toI... | package main
import (
"fmt"
"math/big"
)
func dList(n int) (r [][]int) {
a := make([]int, n)
for i := range a {
a[i] = i
}
var recurse func(last int)
recurse = func(last int) {
if last == 0 {
for j, v := range a {
... |
Change the following Scala code into Go without altering its purpose. |
fun <T> permute(input: List<T>): List<List<T>> {
if (input.size == 1) return listOf(input)
val perms = mutableListOf<List<T>>()
val toInsert = input[0]
for (perm in permute(input.drop(1))) {
for (i in 0..perm.size) {
val newPerm = perm.toMutableList()
newPerm.add(i, toI... | package main
import (
"fmt"
"math/big"
)
func dList(n int) (r [][]int) {
a := make([]int, n)
for i := range a {
a[i] = i
}
var recurse func(last int)
recurse = func(last int) {
if last == 0 {
for j, v := range a {
... |
Write the same algorithm in C as shown in this Tcl implementation. | package require Tcl 8.5;
package require struct::list;
proc derangements lst {
if {![llength $lst]} {return {{}}}
set result {}
for {set perm [struct::list firstperm $lst]} {[llength $perm]} \
{set perm [struct::list nextperm $perm]} {
set skip 0
foreach a $lst b $perm {
if {[set skip ... | #include <stdio.h>
typedef unsigned long long LONG;
LONG deranged(int depth, int len, int *d, int show)
{
int i;
char tmp;
LONG count = 0;
if (depth == len) {
if (show) {
for (i = 0; i < len; i++) putchar(d[i] + 'a');
putc... |
Generate an equivalent C version of this Tcl code. | package require Tcl 8.5;
package require struct::list;
proc derangements lst {
if {![llength $lst]} {return {{}}}
set result {}
for {set perm [struct::list firstperm $lst]} {[llength $perm]} \
{set perm [struct::list nextperm $perm]} {
set skip 0
foreach a $lst b $perm {
if {[set skip ... | #include <stdio.h>
typedef unsigned long long LONG;
LONG deranged(int depth, int len, int *d, int show)
{
int i;
char tmp;
LONG count = 0;
if (depth == len) {
if (show) {
for (i = 0; i < len; i++) putchar(d[i] + 'a');
putc... |
Port the following code from Tcl to C# with equivalent syntax and logic. | package require Tcl 8.5;
package require struct::list;
proc derangements lst {
if {![llength $lst]} {return {{}}}
set result {}
for {set perm [struct::list firstperm $lst]} {[llength $perm]} \
{set perm [struct::list nextperm $perm]} {
set skip 0
foreach a $lst b $perm {
if {[set skip ... | using System;
class Derangements
{
static int n = 4;
static int [] buf = new int [n];
static bool [] used = new bool [n];
static void Main()
{
for (int i = 0; i < n; i++) used [i] = false;
rec(0);
}
static void rec(int ind)
{
for (int i = 0; i < n; i++)
{
if (!used [i] && i != in... |
Translate this program into C# but keep the logic exactly as in Tcl. | package require Tcl 8.5;
package require struct::list;
proc derangements lst {
if {![llength $lst]} {return {{}}}
set result {}
for {set perm [struct::list firstperm $lst]} {[llength $perm]} \
{set perm [struct::list nextperm $perm]} {
set skip 0
foreach a $lst b $perm {
if {[set skip ... | using System;
class Derangements
{
static int n = 4;
static int [] buf = new int [n];
static bool [] used = new bool [n];
static void Main()
{
for (int i = 0; i < n; i++) used [i] = false;
rec(0);
}
static void rec(int ind)
{
for (int i = 0; i < n; i++)
{
if (!used [i] && i != in... |
Write a version of this Tcl function in Java with identical behavior. | package require Tcl 8.5;
package require struct::list;
proc derangements lst {
if {![llength $lst]} {return {{}}}
set result {}
for {set perm [struct::list firstperm $lst]} {[llength $perm]} \
{set perm [struct::list nextperm $perm]} {
set skip 0
foreach a $lst b $perm {
if {[set skip ... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Derangement {
public static void main(String[] args) {
System.out.println("derangements for n = 4\n");
for (Object d : (ArrayList)(derangements(4, false)[0])) {
System.out.println(Arrays.toString(... |
Produce a functionally identical Java code for the snippet given in Tcl. | package require Tcl 8.5;
package require struct::list;
proc derangements lst {
if {![llength $lst]} {return {{}}}
set result {}
for {set perm [struct::list firstperm $lst]} {[llength $perm]} \
{set perm [struct::list nextperm $perm]} {
set skip 0
foreach a $lst b $perm {
if {[set skip ... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Derangement {
public static void main(String[] args) {
System.out.println("derangements for n = 4\n");
for (Object d : (ArrayList)(derangements(4, false)[0])) {
System.out.println(Arrays.toString(... |
Convert the following code from Tcl to Python, ensuring the logic remains intact. | package require Tcl 8.5;
package require struct::list;
proc derangements lst {
if {![llength $lst]} {return {{}}}
set result {}
for {set perm [struct::list firstperm $lst]} {[llength $perm]} \
{set perm [struct::list nextperm $perm]} {
set skip 0
foreach a $lst b $perm {
if {[set skip ... | from itertools import permutations
import math
def derangements(n):
'All deranged permutations of the integers 0..n-1 inclusive'
return ( perm for perm in permutations(range(n))
if all(indx != p for indx, p in enumerate(perm)) )
def subfact(n):
if n == 2 or n == 0:
return 1
elif ... |
Convert the following code from Tcl to Python, ensuring the logic remains intact. | package require Tcl 8.5;
package require struct::list;
proc derangements lst {
if {![llength $lst]} {return {{}}}
set result {}
for {set perm [struct::list firstperm $lst]} {[llength $perm]} \
{set perm [struct::list nextperm $perm]} {
set skip 0
foreach a $lst b $perm {
if {[set skip ... | from itertools import permutations
import math
def derangements(n):
'All deranged permutations of the integers 0..n-1 inclusive'
return ( perm for perm in permutations(range(n))
if all(indx != p for indx, p in enumerate(perm)) )
def subfact(n):
if n == 2 or n == 0:
return 1
elif ... |
Can you help me rewrite this code in Go instead of Tcl, keeping it the same logically? | package require Tcl 8.5;
package require struct::list;
proc derangements lst {
if {![llength $lst]} {return {{}}}
set result {}
for {set perm [struct::list firstperm $lst]} {[llength $perm]} \
{set perm [struct::list nextperm $perm]} {
set skip 0
foreach a $lst b $perm {
if {[set skip ... | package main
import (
"fmt"
"math/big"
)
func dList(n int) (r [][]int) {
a := make([]int, n)
for i := range a {
a[i] = i
}
var recurse func(last int)
recurse = func(last int) {
if last == 0 {
for j, v := range a {
... |
Port the provided Tcl code into Go while preserving the original functionality. | package require Tcl 8.5;
package require struct::list;
proc derangements lst {
if {![llength $lst]} {return {{}}}
set result {}
for {set perm [struct::list firstperm $lst]} {[llength $perm]} \
{set perm [struct::list nextperm $perm]} {
set skip 0
foreach a $lst b $perm {
if {[set skip ... | package main
import (
"fmt"
"math/big"
)
func dList(n int) (r [][]int) {
a := make([]int, n)
for i := range a {
a[i] = i
}
var recurse func(last int)
recurse = func(last int) {
if last == 0 {
for j, v := range a {
... |
Change the programming language of this snippet from Ada to C# without modifying what it does. | with Ada.Strings.Fixed, Ada.Text_IO;
use Ada.Strings, Ada.Text_IO;
procedure String_Replace is
Original : constant String := "Mary had a @__@ lamb.";
Tbr : constant String := "@__@";
New_Str : constant String := "little";
Index : Natural := Fixed.Index (Original, Tbr);
begin
Put_Line (Fixed.Replace_Slic... | class Program
{
static void Main()
{
string extra = "little";
string formatted = $"Mary had a {extra} lamb.";
System.Console.WriteLine(formatted);
}
}
|
Generate an equivalent C version of this Ada code. | with Ada.Strings.Fixed, Ada.Text_IO;
use Ada.Strings, Ada.Text_IO;
procedure String_Replace is
Original : constant String := "Mary had a @__@ lamb.";
Tbr : constant String := "@__@";
New_Str : constant String := "little";
Index : Natural := Fixed.Index (Original, Tbr);
begin
Put_Line (Fixed.Replace_Slic... | #include <stdio.h>
int main() {
const char *extra = "little";
printf("Mary had a %s lamb.\n", extra);
return 0;
}
|
Write the same code in C++ as shown below in Ada. | with Ada.Strings.Fixed, Ada.Text_IO;
use Ada.Strings, Ada.Text_IO;
procedure String_Replace is
Original : constant String := "Mary had a @__@ lamb.";
Tbr : constant String := "@__@";
New_Str : constant String := "little";
Index : Natural := Fixed.Index (Original, Tbr);
begin
Put_Line (Fixed.Replace_Slic... | #include <string>
#include <iostream>
int main( ) {
std::string original( "Mary had a X lamb." ) , toBeReplaced( "X" ) ,
replacement ( "little" ) ;
std::string newString = original.replace( original.find( "X" ) ,
toBeReplaced.length( ) , replacement ) ;
std::cout << "String after replacement: " << new... |
Translate this program into Go but keep the logic exactly as in Ada. | with Ada.Strings.Fixed, Ada.Text_IO;
use Ada.Strings, Ada.Text_IO;
procedure String_Replace is
Original : constant String := "Mary had a @__@ lamb.";
Tbr : constant String := "@__@";
New_Str : constant String := "little";
Index : Natural := Fixed.Index (Original, Tbr);
begin
Put_Line (Fixed.Replace_Slic... | package main
import (
"fmt"
)
func main() {
str := "Mary had a %s lamb"
txt := "little"
out := fmt.Sprintf(str, txt)
fmt.Println(out)
}
|
Change the following Ada code into Java without altering its purpose. | with Ada.Strings.Fixed, Ada.Text_IO;
use Ada.Strings, Ada.Text_IO;
procedure String_Replace is
Original : constant String := "Mary had a @__@ lamb.";
Tbr : constant String := "@__@";
New_Str : constant String := "little";
Index : Natural := Fixed.Index (Original, Tbr);
begin
Put_Line (Fixed.Replace_Slic... | String original = "Mary had a X lamb";
String little = "little";
String replaced = original.replace("X", little);
System.out.println(replaced);
System.out.printf("Mary had a %s lamb.", little);
String formatted = String.format("Mary had a %s lamb.", little);
System.out.println(formatted);
|
Write the same code in Python as shown below in Ada. | with Ada.Strings.Fixed, Ada.Text_IO;
use Ada.Strings, Ada.Text_IO;
procedure String_Replace is
Original : constant String := "Mary had a @__@ lamb.";
Tbr : constant String := "@__@";
New_Str : constant String := "little";
Index : Natural := Fixed.Index (Original, Tbr);
begin
Put_Line (Fixed.Replace_Slic... | >>> original = 'Mary had a %s lamb.'
>>> extra = 'little'
>>> original % extra
'Mary had a little lamb.'
|
Maintain the same structure and functionality when rewriting this code in VB. | with Ada.Strings.Fixed, Ada.Text_IO;
use Ada.Strings, Ada.Text_IO;
procedure String_Replace is
Original : constant String := "Mary had a @__@ lamb.";
Tbr : constant String := "@__@";
New_Str : constant String := "little";
Index : Natural := Fixed.Index (Original, Tbr);
begin
Put_Line (Fixed.Replace_Slic... | Dim name as String = "J. Doe"
Dim balance as Double = 123.45
Dim prompt as String = String.Format("Hello {0}, your balance is {1}.", name, balance)
Console.WriteLine(prompt)
|
Port the provided Arturo code into C while preserving the original functionality. | sizeOfLamb: "little"
print ~"Mary had a |sizeOfLamb| lamb."
| #include <stdio.h>
int main() {
const char *extra = "little";
printf("Mary had a %s lamb.\n", extra);
return 0;
}
|
Port the provided Arturo code into C# while preserving the original functionality. | sizeOfLamb: "little"
print ~"Mary had a |sizeOfLamb| lamb."
| class Program
{
static void Main()
{
string extra = "little";
string formatted = $"Mary had a {extra} lamb.";
System.Console.WriteLine(formatted);
}
}
|
Transform the following Arturo implementation into C++, maintaining the same output and logic. | sizeOfLamb: "little"
print ~"Mary had a |sizeOfLamb| lamb."
| #include <string>
#include <iostream>
int main( ) {
std::string original( "Mary had a X lamb." ) , toBeReplaced( "X" ) ,
replacement ( "little" ) ;
std::string newString = original.replace( original.find( "X" ) ,
toBeReplaced.length( ) , replacement ) ;
std::cout << "String after replacement: " << new... |
Port the following code from Arturo to Java with equivalent syntax and logic. | sizeOfLamb: "little"
print ~"Mary had a |sizeOfLamb| lamb."
| String original = "Mary had a X lamb";
String little = "little";
String replaced = original.replace("X", little);
System.out.println(replaced);
System.out.printf("Mary had a %s lamb.", little);
String formatted = String.format("Mary had a %s lamb.", little);
System.out.println(formatted);
|
Change the following Arturo code into Python without altering its purpose. | sizeOfLamb: "little"
print ~"Mary had a |sizeOfLamb| lamb."
| >>> original = 'Mary had a %s lamb.'
>>> extra = 'little'
>>> original % extra
'Mary had a little lamb.'
|
Translate this program into VB but keep the logic exactly as in Arturo. | sizeOfLamb: "little"
print ~"Mary had a |sizeOfLamb| lamb."
| Dim name as String = "J. Doe"
Dim balance as Double = 123.45
Dim prompt as String = String.Format("Hello {0}, your balance is {1}.", name, balance)
Console.WriteLine(prompt)
|
Translate the given Arturo code snippet into Go without altering its behavior. | sizeOfLamb: "little"
print ~"Mary had a |sizeOfLamb| lamb."
| package main
import (
"fmt"
)
func main() {
str := "Mary had a %s lamb"
txt := "little"
out := fmt.Sprintf(str, txt)
fmt.Println(out)
}
|
Maintain the same structure and functionality when rewriting this code in C. |
LIT = little
string = Mary had a %LIT% lamb.
LIT := "little"
string := "Mary had a" LIT " lamb."
MsgBox %string%
| #include <stdio.h>
int main() {
const char *extra = "little";
printf("Mary had a %s lamb.\n", extra);
return 0;
}
|
Maintain the same structure and functionality when rewriting this code in C#. |
LIT = little
string = Mary had a %LIT% lamb.
LIT := "little"
string := "Mary had a" LIT " lamb."
MsgBox %string%
| class Program
{
static void Main()
{
string extra = "little";
string formatted = $"Mary had a {extra} lamb.";
System.Console.WriteLine(formatted);
}
}
|
Write the same code in C++ as shown below in AutoHotKey. |
LIT = little
string = Mary had a %LIT% lamb.
LIT := "little"
string := "Mary had a" LIT " lamb."
MsgBox %string%
| #include <string>
#include <iostream>
int main( ) {
std::string original( "Mary had a X lamb." ) , toBeReplaced( "X" ) ,
replacement ( "little" ) ;
std::string newString = original.replace( original.find( "X" ) ,
toBeReplaced.length( ) , replacement ) ;
std::cout << "String after replacement: " << new... |
Change the programming language of this snippet from AutoHotKey to Java without modifying what it does. |
LIT = little
string = Mary had a %LIT% lamb.
LIT := "little"
string := "Mary had a" LIT " lamb."
MsgBox %string%
| String original = "Mary had a X lamb";
String little = "little";
String replaced = original.replace("X", little);
System.out.println(replaced);
System.out.printf("Mary had a %s lamb.", little);
String formatted = String.format("Mary had a %s lamb.", little);
System.out.println(formatted);
|
Change the following AutoHotKey code into Python without altering its purpose. |
LIT = little
string = Mary had a %LIT% lamb.
LIT := "little"
string := "Mary had a" LIT " lamb."
MsgBox %string%
| >>> original = 'Mary had a %s lamb.'
>>> extra = 'little'
>>> original % extra
'Mary had a little lamb.'
|
Can you help me rewrite this code in VB instead of AutoHotKey, keeping it the same logically? |
LIT = little
string = Mary had a %LIT% lamb.
LIT := "little"
string := "Mary had a" LIT " lamb."
MsgBox %string%
| Dim name as String = "J. Doe"
Dim balance as Double = 123.45
Dim prompt as String = String.Format("Hello {0}, your balance is {1}.", name, balance)
Console.WriteLine(prompt)
|
Translate the given AutoHotKey code snippet into Go without altering its behavior. |
LIT = little
string = Mary had a %LIT% lamb.
LIT := "little"
string := "Mary had a" LIT " lamb."
MsgBox %string%
| package main
import (
"fmt"
)
func main() {
str := "Mary had a %s lamb"
txt := "little"
out := fmt.Sprintf(str, txt)
fmt.Println(out)
}
|
Preserve the algorithm and functionality while converting the code from AWK to C. |
BEGIN {
str="Mary had a
gsub(/
print str
}
| #include <stdio.h>
int main() {
const char *extra = "little";
printf("Mary had a %s lamb.\n", extra);
return 0;
}
|
Maintain the same structure and functionality when rewriting this code in C#. |
BEGIN {
str="Mary had a
gsub(/
print str
}
| class Program
{
static void Main()
{
string extra = "little";
string formatted = $"Mary had a {extra} lamb.";
System.Console.WriteLine(formatted);
}
}
|
Please provide an equivalent version of this AWK code in C++. |
BEGIN {
str="Mary had a
gsub(/
print str
}
| #include <string>
#include <iostream>
int main( ) {
std::string original( "Mary had a X lamb." ) , toBeReplaced( "X" ) ,
replacement ( "little" ) ;
std::string newString = original.replace( original.find( "X" ) ,
toBeReplaced.length( ) , replacement ) ;
std::cout << "String after replacement: " << new... |
Change the following AWK code into Java without altering its purpose. |
BEGIN {
str="Mary had a
gsub(/
print str
}
| String original = "Mary had a X lamb";
String little = "little";
String replaced = original.replace("X", little);
System.out.println(replaced);
System.out.printf("Mary had a %s lamb.", little);
String formatted = String.format("Mary had a %s lamb.", little);
System.out.println(formatted);
|
Write a version of this AWK function in Python with identical behavior. |
BEGIN {
str="Mary had a
gsub(/
print str
}
| >>> original = 'Mary had a %s lamb.'
>>> extra = 'little'
>>> original % extra
'Mary had a little lamb.'
|
Translate the given AWK code snippet into VB without altering its behavior. |
BEGIN {
str="Mary had a
gsub(/
print str
}
| Dim name as String = "J. Doe"
Dim balance as Double = 123.45
Dim prompt as String = String.Format("Hello {0}, your balance is {1}.", name, balance)
Console.WriteLine(prompt)
|
Rewrite the snippet below in Go so it works the same as the original AWK code. |
BEGIN {
str="Mary had a
gsub(/
print str
}
| package main
import (
"fmt"
)
func main() {
str := "Mary had a %s lamb"
txt := "little"
out := fmt.Sprintf(str, txt)
fmt.Println(out)
}
|
Produce a language-to-language conversion: from Common_Lisp to C, same semantics. | (let [little "little"]
(println (format "Mary had a %s lamb." little)))
| #include <stdio.h>
int main() {
const char *extra = "little";
printf("Mary had a %s lamb.\n", extra);
return 0;
}
|
Port the following code from Common_Lisp to C# with equivalent syntax and logic. | (let [little "little"]
(println (format "Mary had a %s lamb." little)))
| class Program
{
static void Main()
{
string extra = "little";
string formatted = $"Mary had a {extra} lamb.";
System.Console.WriteLine(formatted);
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.