**Smart Number**

### Problem Statement :

In this challenge, the task is to debug the existing code to successfully execute all provided test files. A number is called a smart number if it has an odd number of factors. Given some numbers, find whether they are smart numbers or not. Debug the given function is_smart_number to correctly check if a given number is a smart number. Note: You can modify only one line in the given code and you cannot add or remove any new lines. To restore the original code, click on the icon to the right of the language selector. Input Format The first line of the input contains t, the number of test cases. The next t lines contain one integer each. Constraints 1 <= t <= 10^3 1 <= ni <= 10^4 , where ni is the ith integer. Output Format The output should consist of t lines. In the ith line print YES if the ith integer has an odd number of factors, else print NO.

### Solution :

` ````
Solution in C :
In Python3 :
import math
def is_smart_number(num):
val = int(math.sqrt(num))
if num == val**2:
return True
return False
for _ in range(int(input())):
num = int(input())
ans = is_smart_number(num)
if ans:
print("YES")
else:
print("NO")
In Java :
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static boolean isSmartNumber(int num) {
int val = (int) Math.sqrt(num);
if(num / (double) val == val)
return true;
return false;
}
public static void main(String[] args) {
int test_cases;
Scanner in = new Scanner(System.in);
test_cases = in.nextInt();
int num;
for(int i = 0; i < test_cases; i++){
num = in.nextInt();
boolean ans = isSmartNumber(num);
if(ans){
System.out.println("YES");
}
else System.out.println("NO");
}
}
}
In C++ :
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static boolean isSmartNumber(int num) {
int val = (int) Math.sqrt(num);
if(val * val == num)
return true;
return false;
}
public static void main(String[] args) {
int test_cases;
Scanner in = new Scanner(System.in);
test_cases = in.nextInt();
int num;
for(int i = 0; i < test_cases; i++){
num = in.nextInt();
boolean ans = isSmartNumber(num);
if(ans){
System.out.println("YES");
}
else System.out.println("NO");
}
}
}
```

## View More Similar Problems

## Find the Running Median

The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.

View Solution →## Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

View Solution →## Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →## Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

View Solution →## Kundu and Tree

Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that

View Solution →## Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →