Skip to main content

C++ = How to sum of digits of any number code.

Code no: 1 = By using array. 

#include <iostream>

using namespace std;

int main() 

{

int number;

cout<<"Enter the n";

cin>>number;

int a[number];

int sum=0;

cout<<"Enter a digit : "<<endl;

for (int i=1;i<=number;i++)

{

cin>>a[i];

}

for (int i=1;i<=number;i++)

{

sum+=a[i];

}

cout<<"The sum of the number : "<<sum;

return 0;

}
Result:








Code no: 2 = By using some logic without using array and all the code is in one function.

#include <iostream>

using namespace std;

int main()

{

int num,origional,sum=0,digit=0;

origional=num;

cout<<"Enter any no: to finds its sum = ";

cin>>num;

while(num!=0)

{

digit=num%10;

sum+=digit; 

num/=10; 

}

cout<<"The sum of the digits is "<<sum;

return 0;

}

Result:






Code no: 3 = Using same code as of code no: second but using different function to perform same task.

#include <iostream>

using namespace std;

int sumofdigit(int num)

{

int sum=0,digit=0;

while (num!=0)

{

digit=num%10;

sum+=digit;

num/=10;

}

return sum;

}

int main()

{

int num;

cout<<"Enter any digit to find its sum = ";

cin>>num;

    int sum=sumofdigit(num);

cout<<"Sum of the digit is "<<sum;

return 0;

}

Result:




Comments

Popular posts from this blog

C++ = Code to check number is a prime or not. If not find the nearest prime number.

Code:  #include <iostream> using namespace std; bool prime(int n) { if (n<=1) { return false; }        for (int i=2;i<=n/2;i++)    {       if (n%i==0)   {   return false;   }    }         return true; } int nearest(int n) { for (int i=n-1;i>=2;i--) { if (prime(i)) { return i; } } return 0; } int main () { int number; cout<<"Enter any number : "; cin>>number; if (prime(number)) { cout<<"The number is prime. "<<endl; }     else     {     cout<<"The entered number is compositive."<<endl;     cout<<"The nearest prime number will be "<<nearest(number)<<endl; } } Result:

C++ = Code to check number wheater it is prime or not.

Code no 1= Without any other function with using another function. #include <iostream> using namespace std; int main() { int number; bool prime=true; cout<<"Enter any number : "; cin>>number; if (number<=1) { prime=false; } else { for (int i=2;i<number;i++) { if (number%i==0) { prime=false; break; } } } if (prime) { cout<<"The number is a prime number."<<endl; } else { cout<<"The number is not a prime number."<<endl; } } Code no: 2= With using another function #include <iostream> #include <cmath> using namespace std; bool prime(int n) { if (n<=1) { return false; } for (int i=2;i<n/2;i++) { if (n%i==0) { return false; } } return true; } int main() { int number; cout<<"Enter any number : "; cin>>number; if (prime(number)) { cout<<"The numbe...

C++ = Printing diamond with asterik

 CODE: #include <iostream> using namespace std; int main() {     for (int i=1;i<=5;i++)     {     for (int j=1;j<=5-i;j++)     {     cout<<" "; }     for (int k=1;k<=(2*i)-1;k++)     {     cout<<"*"; }   cout<<endl; } for (int i=4;i>=1;i--)     { for (int j=1;j<=5-i;j++)     {     cout<<" "; }     for (int k=1;k<=(2*i)-1;k++)     {     cout<<"*"; }        cout<<endl; } return 0; } RESULT: