Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
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
regimeketopdfb
Pascals Triangle
A
Fundamentos de programación. Tema 7. Ejercicio 6.
overloadresolution
test
Struct memory ordering
Recursive Enumeration Example
HTML Timetable generator.cpp
wellformed number