ef mul(s,t): // Multiplies two polynomials
	u = []
	p = len(s)
	q = len(t)
	for i in range(p+q-1):
		a = 0
		for j in range(i+1):
			if j < p:
				if (i-j) < q:
					a = a+s[j]*t[i-j]
		u.append(a)
	return u


def nmul(s): //Product of polynomials from s
	a = s[0]
	if len(s) == 1:
		return a
	else:
		for i in range(1, len(s)):
			a = mul(a, s[i])
	return a


def bincho(b, s): //Ignore it
	t = []
	for i in range(len(s)):
		if b[i] == "1":
			t.append(s[i])
	return t

def er(a): //Distance from nearest integer

  public static boolean allPlural(String[] words) {
    for (String s : words) {
      if (s.isEmpty()) {
        return false;
      }
      switch (s.charAt(s.length() - 1)) {
        case 's':
        case 'S':
          continue;
      }
      return false;
    }
    return true;
  }

def allPlural(n):
    return all(i[-1:].lower() == "s" for i in n)

def allPlural(n):
    return all(i and i[-1].lower() == "s" for i in n)

boolean allPlural(ArrayList<String> words) {
    return words.stream().allMatch(i -> i.matches("[sS]$"));
}

IEnumerable<int> numbers = Enumerable.Range(0, 10);
var evens = from num in numbers where num % 2 == 0 select num;

ArrayList evens = new ArrayList();
ArrayList numbers = Range(10);
int size = numbers.Count;
int i = 0;

while (i < size)
{
    if (i % 2 == 0)
    {
        evens.Add(i);
    }
    i++;
}

IEnumerable<int> Infinity() {
    for (var i = 0;; i++) {
        yield return i;
    }
}

Northwnd db = new Northwnd(@"c:\northwnd.mdf");

// Query for customers in London.
IQueryable<Customer> custQuery =
    from cust in db.Customers
    where cust.City == "London"
    select cust;

def vp(a, p):
	i = 0
	while (a % p) == 0:
		i = i +1
		a = int(a/p)
	return i