| Submit | All submissions | Best solutions | Back to list |
EIUGCD - Greatest Common Divisor |
Given two integers a and b. Find the greatest common divisor of a and b.
Input
The input begins with the number t of test cases in a single line (t<=10).
Each of next t lines contains a testcase which give two integers a and b.
Output
For each testcase, print the result in a single line.
Example
Input: 2
5 7
4 6 Output: 1
2
| Added by: | Ha Minh Ngoc |
| Date: | 2014-12-07 |
| Time limit: | 0.5s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | CSHARP C++ 4.3.2 CPP CPP14 CPP14-CLANG FSHARP GO JAVA JS-MONKEY NODEJS PHP PYTHON PYPY PYPY3 PYTHON3 RUBY SQLITE SWIFT VB.NET |
RSS