Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

kien_coi_1997's blog

How to solve this hard problem about set?
By kien_coi_1997, 12 years ago, In English

There is n integer elements. Choose k elements then calculate their GCD, call result X.

What is maximal value of X?

k<=n<=3000, k<=100, elements in range 1..10^10.

Example:

3 2
120
36
100

Sample output

20
Tags set
  • Vote: I like it
  • +43
  • Vote: I do not like it

»
12 years ago, hide # |
← Rev. 3  
Vote: I like it +30 Vote: I do not like it

These constraints are in a very gray area, it really depends on the time limit. So depending on the limit you may or may not be able to:

Factor each number: Sieve of Eratosthenes + 3000 * (primes below 10 ^ 5) = 3000 * 10000; Generate divisors of each number in O(divisor_count). Divisor_count is at most 2300. Keep a frequency table for the divisors and just select the biggest one that's over k.

Just a first thought. It's a fragile solution, but it may very well work. Again, the constraints are too fuzzy. Will look for something cleaner and smarter though :).

→ Reply
  • »
    »
    12 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    If I correctly understood your solution it wouldn't work because the gcd can be a composite number instead of a prime.

    → Reply
    • »
      »
      »
      12 years ago, hide # ^ |
       
      Vote: I like it +11 Vote: I do not like it

      I take in account all divisors, composite or not. The factoring into primes part is only so you can generate the divisors of a number quickly, instead of trying each number up to 10 ^ 5.

      → Reply
  • »
    »
    12 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    Thank you, I understood.

    → Reply
»
12 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

ez

→ Reply