Balls Rearrangement

Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 344 Accepted Submission(s): 165

Problem Description

Bob has N balls and A boxes. He numbers the balls from 0 to N-1, and numbers the boxes from 0 to A-1. To find the balls easily, he puts the ball numbered x into the box numbered a if x = a mod A.

Some day Bob buys B new boxes, and he wants to rearrange the balls from the old boxes to the new boxes. The new boxes are numbered from 0 to B-1. After the rearrangement, the ball numbered x should be in the box number b if x = b mod B.

This work may be very boring, so he wants to know the cost before the rearrangement. If he moves a ball from the old box numbered a to the new box numbered b, the cost he considered would be |a-b|. The total cost is the sum of the cost to move every ball, and it is what Bob is interested in now.

Input

The first line of the input is an integer T, the number of test cases.(0<T<=50)

Then T test case followed. The only line of each test case are three integers N, A and B.(1<=N<=1000000000, 1<=A,B<=100000).

Output

For each test case, output the total cost.

Sample Input

      3 1000000000 1 1 8 2 4 11 5 3 

Sample Output

      0 8 16 

Source

/*分析：对于i%a - i%b,每次加上从i开始和这个值(i%a - i%b)相等的一段,这样i就不是每次+1,而是每次加上一段,如果碰到n大于a,b的最小公倍数，则只需要计算a,b最小公倍数长度的总和，然后sum*=n/per + p;//p表示前i个数,p=n%per;本题反思:刚开始自己就是这样想，但是想到a,b的最小公倍数可能很大,而且n也很大，如果刚好碰到n
     
      per但是per很大 即使一段段的算也可能超时，所以一直不敢下手，一直在找寻更简单的推论。。结果一直没找到下次碰到这种情况应该先试试，不能找不出别的更简单的方法就连自己想到的方法都不试试现在认真分析发现时间复杂度好像是:O((a/b * min(per,n)/a));//假设a>=b */#include
      
       #include
       
        #include
        
         #include
         
          #include
          
           #include
           
            #include
            
             #include
             #include
              
               #include
               
                #include
                
                 #define INF 99999999using namespace std;const int MAX=10;__int64 p;__int64 Gcd(__int64 a,__int64 b){ if(b == 0)return a; return Gcd(b,a%b);}__int64 calculate(__int64 n,__int64 a,__int64 b,__int64 num){ p=0; __int64 la=a,lb=b,sum=0,l; for(__int64 i=0;i
                 
                  num && i
                  
                   per)sum=(n/per)*sum+p;//p表示前n%k个i%a-i%b的和 printf("%I64d\n",sum); } return 0;}

转载地址：http://nwhal.baihongyu.com/

你可能感兴趣的文章

领域驱动设计（DDD）的实践经验分享之持久化透明