Start a new Kumite
AllAgda (Beta)BF (Beta)CCFML (Beta)ClojureCOBOL (Beta)CoffeeScriptCommonLisp (Beta)CoqC++CrystalC#D (Beta)DartElixirElm (Beta)Erlang (Beta)Factor (Beta)Forth (Beta)Fortran (Beta)F#GoGroovyHaskellHaxe (Beta)Idris (Beta)JavaJavaScriptJulia (Beta)Kotlinλ Calculus (Beta)LeanLuaNASMNim (Beta)Objective-C (Beta)OCaml (Beta)Pascal (Beta)Perl (Beta)PHPPowerShell (Beta)Prolog (Beta)PureScript (Beta)PythonR (Beta)RacketRaku (Beta)Reason (Beta)RISC-V (Beta)RubyRustScalaShellSolidity (Beta)SQLSwiftTypeScriptVB (Beta)
Show only mine

Kumite (ko͞omiˌtā) is the practice of taking techniques learned from Kata and applying them through the act of freestyle sparring.

You can create a new kumite by providing some initial code and optionally some test cases. From there other warriors can spar with you, by enhancing, refactoring and translating your code. There is no limit to how many warriors you can spar with.

A great use for kumite is to begin an idea for a kata as one. You can collaborate with other code warriors until you have it right, then you can convert it to a kata.

JefeThePugvs.assylzhann17 months ago

Fix the code

Code
Diff
  • from math import prod

def multiply(*ints):
    return prod(ints)

result = multiply(5, 10)
print(result)
    • from math import prod
    • def multiply(a, b):
    • ints = (a, b)
    • def multiply(*ints):
    • return prod(ints)
    • result = multiply(5, 10)
    • print(result)
antenorvs.kJAHsin17 months ago

return test average letter grade

not immediately clear but its an alternative... :-D

Code
Diff
  • function getGrade (s1, s2, s3) { 
  const pos = (function rank(avg, grade, i) {
    if (avg / grade > 1 || i > 4) return i
    
    return rank(avg, grade-10, ++i)
  })((s1+s2+s3)/3, 90, 0)
  
  return String.fromCharCode(65 + pos)
}
    • function getGrade (s1, s2, s3) {
    • let avg = (s1 + s2 + s3) / 3;
    • if (avg >= 90) {
    • return "A"
    • }
    • else if (avg >= 80) {
    • return "B"
    • }
    • else if (avg >= 70) {
    • return "C"
    • }
    • else if (avg >= 60) {
    • return "D"
    • }
    • else {return "F"}
    • function getGrade (s1, s2, s3) {
    • const pos = (function rank(avg, grade, i) {
    • if (avg / grade > 1 || i > 4) return i
    • return rank(avg, grade-10, ++i)
    • })((s1+s2+s3)/3, 90, 0)
    • return String.fromCharCode(65 + pos)
    • }
leoot2000vs.Insisted17 months ago

Grade Calculator - Convert Grade to letter

Code
Diff
  • def grade_calc(grade):
    grade_range = {"F": range(0, 60), "D": range(60, 70), "C": range(70, 80), "B": range(80, 90), "A": range(90, 101)}
    
    grade_finder = [key for key in grade_range.keys() if int(grade) in grade_range[key] and grade >= 0 and grade <= 100]
    
    return grade_finder[0] if grade_finder else "Not a grade"
    • #grade_calc = lambda s: 'FDCBAA'[max(5, int(s//10)) - 5] if 0 <= s <= 100 else 'Not a grade'
    • grade_calc = lambda s: 'FFFFFFDCBAA'[int(s//10)] if 0 <= s <= 100 else 'Not a grade'
    • def grade_calc(grade):
    • grade_range = {"F": range(0, 60), "D": range(60, 70), "C": range(70, 80), "B": range(80, 90), "A": range(90, 101)}
    • grade_finder = [key for key in grade_range.keys() if int(grade) in grade_range[key] and grade >= 0 and grade <= 100]
    • return grade_finder[0] if grade_finder else "Not a grade"
aleksa196vs.an1712 years ago

Зрительный зал

Трубанов

Code
Diff
  • const cinema_auditorium = (spisok2D, ryad) => {
  if (ryad < 0 || ryad >= spisok2D.length) {
    console.log('Нет такого ряда.');
    return 0;
  }

  const Tickets = spisok2D[ryad];
  const soldTickets = Tickets.reduce((sum, ticket) => sum + ticket, 0);

  console.log(`Продано билетов в ряду ${ryad + 1}: ${soldTickets}`);
  return soldTickets;
};
    • const cinema_auditorium = (spisok2D,ryad)=> {
    • console.log(spisok2D,ryad)
    • return 3
    • }
    • const cinema_auditorium = (spisok2D, ryad) => {
    • if (ryad < 0 || ryad >= spisok2D.length) {
    • console.log('Нет такого ряда.');
    • return 0;
    • }
    • const Tickets = spisok2D[ryad];
    • const soldTickets = Tickets.reduce((sum, ticket) => sum + ticket, 0);
    • console.log(`Продано билетов в ряду ${ryad + 1}: ${soldTickets}`);
    • return soldTickets;
    • };
D4Khanvs.an1712 years ago

Табулирование функции

Code
Diff
  • const tab = (f, a, b, h) => {
  let sum = 0;
  for (let x = a; x <= b; x += h){
    sum += f(x);
  }
  return sum;
 
}
    • const tab = (f, a, b, h) => {
    • let sum = 0;
    • for (let x = a; x <= b; x += h){
    • sum += f(x);
    • }
    • return sum;
    • }
aleksa196vs.an1712 years ago

Сумма нечетных

Трубанов

Code
Diff
  • function нечетное(x) {
  return x % 2 !== 0;
}

function sumNechet(a, b) {
  let сумма = 0;

  for (let число = a; число <= b; число++) {
    if (нечетное(число)) {
      сумма += число;
    }
  }

  return сумма;
}
    • function sumNechet(a, b) {
    • function нечетное(x) {
    • return x % 2 !== 0;
    • }
    • function нечетное(число) {
    • }
    • function sumNechet(a, b) {
    • let сумма = 0;
    • for (let число = a; число <= b; число++) {
    • if (нечетное(число)) {
    • сумма += число;
    • }
    • }
    • return сумма;
    • }
Pinnaclevs.Cilok2 years ago

Hello world

Code
Diff
  • hello_world=lambda i:['Goodbye','Hello'][i]+', World'
    • def hello_world(world):
    • return "Hello, World" if world == True else "Goodbye, World"
    • hello_world=lambda i:['Goodbye','Hello'][i]+', World'
Aprogrammer55vs.pablo.fs2 years ago

The "Small" Password Game

Puzzles

i know that count as a cheat

Code
Diff
  • import java.time.LocalDate;
import java.time.format.DateTimeFormatter;
import java.util.*;
public class PasswordValidation { 
    private static final String TODAY_DATE = LocalDate.now().format(DateTimeFormatter.ofPattern("yyyyMMdd"));
	  private static final String[] VALID_MONTHS = { "jan", "feb", "mar", "apr", "may", "jun", "jul", "aug", "sep", "oct",
			"nov", "dec" };
  public static boolean validatePassword(String password) { 
    if (password.length() < 20 | password.length() > 50)
			return false;
		if (!isPrime(password.length()))
			return false;
		if (!password.contains(String.valueOf(password.length())))
			return false;
		if (!password.contains(TODAY_DATE))
			return false;
		if (!Arrays.stream(VALID_MONTHS).anyMatch(s -> password.toLowerCase().contains(s)))
			return false;
		if (!password.matches(("(.*[A-Z].*){3,}"))
        || !password.matches("(.*[a-z].*){1,}")
				|| !password.matches("(.*[-._@#$&].*){1,}")
				|| password.matches(".*[-._@#$&][-._@#$&].*"))
			return false;
		if (Arrays.stream(password.split("")).filter(s -> s.matches("[0-9]")).mapToInt(s -> Integer.valueOf(s)).sum() < 25)
			return false;
		return true;
  }
  public static boolean isPrime(int n) {
		for (int i = 2; i <= Math.sqrt(n); i++)
			if (n % i == 0)
				return false;
		return true;
	}
}
    • import java.time.LocalDate;
    • import java.time.format.DateTimeFormatter;
    • import java.util.Arrays;
    • public class PasswordValidation {
    • import java.util.*;
    • public class PasswordValidation {
    • private static final String TODAY_DATE = LocalDate.now().format(DateTimeFormatter.ofPattern("yyyyMMdd"));
    • private static final String[] VALID_MONTHS = { "jan", "feb", "mar", "apr", "may", "jun", "jul", "aug", "sep", "oct",
    • "nov", "dec" };
    • public static boolean validatePassword(String password) {
    • if (password.length() < 20 | password.length() > 50)
    • return false;
    • if (!isPrime(password.length()))
    • return false;
    • if (!password.contains(String.valueOf(password.length())))
    • return false;
    • if (!password.contains(TODAY_DATE))
    • return false;
    • if (!Arrays.stream(VALID_MONTHS).anyMatch(s -> password.toLowerCase().contains(s)))
    • return false;
    • if (!password.matches(("(.*[A-Z].*){3,}"))
    • || !password.matches("(.*[a-z].*){1,}")
    • || !password.matches("(.*[-._@#$&].*){1,}")
    • || password.matches(".*[-._@#$&][-._@#$&].*"))
    • return false;
    • if (Arrays.stream(password.split("")).filter(s -> s.matches("[0-9]")).mapToInt(s -> Integer.valueOf(s)).sum() < 25)
    • return false;
    • return true;
    • }
    • public static boolean isPrime(int n) {
    • for (int i = 2; i <= Math.sqrt(n); i++) {
    • for (int i = 2; i <= Math.sqrt(n); i++)
    • if (n % i == 0)
    • return false;
    • }
    • return true;
    • }
    • }