mfocko/Codeforces
1
0
Fork 0
mirror of https://gitlab.com/mfocko/Codeforces.git synced 2024-12-22 01:21:21 +01:00
Code Issues Projects Releases Packages Wiki Activity

chore: format using google style

Browse source 
Signed-off-by: Matej Focko <me@mfocko.xyz>
This commit is contained in:
Matej Focko 2023-07-10 20:20:03 +02:00
parent d98a05a245
commit 1464165a91
Signed by: mfocko
GPG key ID: 7C47D46246790496
3 changed files with 5 additions and 12 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
266/a.cpp
View file

@ -35,7 +35,6 @@ void solve() {
#ifndef TEST #ifndef TEST
int main(void) { int main(void) {
#ifdef SINGLE #ifdef SINGLE
solve(); solve();

7
546/a.cpp
View file

@ -5,11 +5,9 @@ namespace {
using namespace std; using namespace std;
long pow(long base, long exp) { long pow(long base, long exp) {
if (exp == 0) if (exp == 0) return 1;
return 1;
long half = pow(base, exp / 2); long half = pow(base, exp / 2);
if (exp % 2 == 0) if (exp % 2 == 0) return half * half;
return half * half;
return half * half * base; return half * half * base;
} }
@ -34,7 +32,6 @@ void solve() {
#ifndef TEST #ifndef TEST
int main(void) { int main(void) {
#ifdef SINGLE #ifdef SINGLE
solve(); solve();

9
791/a.cpp
View file

@ -5,11 +5,9 @@ namespace {
using namespace std; using namespace std;
long pow(long base, long exp) { long pow(long base, long exp) {
if (exp == 0) if (exp == 0) return 1;
return 1;
long half = pow(base, exp / 2); long half = pow(base, exp / 2);
if (exp % 2 == 0) if (exp % 2 == 0) return half * half;
return half * half;
return half * half * base; return half * half * base;
} }
@ -40,7 +38,7 @@ void solve() {
cout << find_k(a, b) << "\n"; cout << find_k(a, b) << "\n";
} }
} // namespace } // namespace
// for single test case, comment out for ‹N› test cases // for single test case, comment out for ‹N› test cases
#define SINGLE #define SINGLE
@ -48,7 +46,6 @@ void solve() {
#ifndef TEST #ifndef TEST
int main(void) { int main(void) {
#ifdef SINGLE #ifdef SINGLE
solve(); solve();