Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
Peregruzka
#include <iostream> #include <time.h> using namespace std; int maximum(int a, int b=0) { if(a>b) { return a; } else { return b; } } int maximum(int a, int b, int c) { return maximum(maximum(a, b), c); } int maximum(int a, int b, int c, int d) { return maximum(maximum(a, b, c), d); } int main() { cout << maximum(-9) << endl; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Maze problem solution
function pointer
Enum flags operator example
Vector of pointer of P...
Fun with Pointers #1
back_inserter example
pointer to pointer
back_inserter example
hello,world !ssn2019
BinaryGap, C++ - Find longest sequence of zeros in binary representation of an integer.
Please log in to post a comment.