factorial code giving alternate +ve and -ve output for number > 19, tried long long, didn't work
0
$begingroup$
`#include
int main(void) {
int fact = 1;
int num;
printf("Enter a numbern");
scanf("%d", &num);
while ( num > 0 ) {
fact=fact*num;
num=num-1;
}
printf("%dn", fact );
return 0;
}`
I tried using long long data type but it did not work and I was getting alternate +ve and -ve numbers as output
c
New contributor
$endgroup$
add a comment |
0
$begingroup$
`#include
int main(void) {
int fact = 1;
int num;
printf("Enter a numbern");
scanf("%d", &num);
while ( num > 0 ) {
fact=fact*num;
num=num-1;
}
printf("%dn", fact );
return 0;
}`
I tried using long long data type but it did not work and I was getting alternate +ve and -ve numbers as output
c
New contributor
$endgroup$
add a comment |
0
0
0
$begingroup$
`#include
int main(void) {
int fact = 1;
int num;
printf("Enter a numbern");
scanf("%d", &num);
while ( num > 0 ) {
fact=fact*num;
num=num-1;
}
printf("%dn", fact );
return 0;
}`
I tried using long long data type but it did not work and I was getting alternate +ve and -ve numbers as output
c
New contributor
$endgroup$
`#include
int main(void) {
int fact = 1;
int num;
printf("Enter a numbern");
scanf("%d", &num);
while ( num > 0 ) {
fact=fact*num;
num=num-1;
}
printf("%dn", fact );
return 0;
}`
I tried using long long data type but it did not work and I was getting alternate +ve and -ve numbers as output
c
c
New contributor
New contributor
New contributor
asked 10 mins ago
adarsh narayanadarsh narayan
1
1
New contributor
New contributor
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
adarsh narayan is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f212605%2ffactorial-code-giving-alternate-ve-and-ve-output-for-number-19-tried-long-l%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
adarsh narayan is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
adarsh narayan is a new contributor. Be nice, and check out our Code of Conduct.
adarsh narayan is a new contributor. Be nice, and check out our Code of Conduct.
adarsh narayan is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f212605%2ffactorial-code-giving-alternate-ve-and-ve-output-for-number-19-tried-long-l%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown