F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

QSC and Master

Time 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
3 3 1 2 3 1 1 1 3 1 2 4 1 1 1 4 1 3 4 3 1 1 1 1
 

Sample Output
0 2 0
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-21 18:20:28, Gzip enabled