Buggy python submission (verdict: Runtime Error):
def isprime_euclid2(N):
    if N<1:
        print 'N>2'
    elif N==2:
        return True
        
    import math
    def euclid(m,n):
        while m%n>0:
            r=m%n
            m,n=n,r
        else:
            return n
        
    euclid_list=[]
    for k in range(1,int(round(math.sqrt(N)))+1):
        euclid_list.append(euclid(N,k))
    temp=set(euclid_list)
    if len(temp)==1:
        return True
    else:
        return False     

while True:
    n = int(raw_input())
    total = 0
    for k in range(n):
        if isprime_euclid2(int(raw_input())):
            total +=1
    print total

Fixed submission:
import math
def is_prime(n):
    if n % 2 == 0 and n > 2: 
        return False
    return all(n % i for i in range(3, int(math.sqrt(n)) + 1, 2))
                      
while True:
    try:
        n = int(raw_input())
        total = 0
        for k in range(n):
            if is_prime(int(raw_input())):
                total +=1
        print total
    except EOFError:
        break

Buggy python submission (verdict: Runtime Error):
def isprime_euclid2(N):
    if N<1:
        print 'N>2'
    elif N==2:
        return True
        
    
    def euclid(m,n):
        while m%n>0:
            r=m%n
            m,n=n,r
        else:
            return n
        
    euclid_list=[]
    for k in range(1,int(round(math.sqrt(N)))+1):
        euclid_list.append(euclid(N,k))
    temp=set(euclid_list)
    if len(temp)==1:
        return True
    else:
        return False  
           
import math
while True:
    n = int(raw_input())
    total = 0
    for k in range(n):
        if isprime_euclid2(int(raw_input())):
            total +=1
    print total
        

Fixed submission:
import math
def is_prime(n):
    if n % 2 == 0 and n > 2: 
        return False
    return all(n % i for i in range(3, int(math.sqrt(n)) + 1, 2))
                      
while True:
    try:
        n = int(raw_input())
        total = 0
        for k in range(n):
            if is_prime(int(raw_input())):
                total +=1
        print total
    except EOFError:
        break

Buggy python submission (verdict: Runtime Error):
def euclid(m,n):
    while m%n>0:
        m,n=n,m%n
    else:
        return n

def isprime_euclid2(N):
    if N<1:
        print 'N>2'
    elif N==2:
        return True
        
    euclid_list=[]
    for k in range(1,int(round(math.sqrt(N)))+1):
        euclid_list.append(euclid(N,k))
    temp=set(euclid_list)
    if len(temp)==1:
        return True
    else:
        return False  
           
import math
while True:
    n = int(raw_input())
    total = 0
    for k in range(n):
        if isprime_euclid2(int(raw_input())):
            total +=1
    print total
        

Fixed submission:
import math
def is_prime(n):
    if n % 2 == 0 and n > 2: 
        return False
    return all(n % i for i in range(3, int(math.sqrt(n)) + 1, 2))
                      
while True:
    try:
        n = int(raw_input())
        total = 0
        for k in range(n):
            if is_prime(int(raw_input())):
                total +=1
        print total
    except EOFError:
        break

Buggy python submission (verdict: Time Limit Exceeded):
def euclid(m,n):
    while m%n>0:
        m,n=n,m%n
    else:
        return n

def isprime_euclid2(N):
    if N<1:
        print 'N>2'
    elif N==2:
        return True
        
    euclid_list=[]
    for k in range(1,int(round(math.sqrt(N)))+1):
        euclid_list.append(euclid(N,k))
    temp=set(euclid_list)
    if len(temp)==1:
        return True
    else:
        return False  
           
import math
while True:
    try:
        n = int(raw_input())
        total = 0
        for k in range(n):
            if isprime_euclid2(int(raw_input())):
                total +=1
        print total
    except EOFError:
        break    

Fixed submission:
import math
def is_prime(n):
    if n % 2 == 0 and n > 2: 
        return False
    return all(n % i for i in range(3, int(math.sqrt(n)) + 1, 2))
                      
while True:
    try:
        n = int(raw_input())
        total = 0
        for k in range(n):
            if is_prime(int(raw_input())):
                total +=1
        print total
    except EOFError:
        break

Buggy python submission (verdict: Time Limit Exceeded):
def euclid(m,n):
    while m%n>0:
        m,n=n,m%n
    else:
        return n

def isprime_euclid2(N):
    if N<1:
        print 'N>2'
    elif N==2:
        return True
        
    euclid_list=[]
    for k in range(1,int(round(math.sqrt(N)))+1):
        euclid_list.append(euclid(N,k))
    temp=set(euclid_list)
    if len(temp)==1:
        return True
    else:
        return False  
           
import math
while True:
    try:
        n = int(raw_input())
        total = 0
        for k in range(n):
            if isprime_euclid2(int(raw_input())):
                total +=1
        print total
    except EOFError:
        break    

Fixed submission:
import math
def is_prime(n):
    if n % 2 == 0 and n > 2: 
        return False
    return all(n % i for i in range(3, int(math.sqrt(n)) + 1, 2))
                      
while True:
    try:
        n = int(raw_input())
        total = 0
        for k in range(n):
            if is_prime(int(raw_input())):
                total +=1
        print total
    except EOFError:
        break