Lost Arithmetic Progression Solution | Codeforces Problem Solution 2022

Lost Arithmetic Progression Solution | Codeforces Problem Solution 2022

D. Lost Arithmetic Progression

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Long ago, you thought of two finite arithmetic progressions 𝐴$A$ and 𝐵$B$. Then you found out another sequence 𝐶$C$ containing all elements common to both 𝐴$A$ and 𝐵$B$. It is not hard to see that 𝐶$C$ is also a finite arithmetic progression. After many years, you forgot what 𝐴$A$ was but remember 𝐵$B$ and 𝐶$C$. You are, for some reason, determined to find this lost arithmetic progression. Before you begin this eternal search, you want to know how many different finite arithmetic progressions exist which can be your lost progression 𝐴$A$.

Two arithmetic progressions are considered different if they differ in their first term, common difference or number of terms.

Solution Click Below:- CLICK HERE

It may be possible that there are infinitely many such progressions, in which case you won't even try to look for them! Print −1$-1$ in all such cases.

Even if there are finite number of them, the answer might be very large. So, you are only interested to find the answer modulo 109+7${10}^9+7$.

Lost Arithmetic Progression Solution | Codeforces Problem Solution 2022

Power or XOR? Solution | Codeforces Problem Solution 2022 

Anti-Theft Road Planning Solution | Codeforces Problem Solution 2022 

A Perfectly Balanced String? Solution | Codeforces Problem Solution 2022 

Palindrome Basis Solution | Codeforces Problem Solution 2022 

Subtle Substring Subtraction Solution | Codeforces Problem Solution 2022 

Input

The first line of input contains a single integer 𝑡$t$ (1≤𝑡≤100$1\le t\le 100$) denoting the number of testcases.

The first line of each testcase contains three integers 𝑏$b$, 𝑞$q$ and 𝑦$y$ (−109≤𝑏≤109$-{10}^9\le b\le {10}^9$, 1≤𝑞≤109$1\le q\le {10}^9$, 2≤𝑦≤109$2\le y\le {10}^9$) denoting the first term, common difference and number of terms of 𝐵$B$ respectively.

The second line of each testcase contains three integers 𝑐$c$, 𝑟$r$ and 𝑧$z$ (−109≤𝑐≤109$-{10}^9\le c\le {10}^9$, 1≤𝑟≤109$1\le r\le {10}^9$, 2≤𝑧≤109$2\le z\le {10}^9$) denoting the first term, common difference and number of terms of 𝐶$C$ respectively.

Output

For each testcase, print a single line containing a single integer.

If there are infinitely many finite arithmetic progressions which could be your lost progression 𝐴$A$, print −1$-1$.

Otherwise, print the number of finite arithmetic progressions which could be your lost progression 𝐴$A$ modulo 109+7${10}^9+7$. In particular, if there are no such finite arithmetic progressions, print 0$0$.

Join Now for Solution:-