Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <string.h>
- #include <ctype.h>
- int primetest(int n)
- {
- int odb=0,i;
- for(i=2;i<n;i++)
- {
- if(n%i==0) odb++;
- }
- return odb;
- }
- int main()
- {
- int i,j,db,prime=0;
- char t[1000];
- while(scanf("%s",t)!=EOF)
- {
- for(i=0;i<strlen(t);i++)
- {
- prime = 0;
- db=1;
- for(j=i+1;j<strlen(t);j++)
- {
- if(t[i]==t[j] && isalpha(t[i]))
- {
- db++;
- t[j]='5';
- }
- printf("%s\n",t);
- }
- printf("%c db: %d\n",t[i],db);
- if(db==1)
- {
- prime=-1;
- break;
- }
- else{
- if(t[i]=='\n' || t[i]=='\0')
- {
- prime=primetest(db);
- if(prime!=0)
- {
- prime=-1;
- printf("nemprim %d\n **%s**\n ",db,t);
- break;
- }
- }
- } //t[i]='*';
- }
- if(prime==-1) printf("NO\n");
- else printf("YES %d\n",prime);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement