Commit 0d80d06

committed

program to check if a number is automorpihc or not:

1 parent ca59d96 commit 0d80d06Copy full SHA for 0d80d06

File tree

+51

-10

lines changed

+51

-10

lines changed

Lines changed: 30 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,30 @@`
	`1`	`+#include<iostream>`
	`2`	`+#include<math.h>`
	`3`	`+`
	`4`	`+using namespace std;`
	`5`	`+`
	`6`	`+void isAutomorphic(int n)`
	`7`	`+{`
	`8`	`+ int sq = (n*n);`
	`9`	`+ int count = 0;`
	`10`	`+ int nn = n;`
	`11`	`+ //counting number of digits of n`
	`12`	`+ while(nn)`
	`13`	`+ {`
	`14`	`+ count++;`
	`15`	`+ nn /= 10;`
	`16`	`+ }`
	`17`	`+ int dig = pow(10,count);`
	`18`	`+`
	`19`	`+ int d = (sq % dig);`
	`20`	`+ if(d==n) cout<<"Automorpihc";`
	`21`	`+`
	`22`	`+ else cout<<"Not Automorphic";`
	`23`	`+}`
	`24`	`+`
	`25`	`+`
	`26`	`+int main()`
	`27`	`+{`
	`28`	`+ isAutomorphic(76);`
	`29`	`+ return 0;`
	`30`	`+}`

Lines changed: 5 additions & 5 deletions

Lines changed: 16 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -29,18 +29,29 @@ int CountSet(int n)`
`29`	`29`	`while(n)`
`30`	`30`	`{`
`31`	`31`	`count += n & 1;`
`32`		`- n >>= 1; //simply right shift the no by 1`
`33`		`-`
	`32`	`+ // n >>= 1; //simply right shift the no by 1`
	`33`	`+ //right shift is equivalent to division by 2`
	`34`	`+ n /= 2;`
`34`	`35`	`}`
`35`	`36`
`36`	`37`	`return count;`
`37`	`38`	`}`
`38`	`39`
	`40`	`+//int countUnset(int n){`
	`41`	`+//`
	`42`	`+// int count = 0;`
	`43`	`+// while(n)`
	`44`	`+// {`
	`45`	`+// count += n \| 1;`
	`46`	`+//`
	`47`	`+// n /= 2;`
	`48`	`+// }`
	`49`	`+//}`
	`50`	`+`
`39`	`51`	`int main()`
`40`	`52`	`{`
`41`		`- //cout<<CountSet(10);`
`42`		`-int n = __builtin_popcount(7);`
	`53`	`+ cout<<CountSet(7);`
	`54`	`+// cout<<endl<<countUnset(5);`
`43`	`55`
`44`		`- cout<<n;`
`45`	`56`	`return 0;`
`46`	`57`	`}`

Comments

(0)