Code: / / c entered by typing the number of the function / / find the factorial value facto double (int number); int main () {int number; printf ("Enter number black and decker \ n"); scanf ("% d", & number); printf ("The factorial of a number is:% f \ n", black and decker facto (figure)); return 0; } / / Background, but seeing that my process facto double function (int amount) {double inspector; for (int counter = 1; counter <= number; counter + +) {inspector = inspector * counter; Auditor} return; }
Code: # include <stdio.h> long-facto (int number); int main () {int number; printf ("Enter number \ n"); scanf ("% d", & number); printf black and decker ("The factorial of a number is:% ld \ n", facto (figure)); return 0; } / / Process in the background, but which have not seen long-facto function (int amount) {double inspector; Auditor = 1; while (inspector> 1) {for (int counter = 1; counter <= number; counter + +) {inspector = inspector * counter; Auditor}} return; }
But did not fully examine the first gz Arpt: facto function of the auditor in the auditor variable Aninamor black and decker 1 atamsn but while DNGs> 1 increases're neighbors. In this way you can not go to DNGs while the proprietress time. did that small changes in codes of bi
Code: # include <stdio.h> long-facto (int number); int main () {int number; printf ("Enter number \ n"); scanf ("% d", & number); printf black and decker ("The factorial of a number is:% ld \ n", facto (figure)); system ("PAUSE"); return 0; } / / Process in the background, but which have not seen long-facto function (int amount) {double inspector; Auditor = 1; int counter; for (counter = 1; counter <= number; counter + +) {inspector = inspector * counter; Auditor} return; }
Code: # # <stdlib.h> long <stdio.h> black and decker facto (int number); int main () {int number; printf ("Enter number \ n"); scanf ("% d", & number); printf ("The factorial of a number is:% ld \ n", facto (figure)); system ("PAUSE"); main (); return 0; } / / Process in the background, but which have not seen long-facto function (int amount) {double inspector; Auditor = 1; int counter; for (counter = 1; counter black and decker <= number; counter + +) {inspector = inspector * counter; Auditor} return; Hesaply} is currently a problem after up to 12 kyr.
Tm +3 ayarlanmt GTS is time-consuming. Now at 22:14.
No comments:
Post a Comment