Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Fractions n/d that obey (n+5)/(d+2)=3n/d
#include <stdio.h> // given a fraction that obeys // // (n+5)/(d+2) = 3 * n/d // // print out all solutions int main(void) { double lower = -100; double upper = 100; double d; for (double n = lower; n <= upper; n+=1) { if (n == 0) continue; d = 6*n/(5-2*n); if (d == (int)d) printf("\n%d/%d", (int)n,(int)d); } printf("\n"); return 0; }
run
|
edit
|
history
|
help
0
inicializace struktury
array of structures
Min_Max pole čísel
struktura vzalenost
OBsah obdelniku
Square of a Number
funkce vzdálenost
BPC UDP cv10 cisla
test1
hledání max, min