#include <stdio.h>
int main()
{
int n, i, flag = 1,c=0;
for (i = 2; i <= n/2; i++) {
if (n % i == 0) {
flag = 0;
break;
}
}
if (flag == 1) {
printf("number %d has 0 divisors so\n",n
); printf("this is a prime number"); }
else {
for (i=2;i<n;i++) {
if (n%i==0) {
c++;}}
printf("\nnumber %d has %d divisors",n
,c
); }
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgbWFpbigpCnsKICAgIGludCBuLCBpLCBmbGFnID0gMSxjPTA7CgogICAgcHJpbnRmKCJFbnRlciBhIG51bWJlcjogXG4iKTsKCiAgICBzY2FuZigiJWQiLCAmbik7CgogICAgZm9yIChpID0gMjsgaSA8PSBuLzI7IGkrKykgewoKICAgICAgICBpZiAobiAlIGkgPT0gMCkgewogICAgICAgICAgICBmbGFnID0gMDsKICAgICAgICAgICAgYnJlYWs7CiAgICAgICAgfQogICAgfQoKICAgIGlmIChmbGFnID09IDEpIHsKICAgcHJpbnRmKCJudW1iZXIgJWQgaGFzIDAgZGl2aXNvcnMgc29cbiIsbik7CiAgICAgICAgcHJpbnRmKCJ0aGlzIGlzIGEgcHJpbWUgbnVtYmVyIik7CiAgICB9CiAgICBlbHNlIHsKICAgICAKICAgZm9yIChpPTI7aTxuO2krKykgewogICAgICAgIGlmIChuJWk9PTApIHsKICAgICAgICAgICAgcHJpbnRmKCIlZFxuIixpKTsKICAgICAgICAgYysrO319CiAgIHByaW50ZigiXG5udW1iZXIgJWQgaGFzICVkIGRpdmlzb3JzIixuLGMpOwogICAgfQogICAgfQo=