Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- int main()
- {
- int ar[100],n,i,j,flag;
- printf("No of ele:");
- scanf("%d",&n);
- for(i=0;i<n;i++){
- scanf("%d",&ar[i]);
- }
- for(i=0;i<n;i++){
- flag=0;
- if(ar[i]==1){
- flag=2;
- printf("Neither prime nor composite\n");
- }
- for(j=2;j<ar[i];j++){
- if(ar[i]%j==0){
- flag=1;
- break;
- }
- }
- if(flag==0){
- printf("%d is prime\n",ar[i]);
- }
- else if(flag==1){
- printf("%d is not prime\n",ar[i]);
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement