https://codeforces.net/contest/1715/problem/A
void solve(){ ll n,m;cin>>n>>m; if(n==1 and m==1){ cout<<0<<endl; return; } ll a = m-1; ll b = n-1; ll c = min(n,m)-1; cout<<a+b+c+1<<endl;
}
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
1715A---- A better Approach
https://codeforces.net/contest/1715/problem/A
void solve(){ ll n,m;cin>>n>>m; if(n==1 and m==1){ cout<<0<<endl; return; } ll a = m-1; ll b = n-1; ll c = min(n,m)-1; cout<<a+b+c+1<<endl;
}
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | Aayuushh19 | 2022-08-21 05:22:44 | 275 | Initial revision (published) |
Название |
---|