Sherlock and Squares

Sherlock and Squares


Watson gives two integers ( and ) to Sherlock and asks if he can count the number of square integers between  and  (both inclusive).
Note: A square integer is an integer which is the square of any integer. For example, 1, 4, 9, and 16 are some of the square integers as they are squares of 1, 2, 3, and 4, respectively.
Input Format
The first line contains , the number of test cases.  test cases follow, each in a new line. 
Each test case contains two space-separated integers denoting  and .
--Solution--
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
    int t,i,l;
   unsigned int x,y,j,k;
   cin>>t; 
    for(i=0;i<t;i++)
        {cin>>x>>y;l=0;
        for(j=1;j<=y;j++)
            {
              k=j*j;
            if(k>=x && k<=y)
                l++;
            if(k>=y)
                break;
        }cout<<l<<endl;
        } 
    return 0;
}

Comments

Post a Comment

Popular posts from this blog

HackeRank Problem John Watson performs an operation called a  right circular rotation  on an array of integers,  . After performing one  right circular rotation  operation, the array is transformed from   to  . Watson performs this operation   times. To test Sherlock's ability to identify the current element at a particular position in the rotated array, Watson asks   queries, where each query consists of a single integer,  , for which you must print the element at index   in the rotated array (i.e., the value of  ). -----Solution---- #include <math.h> #include <stdio.h> #include <string.h> #include <stdlib.h> #include <assert.h> #include <limits.h> #include <stdbool.h> int main(){     int n,k,q     scanf("%d %d %d",&n,&k,&q);     int *a = malloc(sizeof(int) * n);     for(int a_i = 0; a_i < n; a_i++){        scanf("%d",&a[a_i]);     }     for(int a0 = 0; a0 < q; a0++){  
Read more

Cut the sticks

Cut the sticks     You are given   sticks, where the  length  of each stick is a positive integer. A  cut operation  is performed on the sticks such that all of them are reduced by the length of the smallest stick. ---Solution--- #include <cmath> #include <cstdio> #include <vector> #include <iostream> #include <algorithm> using namespace std; int compare (const void * a, const void * b) {   return ( *(int*)a - *(int*)b ); } int main() {     /* Enter your code here. Read input from STDIN. Print output to STDOUT */        int element,k;     cin>>element;     int array[element];     for(int i=0;i<element;i++)         {             cin>>array[i];     }      qsort (array, element, sizeof(int), compare);     int p=element;     for(int i=0;i<element;i++)         {                            if(array[i]!=0)              {cout<<p<<endl;          if(p<=1)          {break;}             for(int j=element-1;j>=i;j--)    
Read more