Begin a new Kumite
Search
About
  • Filter by Language:

  • 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.

FiaDootFailed Tests

Find Screen Resolution

You need return the screen size on request
Find resolution can here:
[image]:https://upload.wikimedia.org/wikipedia/commons/thumb/0/0c/Vector_Video_Standards8.svg/1280px-Vector_Video_Standards8.svg.png

public string PrimitiveFlow(string s)
{
//Code here :3

return "";
}
ludumludere-altusscholadiscipulusvs.dan323

List of divisors of number

Code
Diff
  • def divisors(number):
    dividers = []
    for i in range(1,number+1):
        if(number % i == 0):
            dividers.append(i)
    return dividers
  • 1−
    module Divisors where
    2−
    3−
    divisors :: Integer -> [Integer]

    4−
    divisors n = 1:n:(divisorsAux 2)

    5−
      where

    6−
        divisorsAux k

    7−
          | (fromIntegral k) > sqrt (fromIntegral n) = []

    8−
          | otherwise  = if n `mod` k == 0

    9−
                         then if n`div`k ==k

    10−
                              then k:(divisorsAux (k+1))

    11−
                              else k:(n`div`k):(divisorsAux (k+1))

    12−
                         else divisorsAux (k+1)

    1+
    def divisors(number):

    2+
        dividers = []

    3+
        for i in range(1,number+1):

    4+
            if(number % i == 0):

    5+
                dividers.append(i)

    6+
        return dividers

Recent Moves:
khanxivs.supercatex
Find the maximum number
Code
Diff
  • def find_max(arr):
    return max(arr)
  • 11 
    def find_max(arr):

    2−
        return 0

    2+
        return max(arr)

Recent Moves:
mstp-cgFailed Tests
SudukoDLX
puzzle =   {0 : [0,0,0,0,0,0,0,0,0],
            1 : [0,3,0,0,0,0,1,6,0],
            2 : [0,6,7,0,3,5,0,0,4],
            3 : [6,0,8,1,2,0,9,0,0],
            4 : [0,9,0,0,8,0,0,3,0],
            5 : [0,0,2,0,7,9,8,0,6],
            6 : [8,0,0,6,9,0,3,5,0],
            7 : [0,2,6,0,0,0,0,9,0],
            8 : [0,0,0,0,0,0,0,0,0]
        }

def makeGrid(puzzle):
    for a in list(range(1,10)):
        #print('Checking for: {}'.format(a))
        grid = []
        # Set block list
        blockList = []
        for x in puzzle:
            row = []
            y = 0
            for n in puzzle[x]:
                if n == a:
                    row.append(0)
                    blockList.append([x,y])
                elif n != 0:
                    row.append(1)
                else:
                    row.append(0)
                y += 1
            grid.append(row)
        # Block using standard logic
        for b in blockList:
            grid = blockGrid(b, grid)
        # Block using simplified dancing links (algorithm X) for fun
        blockDLX(grid, a)
        solveRow(grid, a)
        solveColumn(grid, a)

def blockGrid(b, grid):
    # Block row
    x = b[0]
    y = 0
    for n in grid[x]:
        grid[x][y] = 1
        y += 1
    # Block column
    x = 0
    y = b[1]
    for row in grid:
        grid[x][y] = 1
        x += 1
    # Block square
    x = b[0]
    y = b[1]
    rowRange = [0,3,6]
    columnRange = [0,3,6]
    for a in rowRange:
        if x >= a and x < a + 3:
            for b in columnRange:
                if y >= b and y < b + 3:
                    i = 0
                    while i < 3:
                        j = 0
                        while j < 3:
                            grid[a + i][b + j] = 1
                            j += 1
                        i += 1
    return(grid)

def blockDLX(grid, a):
    # Reduce rows
    x = 0
    subGrid = {}
    for row in grid:
        if row.count(0) != 0:
            subGrid[x] = row
        x += 1
    # Reduce columns
    for x in subGrid:
        y = 0
        solvedCount = 0
        checkColumns = []
        blockColumn = []
        for n in subGrid[x]:
            if n == 1:
                check = 0
                for row in subGrid:
                    if subGrid[row][y] == 1:
                        check += 1
                if check != len(subGrid):
                    checkColumns.append(y)
                else:
                    solvedCount += 1
            else:
                blockColumn.append(y)
            y += 1
        # Check columns
        if len(checkColumns) > 0:
            blockRow = []
            for z in subGrid:
                match = 'y'
                for column in checkColumns:
                    if subGrid[z][column] == 0:
                        match = 'n'
                if match == 'y':
                    blockRow.append(z)
            if len(blockRow) == subGrid[x].count(0) and len(blockRow) != (len(subGrid[x]) - solvedCount):
                for column in blockColumn:
                    x = 0
                    for row in grid:
                        if x not in blockRow:
                            grid[x][column] = 1
                        x += 1

def solveRow(grid, a):
    x = 0
    for row in grid:
        if row.count(0) == 1:
            y = 0
            for n in grid[x]:
                if n == 0:
                    #print('Match found x:{} y:{}'.format(x, y))
                    puzzle[x][y] = a
                y += 1
        x += 1

def solveColumn(grid, a):
    y = 0
    while y < 9:
        column = []
        for row in grid:
            column.append(row[y])
        if column.count(0) == 1:
            x = 0
            for n in column:
                if n == 0:
                    #print('Match found x:{} y:{}'.format(x, y))
                    puzzle[x][y] = a
                x += 1
        y += 1

while any(0 in puzzle[row] for row in puzzle):
    makeGrid(puzzle)
print('\n\nSolved:')
for x in puzzle:
    print(puzzle[x])
rowcasedvs.TonyY
Check Even Number
Code
Diff
  • isEven=x=>!(x%2)
  • 1−
    function isEven(input) {

    2−
      return input%2===0;

    3−
    }

    1+
    isEven=x=>!(x%2)

zhouh23vs.TonyY
Remove Conitnuously Duplicated Numbers
Code
Diff
  • function kumite(arr) {
    var copy = [...arr];
    for(var i=0; i<copy.length-1; i++){
        if(copy[i] == copy[i+1]){
            for(var j=i+1; copy[j] == copy[i]; j++);
            copy.splice(i, j-i);
            i--;
        }
    }
    return copy;
}
  • 11 
    function kumite(arr) {

    2−
      return [];

    2+
        var copy = [...arr];

    3+
        for(var i=0; i<copy.length-1; i++){

    4+
            if(copy[i] == copy[i+1]){

    5+
                for(var j=i+1; copy[j] == copy[i]; j++);

    6+
                copy.splice(i, j-i);

    7+
                i--;

    8+
            }

    9+
        }

    10+
        return copy;

    33 
    }

Recent Moves: