Check if a Float value is equivalent to an Integer value Last Updated : 28 Apr, 2021 Comments Improve Suggest changes Like Article Like Report Given a floating-point number N, the task is to check if the value of N is equivalent to an integer or not. If found to be true, then print "YES". Otherwise, print "NO". Examples: Input: N = 1.5Output: NO Input: N = 1.0Output: YES Approach: The idea is to use the concept of Type Casting. Follow the steps below to solve the problem: Initialize a variable, say X, to store the integer value of N.Convert the value float value of N to integer and store it in X.Finally, check if (N - X) > 0 or not. If found to be true, then print "NO".Otherwise, print "YES". Below is the implementation of the above approach: C++ // C++ program to implement // the above approach #include <bits/stdc++.h> using namespace std; // Function to check if N is // equivalent to an integer bool isInteger(double N) { // Convert float value // of N to integer int X = N; double temp2 = N - X; // If N is not equivalent // to any integer if (temp2 > 0) { return false; } return true; } // Driver Code int main() { double N = 1.5; if (isInteger(N)) { cout << "YES"; } else { cout << "NO"; } return 0; } Java // Java program to implement // the above approach import java.util.*; class GFG { // Function to check if N is // equivalent to an integer static boolean isInteger(double N) { // Convert float value // of N to integer int X = (int)N; double temp2 = N - X; // If N is not equivalent // to any integer if (temp2 > 0) { return false; } return true; } // Driver code public static void main(String[] args) { double N = 1.5; if (isInteger(N)) { System.out.println("YES"); } else { System.out.println("NO"); } } } // This code is contributed by susmitakundugoaldanga Python3 # Python3 program to implement # the above approach # Function to check if N is # equivalent to an integer def isInteger(N): # Convert float value # of N to integer X = int(N) temp2 = N - X # If N is not equivalent # to any integer if (temp2 > 0): return False return True # Driver Code if __name__ == '__main__': N = 1.5 if (isInteger(N)): print("YES") else: print("NO") # This code is contributed by mohit kumar 29 C# // C# program to implement // the above approach using System; class GFG{ // Function to check if N is // equivalent to an integer static bool isint(double N) { // Convert float value // of N to integer int X = (int)N; double temp2 = N - X; // If N is not equivalent // to any integer if (temp2 > 0) { return false; } return true; } // Driver code public static void Main(String[] args) { double N = 1.5; if (isint(N)) { Console.WriteLine("YES"); } else { Console.WriteLine("NO"); } } } // This code is contributed by 29AjayKumar JavaScript <script> // Javascript program for the above approach // Function to check if N is // equivalent to an integer function isInteger(N) { // Convert float value // of N to integer let X = Math.floor(N); let temp2 = N - X; // If N is not equivalent // to any integer if (temp2 > 0) { return false; } return true; } // driver function let N = 1.5; if (isInteger(N)) { document.write("YES"); } else { document.write("NO"); } // This code is contributed by souravghosh0416. </script> Output: NO Time Complexity: O(1)Auxiliary Space: O(1) Comment More infoAdvertise with us Next Article Check if a Float value is equivalent to an Integer value Y yogeshsirsat56 Follow Improve Article Tags : Mathematical Competitive Programming School Programming Mathematics DSA Data Types Maths +3 More Practice Tags : Mathematical Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Dijkstra's Algorithm to find Shortest Paths from a Source to all Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example 12 min read Selection Sort Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.First we find the smallest element an 8 min read Like