//////////////////////////////////////////////////// /// /// Special Numbers /// --------------- /// /// Made By - Kinshuk Vasisht /// Version - 1.1 /// Features - Checks if a number is /// Armstrong, /// Narcissitic, Pronic, /// Perfect, Abundant, /// Deficient, Niven, /// Fujiwara, Prime, /// Trimorphic, Automorphic, /// Palindromic, Disarium, /// Mersenne, Cullen, /// and Factorion or not... /// Special Output for 1729.. /// Overloads - None. (No Templates) /// Functions - fujiwara(no), rev(no), /// power(no,t), /// factorion(no), /// narcissitic(no), /// perfect(no),cullen(no), /// trimorphic(no), /// prime(no),armstrong(no), /// niven(no),pronic(no), /// fac(no),disarium(no), /// automorphic(no), /// mersenne(no), /// checker(no). /// Main Data Type - Long Long ( as Alias - l) /// Templates - None. /// Macros - None. /// Headers - #include, /// #include /// No. of Lines - 303 (No Extras) /// //////////////////////////////////////////////////// /* Hello. This is a Simple Program created to find specialities of numbers... All the user needs to do is enter a Number, and it will check for its special features... Then it will display you, how it is special..., EG - if its a palindrome, armstrong, fujiwara, etc; NOTE : This Program is intended only for checking the properties of 'Natural Numbers'. Also,the more number gets bigger, the more time is taken in the checking process... It is a non-updated version, hence the slow speed... */ #include #include using namespace std; typedef long long l; bool perfectn(l n) { int t=sqrt(n); if(t*t==n) return true; return false; } long fac(long n) { if(n==0) return 1; else if(n==1) return 1; else return n*fac(n-1); } l rev(l no) { l n=no,reve=0,d; while(n!=0) { d=n%10; reve=reve*10+d; n/=10; } return reve; } l power(l no, l t) { l sum=1; for(l i=0;i=0) return sum; else return -1; } bool fibonacci(l no) { if(perfectn(5*no*no+4)||perfectn(5*no*no-4)) return true; return false; } void checker(l no) { if(fibonacci(no)==true||prime(no)==-1||prime(no)>0||fujiwara(no)==true||no==rev(no)||narcissitic(no)==true||perfect(no)>=0||cullen(no)==true||factorion(no)==true||trimorphic(no)==true||prime(no)==0||armstrong(no)==true||niven(no)==true||pronic(no)==true||disarium(no)==true||automorphic(no)==true||mersenne(no)==true) { if(no==rev(no)) cout<0) cout<no) cout<>no; cout<

Special Numbers Checker