C++ = Write a program that takes n numbers as input. It displays total positive and negative numbers.

Code:

#include <iostream>

using namespace std;

int main()

{

int num,pos=0,neg=0;

cout<<"Enter the number of numbers to be input : ";

cin>>num;

for (int i=1;i<=num;i++) //1 //2

{

int n;

cin>>n;

if (n>0)

{

pos++;

}

else

{

neg++;

}

cout<<"The number of positive numbers you entered are "<<pos<<endl;

cout<<"The number of negative numbers you entered are "<<neg<<endl;

return 0;

}

Result:

Comments

C++ = Code for Counter

Code: #include <iostream> #include <conio.h> using namespace std; int main() { int count = 0; char input; cout << "--------------------------" << endl; cout << " Counter " << endl; cout << "--------------------------" << endl; cout << endl; cout << "Press 1 to counter" << endl; cout << "Press 0 to quit" << endl; cout << endl; cout << "Enter the number continuously : "; while (true) { input = getch(); if (input == '1') { count += 1; cout << "Your counts are " << count << endl; ...

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 for checking any digit palindrome number

Code no: 1 = Using only main function to perform task. #include <iostream> using namespace std; int main() { int number,original,digit,reverse=0; cout<<"Enter any number : "; cin>>number; original=number; while (number!=0) { digit=number%10; reverse=(reverse*10)+digit; number=number/10; } if (original==reverse) { cout<<"This "<<original<<" is Palindrome number."; } else { cout<<"The "<<original<<" is not Palindrome number."; } } Result: Code no: 2 = Using two functions to perform same task. #include <iostream> using namespace std; int isprime(int num) { int digit=0,reverse=0; while (num!=0) { digit=num%10; reverse=(reverse*10)+digit; num/=10; } return reverse; } int main() { int num; cout<<"Enter any digit to find its sum = "; cin>>num; int original=num; if (i...

Welcome to Mohsin Lashari Baloch's Blog

Search This Blog