摘要：
Gcd Description 给定整数N，求1<=x,y<=N且Gcd(x,y)为素数的数对(x,y)有多少对. 给定整数N，求1<=x,y<=N且Gcd(x,y)为素数的数对(x,y)有多少对. Input 一个整数N 一个整数N Output 如题 如题 Sample Input 4 Samp 阅读全文
摘要：
The Doors Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 8819 Accepted: 3395 Description You are to find the length of the shortest path t 阅读全文