Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
0003
# include <stdio.h> int main (void) { int x, x1, x2, x3, x4; printf ("Enter the value of x:_\n"); scanf ("%d", &x); x1 = x/20; x2 = (x - x1 * 20)/10; x3 = (x - x1 * 20 - x2*10)/5; x4 = (x - x1 * 20 - x2*10 - x3*5)/1; printf ("x1: %d\n", x1); printf ("x2: %d\n", x2); printf ("x3: %d\n", x3); printf ("x4: %d\n", x4); return 0; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Bucles: secuencia ascendente de números
Bucles: suma impares menores que N
CV09-2
Herout (67) - 12
UDP - Male/Velke pismena
cv2
Fibonacci search by Henry Kroll III www.thenerdshow.com
Eukleidova algoritmu
Find the length of largest subarray with equal number of 0's and 1's using recursion
Vending machine
stackse - search stackoverflow differently
Please log in to post a comment.