Write a program to add natural numbers up to 20 by using for loop in c++ language.



 Write a program to add natural numbers up to nth term by using for loop in c++ language. 


#include <iostream>


using namespace std;


int main() {


    int sum =0  ,n ;


    cout<<"Enter the nth term  n = ";


    cin>>n;


     for(int i =1;i<=n; i++)
    {  sum =sum +i ;}


    cout<<"sum of  "<<n<<"th term is = "<<sum

   return 0;
}


  • OUTPUT

Enter the nth term  n = 20
the sum of  20th term is = 210




Comments

Post a Comment

If you have any doubt ,let me know

Popular posts from this blog

2) .cheak even and odd nmbr\\\

//Check even or odd number #include <iostream> using namespace std; int main() {  int a,b;   cin>>a;     if (   a%2==0  )       {cout<< " a is even nmber" ;     }     else cout << "a is odd nmbr" ;       return 0;     }    
Read more

Write the program to arrange the n queen(queen of chessboard) in n*n matrix such that they can not ATTACK TO eachother.

Image
  OUTPUT : In form of matrix of elements (0 and 1)     where 1 is suitable position where can be keep without attack to each other.   USED : Recursion , BACKTRACKING etc CHARACTERISTICS   OF QUEEN :     A )They can move in any position in a row where it is presence.     B )They can move in any position in a column where it is presence.     C )They can move in any position in a diagonal where it is presence. CONDITION :     Arrange the queen such that they can not ATTACK to each other.     in n*n matrix       APPROCH :    A )put a queen in a row than move next row to put      the next queen in next row such that they can not ATTACK each other        After matrix 4 they are not any place where a queen can be Put without attack by anyone so BACKTRACK occur here and reach again to Matrix 1 and then continue...
Read more

write a program for finding the path in maze from, begin to end

Image
write a program for finding the path in maze from, begin to end ABOUT FIGURE :Deep blue indicates wall and deep green denotes free path. In above figure , upper matrix is input In below matrix is output (path in form of 1) CONDITION : movement takeplace ony in positive x direction                   and in negative y direction APPROCH :  a)in a maze 1 denote movement space and 0 denote wall   b)use recursion to find the way by reducing number of box   c)use a new_array which initialisation by 0,and after getting path         become 1 on that place.   D ) use BACKTRACKING ,if_rat will not get path then it take back the path      this_ is known as backtracking. backtracking (algorithmic technique) Definition:  Find a solution by trying one of several choices. If the choice proves incorrect, computation  backtrac...
Read more