#t297. 两倍
两倍
Twice
Problem Background
Special for beginners, ^_^
Problem Description
Given between and positive integers, your task is to count how many pairs of numbers satisfy: one number in the pair is twice the other.
For example, given 1 4 3 2 9 7 18 22, the answer is , because is twice , is twice , and is twice .
Input Format
One line giving between and positive integers less than . The input ends with a .
Output Format
One integer: the number of pairs in which one number is twice the other.
Sample Input
1 4 3 2 9 7 18 22 0
Sample Output
3
Constraints
Time limit: 1s, memory limit: 1024KiB for each test case.