### Task

Your main goal is to find two numbers(` >= 0 `), greatest common divisor of wich will be `divisor` and number of iterations, taken by Euclids algorithm will be `iterations`.

### Euclid's GCD

```CSharp
BigInteger FindGCD(BigInteger a, BigInteger b) {
  // Swaping `a` and `b`
  if (a < b) {
    a += b;
    b = a - b;
    a = a - b;
  }
  
  while (b > 0) {
    // Iteration of calculation
    BigInteger c = a % b;
    a = b;
    b = c;
  }
  
  // `a` - is greates common divisor now
  return a;
}
```

### Restrictions

Your program should work with numbers

`0 < divisor < 1000`

`0 <= iterations <= 50'000`

Source: codewars | Difficulty: EASY

Starter code: def find_initial_numbers (divisor, iterations):
	

Solutions:
def find_initial_numbers(divisor, iterations):
	a = divisor
	b = divisor if iterations != 0 else 0
	for _ in range(iterations):
		c = b
		b = a
		a = b + c
	return (a, b)


def find_initial_numbers(divisor, iterations):
	(a, b) = (divisor, 0)
	for i_iter in range(iterations):
		(a, b) = (a * (divisor + 1) + b, a)
	return [a, b]


def find_initial_numbers(divisor, iterations):
	if iterations == 0:
		return (divisor, 0)
	a = divisor
	b = 0
	for _ in range(iterations + 1):
		(a, b) = (a + b, a)
	return (a, b)


def find_initial_numbers(divisor, iterations):
	(a, b) = (5 * divisor, divisor)
	for i in range(1, iterations):
		(a, b) = (5 * a + b, a)
	return (a, b) if iterations else (divisor, iterations)