AMR15B how to solve this question ??
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/08/2026 12:23:01 (g2).
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.
.