4/06/2017

Geeksforgeeks Solution For " Number of ways to find two numbers "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Number of ways to find two numbers

Submit Your Solution :- Click Here 

Solution :- 

#include <iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
       int i,j,k,sum=0;
       cin>>k;
       for(i=1;i<1000;i++)
       {
           for(j=i+1;j<1000;j++)
           {
              if((i+j)<=k)
              {
                  sum++;
              }
           }
       }
       cout<<sum<<endl;

    }
    return 0;
}

Output:-



Geeksforgeeks Solution For " Number of ways to find two numbers "

Previous Post
Next Post

post written by:

Hi, I’m Ghanendra Yadav, SEO Expert, Professional Blogger, Programmer, and UI Developer. Get a Solution of More Than 500+ Programming Problems, and Practice All Programs in C, C++, and Java Languages. Get a Competitive Website Solution also Ie. Hackerrank Solutions and Geeksforgeeks Solutions. If You Are Interested to Learn a C Programming Language and You Don't Have Experience in Any Programming, You Should Start with a C Programming Language, Read: List of Format Specifiers in C.
Follow Me

0 Comments: