|
||||||||||
QSC and MasterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3692 Accepted Submission(s): 1305 Problem Description Every school has some legends, Northeastern University is the same. Enter from the north gate of Northeastern University£¬You are facing the main building of Northeastern University.Ninety-nine percent of the students have not been there£¬It is said that there is a monster in it. QSCI am a curious NEU_ACMer£¬This is the story he told us. It¡¯s a certain period£¬QSCI am in a dark night, secretly sneaked into the East Building£¬hope to see the master.After a serious search£¬He finally saw the little master in a dark corner. The master said£º ¡°You and I, we're interfacing.please solve my little puzzle£¡ There are N pairs of numbers£¬Each pair consists of a key and a value£¬Now you need to move out some of the pairs to get the score.You can move out two continuous pairs£¬if and only if their keys are non coprime(their gcd is not one).The final score you get is the sum of all pair¡¯s value which be moved out. May I ask how many points you can get the most£¿ The answer you give is directly related to your final exam results~The young man~¡± QSC is very sad when he told the story£¬He failed his linear algebra that year because he didn't work out the puzzle. Could you solve this puzzle? £¨Data range£º1<=N<=300 1<=Ai.key<=1,000,000,000 0<Ai.value<=1,000,000,000£© Input First line contains a integer T£¬means there are T(1¡ÜT¡Ü10) test case¡£ Each test case start with one integer N . Next line contains N integers£¬means Ai.key.Next line contains N integers£¬means Ai.value. Output For each test case,output the max score you could get in a line. Sample Input
Sample Output
Source | ||||||||||
|