linear diophantine equation: ax+by=c where a,b,c are given and range of x and y are given. 1.)how to find the number of integral solution between the range? 2.)find x and y for which x+y is minimum
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 4039 |
| 2 | tourist | 3841 |
| 3 | jqdai0815 | 3682 |
| 4 | ksun48 | 3590 |
| 5 | ecnerwala | 3542 |
| 6 | Benq | 3535 |
| 7 | orzdevinwang | 3526 |
| 8 | gamegame | 3477 |
| 9 | heuristica | 3357 |
| 10 | Radewoosh | 3355 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 165 |
| 3 | atcoder_official | 160 |
| 3 | Um_nik | 160 |
| 5 | djm03178 | 157 |
| 6 | Dominater069 | 156 |
| 7 | adamant | 153 |
| 8 | luogu_official | 152 |
| 9 | awoo | 151 |
| 10 | TheScrasse | 147 |
→ Find user
→ Recent actions
If we Know the value of c where c=((a%mod)*(b%mod))%mod , the value of (a%mod) is given.How to find the value of (b%mod). a,b,c are integer and mod=1e9+7.
Example: mod=1e9+7 c=386724027 (a%mod)=787871 how to find the value of (b%mod)? ans=9192351 Can anyone help me to solve this?
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/22/2025 09:47:35 (k2).
Desktop version, switch to mobile version.
Supported by
