xeonqq

## codility_NumberSolitaire.py
# you can use print for debugging purposes, e.g.
# print "this is a debug message"

def solution(A):
    n = len(A)
    MIN_INT = -n * 20000
    v = [A[0]]+(n-1)*[MIN_INT]
    for i in xrange(1, n):
        for j in xrange(1, 7):
            if j <= i:

## Codility_MinMaxDivision.py
def blockPossible(A, bound, K):
    s = A[0]
    blocks = 1;
    for a in A[1:]:
        s += a
        if s>bound:
            blocks+=1
            s=a
        if blocks > K:
            return False

## logistic_regression.ipynb

      
        
          
            
              
              1 file
            
          
          
            
              
              0 forks
            
          
          
            
              
              0 comments
            
          
          
            
              
              0 stars
            
          
        
        
          
              
          
          
            
                xeonqq
                / logistic_regression.ipynb
            
            
              Created
              August 4, 2015 13:24
            
          
        
      
        
  
    
    

          
    
      
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
	# you can use print for debugging purposes, e.g.
	# print "this is a debug message"

	def solution(A):
	n = len(A)
	MIN_INT = -n * 20000
	v = [A[0]]+(n-1)*[MIN_INT]
	for i in xrange(1, n):
	for j in xrange(1, 7):
	if j <= i:
	def blockPossible(A, bound, K):
	s = A[0]
	blocks = 1;
	for a in A[1:]:
	s += a
	if s>bound:
	blocks+=1
	s=a
	if blocks > K:
	return False