Skip to content

Courses
Tutorials
Practice
Contests

C++ Data Types
C++ Input/Output
C++ Arrays
C++ Pointers
C++ OOPs
C++ STL
C++ Interview Questions
C++ Programs
C++ Cheatsheet
C++ MCQ
C++ Projects
C++ Exception Handling
C++ Memory Management

C++ Program To Check Whether a Number is Prime or not

C++ Program To Check And Print Neon Number in a Given Range

Last Updated : 22 Feb, 2023

Comments

Improve

Suggest changes

Like Article

Like

Report

A neon number is a number where the sum of digits of the square of the number is equal to the number. The task is to check and print neon numbers in a range.

Examples:

Input: 9 Output: Neon Number Explanation: square is 9*9 = 81 and  sum of the digits of the square is 9.  Input: 12 Output: Not a Neon Number Explanation: square is 12*12 = 144 and  sum of the digits of the square is 9 (1  + 4 + 4) which is not equal to 12.

The implementation is simple, we first compute square of given number, the find sum of digits in the square.

C++

   // C++ program to check and print
// Neon Numbers upto 10000
#include <iostream>
using namespace std;
#include <math.h>
 
int checkNeon(int x)
{
    // Storing the square of x
    int sq = x * x;
 
    // Calculating the sum of 
    // digits of sq
    int sum_digits = 0;
    while (sq != 0) 
    {
        sum_digits = sum_digits + sq % 10;
        sq = sq / 10;
    }
    return (sum_digits == x);
}
 
// Driver Code
int main(void)
{
    // Printing Neon Numbers upto 10000
    for (int i = 1; i <= 10000; i++) 
        if (checkNeon(i))
            cout << i << " ";    
}
 
  

Output:

1 9

Time Complexity: O(n*log₁₀(n*n)) where n is the number till which neon numbers to be printed.

Space Complexity: O(1) as no extra space has been used.

C++ Program To Check Whether a Number is Prime or not

kartik

Improve

Article Tags :

C++
C++ Programs
C Basic Programs

Practice Tags :

CPP

Similar Reads

C++ Program to Print Even Numbers in an Array

Given an array of numbers, the task is to print all the even elements of the array. Let us understand it with few examples mentioned below. Example: Input: num1 = [2,7,6,5,4] Output: 2, 6, 4 Input: num2 = [1,4,7,8,3] Output: 4, 81. Using for loop Approach: Iterate each element in the given using for

C Program To Find Prime Numbers Between Given Range

A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. For example, 2, 3, 5, 7, and 11 are prime numbers. In this article, we will learn how to find all the prime numbers between the given range. Example Input: l = 10, r = 30Output: 11 13 17 19Explan

C++ Program To Check Whether a Number is Prime or not

Given a positive integerÂ N. The task is to write a C++ program to check if the number is prime or not.Â Definition:Â A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. The first few prime numbers are {2, 3, 5, 7, 11, ....} The idea to solve this

C++ Program To Find Prime Numbers Between Given Interval

A prime number is defined as a natural number greater than 1 and is divisible by only 1 and itself. In other words, the prime number is a positive integer greater than 1 that has exactly two factors, 1 and the number itself. The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23 . . . Note:

C++ Program for How to check if a given number is Fibonacci number?

Given a number 'n', how to check if n is a Fibonacci number. First few Fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 141, .. Examples : Input : 8 Output : Yes Input : 34 Output : Yes Input : 41 Output : No Following is an interesting property about Fibonacci numbers that can also be

C++ Program to Print Armstrong Numbers Between 1 to 1000

Here, we will see how to print Armstrong numbers between 1 to 1000 using a C++ program. Armstrong Number A number "N" is an Armstrong number if "N" is equal to the sum of all N's digits raised to the power of the number of digits in N. Example: There are 2 ways to find all the Armstrong numbers betw

C++ Program to Print Prime Numbers from 1 to n

A prime number is a natural number that has only two divisors, which are 1 and itself. In this article, we will learn how to print all the prime numbers from 1 to n in C++. Examples Input: n = 10Output: 2, 3, 5, 7Explanation: As 2, 3, 5, 7 are the only prime numbers between 1 to 10. Input: n = 5Outp

C++ Program To Check If a Prime Number Can Be Expressed as Sum of Two Prime Numbers

Given a prime numberÂ [Tex]NÂ Â [/Tex]. The task is to check if it is possible to expressÂ [Tex]NÂ Â [/Tex]as sum of two separate prime numbers.Note: The range of N is less than 108. Examples:Â Input: N = 13 Output: Yes Explanation: The number 13 can be written as 11 + 2, here 11 and 2 are both prime. Inp

How to Find the Range of Numbers in an Array in C++?

The range of numbers in an array means the difference between the maximum value and the minimum value in the given array. In this article, we will learn how to find the range of numbers in an array in C++. For Example, Input: myArray = {5,10,15,30,25}; Output: Range: 25Range Within an Array in C++To

Program to delete Nth digit of a Number

Given a number num and a number n, the task is to delete this nth digit of the number num, from starting and from end.Examples: Input: num = 1234, n = 3 Output: num_after_deleting_from_starting = 124, num_after_deleting_from_end = 134Input: num = 4516312, n = 2 Output: num_after_deleting_from_starti

Corporate & Communications Address:

A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh (201305)

Registered Address:

K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar, Uttar Pradesh, 201305

Advertise with us

Company
About Us
Legal
Privacy Policy
In Media
Contact Us
Advertise with us
GFG Corporate Solution
Placement Training Program

Languages
Python
Java
C++
PHP
GoLang
SQL
R Language
Android Tutorial
Tutorials Archive

DSA
Data Structures
Algorithms
DSA for Beginners
Basic DSA Problems
DSA Roadmap
Top 100 DSA Interview Problems
DSA Roadmap by Sandeep Jain
All Cheat Sheets

Data Science & ML
Data Science With Python
Data Science For Beginner
Machine Learning
ML Maths
Data Visualisation
Pandas
NumPy
NLP
Deep Learning

Web Technologies
HTML
CSS
JavaScript
TypeScript
ReactJS
NextJS
Bootstrap
Web Design

Python Tutorial
Python Programming Examples
Python Projects
Python Tkinter
Python Web Scraping
OpenCV Tutorial
Python Interview Question
Django

Computer Science
Operating Systems
Computer Network
Database Management System
Software Engineering
Digital Logic Design
Engineering Maths
Software Development
Software Testing

DevOps
Git
Linux
AWS
Docker
Kubernetes
Azure
GCP
DevOps Roadmap

System Design
High Level Design
Low Level Design
UML Diagrams
Interview Guide
Design Patterns
OOAD
System Design Bootcamp
Interview Questions

Inteview Preparation
Competitive Programming
Top DS or Algo for CP
Company-Wise Recruitment Process
Company-Wise Preparation
Aptitude Preparation
Puzzles

School Subjects
Mathematics
Physics
Chemistry
Biology
Social Science
English Grammar
Commerce
World GK

GeeksforGeeks Videos
DSA
Python
Java
C++
Web Development
Data Science
CS Subjects

@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Improvement

Suggest Changes

Help us improve. Share your suggestions to enhance the article. Contribute your expertise and make a difference in the GeeksforGeeks portal.

geeksforgeeks-suggest-icon

Create Improvement

Enhance the article with your expertise. Contribute to the GeeksforGeeks community and help create better learning resources for all.

geeksforgeeks-improvement-icon

Suggest Changes

min 4 words, max Words Limit:1000

Thank You!

Your suggestions are valuable to us.

What kind of Experience do you want to share?

Interview Experiences

Admission Experiences

Career Journeys

Work Experiences

Campus Experiences

Competitive Exam Experiences