Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
C assignment due sunday
//gcc 5.4.0 #include <stdio.h> int main(void) { int numOne; int numTwo; int numThree; int i; scanf("%d, %d, %d", &numOne, &numTwo, &numThree); printf("%d %d %d", numOne, numTwo, numThree); int num[3]; num[0]=numOne; num[1]=numTwo; num[2]=numThree; int max=numOne; int min=numOne; for (i=0; i<3; i++) { if (num[i]>max) { max=num[i]; } } for (i=0; i<3; i++) { if (num[i]<min) { min=num[i]; } } return 0; }
run
|
edit
|
history
|
help
0
Project 5 v.06
ayudantia ejercicio 2 numero nashee
2-dimension array got area by malloc()
RSA Algo
convertletter
150108_recursividadFactorial
menu
poist
c. new one
bitwise operations