Skip to main content

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;
        }
        else if (input == '0')
        {
            break;
        }
    }

    cout << "-------------------------" << endl;
    cout << "Your counts are " << count << endl;

    return 0;
}

Result:


Comments

Post a Comment

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:
Post a Comment
Read more

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...
Post a Comment
Read more

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:
Post a Comment
Read more