← 返回题目

题库练习 Geometric Progressions

← 上一题下一题 →

A10044 | $Geometric Progressions$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Geometric progression with the first element $a$ and common ratio $b$ is a sequence of numbers $a,ab,ab^{2},ab^{3},...$ . You are given $n$ integer geometric progressions. Your task is to find the smallest integer $x$ , that is the element of all the given progressions, or else state that such integer does not exist.

输入格式

The first line contains integer ( $1<=n<=100$ ) — the number of geometric progressions. Next $n$ lines contain pairs of integers $a,b$ ( $1<=a,b<=10^{9}$ ), that are the first element and the common ratio of the corresponding geometric progression.

输出格式

If the intersection of all progressions is empty, then print $-1$ , otherwise print the remainder of the minimal positive integer number belonging to all progressions modulo $1000000007$ ( $10^{9}+7$ ).

输入输出样例

输入 #1

2
2 2
4 1

输出 #1

输入 #2

2
2 2
3 3

输出 #2

-1

C++ 编辑器

输入

输出