Instruction
stringlengths
45
106
input_code
stringlengths
1
13.7k
output_code
stringlengths
1
13.7k
Convert this Julia snippet to Go and keep its semantics consistent.
function isbncheck(str) return sum(iseven(i) ? 3 * parse(Int, ch) : parse(Int, ch) for (i, ch) in enumerate(replace(str, r"\D" => ""))) % 10 == 0 end const testingcodes = ["978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"] for code in testingcodes println(code, ": ", isbncheck(code) ? "good" : "bad") end
package main import ( "fmt" "strings" "unicode/utf8" ) func checkIsbn13(isbn string) bool { isbn = strings.ReplaceAll(strings.ReplaceAll(isbn, "-", ""), " ", "") le := utf8.RuneCountInString(isbn) if le != 13 { return false } sum := int32(0) for i, c := range isbn { if c < '0' || c > '9' { return false } if i%2 == 0 { sum += c - '0' } else { sum += 3 * (c - '0') } } return sum%10 == 0 } func main() { isbns := []string{"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"} for _, isbn := range isbns { res := "bad" if checkIsbn13(isbn) { res = "good" } fmt.Printf("%s: %s\n", isbn, res) } }
Generate a C translation of this Lua snippet without changing its computational steps.
function checkIsbn13(isbn) local count = 0 local sum = 0 for c in isbn:gmatch"." do if c == ' ' or c == '-' then elseif c < '0' or '9' < c then return false else local digit = c - '0' if (count % 2) > 0 then sum = sum + 3 * digit else sum = sum + digit end count = count + 1 end end if count ~= 13 then return false end return (sum % 10) == 0 end function test(isbn) if checkIsbn13(isbn) then print(isbn .. ": good") else print(isbn .. ": bad") end end function main() test("978-1734314502") test("978-1734314509") test("978-1788399081") test("978-1788399083") end main()
#include <stdio.h> int check_isbn13(const char *isbn) { int ch = *isbn, count = 0, sum = 0; for ( ; ch != 0; ch = *++isbn, ++count) { if (ch == ' ' || ch == '-') { --count; continue; } if (ch < '0' || ch > '9') { return 0; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } } if (count != 13) return 0; return !(sum%10); } int main() { int i; const char* isbns[] = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"}; for (i = 0; i < 4; ++i) { printf("%s: %s\n", isbns[i], check_isbn13(isbns[i]) ? "good" : "bad"); } return 0; }
Port the provided Lua code into C while preserving the original functionality.
function checkIsbn13(isbn) local count = 0 local sum = 0 for c in isbn:gmatch"." do if c == ' ' or c == '-' then elseif c < '0' or '9' < c then return false else local digit = c - '0' if (count % 2) > 0 then sum = sum + 3 * digit else sum = sum + digit end count = count + 1 end end if count ~= 13 then return false end return (sum % 10) == 0 end function test(isbn) if checkIsbn13(isbn) then print(isbn .. ": good") else print(isbn .. ": bad") end end function main() test("978-1734314502") test("978-1734314509") test("978-1788399081") test("978-1788399083") end main()
#include <stdio.h> int check_isbn13(const char *isbn) { int ch = *isbn, count = 0, sum = 0; for ( ; ch != 0; ch = *++isbn, ++count) { if (ch == ' ' || ch == '-') { --count; continue; } if (ch < '0' || ch > '9') { return 0; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } } if (count != 13) return 0; return !(sum%10); } int main() { int i; const char* isbns[] = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"}; for (i = 0; i < 4; ++i) { printf("%s: %s\n", isbns[i], check_isbn13(isbns[i]) ? "good" : "bad"); } return 0; }
Produce a language-to-language conversion: from Lua to C#, same semantics.
function checkIsbn13(isbn) local count = 0 local sum = 0 for c in isbn:gmatch"." do if c == ' ' or c == '-' then elseif c < '0' or '9' < c then return false else local digit = c - '0' if (count % 2) > 0 then sum = sum + 3 * digit else sum = sum + digit end count = count + 1 end end if count ~= 13 then return false end return (sum % 10) == 0 end function test(isbn) if checkIsbn13(isbn) then print(isbn .. ": good") else print(isbn .. ": bad") end end function main() test("978-1734314502") test("978-1734314509") test("978-1788399081") test("978-1788399083") end main()
using System; using System.Linq; public class Program { public static void Main() { Console.WriteLine(CheckISBN13("978-1734314502")); Console.WriteLine(CheckISBN13("978-1734314509")); Console.WriteLine(CheckISBN13("978-1788399081")); Console.WriteLine(CheckISBN13("978-1788399083")); static bool CheckISBN13(string code) { code = code.Replace("-", "").Replace(" ", ""); if (code.Length != 13) return false; int sum = 0; foreach (var (index, digit) in code.Select((digit, index) => (index, digit))) { if (char.IsDigit(digit)) sum += (digit - '0') * (index % 2 == 0 ? 1 : 3); else return false; } return sum % 10 == 0; } } }
Port the provided Lua code into C# while preserving the original functionality.
function checkIsbn13(isbn) local count = 0 local sum = 0 for c in isbn:gmatch"." do if c == ' ' or c == '-' then elseif c < '0' or '9' < c then return false else local digit = c - '0' if (count % 2) > 0 then sum = sum + 3 * digit else sum = sum + digit end count = count + 1 end end if count ~= 13 then return false end return (sum % 10) == 0 end function test(isbn) if checkIsbn13(isbn) then print(isbn .. ": good") else print(isbn .. ": bad") end end function main() test("978-1734314502") test("978-1734314509") test("978-1788399081") test("978-1788399083") end main()
using System; using System.Linq; public class Program { public static void Main() { Console.WriteLine(CheckISBN13("978-1734314502")); Console.WriteLine(CheckISBN13("978-1734314509")); Console.WriteLine(CheckISBN13("978-1788399081")); Console.WriteLine(CheckISBN13("978-1788399083")); static bool CheckISBN13(string code) { code = code.Replace("-", "").Replace(" ", ""); if (code.Length != 13) return false; int sum = 0; foreach (var (index, digit) in code.Select((digit, index) => (index, digit))) { if (char.IsDigit(digit)) sum += (digit - '0') * (index % 2 == 0 ? 1 : 3); else return false; } return sum % 10 == 0; } } }
Convert this Lua block to C++, preserving its control flow and logic.
function checkIsbn13(isbn) local count = 0 local sum = 0 for c in isbn:gmatch"." do if c == ' ' or c == '-' then elseif c < '0' or '9' < c then return false else local digit = c - '0' if (count % 2) > 0 then sum = sum + 3 * digit else sum = sum + digit end count = count + 1 end end if count ~= 13 then return false end return (sum % 10) == 0 end function test(isbn) if checkIsbn13(isbn) then print(isbn .. ": good") else print(isbn .. ": bad") end end function main() test("978-1734314502") test("978-1734314509") test("978-1788399081") test("978-1788399083") end main()
#include <iostream> bool check_isbn13(std::string isbn) { int count = 0; int sum = 0; for (auto ch : isbn) { if (ch == ' ' || ch == '-') { continue; } if (ch < '0' || ch > '9') { return false; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } count++; } if (count != 13) { return false; } return sum % 10 == 0; } int main() { auto isbns = { "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" }; for (auto isbn : isbns) { std::cout << isbn << ": " << (check_isbn13(isbn) ? "good" : "bad") << '\n'; } return 0; }
Convert this Lua snippet to C++ and keep its semantics consistent.
function checkIsbn13(isbn) local count = 0 local sum = 0 for c in isbn:gmatch"." do if c == ' ' or c == '-' then elseif c < '0' or '9' < c then return false else local digit = c - '0' if (count % 2) > 0 then sum = sum + 3 * digit else sum = sum + digit end count = count + 1 end end if count ~= 13 then return false end return (sum % 10) == 0 end function test(isbn) if checkIsbn13(isbn) then print(isbn .. ": good") else print(isbn .. ": bad") end end function main() test("978-1734314502") test("978-1734314509") test("978-1788399081") test("978-1788399083") end main()
#include <iostream> bool check_isbn13(std::string isbn) { int count = 0; int sum = 0; for (auto ch : isbn) { if (ch == ' ' || ch == '-') { continue; } if (ch < '0' || ch > '9') { return false; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } count++; } if (count != 13) { return false; } return sum % 10 == 0; } int main() { auto isbns = { "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" }; for (auto isbn : isbns) { std::cout << isbn << ": " << (check_isbn13(isbn) ? "good" : "bad") << '\n'; } return 0; }
Change the following Lua code into Java without altering its purpose.
function checkIsbn13(isbn) local count = 0 local sum = 0 for c in isbn:gmatch"." do if c == ' ' or c == '-' then elseif c < '0' or '9' < c then return false else local digit = c - '0' if (count % 2) > 0 then sum = sum + 3 * digit else sum = sum + digit end count = count + 1 end end if count ~= 13 then return false end return (sum % 10) == 0 end function test(isbn) if checkIsbn13(isbn) then print(isbn .. ": good") else print(isbn .. ": bad") end end function main() test("978-1734314502") test("978-1734314509") test("978-1788399081") test("978-1788399083") end main()
public static void main(){ System.out.println(isISBN13("978-1734314502")); System.out.println(isISBN13("978-1734314509")); System.out.println(isISBN13("978-1788399081")); System.out.println(isISBN13("978-1788399083")); } public static boolean isISBN13(String in){ int pre = Integer.parseInt(in.substring(0,3)); if (pre!=978)return false; String postStr = in.substring(4); if (postStr.length()!=10)return false; int post = Integer.parseInt(postStr); int sum = 38; for(int x = 0; x<10;x+=2) sum += (postStr.charAt(x)-48)*3 + ((postStr.charAt(x+1)-48)); if(sum%10==0) return true; return false; }
Change the following Lua code into Java without altering its purpose.
function checkIsbn13(isbn) local count = 0 local sum = 0 for c in isbn:gmatch"." do if c == ' ' or c == '-' then elseif c < '0' or '9' < c then return false else local digit = c - '0' if (count % 2) > 0 then sum = sum + 3 * digit else sum = sum + digit end count = count + 1 end end if count ~= 13 then return false end return (sum % 10) == 0 end function test(isbn) if checkIsbn13(isbn) then print(isbn .. ": good") else print(isbn .. ": bad") end end function main() test("978-1734314502") test("978-1734314509") test("978-1788399081") test("978-1788399083") end main()
public static void main(){ System.out.println(isISBN13("978-1734314502")); System.out.println(isISBN13("978-1734314509")); System.out.println(isISBN13("978-1788399081")); System.out.println(isISBN13("978-1788399083")); } public static boolean isISBN13(String in){ int pre = Integer.parseInt(in.substring(0,3)); if (pre!=978)return false; String postStr = in.substring(4); if (postStr.length()!=10)return false; int post = Integer.parseInt(postStr); int sum = 38; for(int x = 0; x<10;x+=2) sum += (postStr.charAt(x)-48)*3 + ((postStr.charAt(x+1)-48)); if(sum%10==0) return true; return false; }
Produce a language-to-language conversion: from Lua to Python, same semantics.
function checkIsbn13(isbn) local count = 0 local sum = 0 for c in isbn:gmatch"." do if c == ' ' or c == '-' then elseif c < '0' or '9' < c then return false else local digit = c - '0' if (count % 2) > 0 then sum = sum + 3 * digit else sum = sum + digit end count = count + 1 end end if count ~= 13 then return false end return (sum % 10) == 0 end function test(isbn) if checkIsbn13(isbn) then print(isbn .. ": good") else print(isbn .. ": bad") end end function main() test("978-1734314502") test("978-1734314509") test("978-1788399081") test("978-1788399083") end main()
def is_isbn13(n): n = n.replace('-','').replace(' ', '') if len(n) != 13: return False product = (sum(int(ch) for ch in n[::2]) + sum(int(ch) * 3 for ch in n[1::2])) return product % 10 == 0 if __name__ == '__main__': tests = .strip().split() for t in tests: print(f"ISBN13 {t} validates {is_isbn13(t)}")
Convert the following code from Lua to Python, ensuring the logic remains intact.
function checkIsbn13(isbn) local count = 0 local sum = 0 for c in isbn:gmatch"." do if c == ' ' or c == '-' then elseif c < '0' or '9' < c then return false else local digit = c - '0' if (count % 2) > 0 then sum = sum + 3 * digit else sum = sum + digit end count = count + 1 end end if count ~= 13 then return false end return (sum % 10) == 0 end function test(isbn) if checkIsbn13(isbn) then print(isbn .. ": good") else print(isbn .. ": bad") end end function main() test("978-1734314502") test("978-1734314509") test("978-1788399081") test("978-1788399083") end main()
def is_isbn13(n): n = n.replace('-','').replace(' ', '') if len(n) != 13: return False product = (sum(int(ch) for ch in n[::2]) + sum(int(ch) * 3 for ch in n[1::2])) return product % 10 == 0 if __name__ == '__main__': tests = .strip().split() for t in tests: print(f"ISBN13 {t} validates {is_isbn13(t)}")
Port the provided Lua code into VB while preserving the original functionality.
function checkIsbn13(isbn) local count = 0 local sum = 0 for c in isbn:gmatch"." do if c == ' ' or c == '-' then elseif c < '0' or '9' < c then return false else local digit = c - '0' if (count % 2) > 0 then sum = sum + 3 * digit else sum = sum + digit end count = count + 1 end end if count ~= 13 then return false end return (sum % 10) == 0 end function test(isbn) if checkIsbn13(isbn) then print(isbn .. ": good") else print(isbn .. ": bad") end end function main() test("978-1734314502") test("978-1734314509") test("978-1788399081") test("978-1788399083") end main()
arraybase 1 dim isbn = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083", "978-2-74839-908-0", "978-2-74839-908-5", "978 1 86197 876 9"} for n = 1 to isbn[?] sum = 0 isbnStr = isbn[n] isbnStr = replace(isbnStr, "-", "") isbnStr = replace(isbnStr, " ", "") for m = 1 to length(isbnStr) if m mod 2 = 0 then num = 3 * int(mid(isbnStr, m, 1)) else num = int(mid(isbnStr, m, 1)) end if sum += num next m if sum mod 10 = 0 then print isbn[n]; ": good" else print isbn[n]; ": bad" end if next n
Can you help me rewrite this code in VB instead of Lua, keeping it the same logically?
function checkIsbn13(isbn) local count = 0 local sum = 0 for c in isbn:gmatch"." do if c == ' ' or c == '-' then elseif c < '0' or '9' < c then return false else local digit = c - '0' if (count % 2) > 0 then sum = sum + 3 * digit else sum = sum + digit end count = count + 1 end end if count ~= 13 then return false end return (sum % 10) == 0 end function test(isbn) if checkIsbn13(isbn) then print(isbn .. ": good") else print(isbn .. ": bad") end end function main() test("978-1734314502") test("978-1734314509") test("978-1788399081") test("978-1788399083") end main()
arraybase 1 dim isbn = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083", "978-2-74839-908-0", "978-2-74839-908-5", "978 1 86197 876 9"} for n = 1 to isbn[?] sum = 0 isbnStr = isbn[n] isbnStr = replace(isbnStr, "-", "") isbnStr = replace(isbnStr, " ", "") for m = 1 to length(isbnStr) if m mod 2 = 0 then num = 3 * int(mid(isbnStr, m, 1)) else num = int(mid(isbnStr, m, 1)) end if sum += num next m if sum mod 10 = 0 then print isbn[n]; ": good" else print isbn[n]; ": bad" end if next n
Generate an equivalent Go version of this Lua code.
function checkIsbn13(isbn) local count = 0 local sum = 0 for c in isbn:gmatch"." do if c == ' ' or c == '-' then elseif c < '0' or '9' < c then return false else local digit = c - '0' if (count % 2) > 0 then sum = sum + 3 * digit else sum = sum + digit end count = count + 1 end end if count ~= 13 then return false end return (sum % 10) == 0 end function test(isbn) if checkIsbn13(isbn) then print(isbn .. ": good") else print(isbn .. ": bad") end end function main() test("978-1734314502") test("978-1734314509") test("978-1788399081") test("978-1788399083") end main()
package main import ( "fmt" "strings" "unicode/utf8" ) func checkIsbn13(isbn string) bool { isbn = strings.ReplaceAll(strings.ReplaceAll(isbn, "-", ""), " ", "") le := utf8.RuneCountInString(isbn) if le != 13 { return false } sum := int32(0) for i, c := range isbn { if c < '0' || c > '9' { return false } if i%2 == 0 { sum += c - '0' } else { sum += 3 * (c - '0') } } return sum%10 == 0 } func main() { isbns := []string{"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"} for _, isbn := range isbns { res := "bad" if checkIsbn13(isbn) { res = "good" } fmt.Printf("%s: %s\n", isbn, res) } }
Convert this Lua snippet to Go and keep its semantics consistent.
function checkIsbn13(isbn) local count = 0 local sum = 0 for c in isbn:gmatch"." do if c == ' ' or c == '-' then elseif c < '0' or '9' < c then return false else local digit = c - '0' if (count % 2) > 0 then sum = sum + 3 * digit else sum = sum + digit end count = count + 1 end end if count ~= 13 then return false end return (sum % 10) == 0 end function test(isbn) if checkIsbn13(isbn) then print(isbn .. ": good") else print(isbn .. ": bad") end end function main() test("978-1734314502") test("978-1734314509") test("978-1788399081") test("978-1788399083") end main()
package main import ( "fmt" "strings" "unicode/utf8" ) func checkIsbn13(isbn string) bool { isbn = strings.ReplaceAll(strings.ReplaceAll(isbn, "-", ""), " ", "") le := utf8.RuneCountInString(isbn) if le != 13 { return false } sum := int32(0) for i, c := range isbn { if c < '0' || c > '9' { return false } if i%2 == 0 { sum += c - '0' } else { sum += 3 * (c - '0') } } return sum%10 == 0 } func main() { isbns := []string{"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"} for _, isbn := range isbns { res := "bad" if checkIsbn13(isbn) { res = "good" } fmt.Printf("%s: %s\n", isbn, res) } }
Can you help me rewrite this code in C instead of Mathematica, keeping it the same logically?
ClearAll[ValidISBNQ] ValidISBNQ[iban_String] := Module[{i}, i = StringReplace[iban, {" " -> "", "-" -> ""}]; If[StringMatchQ[i, Repeated[DigitCharacter]], i = ToExpression /@ Characters[i]; i[[2 ;; ;; 2]] *= 3; Mod[Total[i], 10] == 0 , False ] ] ValidISBNQ["978-1734314502"] ValidISBNQ["978-1734314509"] ValidISBNQ["978-1788399081"] ValidISBNQ["978-1788399083"]
#include <stdio.h> int check_isbn13(const char *isbn) { int ch = *isbn, count = 0, sum = 0; for ( ; ch != 0; ch = *++isbn, ++count) { if (ch == ' ' || ch == '-') { --count; continue; } if (ch < '0' || ch > '9') { return 0; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } } if (count != 13) return 0; return !(sum%10); } int main() { int i; const char* isbns[] = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"}; for (i = 0; i < 4; ++i) { printf("%s: %s\n", isbns[i], check_isbn13(isbns[i]) ? "good" : "bad"); } return 0; }
Please provide an equivalent version of this Mathematica code in C.
ClearAll[ValidISBNQ] ValidISBNQ[iban_String] := Module[{i}, i = StringReplace[iban, {" " -> "", "-" -> ""}]; If[StringMatchQ[i, Repeated[DigitCharacter]], i = ToExpression /@ Characters[i]; i[[2 ;; ;; 2]] *= 3; Mod[Total[i], 10] == 0 , False ] ] ValidISBNQ["978-1734314502"] ValidISBNQ["978-1734314509"] ValidISBNQ["978-1788399081"] ValidISBNQ["978-1788399083"]
#include <stdio.h> int check_isbn13(const char *isbn) { int ch = *isbn, count = 0, sum = 0; for ( ; ch != 0; ch = *++isbn, ++count) { if (ch == ' ' || ch == '-') { --count; continue; } if (ch < '0' || ch > '9') { return 0; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } } if (count != 13) return 0; return !(sum%10); } int main() { int i; const char* isbns[] = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"}; for (i = 0; i < 4; ++i) { printf("%s: %s\n", isbns[i], check_isbn13(isbns[i]) ? "good" : "bad"); } return 0; }
Translate the given Mathematica code snippet into C# without altering its behavior.
ClearAll[ValidISBNQ] ValidISBNQ[iban_String] := Module[{i}, i = StringReplace[iban, {" " -> "", "-" -> ""}]; If[StringMatchQ[i, Repeated[DigitCharacter]], i = ToExpression /@ Characters[i]; i[[2 ;; ;; 2]] *= 3; Mod[Total[i], 10] == 0 , False ] ] ValidISBNQ["978-1734314502"] ValidISBNQ["978-1734314509"] ValidISBNQ["978-1788399081"] ValidISBNQ["978-1788399083"]
using System; using System.Linq; public class Program { public static void Main() { Console.WriteLine(CheckISBN13("978-1734314502")); Console.WriteLine(CheckISBN13("978-1734314509")); Console.WriteLine(CheckISBN13("978-1788399081")); Console.WriteLine(CheckISBN13("978-1788399083")); static bool CheckISBN13(string code) { code = code.Replace("-", "").Replace(" ", ""); if (code.Length != 13) return false; int sum = 0; foreach (var (index, digit) in code.Select((digit, index) => (index, digit))) { if (char.IsDigit(digit)) sum += (digit - '0') * (index % 2 == 0 ? 1 : 3); else return false; } return sum % 10 == 0; } } }
Produce a functionally identical C# code for the snippet given in Mathematica.
ClearAll[ValidISBNQ] ValidISBNQ[iban_String] := Module[{i}, i = StringReplace[iban, {" " -> "", "-" -> ""}]; If[StringMatchQ[i, Repeated[DigitCharacter]], i = ToExpression /@ Characters[i]; i[[2 ;; ;; 2]] *= 3; Mod[Total[i], 10] == 0 , False ] ] ValidISBNQ["978-1734314502"] ValidISBNQ["978-1734314509"] ValidISBNQ["978-1788399081"] ValidISBNQ["978-1788399083"]
using System; using System.Linq; public class Program { public static void Main() { Console.WriteLine(CheckISBN13("978-1734314502")); Console.WriteLine(CheckISBN13("978-1734314509")); Console.WriteLine(CheckISBN13("978-1788399081")); Console.WriteLine(CheckISBN13("978-1788399083")); static bool CheckISBN13(string code) { code = code.Replace("-", "").Replace(" ", ""); if (code.Length != 13) return false; int sum = 0; foreach (var (index, digit) in code.Select((digit, index) => (index, digit))) { if (char.IsDigit(digit)) sum += (digit - '0') * (index % 2 == 0 ? 1 : 3); else return false; } return sum % 10 == 0; } } }
Ensure the translated C++ code behaves exactly like the original Mathematica snippet.
ClearAll[ValidISBNQ] ValidISBNQ[iban_String] := Module[{i}, i = StringReplace[iban, {" " -> "", "-" -> ""}]; If[StringMatchQ[i, Repeated[DigitCharacter]], i = ToExpression /@ Characters[i]; i[[2 ;; ;; 2]] *= 3; Mod[Total[i], 10] == 0 , False ] ] ValidISBNQ["978-1734314502"] ValidISBNQ["978-1734314509"] ValidISBNQ["978-1788399081"] ValidISBNQ["978-1788399083"]
#include <iostream> bool check_isbn13(std::string isbn) { int count = 0; int sum = 0; for (auto ch : isbn) { if (ch == ' ' || ch == '-') { continue; } if (ch < '0' || ch > '9') { return false; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } count++; } if (count != 13) { return false; } return sum % 10 == 0; } int main() { auto isbns = { "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" }; for (auto isbn : isbns) { std::cout << isbn << ": " << (check_isbn13(isbn) ? "good" : "bad") << '\n'; } return 0; }
Generate an equivalent C++ version of this Mathematica code.
ClearAll[ValidISBNQ] ValidISBNQ[iban_String] := Module[{i}, i = StringReplace[iban, {" " -> "", "-" -> ""}]; If[StringMatchQ[i, Repeated[DigitCharacter]], i = ToExpression /@ Characters[i]; i[[2 ;; ;; 2]] *= 3; Mod[Total[i], 10] == 0 , False ] ] ValidISBNQ["978-1734314502"] ValidISBNQ["978-1734314509"] ValidISBNQ["978-1788399081"] ValidISBNQ["978-1788399083"]
#include <iostream> bool check_isbn13(std::string isbn) { int count = 0; int sum = 0; for (auto ch : isbn) { if (ch == ' ' || ch == '-') { continue; } if (ch < '0' || ch > '9') { return false; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } count++; } if (count != 13) { return false; } return sum % 10 == 0; } int main() { auto isbns = { "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" }; for (auto isbn : isbns) { std::cout << isbn << ": " << (check_isbn13(isbn) ? "good" : "bad") << '\n'; } return 0; }
Produce a functionally identical Java code for the snippet given in Mathematica.
ClearAll[ValidISBNQ] ValidISBNQ[iban_String] := Module[{i}, i = StringReplace[iban, {" " -> "", "-" -> ""}]; If[StringMatchQ[i, Repeated[DigitCharacter]], i = ToExpression /@ Characters[i]; i[[2 ;; ;; 2]] *= 3; Mod[Total[i], 10] == 0 , False ] ] ValidISBNQ["978-1734314502"] ValidISBNQ["978-1734314509"] ValidISBNQ["978-1788399081"] ValidISBNQ["978-1788399083"]
public static void main(){ System.out.println(isISBN13("978-1734314502")); System.out.println(isISBN13("978-1734314509")); System.out.println(isISBN13("978-1788399081")); System.out.println(isISBN13("978-1788399083")); } public static boolean isISBN13(String in){ int pre = Integer.parseInt(in.substring(0,3)); if (pre!=978)return false; String postStr = in.substring(4); if (postStr.length()!=10)return false; int post = Integer.parseInt(postStr); int sum = 38; for(int x = 0; x<10;x+=2) sum += (postStr.charAt(x)-48)*3 + ((postStr.charAt(x+1)-48)); if(sum%10==0) return true; return false; }
Keep all operations the same but rewrite the snippet in Java.
ClearAll[ValidISBNQ] ValidISBNQ[iban_String] := Module[{i}, i = StringReplace[iban, {" " -> "", "-" -> ""}]; If[StringMatchQ[i, Repeated[DigitCharacter]], i = ToExpression /@ Characters[i]; i[[2 ;; ;; 2]] *= 3; Mod[Total[i], 10] == 0 , False ] ] ValidISBNQ["978-1734314502"] ValidISBNQ["978-1734314509"] ValidISBNQ["978-1788399081"] ValidISBNQ["978-1788399083"]
public static void main(){ System.out.println(isISBN13("978-1734314502")); System.out.println(isISBN13("978-1734314509")); System.out.println(isISBN13("978-1788399081")); System.out.println(isISBN13("978-1788399083")); } public static boolean isISBN13(String in){ int pre = Integer.parseInt(in.substring(0,3)); if (pre!=978)return false; String postStr = in.substring(4); if (postStr.length()!=10)return false; int post = Integer.parseInt(postStr); int sum = 38; for(int x = 0; x<10;x+=2) sum += (postStr.charAt(x)-48)*3 + ((postStr.charAt(x+1)-48)); if(sum%10==0) return true; return false; }
Rewrite the snippet below in Python so it works the same as the original Mathematica code.
ClearAll[ValidISBNQ] ValidISBNQ[iban_String] := Module[{i}, i = StringReplace[iban, {" " -> "", "-" -> ""}]; If[StringMatchQ[i, Repeated[DigitCharacter]], i = ToExpression /@ Characters[i]; i[[2 ;; ;; 2]] *= 3; Mod[Total[i], 10] == 0 , False ] ] ValidISBNQ["978-1734314502"] ValidISBNQ["978-1734314509"] ValidISBNQ["978-1788399081"] ValidISBNQ["978-1788399083"]
def is_isbn13(n): n = n.replace('-','').replace(' ', '') if len(n) != 13: return False product = (sum(int(ch) for ch in n[::2]) + sum(int(ch) * 3 for ch in n[1::2])) return product % 10 == 0 if __name__ == '__main__': tests = .strip().split() for t in tests: print(f"ISBN13 {t} validates {is_isbn13(t)}")
Write the same algorithm in Python as shown in this Mathematica implementation.
ClearAll[ValidISBNQ] ValidISBNQ[iban_String] := Module[{i}, i = StringReplace[iban, {" " -> "", "-" -> ""}]; If[StringMatchQ[i, Repeated[DigitCharacter]], i = ToExpression /@ Characters[i]; i[[2 ;; ;; 2]] *= 3; Mod[Total[i], 10] == 0 , False ] ] ValidISBNQ["978-1734314502"] ValidISBNQ["978-1734314509"] ValidISBNQ["978-1788399081"] ValidISBNQ["978-1788399083"]
def is_isbn13(n): n = n.replace('-','').replace(' ', '') if len(n) != 13: return False product = (sum(int(ch) for ch in n[::2]) + sum(int(ch) * 3 for ch in n[1::2])) return product % 10 == 0 if __name__ == '__main__': tests = .strip().split() for t in tests: print(f"ISBN13 {t} validates {is_isbn13(t)}")
Can you help me rewrite this code in VB instead of Mathematica, keeping it the same logically?
ClearAll[ValidISBNQ] ValidISBNQ[iban_String] := Module[{i}, i = StringReplace[iban, {" " -> "", "-" -> ""}]; If[StringMatchQ[i, Repeated[DigitCharacter]], i = ToExpression /@ Characters[i]; i[[2 ;; ;; 2]] *= 3; Mod[Total[i], 10] == 0 , False ] ] ValidISBNQ["978-1734314502"] ValidISBNQ["978-1734314509"] ValidISBNQ["978-1788399081"] ValidISBNQ["978-1788399083"]
arraybase 1 dim isbn = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083", "978-2-74839-908-0", "978-2-74839-908-5", "978 1 86197 876 9"} for n = 1 to isbn[?] sum = 0 isbnStr = isbn[n] isbnStr = replace(isbnStr, "-", "") isbnStr = replace(isbnStr, " ", "") for m = 1 to length(isbnStr) if m mod 2 = 0 then num = 3 * int(mid(isbnStr, m, 1)) else num = int(mid(isbnStr, m, 1)) end if sum += num next m if sum mod 10 = 0 then print isbn[n]; ": good" else print isbn[n]; ": bad" end if next n
Write the same code in VB as shown below in Mathematica.
ClearAll[ValidISBNQ] ValidISBNQ[iban_String] := Module[{i}, i = StringReplace[iban, {" " -> "", "-" -> ""}]; If[StringMatchQ[i, Repeated[DigitCharacter]], i = ToExpression /@ Characters[i]; i[[2 ;; ;; 2]] *= 3; Mod[Total[i], 10] == 0 , False ] ] ValidISBNQ["978-1734314502"] ValidISBNQ["978-1734314509"] ValidISBNQ["978-1788399081"] ValidISBNQ["978-1788399083"]
arraybase 1 dim isbn = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083", "978-2-74839-908-0", "978-2-74839-908-5", "978 1 86197 876 9"} for n = 1 to isbn[?] sum = 0 isbnStr = isbn[n] isbnStr = replace(isbnStr, "-", "") isbnStr = replace(isbnStr, " ", "") for m = 1 to length(isbnStr) if m mod 2 = 0 then num = 3 * int(mid(isbnStr, m, 1)) else num = int(mid(isbnStr, m, 1)) end if sum += num next m if sum mod 10 = 0 then print isbn[n]; ": good" else print isbn[n]; ": bad" end if next n
Maintain the same structure and functionality when rewriting this code in Go.
ClearAll[ValidISBNQ] ValidISBNQ[iban_String] := Module[{i}, i = StringReplace[iban, {" " -> "", "-" -> ""}]; If[StringMatchQ[i, Repeated[DigitCharacter]], i = ToExpression /@ Characters[i]; i[[2 ;; ;; 2]] *= 3; Mod[Total[i], 10] == 0 , False ] ] ValidISBNQ["978-1734314502"] ValidISBNQ["978-1734314509"] ValidISBNQ["978-1788399081"] ValidISBNQ["978-1788399083"]
package main import ( "fmt" "strings" "unicode/utf8" ) func checkIsbn13(isbn string) bool { isbn = strings.ReplaceAll(strings.ReplaceAll(isbn, "-", ""), " ", "") le := utf8.RuneCountInString(isbn) if le != 13 { return false } sum := int32(0) for i, c := range isbn { if c < '0' || c > '9' { return false } if i%2 == 0 { sum += c - '0' } else { sum += 3 * (c - '0') } } return sum%10 == 0 } func main() { isbns := []string{"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"} for _, isbn := range isbns { res := "bad" if checkIsbn13(isbn) { res = "good" } fmt.Printf("%s: %s\n", isbn, res) } }
Write the same algorithm in Go as shown in this Mathematica implementation.
ClearAll[ValidISBNQ] ValidISBNQ[iban_String] := Module[{i}, i = StringReplace[iban, {" " -> "", "-" -> ""}]; If[StringMatchQ[i, Repeated[DigitCharacter]], i = ToExpression /@ Characters[i]; i[[2 ;; ;; 2]] *= 3; Mod[Total[i], 10] == 0 , False ] ] ValidISBNQ["978-1734314502"] ValidISBNQ["978-1734314509"] ValidISBNQ["978-1788399081"] ValidISBNQ["978-1788399083"]
package main import ( "fmt" "strings" "unicode/utf8" ) func checkIsbn13(isbn string) bool { isbn = strings.ReplaceAll(strings.ReplaceAll(isbn, "-", ""), " ", "") le := utf8.RuneCountInString(isbn) if le != 13 { return false } sum := int32(0) for i, c := range isbn { if c < '0' || c > '9' { return false } if i%2 == 0 { sum += c - '0' } else { sum += 3 * (c - '0') } } return sum%10 == 0 } func main() { isbns := []string{"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"} for _, isbn := range isbns { res := "bad" if checkIsbn13(isbn) { res = "good" } fmt.Printf("%s: %s\n", isbn, res) } }
Write the same algorithm in C as shown in this Nim implementation.
import strutils, strformat func is_isbn*(s: string): bool = var sum, len: int for c in s: if is_digit(c): sum += (ord(c) - ord('0')) * (if len mod 2 == 0: 1 else: 3) len += 1 elif c != ' ' and c != '-': return false return (len == 13) and (sum mod 10 == 0) when is_main_module: let isbns = [ "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ] for isbn in isbns: var quality: string = if is_isbn(isbn): "good" else: "bad" echo &"{isbn}: {quality}"
#include <stdio.h> int check_isbn13(const char *isbn) { int ch = *isbn, count = 0, sum = 0; for ( ; ch != 0; ch = *++isbn, ++count) { if (ch == ' ' || ch == '-') { --count; continue; } if (ch < '0' || ch > '9') { return 0; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } } if (count != 13) return 0; return !(sum%10); } int main() { int i; const char* isbns[] = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"}; for (i = 0; i < 4; ++i) { printf("%s: %s\n", isbns[i], check_isbn13(isbns[i]) ? "good" : "bad"); } return 0; }
Write a version of this Nim function in C with identical behavior.
import strutils, strformat func is_isbn*(s: string): bool = var sum, len: int for c in s: if is_digit(c): sum += (ord(c) - ord('0')) * (if len mod 2 == 0: 1 else: 3) len += 1 elif c != ' ' and c != '-': return false return (len == 13) and (sum mod 10 == 0) when is_main_module: let isbns = [ "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ] for isbn in isbns: var quality: string = if is_isbn(isbn): "good" else: "bad" echo &"{isbn}: {quality}"
#include <stdio.h> int check_isbn13(const char *isbn) { int ch = *isbn, count = 0, sum = 0; for ( ; ch != 0; ch = *++isbn, ++count) { if (ch == ' ' || ch == '-') { --count; continue; } if (ch < '0' || ch > '9') { return 0; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } } if (count != 13) return 0; return !(sum%10); } int main() { int i; const char* isbns[] = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"}; for (i = 0; i < 4; ++i) { printf("%s: %s\n", isbns[i], check_isbn13(isbns[i]) ? "good" : "bad"); } return 0; }
Port the following code from Nim to C# with equivalent syntax and logic.
import strutils, strformat func is_isbn*(s: string): bool = var sum, len: int for c in s: if is_digit(c): sum += (ord(c) - ord('0')) * (if len mod 2 == 0: 1 else: 3) len += 1 elif c != ' ' and c != '-': return false return (len == 13) and (sum mod 10 == 0) when is_main_module: let isbns = [ "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ] for isbn in isbns: var quality: string = if is_isbn(isbn): "good" else: "bad" echo &"{isbn}: {quality}"
using System; using System.Linq; public class Program { public static void Main() { Console.WriteLine(CheckISBN13("978-1734314502")); Console.WriteLine(CheckISBN13("978-1734314509")); Console.WriteLine(CheckISBN13("978-1788399081")); Console.WriteLine(CheckISBN13("978-1788399083")); static bool CheckISBN13(string code) { code = code.Replace("-", "").Replace(" ", ""); if (code.Length != 13) return false; int sum = 0; foreach (var (index, digit) in code.Select((digit, index) => (index, digit))) { if (char.IsDigit(digit)) sum += (digit - '0') * (index % 2 == 0 ? 1 : 3); else return false; } return sum % 10 == 0; } } }
Change the programming language of this snippet from Nim to C# without modifying what it does.
import strutils, strformat func is_isbn*(s: string): bool = var sum, len: int for c in s: if is_digit(c): sum += (ord(c) - ord('0')) * (if len mod 2 == 0: 1 else: 3) len += 1 elif c != ' ' and c != '-': return false return (len == 13) and (sum mod 10 == 0) when is_main_module: let isbns = [ "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ] for isbn in isbns: var quality: string = if is_isbn(isbn): "good" else: "bad" echo &"{isbn}: {quality}"
using System; using System.Linq; public class Program { public static void Main() { Console.WriteLine(CheckISBN13("978-1734314502")); Console.WriteLine(CheckISBN13("978-1734314509")); Console.WriteLine(CheckISBN13("978-1788399081")); Console.WriteLine(CheckISBN13("978-1788399083")); static bool CheckISBN13(string code) { code = code.Replace("-", "").Replace(" ", ""); if (code.Length != 13) return false; int sum = 0; foreach (var (index, digit) in code.Select((digit, index) => (index, digit))) { if (char.IsDigit(digit)) sum += (digit - '0') * (index % 2 == 0 ? 1 : 3); else return false; } return sum % 10 == 0; } } }
Produce a functionally identical C++ code for the snippet given in Nim.
import strutils, strformat func is_isbn*(s: string): bool = var sum, len: int for c in s: if is_digit(c): sum += (ord(c) - ord('0')) * (if len mod 2 == 0: 1 else: 3) len += 1 elif c != ' ' and c != '-': return false return (len == 13) and (sum mod 10 == 0) when is_main_module: let isbns = [ "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ] for isbn in isbns: var quality: string = if is_isbn(isbn): "good" else: "bad" echo &"{isbn}: {quality}"
#include <iostream> bool check_isbn13(std::string isbn) { int count = 0; int sum = 0; for (auto ch : isbn) { if (ch == ' ' || ch == '-') { continue; } if (ch < '0' || ch > '9') { return false; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } count++; } if (count != 13) { return false; } return sum % 10 == 0; } int main() { auto isbns = { "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" }; for (auto isbn : isbns) { std::cout << isbn << ": " << (check_isbn13(isbn) ? "good" : "bad") << '\n'; } return 0; }
Write the same algorithm in C++ as shown in this Nim implementation.
import strutils, strformat func is_isbn*(s: string): bool = var sum, len: int for c in s: if is_digit(c): sum += (ord(c) - ord('0')) * (if len mod 2 == 0: 1 else: 3) len += 1 elif c != ' ' and c != '-': return false return (len == 13) and (sum mod 10 == 0) when is_main_module: let isbns = [ "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ] for isbn in isbns: var quality: string = if is_isbn(isbn): "good" else: "bad" echo &"{isbn}: {quality}"
#include <iostream> bool check_isbn13(std::string isbn) { int count = 0; int sum = 0; for (auto ch : isbn) { if (ch == ' ' || ch == '-') { continue; } if (ch < '0' || ch > '9') { return false; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } count++; } if (count != 13) { return false; } return sum % 10 == 0; } int main() { auto isbns = { "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" }; for (auto isbn : isbns) { std::cout << isbn << ": " << (check_isbn13(isbn) ? "good" : "bad") << '\n'; } return 0; }
Keep all operations the same but rewrite the snippet in Java.
import strutils, strformat func is_isbn*(s: string): bool = var sum, len: int for c in s: if is_digit(c): sum += (ord(c) - ord('0')) * (if len mod 2 == 0: 1 else: 3) len += 1 elif c != ' ' and c != '-': return false return (len == 13) and (sum mod 10 == 0) when is_main_module: let isbns = [ "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ] for isbn in isbns: var quality: string = if is_isbn(isbn): "good" else: "bad" echo &"{isbn}: {quality}"
public static void main(){ System.out.println(isISBN13("978-1734314502")); System.out.println(isISBN13("978-1734314509")); System.out.println(isISBN13("978-1788399081")); System.out.println(isISBN13("978-1788399083")); } public static boolean isISBN13(String in){ int pre = Integer.parseInt(in.substring(0,3)); if (pre!=978)return false; String postStr = in.substring(4); if (postStr.length()!=10)return false; int post = Integer.parseInt(postStr); int sum = 38; for(int x = 0; x<10;x+=2) sum += (postStr.charAt(x)-48)*3 + ((postStr.charAt(x+1)-48)); if(sum%10==0) return true; return false; }
Write the same algorithm in Java as shown in this Nim implementation.
import strutils, strformat func is_isbn*(s: string): bool = var sum, len: int for c in s: if is_digit(c): sum += (ord(c) - ord('0')) * (if len mod 2 == 0: 1 else: 3) len += 1 elif c != ' ' and c != '-': return false return (len == 13) and (sum mod 10 == 0) when is_main_module: let isbns = [ "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ] for isbn in isbns: var quality: string = if is_isbn(isbn): "good" else: "bad" echo &"{isbn}: {quality}"
public static void main(){ System.out.println(isISBN13("978-1734314502")); System.out.println(isISBN13("978-1734314509")); System.out.println(isISBN13("978-1788399081")); System.out.println(isISBN13("978-1788399083")); } public static boolean isISBN13(String in){ int pre = Integer.parseInt(in.substring(0,3)); if (pre!=978)return false; String postStr = in.substring(4); if (postStr.length()!=10)return false; int post = Integer.parseInt(postStr); int sum = 38; for(int x = 0; x<10;x+=2) sum += (postStr.charAt(x)-48)*3 + ((postStr.charAt(x+1)-48)); if(sum%10==0) return true; return false; }
Produce a language-to-language conversion: from Nim to Python, same semantics.
import strutils, strformat func is_isbn*(s: string): bool = var sum, len: int for c in s: if is_digit(c): sum += (ord(c) - ord('0')) * (if len mod 2 == 0: 1 else: 3) len += 1 elif c != ' ' and c != '-': return false return (len == 13) and (sum mod 10 == 0) when is_main_module: let isbns = [ "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ] for isbn in isbns: var quality: string = if is_isbn(isbn): "good" else: "bad" echo &"{isbn}: {quality}"
def is_isbn13(n): n = n.replace('-','').replace(' ', '') if len(n) != 13: return False product = (sum(int(ch) for ch in n[::2]) + sum(int(ch) * 3 for ch in n[1::2])) return product % 10 == 0 if __name__ == '__main__': tests = .strip().split() for t in tests: print(f"ISBN13 {t} validates {is_isbn13(t)}")
Change the programming language of this snippet from Nim to Python without modifying what it does.
import strutils, strformat func is_isbn*(s: string): bool = var sum, len: int for c in s: if is_digit(c): sum += (ord(c) - ord('0')) * (if len mod 2 == 0: 1 else: 3) len += 1 elif c != ' ' and c != '-': return false return (len == 13) and (sum mod 10 == 0) when is_main_module: let isbns = [ "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ] for isbn in isbns: var quality: string = if is_isbn(isbn): "good" else: "bad" echo &"{isbn}: {quality}"
def is_isbn13(n): n = n.replace('-','').replace(' ', '') if len(n) != 13: return False product = (sum(int(ch) for ch in n[::2]) + sum(int(ch) * 3 for ch in n[1::2])) return product % 10 == 0 if __name__ == '__main__': tests = .strip().split() for t in tests: print(f"ISBN13 {t} validates {is_isbn13(t)}")
Ensure the translated VB code behaves exactly like the original Nim snippet.
import strutils, strformat func is_isbn*(s: string): bool = var sum, len: int for c in s: if is_digit(c): sum += (ord(c) - ord('0')) * (if len mod 2 == 0: 1 else: 3) len += 1 elif c != ' ' and c != '-': return false return (len == 13) and (sum mod 10 == 0) when is_main_module: let isbns = [ "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ] for isbn in isbns: var quality: string = if is_isbn(isbn): "good" else: "bad" echo &"{isbn}: {quality}"
arraybase 1 dim isbn = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083", "978-2-74839-908-0", "978-2-74839-908-5", "978 1 86197 876 9"} for n = 1 to isbn[?] sum = 0 isbnStr = isbn[n] isbnStr = replace(isbnStr, "-", "") isbnStr = replace(isbnStr, " ", "") for m = 1 to length(isbnStr) if m mod 2 = 0 then num = 3 * int(mid(isbnStr, m, 1)) else num = int(mid(isbnStr, m, 1)) end if sum += num next m if sum mod 10 = 0 then print isbn[n]; ": good" else print isbn[n]; ": bad" end if next n
Produce a language-to-language conversion: from Nim to VB, same semantics.
import strutils, strformat func is_isbn*(s: string): bool = var sum, len: int for c in s: if is_digit(c): sum += (ord(c) - ord('0')) * (if len mod 2 == 0: 1 else: 3) len += 1 elif c != ' ' and c != '-': return false return (len == 13) and (sum mod 10 == 0) when is_main_module: let isbns = [ "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ] for isbn in isbns: var quality: string = if is_isbn(isbn): "good" else: "bad" echo &"{isbn}: {quality}"
arraybase 1 dim isbn = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083", "978-2-74839-908-0", "978-2-74839-908-5", "978 1 86197 876 9"} for n = 1 to isbn[?] sum = 0 isbnStr = isbn[n] isbnStr = replace(isbnStr, "-", "") isbnStr = replace(isbnStr, " ", "") for m = 1 to length(isbnStr) if m mod 2 = 0 then num = 3 * int(mid(isbnStr, m, 1)) else num = int(mid(isbnStr, m, 1)) end if sum += num next m if sum mod 10 = 0 then print isbn[n]; ": good" else print isbn[n]; ": bad" end if next n
Write a version of this Nim function in Go with identical behavior.
import strutils, strformat func is_isbn*(s: string): bool = var sum, len: int for c in s: if is_digit(c): sum += (ord(c) - ord('0')) * (if len mod 2 == 0: 1 else: 3) len += 1 elif c != ' ' and c != '-': return false return (len == 13) and (sum mod 10 == 0) when is_main_module: let isbns = [ "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ] for isbn in isbns: var quality: string = if is_isbn(isbn): "good" else: "bad" echo &"{isbn}: {quality}"
package main import ( "fmt" "strings" "unicode/utf8" ) func checkIsbn13(isbn string) bool { isbn = strings.ReplaceAll(strings.ReplaceAll(isbn, "-", ""), " ", "") le := utf8.RuneCountInString(isbn) if le != 13 { return false } sum := int32(0) for i, c := range isbn { if c < '0' || c > '9' { return false } if i%2 == 0 { sum += c - '0' } else { sum += 3 * (c - '0') } } return sum%10 == 0 } func main() { isbns := []string{"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"} for _, isbn := range isbns { res := "bad" if checkIsbn13(isbn) { res = "good" } fmt.Printf("%s: %s\n", isbn, res) } }
Produce a functionally identical Go code for the snippet given in Nim.
import strutils, strformat func is_isbn*(s: string): bool = var sum, len: int for c in s: if is_digit(c): sum += (ord(c) - ord('0')) * (if len mod 2 == 0: 1 else: 3) len += 1 elif c != ' ' and c != '-': return false return (len == 13) and (sum mod 10 == 0) when is_main_module: let isbns = [ "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ] for isbn in isbns: var quality: string = if is_isbn(isbn): "good" else: "bad" echo &"{isbn}: {quality}"
package main import ( "fmt" "strings" "unicode/utf8" ) func checkIsbn13(isbn string) bool { isbn = strings.ReplaceAll(strings.ReplaceAll(isbn, "-", ""), " ", "") le := utf8.RuneCountInString(isbn) if le != 13 { return false } sum := int32(0) for i, c := range isbn { if c < '0' || c > '9' { return false } if i%2 == 0 { sum += c - '0' } else { sum += 3 * (c - '0') } } return sum%10 == 0 } func main() { isbns := []string{"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"} for _, isbn := range isbns { res := "bad" if checkIsbn13(isbn) { res = "good" } fmt.Printf("%s: %s\n", isbn, res) } }
Change the following Pascal code into C without altering its purpose.
program ISBNChecksum(output); const codeIndexMaximum = 17; ISBNIndexMinimum = 1; ISBNIndexMaximum = 13; ISBNIndexRange = ISBNIndexMaximum - ISBNIndexMinimum + 1; type code = string(codeIndexMaximum); codeIndex = 1..codeIndexMaximum value 1; decimalDigit = '0'..'9'; decimalValue = 0..9; ISBNIndex = ISBNIndexMinimum..ISBNIndexMaximum; ISBN = array[ISBNIndex] of decimalDigit; function numericValue(protected c: decimalDigit): decimalValue; begin numericValue := ord(c) - ord('0') end; function isValidISBN(protected n: ISBN): Boolean; var sum: 0..225 value 0; i: ISBNIndex; begin for i := ISBNIndexMinimum to ISBNIndexMaximum do begin sum := sum + numericValue(n[i]) * 3 pow ord(not odd(i)) end; isValidISBN := sum mod 10 = 0 end; function digits(n: code): code; var sourceIndex, destinationIndex: codeIndex; begin for sourceIndex := 1 to length(n) do begin if n[sourceIndex] in ['0'..'9'] then begin n[destinationIndex] := n[sourceIndex]; destinationIndex := destinationIndex + 1 end end; digits := subStr(n, 1, destinationIndex - 1) end; function asISBN(protected n: code): ISBN; var result: ISBN; begin unpack(n[1..length(n)], result, 1); asISBN := result end; function isValidISBNString(protected hyphenatedForm: code): Boolean; var digitOnlyForm: code; begin digitOnlyForm := digits(hyphenatedForm); isValidISBNString := (length(digitOnlyForm) = ISBNIndexRange) and_then isValidISBN(asISBN(digitOnlyForm)) end; begin writeLn(isValidISBNString('978-1734314502')); writeLn(isValidISBNString('978-1734314509')); writeLn(isValidISBNString('978-1788399081')); writeLn(isValidISBNString('978-1788399083')) end.
#include <stdio.h> int check_isbn13(const char *isbn) { int ch = *isbn, count = 0, sum = 0; for ( ; ch != 0; ch = *++isbn, ++count) { if (ch == ' ' || ch == '-') { --count; continue; } if (ch < '0' || ch > '9') { return 0; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } } if (count != 13) return 0; return !(sum%10); } int main() { int i; const char* isbns[] = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"}; for (i = 0; i < 4; ++i) { printf("%s: %s\n", isbns[i], check_isbn13(isbns[i]) ? "good" : "bad"); } return 0; }
Translate the given Pascal code snippet into C without altering its behavior.
program ISBNChecksum(output); const codeIndexMaximum = 17; ISBNIndexMinimum = 1; ISBNIndexMaximum = 13; ISBNIndexRange = ISBNIndexMaximum - ISBNIndexMinimum + 1; type code = string(codeIndexMaximum); codeIndex = 1..codeIndexMaximum value 1; decimalDigit = '0'..'9'; decimalValue = 0..9; ISBNIndex = ISBNIndexMinimum..ISBNIndexMaximum; ISBN = array[ISBNIndex] of decimalDigit; function numericValue(protected c: decimalDigit): decimalValue; begin numericValue := ord(c) - ord('0') end; function isValidISBN(protected n: ISBN): Boolean; var sum: 0..225 value 0; i: ISBNIndex; begin for i := ISBNIndexMinimum to ISBNIndexMaximum do begin sum := sum + numericValue(n[i]) * 3 pow ord(not odd(i)) end; isValidISBN := sum mod 10 = 0 end; function digits(n: code): code; var sourceIndex, destinationIndex: codeIndex; begin for sourceIndex := 1 to length(n) do begin if n[sourceIndex] in ['0'..'9'] then begin n[destinationIndex] := n[sourceIndex]; destinationIndex := destinationIndex + 1 end end; digits := subStr(n, 1, destinationIndex - 1) end; function asISBN(protected n: code): ISBN; var result: ISBN; begin unpack(n[1..length(n)], result, 1); asISBN := result end; function isValidISBNString(protected hyphenatedForm: code): Boolean; var digitOnlyForm: code; begin digitOnlyForm := digits(hyphenatedForm); isValidISBNString := (length(digitOnlyForm) = ISBNIndexRange) and_then isValidISBN(asISBN(digitOnlyForm)) end; begin writeLn(isValidISBNString('978-1734314502')); writeLn(isValidISBNString('978-1734314509')); writeLn(isValidISBNString('978-1788399081')); writeLn(isValidISBNString('978-1788399083')) end.
#include <stdio.h> int check_isbn13(const char *isbn) { int ch = *isbn, count = 0, sum = 0; for ( ; ch != 0; ch = *++isbn, ++count) { if (ch == ' ' || ch == '-') { --count; continue; } if (ch < '0' || ch > '9') { return 0; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } } if (count != 13) return 0; return !(sum%10); } int main() { int i; const char* isbns[] = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"}; for (i = 0; i < 4; ++i) { printf("%s: %s\n", isbns[i], check_isbn13(isbns[i]) ? "good" : "bad"); } return 0; }
Generate an equivalent C# version of this Pascal code.
program ISBNChecksum(output); const codeIndexMaximum = 17; ISBNIndexMinimum = 1; ISBNIndexMaximum = 13; ISBNIndexRange = ISBNIndexMaximum - ISBNIndexMinimum + 1; type code = string(codeIndexMaximum); codeIndex = 1..codeIndexMaximum value 1; decimalDigit = '0'..'9'; decimalValue = 0..9; ISBNIndex = ISBNIndexMinimum..ISBNIndexMaximum; ISBN = array[ISBNIndex] of decimalDigit; function numericValue(protected c: decimalDigit): decimalValue; begin numericValue := ord(c) - ord('0') end; function isValidISBN(protected n: ISBN): Boolean; var sum: 0..225 value 0; i: ISBNIndex; begin for i := ISBNIndexMinimum to ISBNIndexMaximum do begin sum := sum + numericValue(n[i]) * 3 pow ord(not odd(i)) end; isValidISBN := sum mod 10 = 0 end; function digits(n: code): code; var sourceIndex, destinationIndex: codeIndex; begin for sourceIndex := 1 to length(n) do begin if n[sourceIndex] in ['0'..'9'] then begin n[destinationIndex] := n[sourceIndex]; destinationIndex := destinationIndex + 1 end end; digits := subStr(n, 1, destinationIndex - 1) end; function asISBN(protected n: code): ISBN; var result: ISBN; begin unpack(n[1..length(n)], result, 1); asISBN := result end; function isValidISBNString(protected hyphenatedForm: code): Boolean; var digitOnlyForm: code; begin digitOnlyForm := digits(hyphenatedForm); isValidISBNString := (length(digitOnlyForm) = ISBNIndexRange) and_then isValidISBN(asISBN(digitOnlyForm)) end; begin writeLn(isValidISBNString('978-1734314502')); writeLn(isValidISBNString('978-1734314509')); writeLn(isValidISBNString('978-1788399081')); writeLn(isValidISBNString('978-1788399083')) end.
using System; using System.Linq; public class Program { public static void Main() { Console.WriteLine(CheckISBN13("978-1734314502")); Console.WriteLine(CheckISBN13("978-1734314509")); Console.WriteLine(CheckISBN13("978-1788399081")); Console.WriteLine(CheckISBN13("978-1788399083")); static bool CheckISBN13(string code) { code = code.Replace("-", "").Replace(" ", ""); if (code.Length != 13) return false; int sum = 0; foreach (var (index, digit) in code.Select((digit, index) => (index, digit))) { if (char.IsDigit(digit)) sum += (digit - '0') * (index % 2 == 0 ? 1 : 3); else return false; } return sum % 10 == 0; } } }
Convert this Pascal block to C#, preserving its control flow and logic.
program ISBNChecksum(output); const codeIndexMaximum = 17; ISBNIndexMinimum = 1; ISBNIndexMaximum = 13; ISBNIndexRange = ISBNIndexMaximum - ISBNIndexMinimum + 1; type code = string(codeIndexMaximum); codeIndex = 1..codeIndexMaximum value 1; decimalDigit = '0'..'9'; decimalValue = 0..9; ISBNIndex = ISBNIndexMinimum..ISBNIndexMaximum; ISBN = array[ISBNIndex] of decimalDigit; function numericValue(protected c: decimalDigit): decimalValue; begin numericValue := ord(c) - ord('0') end; function isValidISBN(protected n: ISBN): Boolean; var sum: 0..225 value 0; i: ISBNIndex; begin for i := ISBNIndexMinimum to ISBNIndexMaximum do begin sum := sum + numericValue(n[i]) * 3 pow ord(not odd(i)) end; isValidISBN := sum mod 10 = 0 end; function digits(n: code): code; var sourceIndex, destinationIndex: codeIndex; begin for sourceIndex := 1 to length(n) do begin if n[sourceIndex] in ['0'..'9'] then begin n[destinationIndex] := n[sourceIndex]; destinationIndex := destinationIndex + 1 end end; digits := subStr(n, 1, destinationIndex - 1) end; function asISBN(protected n: code): ISBN; var result: ISBN; begin unpack(n[1..length(n)], result, 1); asISBN := result end; function isValidISBNString(protected hyphenatedForm: code): Boolean; var digitOnlyForm: code; begin digitOnlyForm := digits(hyphenatedForm); isValidISBNString := (length(digitOnlyForm) = ISBNIndexRange) and_then isValidISBN(asISBN(digitOnlyForm)) end; begin writeLn(isValidISBNString('978-1734314502')); writeLn(isValidISBNString('978-1734314509')); writeLn(isValidISBNString('978-1788399081')); writeLn(isValidISBNString('978-1788399083')) end.
using System; using System.Linq; public class Program { public static void Main() { Console.WriteLine(CheckISBN13("978-1734314502")); Console.WriteLine(CheckISBN13("978-1734314509")); Console.WriteLine(CheckISBN13("978-1788399081")); Console.WriteLine(CheckISBN13("978-1788399083")); static bool CheckISBN13(string code) { code = code.Replace("-", "").Replace(" ", ""); if (code.Length != 13) return false; int sum = 0; foreach (var (index, digit) in code.Select((digit, index) => (index, digit))) { if (char.IsDigit(digit)) sum += (digit - '0') * (index % 2 == 0 ? 1 : 3); else return false; } return sum % 10 == 0; } } }
Generate a C++ translation of this Pascal snippet without changing its computational steps.
program ISBNChecksum(output); const codeIndexMaximum = 17; ISBNIndexMinimum = 1; ISBNIndexMaximum = 13; ISBNIndexRange = ISBNIndexMaximum - ISBNIndexMinimum + 1; type code = string(codeIndexMaximum); codeIndex = 1..codeIndexMaximum value 1; decimalDigit = '0'..'9'; decimalValue = 0..9; ISBNIndex = ISBNIndexMinimum..ISBNIndexMaximum; ISBN = array[ISBNIndex] of decimalDigit; function numericValue(protected c: decimalDigit): decimalValue; begin numericValue := ord(c) - ord('0') end; function isValidISBN(protected n: ISBN): Boolean; var sum: 0..225 value 0; i: ISBNIndex; begin for i := ISBNIndexMinimum to ISBNIndexMaximum do begin sum := sum + numericValue(n[i]) * 3 pow ord(not odd(i)) end; isValidISBN := sum mod 10 = 0 end; function digits(n: code): code; var sourceIndex, destinationIndex: codeIndex; begin for sourceIndex := 1 to length(n) do begin if n[sourceIndex] in ['0'..'9'] then begin n[destinationIndex] := n[sourceIndex]; destinationIndex := destinationIndex + 1 end end; digits := subStr(n, 1, destinationIndex - 1) end; function asISBN(protected n: code): ISBN; var result: ISBN; begin unpack(n[1..length(n)], result, 1); asISBN := result end; function isValidISBNString(protected hyphenatedForm: code): Boolean; var digitOnlyForm: code; begin digitOnlyForm := digits(hyphenatedForm); isValidISBNString := (length(digitOnlyForm) = ISBNIndexRange) and_then isValidISBN(asISBN(digitOnlyForm)) end; begin writeLn(isValidISBNString('978-1734314502')); writeLn(isValidISBNString('978-1734314509')); writeLn(isValidISBNString('978-1788399081')); writeLn(isValidISBNString('978-1788399083')) end.
#include <iostream> bool check_isbn13(std::string isbn) { int count = 0; int sum = 0; for (auto ch : isbn) { if (ch == ' ' || ch == '-') { continue; } if (ch < '0' || ch > '9') { return false; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } count++; } if (count != 13) { return false; } return sum % 10 == 0; } int main() { auto isbns = { "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" }; for (auto isbn : isbns) { std::cout << isbn << ": " << (check_isbn13(isbn) ? "good" : "bad") << '\n'; } return 0; }
Write the same algorithm in C++ as shown in this Pascal implementation.
program ISBNChecksum(output); const codeIndexMaximum = 17; ISBNIndexMinimum = 1; ISBNIndexMaximum = 13; ISBNIndexRange = ISBNIndexMaximum - ISBNIndexMinimum + 1; type code = string(codeIndexMaximum); codeIndex = 1..codeIndexMaximum value 1; decimalDigit = '0'..'9'; decimalValue = 0..9; ISBNIndex = ISBNIndexMinimum..ISBNIndexMaximum; ISBN = array[ISBNIndex] of decimalDigit; function numericValue(protected c: decimalDigit): decimalValue; begin numericValue := ord(c) - ord('0') end; function isValidISBN(protected n: ISBN): Boolean; var sum: 0..225 value 0; i: ISBNIndex; begin for i := ISBNIndexMinimum to ISBNIndexMaximum do begin sum := sum + numericValue(n[i]) * 3 pow ord(not odd(i)) end; isValidISBN := sum mod 10 = 0 end; function digits(n: code): code; var sourceIndex, destinationIndex: codeIndex; begin for sourceIndex := 1 to length(n) do begin if n[sourceIndex] in ['0'..'9'] then begin n[destinationIndex] := n[sourceIndex]; destinationIndex := destinationIndex + 1 end end; digits := subStr(n, 1, destinationIndex - 1) end; function asISBN(protected n: code): ISBN; var result: ISBN; begin unpack(n[1..length(n)], result, 1); asISBN := result end; function isValidISBNString(protected hyphenatedForm: code): Boolean; var digitOnlyForm: code; begin digitOnlyForm := digits(hyphenatedForm); isValidISBNString := (length(digitOnlyForm) = ISBNIndexRange) and_then isValidISBN(asISBN(digitOnlyForm)) end; begin writeLn(isValidISBNString('978-1734314502')); writeLn(isValidISBNString('978-1734314509')); writeLn(isValidISBNString('978-1788399081')); writeLn(isValidISBNString('978-1788399083')) end.
#include <iostream> bool check_isbn13(std::string isbn) { int count = 0; int sum = 0; for (auto ch : isbn) { if (ch == ' ' || ch == '-') { continue; } if (ch < '0' || ch > '9') { return false; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } count++; } if (count != 13) { return false; } return sum % 10 == 0; } int main() { auto isbns = { "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" }; for (auto isbn : isbns) { std::cout << isbn << ": " << (check_isbn13(isbn) ? "good" : "bad") << '\n'; } return 0; }
Generate a Java translation of this Pascal snippet without changing its computational steps.
program ISBNChecksum(output); const codeIndexMaximum = 17; ISBNIndexMinimum = 1; ISBNIndexMaximum = 13; ISBNIndexRange = ISBNIndexMaximum - ISBNIndexMinimum + 1; type code = string(codeIndexMaximum); codeIndex = 1..codeIndexMaximum value 1; decimalDigit = '0'..'9'; decimalValue = 0..9; ISBNIndex = ISBNIndexMinimum..ISBNIndexMaximum; ISBN = array[ISBNIndex] of decimalDigit; function numericValue(protected c: decimalDigit): decimalValue; begin numericValue := ord(c) - ord('0') end; function isValidISBN(protected n: ISBN): Boolean; var sum: 0..225 value 0; i: ISBNIndex; begin for i := ISBNIndexMinimum to ISBNIndexMaximum do begin sum := sum + numericValue(n[i]) * 3 pow ord(not odd(i)) end; isValidISBN := sum mod 10 = 0 end; function digits(n: code): code; var sourceIndex, destinationIndex: codeIndex; begin for sourceIndex := 1 to length(n) do begin if n[sourceIndex] in ['0'..'9'] then begin n[destinationIndex] := n[sourceIndex]; destinationIndex := destinationIndex + 1 end end; digits := subStr(n, 1, destinationIndex - 1) end; function asISBN(protected n: code): ISBN; var result: ISBN; begin unpack(n[1..length(n)], result, 1); asISBN := result end; function isValidISBNString(protected hyphenatedForm: code): Boolean; var digitOnlyForm: code; begin digitOnlyForm := digits(hyphenatedForm); isValidISBNString := (length(digitOnlyForm) = ISBNIndexRange) and_then isValidISBN(asISBN(digitOnlyForm)) end; begin writeLn(isValidISBNString('978-1734314502')); writeLn(isValidISBNString('978-1734314509')); writeLn(isValidISBNString('978-1788399081')); writeLn(isValidISBNString('978-1788399083')) end.
public static void main(){ System.out.println(isISBN13("978-1734314502")); System.out.println(isISBN13("978-1734314509")); System.out.println(isISBN13("978-1788399081")); System.out.println(isISBN13("978-1788399083")); } public static boolean isISBN13(String in){ int pre = Integer.parseInt(in.substring(0,3)); if (pre!=978)return false; String postStr = in.substring(4); if (postStr.length()!=10)return false; int post = Integer.parseInt(postStr); int sum = 38; for(int x = 0; x<10;x+=2) sum += (postStr.charAt(x)-48)*3 + ((postStr.charAt(x+1)-48)); if(sum%10==0) return true; return false; }
Translate the given Pascal code snippet into Java without altering its behavior.
program ISBNChecksum(output); const codeIndexMaximum = 17; ISBNIndexMinimum = 1; ISBNIndexMaximum = 13; ISBNIndexRange = ISBNIndexMaximum - ISBNIndexMinimum + 1; type code = string(codeIndexMaximum); codeIndex = 1..codeIndexMaximum value 1; decimalDigit = '0'..'9'; decimalValue = 0..9; ISBNIndex = ISBNIndexMinimum..ISBNIndexMaximum; ISBN = array[ISBNIndex] of decimalDigit; function numericValue(protected c: decimalDigit): decimalValue; begin numericValue := ord(c) - ord('0') end; function isValidISBN(protected n: ISBN): Boolean; var sum: 0..225 value 0; i: ISBNIndex; begin for i := ISBNIndexMinimum to ISBNIndexMaximum do begin sum := sum + numericValue(n[i]) * 3 pow ord(not odd(i)) end; isValidISBN := sum mod 10 = 0 end; function digits(n: code): code; var sourceIndex, destinationIndex: codeIndex; begin for sourceIndex := 1 to length(n) do begin if n[sourceIndex] in ['0'..'9'] then begin n[destinationIndex] := n[sourceIndex]; destinationIndex := destinationIndex + 1 end end; digits := subStr(n, 1, destinationIndex - 1) end; function asISBN(protected n: code): ISBN; var result: ISBN; begin unpack(n[1..length(n)], result, 1); asISBN := result end; function isValidISBNString(protected hyphenatedForm: code): Boolean; var digitOnlyForm: code; begin digitOnlyForm := digits(hyphenatedForm); isValidISBNString := (length(digitOnlyForm) = ISBNIndexRange) and_then isValidISBN(asISBN(digitOnlyForm)) end; begin writeLn(isValidISBNString('978-1734314502')); writeLn(isValidISBNString('978-1734314509')); writeLn(isValidISBNString('978-1788399081')); writeLn(isValidISBNString('978-1788399083')) end.
public static void main(){ System.out.println(isISBN13("978-1734314502")); System.out.println(isISBN13("978-1734314509")); System.out.println(isISBN13("978-1788399081")); System.out.println(isISBN13("978-1788399083")); } public static boolean isISBN13(String in){ int pre = Integer.parseInt(in.substring(0,3)); if (pre!=978)return false; String postStr = in.substring(4); if (postStr.length()!=10)return false; int post = Integer.parseInt(postStr); int sum = 38; for(int x = 0; x<10;x+=2) sum += (postStr.charAt(x)-48)*3 + ((postStr.charAt(x+1)-48)); if(sum%10==0) return true; return false; }
Rewrite this program in Python while keeping its functionality equivalent to the Pascal version.
program ISBNChecksum(output); const codeIndexMaximum = 17; ISBNIndexMinimum = 1; ISBNIndexMaximum = 13; ISBNIndexRange = ISBNIndexMaximum - ISBNIndexMinimum + 1; type code = string(codeIndexMaximum); codeIndex = 1..codeIndexMaximum value 1; decimalDigit = '0'..'9'; decimalValue = 0..9; ISBNIndex = ISBNIndexMinimum..ISBNIndexMaximum; ISBN = array[ISBNIndex] of decimalDigit; function numericValue(protected c: decimalDigit): decimalValue; begin numericValue := ord(c) - ord('0') end; function isValidISBN(protected n: ISBN): Boolean; var sum: 0..225 value 0; i: ISBNIndex; begin for i := ISBNIndexMinimum to ISBNIndexMaximum do begin sum := sum + numericValue(n[i]) * 3 pow ord(not odd(i)) end; isValidISBN := sum mod 10 = 0 end; function digits(n: code): code; var sourceIndex, destinationIndex: codeIndex; begin for sourceIndex := 1 to length(n) do begin if n[sourceIndex] in ['0'..'9'] then begin n[destinationIndex] := n[sourceIndex]; destinationIndex := destinationIndex + 1 end end; digits := subStr(n, 1, destinationIndex - 1) end; function asISBN(protected n: code): ISBN; var result: ISBN; begin unpack(n[1..length(n)], result, 1); asISBN := result end; function isValidISBNString(protected hyphenatedForm: code): Boolean; var digitOnlyForm: code; begin digitOnlyForm := digits(hyphenatedForm); isValidISBNString := (length(digitOnlyForm) = ISBNIndexRange) and_then isValidISBN(asISBN(digitOnlyForm)) end; begin writeLn(isValidISBNString('978-1734314502')); writeLn(isValidISBNString('978-1734314509')); writeLn(isValidISBNString('978-1788399081')); writeLn(isValidISBNString('978-1788399083')) end.
def is_isbn13(n): n = n.replace('-','').replace(' ', '') if len(n) != 13: return False product = (sum(int(ch) for ch in n[::2]) + sum(int(ch) * 3 for ch in n[1::2])) return product % 10 == 0 if __name__ == '__main__': tests = .strip().split() for t in tests: print(f"ISBN13 {t} validates {is_isbn13(t)}")
Change the following Pascal code into Python without altering its purpose.
program ISBNChecksum(output); const codeIndexMaximum = 17; ISBNIndexMinimum = 1; ISBNIndexMaximum = 13; ISBNIndexRange = ISBNIndexMaximum - ISBNIndexMinimum + 1; type code = string(codeIndexMaximum); codeIndex = 1..codeIndexMaximum value 1; decimalDigit = '0'..'9'; decimalValue = 0..9; ISBNIndex = ISBNIndexMinimum..ISBNIndexMaximum; ISBN = array[ISBNIndex] of decimalDigit; function numericValue(protected c: decimalDigit): decimalValue; begin numericValue := ord(c) - ord('0') end; function isValidISBN(protected n: ISBN): Boolean; var sum: 0..225 value 0; i: ISBNIndex; begin for i := ISBNIndexMinimum to ISBNIndexMaximum do begin sum := sum + numericValue(n[i]) * 3 pow ord(not odd(i)) end; isValidISBN := sum mod 10 = 0 end; function digits(n: code): code; var sourceIndex, destinationIndex: codeIndex; begin for sourceIndex := 1 to length(n) do begin if n[sourceIndex] in ['0'..'9'] then begin n[destinationIndex] := n[sourceIndex]; destinationIndex := destinationIndex + 1 end end; digits := subStr(n, 1, destinationIndex - 1) end; function asISBN(protected n: code): ISBN; var result: ISBN; begin unpack(n[1..length(n)], result, 1); asISBN := result end; function isValidISBNString(protected hyphenatedForm: code): Boolean; var digitOnlyForm: code; begin digitOnlyForm := digits(hyphenatedForm); isValidISBNString := (length(digitOnlyForm) = ISBNIndexRange) and_then isValidISBN(asISBN(digitOnlyForm)) end; begin writeLn(isValidISBNString('978-1734314502')); writeLn(isValidISBNString('978-1734314509')); writeLn(isValidISBNString('978-1788399081')); writeLn(isValidISBNString('978-1788399083')) end.
def is_isbn13(n): n = n.replace('-','').replace(' ', '') if len(n) != 13: return False product = (sum(int(ch) for ch in n[::2]) + sum(int(ch) * 3 for ch in n[1::2])) return product % 10 == 0 if __name__ == '__main__': tests = .strip().split() for t in tests: print(f"ISBN13 {t} validates {is_isbn13(t)}")
Port the provided Pascal code into VB while preserving the original functionality.
program ISBNChecksum(output); const codeIndexMaximum = 17; ISBNIndexMinimum = 1; ISBNIndexMaximum = 13; ISBNIndexRange = ISBNIndexMaximum - ISBNIndexMinimum + 1; type code = string(codeIndexMaximum); codeIndex = 1..codeIndexMaximum value 1; decimalDigit = '0'..'9'; decimalValue = 0..9; ISBNIndex = ISBNIndexMinimum..ISBNIndexMaximum; ISBN = array[ISBNIndex] of decimalDigit; function numericValue(protected c: decimalDigit): decimalValue; begin numericValue := ord(c) - ord('0') end; function isValidISBN(protected n: ISBN): Boolean; var sum: 0..225 value 0; i: ISBNIndex; begin for i := ISBNIndexMinimum to ISBNIndexMaximum do begin sum := sum + numericValue(n[i]) * 3 pow ord(not odd(i)) end; isValidISBN := sum mod 10 = 0 end; function digits(n: code): code; var sourceIndex, destinationIndex: codeIndex; begin for sourceIndex := 1 to length(n) do begin if n[sourceIndex] in ['0'..'9'] then begin n[destinationIndex] := n[sourceIndex]; destinationIndex := destinationIndex + 1 end end; digits := subStr(n, 1, destinationIndex - 1) end; function asISBN(protected n: code): ISBN; var result: ISBN; begin unpack(n[1..length(n)], result, 1); asISBN := result end; function isValidISBNString(protected hyphenatedForm: code): Boolean; var digitOnlyForm: code; begin digitOnlyForm := digits(hyphenatedForm); isValidISBNString := (length(digitOnlyForm) = ISBNIndexRange) and_then isValidISBN(asISBN(digitOnlyForm)) end; begin writeLn(isValidISBNString('978-1734314502')); writeLn(isValidISBNString('978-1734314509')); writeLn(isValidISBNString('978-1788399081')); writeLn(isValidISBNString('978-1788399083')) end.
arraybase 1 dim isbn = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083", "978-2-74839-908-0", "978-2-74839-908-5", "978 1 86197 876 9"} for n = 1 to isbn[?] sum = 0 isbnStr = isbn[n] isbnStr = replace(isbnStr, "-", "") isbnStr = replace(isbnStr, " ", "") for m = 1 to length(isbnStr) if m mod 2 = 0 then num = 3 * int(mid(isbnStr, m, 1)) else num = int(mid(isbnStr, m, 1)) end if sum += num next m if sum mod 10 = 0 then print isbn[n]; ": good" else print isbn[n]; ": bad" end if next n
Rewrite the snippet below in VB so it works the same as the original Pascal code.
program ISBNChecksum(output); const codeIndexMaximum = 17; ISBNIndexMinimum = 1; ISBNIndexMaximum = 13; ISBNIndexRange = ISBNIndexMaximum - ISBNIndexMinimum + 1; type code = string(codeIndexMaximum); codeIndex = 1..codeIndexMaximum value 1; decimalDigit = '0'..'9'; decimalValue = 0..9; ISBNIndex = ISBNIndexMinimum..ISBNIndexMaximum; ISBN = array[ISBNIndex] of decimalDigit; function numericValue(protected c: decimalDigit): decimalValue; begin numericValue := ord(c) - ord('0') end; function isValidISBN(protected n: ISBN): Boolean; var sum: 0..225 value 0; i: ISBNIndex; begin for i := ISBNIndexMinimum to ISBNIndexMaximum do begin sum := sum + numericValue(n[i]) * 3 pow ord(not odd(i)) end; isValidISBN := sum mod 10 = 0 end; function digits(n: code): code; var sourceIndex, destinationIndex: codeIndex; begin for sourceIndex := 1 to length(n) do begin if n[sourceIndex] in ['0'..'9'] then begin n[destinationIndex] := n[sourceIndex]; destinationIndex := destinationIndex + 1 end end; digits := subStr(n, 1, destinationIndex - 1) end; function asISBN(protected n: code): ISBN; var result: ISBN; begin unpack(n[1..length(n)], result, 1); asISBN := result end; function isValidISBNString(protected hyphenatedForm: code): Boolean; var digitOnlyForm: code; begin digitOnlyForm := digits(hyphenatedForm); isValidISBNString := (length(digitOnlyForm) = ISBNIndexRange) and_then isValidISBN(asISBN(digitOnlyForm)) end; begin writeLn(isValidISBNString('978-1734314502')); writeLn(isValidISBNString('978-1734314509')); writeLn(isValidISBNString('978-1788399081')); writeLn(isValidISBNString('978-1788399083')) end.
arraybase 1 dim isbn = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083", "978-2-74839-908-0", "978-2-74839-908-5", "978 1 86197 876 9"} for n = 1 to isbn[?] sum = 0 isbnStr = isbn[n] isbnStr = replace(isbnStr, "-", "") isbnStr = replace(isbnStr, " ", "") for m = 1 to length(isbnStr) if m mod 2 = 0 then num = 3 * int(mid(isbnStr, m, 1)) else num = int(mid(isbnStr, m, 1)) end if sum += num next m if sum mod 10 = 0 then print isbn[n]; ": good" else print isbn[n]; ": bad" end if next n
Produce a language-to-language conversion: from Pascal to Go, same semantics.
program ISBNChecksum(output); const codeIndexMaximum = 17; ISBNIndexMinimum = 1; ISBNIndexMaximum = 13; ISBNIndexRange = ISBNIndexMaximum - ISBNIndexMinimum + 1; type code = string(codeIndexMaximum); codeIndex = 1..codeIndexMaximum value 1; decimalDigit = '0'..'9'; decimalValue = 0..9; ISBNIndex = ISBNIndexMinimum..ISBNIndexMaximum; ISBN = array[ISBNIndex] of decimalDigit; function numericValue(protected c: decimalDigit): decimalValue; begin numericValue := ord(c) - ord('0') end; function isValidISBN(protected n: ISBN): Boolean; var sum: 0..225 value 0; i: ISBNIndex; begin for i := ISBNIndexMinimum to ISBNIndexMaximum do begin sum := sum + numericValue(n[i]) * 3 pow ord(not odd(i)) end; isValidISBN := sum mod 10 = 0 end; function digits(n: code): code; var sourceIndex, destinationIndex: codeIndex; begin for sourceIndex := 1 to length(n) do begin if n[sourceIndex] in ['0'..'9'] then begin n[destinationIndex] := n[sourceIndex]; destinationIndex := destinationIndex + 1 end end; digits := subStr(n, 1, destinationIndex - 1) end; function asISBN(protected n: code): ISBN; var result: ISBN; begin unpack(n[1..length(n)], result, 1); asISBN := result end; function isValidISBNString(protected hyphenatedForm: code): Boolean; var digitOnlyForm: code; begin digitOnlyForm := digits(hyphenatedForm); isValidISBNString := (length(digitOnlyForm) = ISBNIndexRange) and_then isValidISBN(asISBN(digitOnlyForm)) end; begin writeLn(isValidISBNString('978-1734314502')); writeLn(isValidISBNString('978-1734314509')); writeLn(isValidISBNString('978-1788399081')); writeLn(isValidISBNString('978-1788399083')) end.
package main import ( "fmt" "strings" "unicode/utf8" ) func checkIsbn13(isbn string) bool { isbn = strings.ReplaceAll(strings.ReplaceAll(isbn, "-", ""), " ", "") le := utf8.RuneCountInString(isbn) if le != 13 { return false } sum := int32(0) for i, c := range isbn { if c < '0' || c > '9' { return false } if i%2 == 0 { sum += c - '0' } else { sum += 3 * (c - '0') } } return sum%10 == 0 } func main() { isbns := []string{"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"} for _, isbn := range isbns { res := "bad" if checkIsbn13(isbn) { res = "good" } fmt.Printf("%s: %s\n", isbn, res) } }
Write the same code in Go as shown below in Pascal.
program ISBNChecksum(output); const codeIndexMaximum = 17; ISBNIndexMinimum = 1; ISBNIndexMaximum = 13; ISBNIndexRange = ISBNIndexMaximum - ISBNIndexMinimum + 1; type code = string(codeIndexMaximum); codeIndex = 1..codeIndexMaximum value 1; decimalDigit = '0'..'9'; decimalValue = 0..9; ISBNIndex = ISBNIndexMinimum..ISBNIndexMaximum; ISBN = array[ISBNIndex] of decimalDigit; function numericValue(protected c: decimalDigit): decimalValue; begin numericValue := ord(c) - ord('0') end; function isValidISBN(protected n: ISBN): Boolean; var sum: 0..225 value 0; i: ISBNIndex; begin for i := ISBNIndexMinimum to ISBNIndexMaximum do begin sum := sum + numericValue(n[i]) * 3 pow ord(not odd(i)) end; isValidISBN := sum mod 10 = 0 end; function digits(n: code): code; var sourceIndex, destinationIndex: codeIndex; begin for sourceIndex := 1 to length(n) do begin if n[sourceIndex] in ['0'..'9'] then begin n[destinationIndex] := n[sourceIndex]; destinationIndex := destinationIndex + 1 end end; digits := subStr(n, 1, destinationIndex - 1) end; function asISBN(protected n: code): ISBN; var result: ISBN; begin unpack(n[1..length(n)], result, 1); asISBN := result end; function isValidISBNString(protected hyphenatedForm: code): Boolean; var digitOnlyForm: code; begin digitOnlyForm := digits(hyphenatedForm); isValidISBNString := (length(digitOnlyForm) = ISBNIndexRange) and_then isValidISBN(asISBN(digitOnlyForm)) end; begin writeLn(isValidISBNString('978-1734314502')); writeLn(isValidISBNString('978-1734314509')); writeLn(isValidISBNString('978-1788399081')); writeLn(isValidISBNString('978-1788399083')) end.
package main import ( "fmt" "strings" "unicode/utf8" ) func checkIsbn13(isbn string) bool { isbn = strings.ReplaceAll(strings.ReplaceAll(isbn, "-", ""), " ", "") le := utf8.RuneCountInString(isbn) if le != 13 { return false } sum := int32(0) for i, c := range isbn { if c < '0' || c > '9' { return false } if i%2 == 0 { sum += c - '0' } else { sum += 3 * (c - '0') } } return sum%10 == 0 } func main() { isbns := []string{"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"} for _, isbn := range isbns { res := "bad" if checkIsbn13(isbn) { res = "good" } fmt.Printf("%s: %s\n", isbn, res) } }
Produce a language-to-language conversion: from Perl to C, same semantics.
use strict; use warnings; use feature 'say'; sub check_digit { my($isbn) = @_; my($sum); $sum += (1,3)[$_%2] * (split '', join '', split /\D/, $isbn)[$_] for 0..11; (10 - $sum % 10) % 10; } for (<978-1734314502 978-1734314509 978-1788399081 978-1788399083 978-2-74839-908-0 978-2-74839-908-5>) { my($isbn,$check) = /(.*)(.)/; my $check_d = check_digit($isbn); say "$_ : " . ($check == $check_d ? 'Good' : "Bad check-digit $check; should be $check_d") }
#include <stdio.h> int check_isbn13(const char *isbn) { int ch = *isbn, count = 0, sum = 0; for ( ; ch != 0; ch = *++isbn, ++count) { if (ch == ' ' || ch == '-') { --count; continue; } if (ch < '0' || ch > '9') { return 0; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } } if (count != 13) return 0; return !(sum%10); } int main() { int i; const char* isbns[] = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"}; for (i = 0; i < 4; ++i) { printf("%s: %s\n", isbns[i], check_isbn13(isbns[i]) ? "good" : "bad"); } return 0; }
Change the following Perl code into C without altering its purpose.
use strict; use warnings; use feature 'say'; sub check_digit { my($isbn) = @_; my($sum); $sum += (1,3)[$_%2] * (split '', join '', split /\D/, $isbn)[$_] for 0..11; (10 - $sum % 10) % 10; } for (<978-1734314502 978-1734314509 978-1788399081 978-1788399083 978-2-74839-908-0 978-2-74839-908-5>) { my($isbn,$check) = /(.*)(.)/; my $check_d = check_digit($isbn); say "$_ : " . ($check == $check_d ? 'Good' : "Bad check-digit $check; should be $check_d") }
#include <stdio.h> int check_isbn13(const char *isbn) { int ch = *isbn, count = 0, sum = 0; for ( ; ch != 0; ch = *++isbn, ++count) { if (ch == ' ' || ch == '-') { --count; continue; } if (ch < '0' || ch > '9') { return 0; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } } if (count != 13) return 0; return !(sum%10); } int main() { int i; const char* isbns[] = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"}; for (i = 0; i < 4; ++i) { printf("%s: %s\n", isbns[i], check_isbn13(isbns[i]) ? "good" : "bad"); } return 0; }
Rewrite the snippet below in C# so it works the same as the original Perl code.
use strict; use warnings; use feature 'say'; sub check_digit { my($isbn) = @_; my($sum); $sum += (1,3)[$_%2] * (split '', join '', split /\D/, $isbn)[$_] for 0..11; (10 - $sum % 10) % 10; } for (<978-1734314502 978-1734314509 978-1788399081 978-1788399083 978-2-74839-908-0 978-2-74839-908-5>) { my($isbn,$check) = /(.*)(.)/; my $check_d = check_digit($isbn); say "$_ : " . ($check == $check_d ? 'Good' : "Bad check-digit $check; should be $check_d") }
using System; using System.Linq; public class Program { public static void Main() { Console.WriteLine(CheckISBN13("978-1734314502")); Console.WriteLine(CheckISBN13("978-1734314509")); Console.WriteLine(CheckISBN13("978-1788399081")); Console.WriteLine(CheckISBN13("978-1788399083")); static bool CheckISBN13(string code) { code = code.Replace("-", "").Replace(" ", ""); if (code.Length != 13) return false; int sum = 0; foreach (var (index, digit) in code.Select((digit, index) => (index, digit))) { if (char.IsDigit(digit)) sum += (digit - '0') * (index % 2 == 0 ? 1 : 3); else return false; } return sum % 10 == 0; } } }
Port the following code from Perl to C# with equivalent syntax and logic.
use strict; use warnings; use feature 'say'; sub check_digit { my($isbn) = @_; my($sum); $sum += (1,3)[$_%2] * (split '', join '', split /\D/, $isbn)[$_] for 0..11; (10 - $sum % 10) % 10; } for (<978-1734314502 978-1734314509 978-1788399081 978-1788399083 978-2-74839-908-0 978-2-74839-908-5>) { my($isbn,$check) = /(.*)(.)/; my $check_d = check_digit($isbn); say "$_ : " . ($check == $check_d ? 'Good' : "Bad check-digit $check; should be $check_d") }
using System; using System.Linq; public class Program { public static void Main() { Console.WriteLine(CheckISBN13("978-1734314502")); Console.WriteLine(CheckISBN13("978-1734314509")); Console.WriteLine(CheckISBN13("978-1788399081")); Console.WriteLine(CheckISBN13("978-1788399083")); static bool CheckISBN13(string code) { code = code.Replace("-", "").Replace(" ", ""); if (code.Length != 13) return false; int sum = 0; foreach (var (index, digit) in code.Select((digit, index) => (index, digit))) { if (char.IsDigit(digit)) sum += (digit - '0') * (index % 2 == 0 ? 1 : 3); else return false; } return sum % 10 == 0; } } }
Change the programming language of this snippet from Perl to C++ without modifying what it does.
use strict; use warnings; use feature 'say'; sub check_digit { my($isbn) = @_; my($sum); $sum += (1,3)[$_%2] * (split '', join '', split /\D/, $isbn)[$_] for 0..11; (10 - $sum % 10) % 10; } for (<978-1734314502 978-1734314509 978-1788399081 978-1788399083 978-2-74839-908-0 978-2-74839-908-5>) { my($isbn,$check) = /(.*)(.)/; my $check_d = check_digit($isbn); say "$_ : " . ($check == $check_d ? 'Good' : "Bad check-digit $check; should be $check_d") }
#include <iostream> bool check_isbn13(std::string isbn) { int count = 0; int sum = 0; for (auto ch : isbn) { if (ch == ' ' || ch == '-') { continue; } if (ch < '0' || ch > '9') { return false; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } count++; } if (count != 13) { return false; } return sum % 10 == 0; } int main() { auto isbns = { "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" }; for (auto isbn : isbns) { std::cout << isbn << ": " << (check_isbn13(isbn) ? "good" : "bad") << '\n'; } return 0; }
Produce a functionally identical C++ code for the snippet given in Perl.
use strict; use warnings; use feature 'say'; sub check_digit { my($isbn) = @_; my($sum); $sum += (1,3)[$_%2] * (split '', join '', split /\D/, $isbn)[$_] for 0..11; (10 - $sum % 10) % 10; } for (<978-1734314502 978-1734314509 978-1788399081 978-1788399083 978-2-74839-908-0 978-2-74839-908-5>) { my($isbn,$check) = /(.*)(.)/; my $check_d = check_digit($isbn); say "$_ : " . ($check == $check_d ? 'Good' : "Bad check-digit $check; should be $check_d") }
#include <iostream> bool check_isbn13(std::string isbn) { int count = 0; int sum = 0; for (auto ch : isbn) { if (ch == ' ' || ch == '-') { continue; } if (ch < '0' || ch > '9') { return false; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } count++; } if (count != 13) { return false; } return sum % 10 == 0; } int main() { auto isbns = { "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" }; for (auto isbn : isbns) { std::cout << isbn << ": " << (check_isbn13(isbn) ? "good" : "bad") << '\n'; } return 0; }
Convert the following code from Perl to Java, ensuring the logic remains intact.
use strict; use warnings; use feature 'say'; sub check_digit { my($isbn) = @_; my($sum); $sum += (1,3)[$_%2] * (split '', join '', split /\D/, $isbn)[$_] for 0..11; (10 - $sum % 10) % 10; } for (<978-1734314502 978-1734314509 978-1788399081 978-1788399083 978-2-74839-908-0 978-2-74839-908-5>) { my($isbn,$check) = /(.*)(.)/; my $check_d = check_digit($isbn); say "$_ : " . ($check == $check_d ? 'Good' : "Bad check-digit $check; should be $check_d") }
public static void main(){ System.out.println(isISBN13("978-1734314502")); System.out.println(isISBN13("978-1734314509")); System.out.println(isISBN13("978-1788399081")); System.out.println(isISBN13("978-1788399083")); } public static boolean isISBN13(String in){ int pre = Integer.parseInt(in.substring(0,3)); if (pre!=978)return false; String postStr = in.substring(4); if (postStr.length()!=10)return false; int post = Integer.parseInt(postStr); int sum = 38; for(int x = 0; x<10;x+=2) sum += (postStr.charAt(x)-48)*3 + ((postStr.charAt(x+1)-48)); if(sum%10==0) return true; return false; }
Port the following code from Perl to Java with equivalent syntax and logic.
use strict; use warnings; use feature 'say'; sub check_digit { my($isbn) = @_; my($sum); $sum += (1,3)[$_%2] * (split '', join '', split /\D/, $isbn)[$_] for 0..11; (10 - $sum % 10) % 10; } for (<978-1734314502 978-1734314509 978-1788399081 978-1788399083 978-2-74839-908-0 978-2-74839-908-5>) { my($isbn,$check) = /(.*)(.)/; my $check_d = check_digit($isbn); say "$_ : " . ($check == $check_d ? 'Good' : "Bad check-digit $check; should be $check_d") }
public static void main(){ System.out.println(isISBN13("978-1734314502")); System.out.println(isISBN13("978-1734314509")); System.out.println(isISBN13("978-1788399081")); System.out.println(isISBN13("978-1788399083")); } public static boolean isISBN13(String in){ int pre = Integer.parseInt(in.substring(0,3)); if (pre!=978)return false; String postStr = in.substring(4); if (postStr.length()!=10)return false; int post = Integer.parseInt(postStr); int sum = 38; for(int x = 0; x<10;x+=2) sum += (postStr.charAt(x)-48)*3 + ((postStr.charAt(x+1)-48)); if(sum%10==0) return true; return false; }
Rewrite the snippet below in Python so it works the same as the original Perl code.
use strict; use warnings; use feature 'say'; sub check_digit { my($isbn) = @_; my($sum); $sum += (1,3)[$_%2] * (split '', join '', split /\D/, $isbn)[$_] for 0..11; (10 - $sum % 10) % 10; } for (<978-1734314502 978-1734314509 978-1788399081 978-1788399083 978-2-74839-908-0 978-2-74839-908-5>) { my($isbn,$check) = /(.*)(.)/; my $check_d = check_digit($isbn); say "$_ : " . ($check == $check_d ? 'Good' : "Bad check-digit $check; should be $check_d") }
def is_isbn13(n): n = n.replace('-','').replace(' ', '') if len(n) != 13: return False product = (sum(int(ch) for ch in n[::2]) + sum(int(ch) * 3 for ch in n[1::2])) return product % 10 == 0 if __name__ == '__main__': tests = .strip().split() for t in tests: print(f"ISBN13 {t} validates {is_isbn13(t)}")
Translate this program into Python but keep the logic exactly as in Perl.
use strict; use warnings; use feature 'say'; sub check_digit { my($isbn) = @_; my($sum); $sum += (1,3)[$_%2] * (split '', join '', split /\D/, $isbn)[$_] for 0..11; (10 - $sum % 10) % 10; } for (<978-1734314502 978-1734314509 978-1788399081 978-1788399083 978-2-74839-908-0 978-2-74839-908-5>) { my($isbn,$check) = /(.*)(.)/; my $check_d = check_digit($isbn); say "$_ : " . ($check == $check_d ? 'Good' : "Bad check-digit $check; should be $check_d") }
def is_isbn13(n): n = n.replace('-','').replace(' ', '') if len(n) != 13: return False product = (sum(int(ch) for ch in n[::2]) + sum(int(ch) * 3 for ch in n[1::2])) return product % 10 == 0 if __name__ == '__main__': tests = .strip().split() for t in tests: print(f"ISBN13 {t} validates {is_isbn13(t)}")
Produce a language-to-language conversion: from Perl to VB, same semantics.
use strict; use warnings; use feature 'say'; sub check_digit { my($isbn) = @_; my($sum); $sum += (1,3)[$_%2] * (split '', join '', split /\D/, $isbn)[$_] for 0..11; (10 - $sum % 10) % 10; } for (<978-1734314502 978-1734314509 978-1788399081 978-1788399083 978-2-74839-908-0 978-2-74839-908-5>) { my($isbn,$check) = /(.*)(.)/; my $check_d = check_digit($isbn); say "$_ : " . ($check == $check_d ? 'Good' : "Bad check-digit $check; should be $check_d") }
arraybase 1 dim isbn = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083", "978-2-74839-908-0", "978-2-74839-908-5", "978 1 86197 876 9"} for n = 1 to isbn[?] sum = 0 isbnStr = isbn[n] isbnStr = replace(isbnStr, "-", "") isbnStr = replace(isbnStr, " ", "") for m = 1 to length(isbnStr) if m mod 2 = 0 then num = 3 * int(mid(isbnStr, m, 1)) else num = int(mid(isbnStr, m, 1)) end if sum += num next m if sum mod 10 = 0 then print isbn[n]; ": good" else print isbn[n]; ": bad" end if next n
Translate this program into VB but keep the logic exactly as in Perl.
use strict; use warnings; use feature 'say'; sub check_digit { my($isbn) = @_; my($sum); $sum += (1,3)[$_%2] * (split '', join '', split /\D/, $isbn)[$_] for 0..11; (10 - $sum % 10) % 10; } for (<978-1734314502 978-1734314509 978-1788399081 978-1788399083 978-2-74839-908-0 978-2-74839-908-5>) { my($isbn,$check) = /(.*)(.)/; my $check_d = check_digit($isbn); say "$_ : " . ($check == $check_d ? 'Good' : "Bad check-digit $check; should be $check_d") }
arraybase 1 dim isbn = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083", "978-2-74839-908-0", "978-2-74839-908-5", "978 1 86197 876 9"} for n = 1 to isbn[?] sum = 0 isbnStr = isbn[n] isbnStr = replace(isbnStr, "-", "") isbnStr = replace(isbnStr, " ", "") for m = 1 to length(isbnStr) if m mod 2 = 0 then num = 3 * int(mid(isbnStr, m, 1)) else num = int(mid(isbnStr, m, 1)) end if sum += num next m if sum mod 10 = 0 then print isbn[n]; ": good" else print isbn[n]; ": bad" end if next n
Can you help me rewrite this code in Go instead of Perl, keeping it the same logically?
use strict; use warnings; use feature 'say'; sub check_digit { my($isbn) = @_; my($sum); $sum += (1,3)[$_%2] * (split '', join '', split /\D/, $isbn)[$_] for 0..11; (10 - $sum % 10) % 10; } for (<978-1734314502 978-1734314509 978-1788399081 978-1788399083 978-2-74839-908-0 978-2-74839-908-5>) { my($isbn,$check) = /(.*)(.)/; my $check_d = check_digit($isbn); say "$_ : " . ($check == $check_d ? 'Good' : "Bad check-digit $check; should be $check_d") }
package main import ( "fmt" "strings" "unicode/utf8" ) func checkIsbn13(isbn string) bool { isbn = strings.ReplaceAll(strings.ReplaceAll(isbn, "-", ""), " ", "") le := utf8.RuneCountInString(isbn) if le != 13 { return false } sum := int32(0) for i, c := range isbn { if c < '0' || c > '9' { return false } if i%2 == 0 { sum += c - '0' } else { sum += 3 * (c - '0') } } return sum%10 == 0 } func main() { isbns := []string{"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"} for _, isbn := range isbns { res := "bad" if checkIsbn13(isbn) { res = "good" } fmt.Printf("%s: %s\n", isbn, res) } }
Translate this program into Go but keep the logic exactly as in Perl.
use strict; use warnings; use feature 'say'; sub check_digit { my($isbn) = @_; my($sum); $sum += (1,3)[$_%2] * (split '', join '', split /\D/, $isbn)[$_] for 0..11; (10 - $sum % 10) % 10; } for (<978-1734314502 978-1734314509 978-1788399081 978-1788399083 978-2-74839-908-0 978-2-74839-908-5>) { my($isbn,$check) = /(.*)(.)/; my $check_d = check_digit($isbn); say "$_ : " . ($check == $check_d ? 'Good' : "Bad check-digit $check; should be $check_d") }
package main import ( "fmt" "strings" "unicode/utf8" ) func checkIsbn13(isbn string) bool { isbn = strings.ReplaceAll(strings.ReplaceAll(isbn, "-", ""), " ", "") le := utf8.RuneCountInString(isbn) if le != 13 { return false } sum := int32(0) for i, c := range isbn { if c < '0' || c > '9' { return false } if i%2 == 0 { sum += c - '0' } else { sum += 3 * (c - '0') } } return sum%10 == 0 } func main() { isbns := []string{"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"} for _, isbn := range isbns { res := "bad" if checkIsbn13(isbn) { res = "good" } fmt.Printf("%s: %s\n", isbn, res) } }
Translate this program into C but keep the logic exactly as in PowerShell.
function Get-ISBN13 { $codes = ( "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ) foreach ($line in $codes) { $sum = $null $codeNoDash = $line.Replace("-","") for ($i = 0; $i -lt $codeNoDash.length; $i++) { if (($i % 2) -eq 1) { $sum += [decimal]$codeNoDash[$i] * 3 }else { $sum += [decimal]$codeNoDash[$i] } } if (($sum % 10) -eq 0) { Write-Host "$line Good" }else { Write-Host "$line Bad" } } } Get-ISBN13
#include <stdio.h> int check_isbn13(const char *isbn) { int ch = *isbn, count = 0, sum = 0; for ( ; ch != 0; ch = *++isbn, ++count) { if (ch == ' ' || ch == '-') { --count; continue; } if (ch < '0' || ch > '9') { return 0; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } } if (count != 13) return 0; return !(sum%10); } int main() { int i; const char* isbns[] = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"}; for (i = 0; i < 4; ++i) { printf("%s: %s\n", isbns[i], check_isbn13(isbns[i]) ? "good" : "bad"); } return 0; }
Generate a C translation of this PowerShell snippet without changing its computational steps.
function Get-ISBN13 { $codes = ( "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ) foreach ($line in $codes) { $sum = $null $codeNoDash = $line.Replace("-","") for ($i = 0; $i -lt $codeNoDash.length; $i++) { if (($i % 2) -eq 1) { $sum += [decimal]$codeNoDash[$i] * 3 }else { $sum += [decimal]$codeNoDash[$i] } } if (($sum % 10) -eq 0) { Write-Host "$line Good" }else { Write-Host "$line Bad" } } } Get-ISBN13
#include <stdio.h> int check_isbn13(const char *isbn) { int ch = *isbn, count = 0, sum = 0; for ( ; ch != 0; ch = *++isbn, ++count) { if (ch == ' ' || ch == '-') { --count; continue; } if (ch < '0' || ch > '9') { return 0; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } } if (count != 13) return 0; return !(sum%10); } int main() { int i; const char* isbns[] = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"}; for (i = 0; i < 4; ++i) { printf("%s: %s\n", isbns[i], check_isbn13(isbns[i]) ? "good" : "bad"); } return 0; }
Transform the following PowerShell implementation into C#, maintaining the same output and logic.
function Get-ISBN13 { $codes = ( "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ) foreach ($line in $codes) { $sum = $null $codeNoDash = $line.Replace("-","") for ($i = 0; $i -lt $codeNoDash.length; $i++) { if (($i % 2) -eq 1) { $sum += [decimal]$codeNoDash[$i] * 3 }else { $sum += [decimal]$codeNoDash[$i] } } if (($sum % 10) -eq 0) { Write-Host "$line Good" }else { Write-Host "$line Bad" } } } Get-ISBN13
using System; using System.Linq; public class Program { public static void Main() { Console.WriteLine(CheckISBN13("978-1734314502")); Console.WriteLine(CheckISBN13("978-1734314509")); Console.WriteLine(CheckISBN13("978-1788399081")); Console.WriteLine(CheckISBN13("978-1788399083")); static bool CheckISBN13(string code) { code = code.Replace("-", "").Replace(" ", ""); if (code.Length != 13) return false; int sum = 0; foreach (var (index, digit) in code.Select((digit, index) => (index, digit))) { if (char.IsDigit(digit)) sum += (digit - '0') * (index % 2 == 0 ? 1 : 3); else return false; } return sum % 10 == 0; } } }
Change the programming language of this snippet from PowerShell to C# without modifying what it does.
function Get-ISBN13 { $codes = ( "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ) foreach ($line in $codes) { $sum = $null $codeNoDash = $line.Replace("-","") for ($i = 0; $i -lt $codeNoDash.length; $i++) { if (($i % 2) -eq 1) { $sum += [decimal]$codeNoDash[$i] * 3 }else { $sum += [decimal]$codeNoDash[$i] } } if (($sum % 10) -eq 0) { Write-Host "$line Good" }else { Write-Host "$line Bad" } } } Get-ISBN13
using System; using System.Linq; public class Program { public static void Main() { Console.WriteLine(CheckISBN13("978-1734314502")); Console.WriteLine(CheckISBN13("978-1734314509")); Console.WriteLine(CheckISBN13("978-1788399081")); Console.WriteLine(CheckISBN13("978-1788399083")); static bool CheckISBN13(string code) { code = code.Replace("-", "").Replace(" ", ""); if (code.Length != 13) return false; int sum = 0; foreach (var (index, digit) in code.Select((digit, index) => (index, digit))) { if (char.IsDigit(digit)) sum += (digit - '0') * (index % 2 == 0 ? 1 : 3); else return false; } return sum % 10 == 0; } } }
Produce a functionally identical C++ code for the snippet given in PowerShell.
function Get-ISBN13 { $codes = ( "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ) foreach ($line in $codes) { $sum = $null $codeNoDash = $line.Replace("-","") for ($i = 0; $i -lt $codeNoDash.length; $i++) { if (($i % 2) -eq 1) { $sum += [decimal]$codeNoDash[$i] * 3 }else { $sum += [decimal]$codeNoDash[$i] } } if (($sum % 10) -eq 0) { Write-Host "$line Good" }else { Write-Host "$line Bad" } } } Get-ISBN13
#include <iostream> bool check_isbn13(std::string isbn) { int count = 0; int sum = 0; for (auto ch : isbn) { if (ch == ' ' || ch == '-') { continue; } if (ch < '0' || ch > '9') { return false; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } count++; } if (count != 13) { return false; } return sum % 10 == 0; } int main() { auto isbns = { "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" }; for (auto isbn : isbns) { std::cout << isbn << ": " << (check_isbn13(isbn) ? "good" : "bad") << '\n'; } return 0; }
Produce a language-to-language conversion: from PowerShell to C++, same semantics.
function Get-ISBN13 { $codes = ( "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ) foreach ($line in $codes) { $sum = $null $codeNoDash = $line.Replace("-","") for ($i = 0; $i -lt $codeNoDash.length; $i++) { if (($i % 2) -eq 1) { $sum += [decimal]$codeNoDash[$i] * 3 }else { $sum += [decimal]$codeNoDash[$i] } } if (($sum % 10) -eq 0) { Write-Host "$line Good" }else { Write-Host "$line Bad" } } } Get-ISBN13
#include <iostream> bool check_isbn13(std::string isbn) { int count = 0; int sum = 0; for (auto ch : isbn) { if (ch == ' ' || ch == '-') { continue; } if (ch < '0' || ch > '9') { return false; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } count++; } if (count != 13) { return false; } return sum % 10 == 0; } int main() { auto isbns = { "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" }; for (auto isbn : isbns) { std::cout << isbn << ": " << (check_isbn13(isbn) ? "good" : "bad") << '\n'; } return 0; }
Transform the following PowerShell implementation into Java, maintaining the same output and logic.
function Get-ISBN13 { $codes = ( "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ) foreach ($line in $codes) { $sum = $null $codeNoDash = $line.Replace("-","") for ($i = 0; $i -lt $codeNoDash.length; $i++) { if (($i % 2) -eq 1) { $sum += [decimal]$codeNoDash[$i] * 3 }else { $sum += [decimal]$codeNoDash[$i] } } if (($sum % 10) -eq 0) { Write-Host "$line Good" }else { Write-Host "$line Bad" } } } Get-ISBN13
public static void main(){ System.out.println(isISBN13("978-1734314502")); System.out.println(isISBN13("978-1734314509")); System.out.println(isISBN13("978-1788399081")); System.out.println(isISBN13("978-1788399083")); } public static boolean isISBN13(String in){ int pre = Integer.parseInt(in.substring(0,3)); if (pre!=978)return false; String postStr = in.substring(4); if (postStr.length()!=10)return false; int post = Integer.parseInt(postStr); int sum = 38; for(int x = 0; x<10;x+=2) sum += (postStr.charAt(x)-48)*3 + ((postStr.charAt(x+1)-48)); if(sum%10==0) return true; return false; }
Preserve the algorithm and functionality while converting the code from PowerShell to Java.
function Get-ISBN13 { $codes = ( "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ) foreach ($line in $codes) { $sum = $null $codeNoDash = $line.Replace("-","") for ($i = 0; $i -lt $codeNoDash.length; $i++) { if (($i % 2) -eq 1) { $sum += [decimal]$codeNoDash[$i] * 3 }else { $sum += [decimal]$codeNoDash[$i] } } if (($sum % 10) -eq 0) { Write-Host "$line Good" }else { Write-Host "$line Bad" } } } Get-ISBN13
public static void main(){ System.out.println(isISBN13("978-1734314502")); System.out.println(isISBN13("978-1734314509")); System.out.println(isISBN13("978-1788399081")); System.out.println(isISBN13("978-1788399083")); } public static boolean isISBN13(String in){ int pre = Integer.parseInt(in.substring(0,3)); if (pre!=978)return false; String postStr = in.substring(4); if (postStr.length()!=10)return false; int post = Integer.parseInt(postStr); int sum = 38; for(int x = 0; x<10;x+=2) sum += (postStr.charAt(x)-48)*3 + ((postStr.charAt(x+1)-48)); if(sum%10==0) return true; return false; }
Can you help me rewrite this code in Python instead of PowerShell, keeping it the same logically?
function Get-ISBN13 { $codes = ( "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ) foreach ($line in $codes) { $sum = $null $codeNoDash = $line.Replace("-","") for ($i = 0; $i -lt $codeNoDash.length; $i++) { if (($i % 2) -eq 1) { $sum += [decimal]$codeNoDash[$i] * 3 }else { $sum += [decimal]$codeNoDash[$i] } } if (($sum % 10) -eq 0) { Write-Host "$line Good" }else { Write-Host "$line Bad" } } } Get-ISBN13
def is_isbn13(n): n = n.replace('-','').replace(' ', '') if len(n) != 13: return False product = (sum(int(ch) for ch in n[::2]) + sum(int(ch) * 3 for ch in n[1::2])) return product % 10 == 0 if __name__ == '__main__': tests = .strip().split() for t in tests: print(f"ISBN13 {t} validates {is_isbn13(t)}")
Convert the following code from PowerShell to Python, ensuring the logic remains intact.
function Get-ISBN13 { $codes = ( "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ) foreach ($line in $codes) { $sum = $null $codeNoDash = $line.Replace("-","") for ($i = 0; $i -lt $codeNoDash.length; $i++) { if (($i % 2) -eq 1) { $sum += [decimal]$codeNoDash[$i] * 3 }else { $sum += [decimal]$codeNoDash[$i] } } if (($sum % 10) -eq 0) { Write-Host "$line Good" }else { Write-Host "$line Bad" } } } Get-ISBN13
def is_isbn13(n): n = n.replace('-','').replace(' ', '') if len(n) != 13: return False product = (sum(int(ch) for ch in n[::2]) + sum(int(ch) * 3 for ch in n[1::2])) return product % 10 == 0 if __name__ == '__main__': tests = .strip().split() for t in tests: print(f"ISBN13 {t} validates {is_isbn13(t)}")
Can you help me rewrite this code in VB instead of PowerShell, keeping it the same logically?
function Get-ISBN13 { $codes = ( "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ) foreach ($line in $codes) { $sum = $null $codeNoDash = $line.Replace("-","") for ($i = 0; $i -lt $codeNoDash.length; $i++) { if (($i % 2) -eq 1) { $sum += [decimal]$codeNoDash[$i] * 3 }else { $sum += [decimal]$codeNoDash[$i] } } if (($sum % 10) -eq 0) { Write-Host "$line Good" }else { Write-Host "$line Bad" } } } Get-ISBN13
arraybase 1 dim isbn = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083", "978-2-74839-908-0", "978-2-74839-908-5", "978 1 86197 876 9"} for n = 1 to isbn[?] sum = 0 isbnStr = isbn[n] isbnStr = replace(isbnStr, "-", "") isbnStr = replace(isbnStr, " ", "") for m = 1 to length(isbnStr) if m mod 2 = 0 then num = 3 * int(mid(isbnStr, m, 1)) else num = int(mid(isbnStr, m, 1)) end if sum += num next m if sum mod 10 = 0 then print isbn[n]; ": good" else print isbn[n]; ": bad" end if next n
Change the following PowerShell code into VB without altering its purpose.
function Get-ISBN13 { $codes = ( "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ) foreach ($line in $codes) { $sum = $null $codeNoDash = $line.Replace("-","") for ($i = 0; $i -lt $codeNoDash.length; $i++) { if (($i % 2) -eq 1) { $sum += [decimal]$codeNoDash[$i] * 3 }else { $sum += [decimal]$codeNoDash[$i] } } if (($sum % 10) -eq 0) { Write-Host "$line Good" }else { Write-Host "$line Bad" } } } Get-ISBN13
arraybase 1 dim isbn = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083", "978-2-74839-908-0", "978-2-74839-908-5", "978 1 86197 876 9"} for n = 1 to isbn[?] sum = 0 isbnStr = isbn[n] isbnStr = replace(isbnStr, "-", "") isbnStr = replace(isbnStr, " ", "") for m = 1 to length(isbnStr) if m mod 2 = 0 then num = 3 * int(mid(isbnStr, m, 1)) else num = int(mid(isbnStr, m, 1)) end if sum += num next m if sum mod 10 = 0 then print isbn[n]; ": good" else print isbn[n]; ": bad" end if next n
Please provide an equivalent version of this PowerShell code in Go.
function Get-ISBN13 { $codes = ( "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ) foreach ($line in $codes) { $sum = $null $codeNoDash = $line.Replace("-","") for ($i = 0; $i -lt $codeNoDash.length; $i++) { if (($i % 2) -eq 1) { $sum += [decimal]$codeNoDash[$i] * 3 }else { $sum += [decimal]$codeNoDash[$i] } } if (($sum % 10) -eq 0) { Write-Host "$line Good" }else { Write-Host "$line Bad" } } } Get-ISBN13
package main import ( "fmt" "strings" "unicode/utf8" ) func checkIsbn13(isbn string) bool { isbn = strings.ReplaceAll(strings.ReplaceAll(isbn, "-", ""), " ", "") le := utf8.RuneCountInString(isbn) if le != 13 { return false } sum := int32(0) for i, c := range isbn { if c < '0' || c > '9' { return false } if i%2 == 0 { sum += c - '0' } else { sum += 3 * (c - '0') } } return sum%10 == 0 } func main() { isbns := []string{"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"} for _, isbn := range isbns { res := "bad" if checkIsbn13(isbn) { res = "good" } fmt.Printf("%s: %s\n", isbn, res) } }
Produce a functionally identical Go code for the snippet given in PowerShell.
function Get-ISBN13 { $codes = ( "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" ) foreach ($line in $codes) { $sum = $null $codeNoDash = $line.Replace("-","") for ($i = 0; $i -lt $codeNoDash.length; $i++) { if (($i % 2) -eq 1) { $sum += [decimal]$codeNoDash[$i] * 3 }else { $sum += [decimal]$codeNoDash[$i] } } if (($sum % 10) -eq 0) { Write-Host "$line Good" }else { Write-Host "$line Bad" } } } Get-ISBN13
package main import ( "fmt" "strings" "unicode/utf8" ) func checkIsbn13(isbn string) bool { isbn = strings.ReplaceAll(strings.ReplaceAll(isbn, "-", ""), " ", "") le := utf8.RuneCountInString(isbn) if le != 13 { return false } sum := int32(0) for i, c := range isbn { if c < '0' || c > '9' { return false } if i%2 == 0 { sum += c - '0' } else { sum += 3 * (c - '0') } } return sum%10 == 0 } func main() { isbns := []string{"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"} for _, isbn := range isbns { res := "bad" if checkIsbn13(isbn) { res = "good" } fmt.Printf("%s: %s\n", isbn, res) } }
Generate a C translation of this Racket snippet without changing its computational steps.
#lang racket/base (define (isbn13-check-digit-valid? s) (zero? (modulo (for/sum ((i (in-naturals)) (d (regexp-replace* #px"[^[:digit:]]" s ""))) (* (- (char->integer d) (char->integer #\0)) (if (even? i) 1 3))) 10))) (module+ test (require rackunit) (check-true (isbn13-check-digit-valid? "978-1734314502")) (check-false (isbn13-check-digit-valid? "978-1734314509")) (check-true (isbn13-check-digit-valid? "978-1788399081")) (check-false (isbn13-check-digit-valid? "978-1788399083")))
#include <stdio.h> int check_isbn13(const char *isbn) { int ch = *isbn, count = 0, sum = 0; for ( ; ch != 0; ch = *++isbn, ++count) { if (ch == ' ' || ch == '-') { --count; continue; } if (ch < '0' || ch > '9') { return 0; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } } if (count != 13) return 0; return !(sum%10); } int main() { int i; const char* isbns[] = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"}; for (i = 0; i < 4; ++i) { printf("%s: %s\n", isbns[i], check_isbn13(isbns[i]) ? "good" : "bad"); } return 0; }
Rewrite this program in C while keeping its functionality equivalent to the Racket version.
#lang racket/base (define (isbn13-check-digit-valid? s) (zero? (modulo (for/sum ((i (in-naturals)) (d (regexp-replace* #px"[^[:digit:]]" s ""))) (* (- (char->integer d) (char->integer #\0)) (if (even? i) 1 3))) 10))) (module+ test (require rackunit) (check-true (isbn13-check-digit-valid? "978-1734314502")) (check-false (isbn13-check-digit-valid? "978-1734314509")) (check-true (isbn13-check-digit-valid? "978-1788399081")) (check-false (isbn13-check-digit-valid? "978-1788399083")))
#include <stdio.h> int check_isbn13(const char *isbn) { int ch = *isbn, count = 0, sum = 0; for ( ; ch != 0; ch = *++isbn, ++count) { if (ch == ' ' || ch == '-') { --count; continue; } if (ch < '0' || ch > '9') { return 0; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } } if (count != 13) return 0; return !(sum%10); } int main() { int i; const char* isbns[] = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"}; for (i = 0; i < 4; ++i) { printf("%s: %s\n", isbns[i], check_isbn13(isbns[i]) ? "good" : "bad"); } return 0; }
Rewrite this program in C# while keeping its functionality equivalent to the Racket version.
#lang racket/base (define (isbn13-check-digit-valid? s) (zero? (modulo (for/sum ((i (in-naturals)) (d (regexp-replace* #px"[^[:digit:]]" s ""))) (* (- (char->integer d) (char->integer #\0)) (if (even? i) 1 3))) 10))) (module+ test (require rackunit) (check-true (isbn13-check-digit-valid? "978-1734314502")) (check-false (isbn13-check-digit-valid? "978-1734314509")) (check-true (isbn13-check-digit-valid? "978-1788399081")) (check-false (isbn13-check-digit-valid? "978-1788399083")))
using System; using System.Linq; public class Program { public static void Main() { Console.WriteLine(CheckISBN13("978-1734314502")); Console.WriteLine(CheckISBN13("978-1734314509")); Console.WriteLine(CheckISBN13("978-1788399081")); Console.WriteLine(CheckISBN13("978-1788399083")); static bool CheckISBN13(string code) { code = code.Replace("-", "").Replace(" ", ""); if (code.Length != 13) return false; int sum = 0; foreach (var (index, digit) in code.Select((digit, index) => (index, digit))) { if (char.IsDigit(digit)) sum += (digit - '0') * (index % 2 == 0 ? 1 : 3); else return false; } return sum % 10 == 0; } } }
Write the same algorithm in C# as shown in this Racket implementation.
#lang racket/base (define (isbn13-check-digit-valid? s) (zero? (modulo (for/sum ((i (in-naturals)) (d (regexp-replace* #px"[^[:digit:]]" s ""))) (* (- (char->integer d) (char->integer #\0)) (if (even? i) 1 3))) 10))) (module+ test (require rackunit) (check-true (isbn13-check-digit-valid? "978-1734314502")) (check-false (isbn13-check-digit-valid? "978-1734314509")) (check-true (isbn13-check-digit-valid? "978-1788399081")) (check-false (isbn13-check-digit-valid? "978-1788399083")))
using System; using System.Linq; public class Program { public static void Main() { Console.WriteLine(CheckISBN13("978-1734314502")); Console.WriteLine(CheckISBN13("978-1734314509")); Console.WriteLine(CheckISBN13("978-1788399081")); Console.WriteLine(CheckISBN13("978-1788399083")); static bool CheckISBN13(string code) { code = code.Replace("-", "").Replace(" ", ""); if (code.Length != 13) return false; int sum = 0; foreach (var (index, digit) in code.Select((digit, index) => (index, digit))) { if (char.IsDigit(digit)) sum += (digit - '0') * (index % 2 == 0 ? 1 : 3); else return false; } return sum % 10 == 0; } } }
Please provide an equivalent version of this Racket code in C++.
#lang racket/base (define (isbn13-check-digit-valid? s) (zero? (modulo (for/sum ((i (in-naturals)) (d (regexp-replace* #px"[^[:digit:]]" s ""))) (* (- (char->integer d) (char->integer #\0)) (if (even? i) 1 3))) 10))) (module+ test (require rackunit) (check-true (isbn13-check-digit-valid? "978-1734314502")) (check-false (isbn13-check-digit-valid? "978-1734314509")) (check-true (isbn13-check-digit-valid? "978-1788399081")) (check-false (isbn13-check-digit-valid? "978-1788399083")))
#include <iostream> bool check_isbn13(std::string isbn) { int count = 0; int sum = 0; for (auto ch : isbn) { if (ch == ' ' || ch == '-') { continue; } if (ch < '0' || ch > '9') { return false; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } count++; } if (count != 13) { return false; } return sum % 10 == 0; } int main() { auto isbns = { "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" }; for (auto isbn : isbns) { std::cout << isbn << ": " << (check_isbn13(isbn) ? "good" : "bad") << '\n'; } return 0; }
Can you help me rewrite this code in C++ instead of Racket, keeping it the same logically?
#lang racket/base (define (isbn13-check-digit-valid? s) (zero? (modulo (for/sum ((i (in-naturals)) (d (regexp-replace* #px"[^[:digit:]]" s ""))) (* (- (char->integer d) (char->integer #\0)) (if (even? i) 1 3))) 10))) (module+ test (require rackunit) (check-true (isbn13-check-digit-valid? "978-1734314502")) (check-false (isbn13-check-digit-valid? "978-1734314509")) (check-true (isbn13-check-digit-valid? "978-1788399081")) (check-false (isbn13-check-digit-valid? "978-1788399083")))
#include <iostream> bool check_isbn13(std::string isbn) { int count = 0; int sum = 0; for (auto ch : isbn) { if (ch == ' ' || ch == '-') { continue; } if (ch < '0' || ch > '9') { return false; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } count++; } if (count != 13) { return false; } return sum % 10 == 0; } int main() { auto isbns = { "978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083" }; for (auto isbn : isbns) { std::cout << isbn << ": " << (check_isbn13(isbn) ? "good" : "bad") << '\n'; } return 0; }
Ensure the translated Java code behaves exactly like the original Racket snippet.
#lang racket/base (define (isbn13-check-digit-valid? s) (zero? (modulo (for/sum ((i (in-naturals)) (d (regexp-replace* #px"[^[:digit:]]" s ""))) (* (- (char->integer d) (char->integer #\0)) (if (even? i) 1 3))) 10))) (module+ test (require rackunit) (check-true (isbn13-check-digit-valid? "978-1734314502")) (check-false (isbn13-check-digit-valid? "978-1734314509")) (check-true (isbn13-check-digit-valid? "978-1788399081")) (check-false (isbn13-check-digit-valid? "978-1788399083")))
public static void main(){ System.out.println(isISBN13("978-1734314502")); System.out.println(isISBN13("978-1734314509")); System.out.println(isISBN13("978-1788399081")); System.out.println(isISBN13("978-1788399083")); } public static boolean isISBN13(String in){ int pre = Integer.parseInt(in.substring(0,3)); if (pre!=978)return false; String postStr = in.substring(4); if (postStr.length()!=10)return false; int post = Integer.parseInt(postStr); int sum = 38; for(int x = 0; x<10;x+=2) sum += (postStr.charAt(x)-48)*3 + ((postStr.charAt(x+1)-48)); if(sum%10==0) return true; return false; }
Rewrite the snippet below in Java so it works the same as the original Racket code.
#lang racket/base (define (isbn13-check-digit-valid? s) (zero? (modulo (for/sum ((i (in-naturals)) (d (regexp-replace* #px"[^[:digit:]]" s ""))) (* (- (char->integer d) (char->integer #\0)) (if (even? i) 1 3))) 10))) (module+ test (require rackunit) (check-true (isbn13-check-digit-valid? "978-1734314502")) (check-false (isbn13-check-digit-valid? "978-1734314509")) (check-true (isbn13-check-digit-valid? "978-1788399081")) (check-false (isbn13-check-digit-valid? "978-1788399083")))
public static void main(){ System.out.println(isISBN13("978-1734314502")); System.out.println(isISBN13("978-1734314509")); System.out.println(isISBN13("978-1788399081")); System.out.println(isISBN13("978-1788399083")); } public static boolean isISBN13(String in){ int pre = Integer.parseInt(in.substring(0,3)); if (pre!=978)return false; String postStr = in.substring(4); if (postStr.length()!=10)return false; int post = Integer.parseInt(postStr); int sum = 38; for(int x = 0; x<10;x+=2) sum += (postStr.charAt(x)-48)*3 + ((postStr.charAt(x+1)-48)); if(sum%10==0) return true; return false; }
Generate an equivalent Python version of this Racket code.
#lang racket/base (define (isbn13-check-digit-valid? s) (zero? (modulo (for/sum ((i (in-naturals)) (d (regexp-replace* #px"[^[:digit:]]" s ""))) (* (- (char->integer d) (char->integer #\0)) (if (even? i) 1 3))) 10))) (module+ test (require rackunit) (check-true (isbn13-check-digit-valid? "978-1734314502")) (check-false (isbn13-check-digit-valid? "978-1734314509")) (check-true (isbn13-check-digit-valid? "978-1788399081")) (check-false (isbn13-check-digit-valid? "978-1788399083")))
def is_isbn13(n): n = n.replace('-','').replace(' ', '') if len(n) != 13: return False product = (sum(int(ch) for ch in n[::2]) + sum(int(ch) * 3 for ch in n[1::2])) return product % 10 == 0 if __name__ == '__main__': tests = .strip().split() for t in tests: print(f"ISBN13 {t} validates {is_isbn13(t)}")
Convert this Racket block to Python, preserving its control flow and logic.
#lang racket/base (define (isbn13-check-digit-valid? s) (zero? (modulo (for/sum ((i (in-naturals)) (d (regexp-replace* #px"[^[:digit:]]" s ""))) (* (- (char->integer d) (char->integer #\0)) (if (even? i) 1 3))) 10))) (module+ test (require rackunit) (check-true (isbn13-check-digit-valid? "978-1734314502")) (check-false (isbn13-check-digit-valid? "978-1734314509")) (check-true (isbn13-check-digit-valid? "978-1788399081")) (check-false (isbn13-check-digit-valid? "978-1788399083")))
def is_isbn13(n): n = n.replace('-','').replace(' ', '') if len(n) != 13: return False product = (sum(int(ch) for ch in n[::2]) + sum(int(ch) * 3 for ch in n[1::2])) return product % 10 == 0 if __name__ == '__main__': tests = .strip().split() for t in tests: print(f"ISBN13 {t} validates {is_isbn13(t)}")
Produce a functionally identical VB code for the snippet given in Racket.
#lang racket/base (define (isbn13-check-digit-valid? s) (zero? (modulo (for/sum ((i (in-naturals)) (d (regexp-replace* #px"[^[:digit:]]" s ""))) (* (- (char->integer d) (char->integer #\0)) (if (even? i) 1 3))) 10))) (module+ test (require rackunit) (check-true (isbn13-check-digit-valid? "978-1734314502")) (check-false (isbn13-check-digit-valid? "978-1734314509")) (check-true (isbn13-check-digit-valid? "978-1788399081")) (check-false (isbn13-check-digit-valid? "978-1788399083")))
arraybase 1 dim isbn = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083", "978-2-74839-908-0", "978-2-74839-908-5", "978 1 86197 876 9"} for n = 1 to isbn[?] sum = 0 isbnStr = isbn[n] isbnStr = replace(isbnStr, "-", "") isbnStr = replace(isbnStr, " ", "") for m = 1 to length(isbnStr) if m mod 2 = 0 then num = 3 * int(mid(isbnStr, m, 1)) else num = int(mid(isbnStr, m, 1)) end if sum += num next m if sum mod 10 = 0 then print isbn[n]; ": good" else print isbn[n]; ": bad" end if next n
Can you help me rewrite this code in VB instead of Racket, keeping it the same logically?
#lang racket/base (define (isbn13-check-digit-valid? s) (zero? (modulo (for/sum ((i (in-naturals)) (d (regexp-replace* #px"[^[:digit:]]" s ""))) (* (- (char->integer d) (char->integer #\0)) (if (even? i) 1 3))) 10))) (module+ test (require rackunit) (check-true (isbn13-check-digit-valid? "978-1734314502")) (check-false (isbn13-check-digit-valid? "978-1734314509")) (check-true (isbn13-check-digit-valid? "978-1788399081")) (check-false (isbn13-check-digit-valid? "978-1788399083")))
arraybase 1 dim isbn = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083", "978-2-74839-908-0", "978-2-74839-908-5", "978 1 86197 876 9"} for n = 1 to isbn[?] sum = 0 isbnStr = isbn[n] isbnStr = replace(isbnStr, "-", "") isbnStr = replace(isbnStr, " ", "") for m = 1 to length(isbnStr) if m mod 2 = 0 then num = 3 * int(mid(isbnStr, m, 1)) else num = int(mid(isbnStr, m, 1)) end if sum += num next m if sum mod 10 = 0 then print isbn[n]; ": good" else print isbn[n]; ": bad" end if next n
Port the provided Racket code into Go while preserving the original functionality.
#lang racket/base (define (isbn13-check-digit-valid? s) (zero? (modulo (for/sum ((i (in-naturals)) (d (regexp-replace* #px"[^[:digit:]]" s ""))) (* (- (char->integer d) (char->integer #\0)) (if (even? i) 1 3))) 10))) (module+ test (require rackunit) (check-true (isbn13-check-digit-valid? "978-1734314502")) (check-false (isbn13-check-digit-valid? "978-1734314509")) (check-true (isbn13-check-digit-valid? "978-1788399081")) (check-false (isbn13-check-digit-valid? "978-1788399083")))
package main import ( "fmt" "strings" "unicode/utf8" ) func checkIsbn13(isbn string) bool { isbn = strings.ReplaceAll(strings.ReplaceAll(isbn, "-", ""), " ", "") le := utf8.RuneCountInString(isbn) if le != 13 { return false } sum := int32(0) for i, c := range isbn { if c < '0' || c > '9' { return false } if i%2 == 0 { sum += c - '0' } else { sum += 3 * (c - '0') } } return sum%10 == 0 } func main() { isbns := []string{"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"} for _, isbn := range isbns { res := "bad" if checkIsbn13(isbn) { res = "good" } fmt.Printf("%s: %s\n", isbn, res) } }
Transform the following Racket implementation into Go, maintaining the same output and logic.
#lang racket/base (define (isbn13-check-digit-valid? s) (zero? (modulo (for/sum ((i (in-naturals)) (d (regexp-replace* #px"[^[:digit:]]" s ""))) (* (- (char->integer d) (char->integer #\0)) (if (even? i) 1 3))) 10))) (module+ test (require rackunit) (check-true (isbn13-check-digit-valid? "978-1734314502")) (check-false (isbn13-check-digit-valid? "978-1734314509")) (check-true (isbn13-check-digit-valid? "978-1788399081")) (check-false (isbn13-check-digit-valid? "978-1788399083")))
package main import ( "fmt" "strings" "unicode/utf8" ) func checkIsbn13(isbn string) bool { isbn = strings.ReplaceAll(strings.ReplaceAll(isbn, "-", ""), " ", "") le := utf8.RuneCountInString(isbn) if le != 13 { return false } sum := int32(0) for i, c := range isbn { if c < '0' || c > '9' { return false } if i%2 == 0 { sum += c - '0' } else { sum += 3 * (c - '0') } } return sum%10 == 0 } func main() { isbns := []string{"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"} for _, isbn := range isbns { res := "bad" if checkIsbn13(isbn) { res = "good" } fmt.Printf("%s: %s\n", isbn, res) } }
Convert this COBOL block to C, preserving its control flow and logic.
****************************************************************** * Author: Jay Moseley * Date: November 10, 2019 * Purpose: Testing various subprograms/ functions. * Tectonics: cobc -xj testSubs.cbl ****************************************************************** IDENTIFICATION DIVISION. PROGRAM-ID. testSubs. ENVIRONMENT DIVISION. CONFIGURATION SECTION. REPOSITORY. FUNCTION ALL INTRINSIC FUNCTION validISBN13. INPUT-OUTPUT SECTION. FILE-CONTROL. DATA DIVISION. FILE SECTION. WORKING-STORAGE SECTION. 01 IX PIC S9(4) COMP. 01 TEST-ISBNS. 02 FILLER PIC X(14) VALUE '978-1734314502'. 02 FILLER PIC X(14) VALUE '978-1734314509'. 02 FILLER PIC X(14) VALUE '978-1788399081'. 02 FILLER PIC X(14) VALUE '978-1788399083'. 01 TEST-ISBN REDEFINES TEST-ISBNS OCCURS 4 TIMES PIC X(14). PROCEDURE DIVISION. MAIN-PROCEDURE. PERFORM VARYING IX FROM 1 BY 1 UNTIL IX > 4 DISPLAY TEST-ISBN (IX) ' ' WITH NO ADVANCING END-DISPLAY IF validISBN13(TEST-ISBN (IX)) = -1 DISPLAY '(bad)' ELSE DISPLAY '(good)' END-IF END-PERFORM. GOBACK. END PROGRAM testSubs. ****************************************************************** * Author: Jay Moseley * Date: May 19, 2016 * Purpose: validate ISBN-13 (International Standard * Book Number). ****************************************************************** IDENTIFICATION DIVISION. FUNCTION-ID. validISBN13. ENVIRONMENT DIVISION. CONFIGURATION SECTION. REPOSITORY. FUNCTION ALL INTRINSIC. INPUT-OUTPUT SECTION. FILE-CONTROL. DATA DIVISION. FILE SECTION. WORKING-STORAGE SECTION. 01 PASSED-SIZE PIC S9(6) COMP-5. 01 IX PIC S9(4) COMP. 01 WORK-FIELDS. 02 WF-DIGIT PIC X. 02 WF-COUNT PIC 9(2). 88 WEIGHT-1 VALUE 1, 3, 5, 7, 9, 11, 13. 88 WEIGHT-3 VALUE 2, 4, 6, 8, 10, 12. 02 WF-SUM PIC S9(8) COMP. LINKAGE SECTION. 01 PASSED-ISBN PIC X ANY LENGTH. 01 RETURN-VALUE PIC S9. PROCEDURE DIVISION USING PASSED-ISBN RETURNING RETURN-VALUE. CALL 'C$PARAMSIZE' USING 1 GIVING PASSED-SIZE END-CALL. COMPUTE-CKDIGIT. INITIALIZE WORK-FIELDS. PERFORM VARYING IX FROM 1 BY 1 UNTIL IX GREATER THAN PASSED-SIZE MOVE PASSED-ISBN (IX:1) TO WF-DIGIT IF WF-DIGIT IS NUMERIC ADD 1 TO WF-COUNT IF WEIGHT-1 ADD NUMVAL(WF-DIGIT) TO WF-SUM ELSE COMPUTE WF-SUM = WF-SUM + (NUMVAL(WF-DIGIT) * 3) END-COMPUTE END-IF END-IF END-PERFORM. IF MOD(WF-SUM, 10) = 0 MOVE +0 TO RETURN-VALUE ELSE MOVE -1 TO RETURN-VALUE END-IF. GOBACK. * - - - - - - - - - - - - - - - - - - - - - - PROGRAM EXIT POINT END FUNCTION validISBN13.
#include <stdio.h> int check_isbn13(const char *isbn) { int ch = *isbn, count = 0, sum = 0; for ( ; ch != 0; ch = *++isbn, ++count) { if (ch == ' ' || ch == '-') { --count; continue; } if (ch < '0' || ch > '9') { return 0; } if (count & 1) { sum += 3 * (ch - '0'); } else { sum += ch - '0'; } } if (count != 13) return 0; return !(sum%10); } int main() { int i; const char* isbns[] = {"978-1734314502", "978-1734314509", "978-1788399081", "978-1788399083"}; for (i = 0; i < 4; ++i) { printf("%s: %s\n", isbns[i], check_isbn13(isbns[i]) ? "good" : "bad"); } return 0; }