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
Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 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 | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ 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-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/06/2026 18:24:37 (g2).
Desktop version, switch to mobile version.
Supported by
