AMR15B how to solve this question ??
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3856 |
| 2 | jiangly | 3747 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3591 |
| 6 | gamegame | 3477 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3462 |
| 9 | ecnerwala | 3451 |
| 10 | heuristica | 3431 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | -is-this-fft- | 162 |
| 3 | Dominater069 | 160 |
| 4 | Um_nik | 158 |
| 5 | atcoder_official | 157 |
| 6 | Qingyu | 156 |
| 7 | adamant | 151 |
| 7 | djm03178 | 151 |
| 7 | luogu_official | 151 |
| 10 | awoo | 146 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Feb/23/2025 22:46:40 (j2).
Desktop version, switch to mobile version.
Supported by
A simpler problem: Given an array of integers, find sum of minimum elements of each subset.
Solution: Sort the array so that A[0]<=A[1]<=...<=A[n-1]. Answer= sum 2^(n-i+1)*A[i].
From now on by f(A) we will denote this value for an array.
Prime factorize each number and for each prime p<=10^5 store a list where for each a[i] which is a multiple of p the power of p in a[i] is stored in the list. Let M[p] be this list p.
Answer= product pf(M[p]) over all primes from 1 to 10^5
f(M[p]) can get quite large so it's advisable to compute it modulo 10^9+6 (because x109 + 6 = 1 mod 10^9+7.
.