Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <string.h>
- #include <math.h>
- #include <stdlib.h>
- int main() {
- int n,m;
- scanf("%d",&n);
- for(int i=2; i<n/2; i++){
- m= pow(2,(i-1))*(pow(2,i)-1);
- printf("%d",m);
- if(m==n){
- printf("Perfect Number");
- return 0;
- }
- }
- printf("Not a Perfect Number");
- }
- #include <stdio.h>
- #include <string.h>
- #include <math.h>
- #include <stdlib.h>
- int main() {
- int n,m;
- scanf("%d",&n);
- for(int i=2; i<n/2; i++){
- m= pow(2,(i-1))*(pow(2,i)-1);
- if(m==n){
- printf("Perfect Number");
- return 0;
- }
- }
- printf("Not a Perfect Number");
- }
- #include <stdio.h>
- #include <string.h>
- #include <math.h>
- #include <stdlib.h>
- int main() {
- int n;
- scanf("%d", &n);
- for(int i=2; i<n/2; i++){
- if(n%i == 0){
- printf("Not a Prime Number");
- return 0;
- }
- }
- n!=1 ? printf("Prime Number") : printf("Not a Prime Number");;
- }
- #include <stdio.h>
- #include <string.h>
- #include <math.h>
- #include <stdlib.h>
- int main() {
- int n,i;
- scanf("%d%d", &n,&i);
- if(n%i==0){
- printf("Smooth Number");
- return 0;
- }
- printf("Not a Smooth Number");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement