_ostreamBaba

青蛙的约会 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 108204 Accepted: 21663 Description 两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前忘记了一件很重要的事情，

C Looooops Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 24296 Accepted: 6765 DescriptionA Compiler Mystery: We are given a C-language style for loop of type for (variable = A

Biorhythms Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 130935 Accepted: 41750 DescriptionSome people believe that there are three cycles in a person's life that start the day

Lowest Common Multiple Plus Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 53067 Accepted Submission(s): 21990 Problem Description 求n个数的最小公倍

给出N个固定集合{1，N},{2,N-1},{3,N-2},...,{N-1,2},{N,1}.求出有多少个集合满足：第一个元素是A的倍数且第二个元素是B的倍数。 提示： 对于第二组测试数据，集合分别是：{1,10},{2,9},{3,8},{4,7},{5,6},{6,5},{7,4},{8,3},{9,2},{10,1}.满足条件的是第2个和第8个。Input 第1行：1个整数T（1<=T<=5