GooMaple

一个元素一个元素往后判断，注意inputon和inputone等特殊情况的判断。 用逆序判断会更加简单 。 代码如下： #include #include #include #include #include using namespace std; char a[10000002]; int solve() { int len = strlen(a), flag = 0

GCD & LCM Time Limit: 2 Seconds      Memory Limit: 65536 KB Given x and y (2 1) p and q are positive integers; 2) GCD(p, q) = x; 3) LCM(p, q) = y. Input x and y, one line for each test.

A. Statues time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output In this task Anna and Maria play a game with a v