AMR15B how to solve this question ??
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3898 |
| 2 | tourist | 3840 |
| 3 | orzdevinwang | 3706 |
| 4 | ksun48 | 3691 |
| 5 | jqdai0815 | 3682 |
| 6 | ecnerwala | 3525 |
| 7 | gamegame | 3477 |
| 8 | Benq | 3468 |
| 9 | Ormlis | 3381 |
| 10 | maroonrk | 3379 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 165 |
| 3 | Dominater069 | 161 |
| 4 | Um_nik | 159 |
| 4 | atcoder_official | 159 |
| 6 | djm03178 | 157 |
| 7 | adamant | 153 |
| 8 | luogu_official | 150 |
| 9 | awoo | 149 |
| 10 | TheScrasse | 146 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/31/2025 11:01:19 (i1).
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.
.