double mcp(register double n) {
double sqrt(double x);
double remainder(double x, double y);
register double d = 3;
register double rt;
if(n < 2) {
return -1;
}
while(divisible(n, 2)) {
n /= 2;
}
if(n == 1) {
return 2;
}
rt = sqrt(n);
while(d <= rt) {
if(divisible(n, d)) {
n /= d;
rt = sqrt(n);
continue;
}
d += 2;
}
return n;
}
int main(int argc, char *argv[]){
int i;
int div[2];
for(i=1;i<=NUM_MAX;i++){
div[0]=divisible(i,3);
div[1]=divisible(i,5);
if((!div[0]||contiene(i,'3'))&&(!div[1]||contiene(i,'5'))) printf("%s\n","fizzbuzz");
else if(!div[0]||contiene(i,'3'))printf("%s\n","fizz");
else if(!div[1]||contiene(i,'5'))printf("%s\n","buzz");
else printf("%i\n",i);
}
}
/* Checks if any primes divide a number */
extern short any_divide(BigNum * number, BigNum * the_primes, long no_of_primes)
{
if (no_of_primes == 1) {
return(divisible(number, &(the_primes[0])));
}
else {
if (divisible(number, &(the_primes[no_of_primes-1]))) {
return(1);
}
else {
return(any_divide(number, the_primes, no_of_primes - 1));
}
}
}
int divisible(int n)
{
int a[10], l = 0, se = 0, so = 0, i;
for (i = 0; n > 0; i++)
{
a[i] = n % 10;
l++;
n = n / 10;
}
for (i = 0; i < l; i++)
{
if (i % 2 == 0)
se = se + a[i];
else
so = so + a[i];
}
if ((se - so) >= 0)
{
if (se == so)
return 1;
else
return divisible(se - so);
}
else
return 0;
}
void divisible(int num)
{
int n = num;
int i = 0;
int se = 0, so = 0;
while (num != 0)
{
if (i % 2 == 0)
se += num % 10;
else
so += num % 10;
num = num / 10;
i++;
}
if (se == so)
{
printf("\nNumber is divisible by 11");
return;
}
else
{
if (se - so < 11)
{
printf("\nNumber is not divisible by 11");
return;
}
else
divisible(se - so);
}
}
int strsum(char *p)
{
int i,n=0,k;
valid(p);
for(i=0;p[i];i++)
n+=p[i]-'0';
n=divisible(n);
return n;
}
void main()
{
int n,k;
printf("enter the number:");
scanf("%d",&n);
k=divisible(n);
if(k==0)
printf("the given number is not divisible by 11");
else
printf("divisible");
}
main()
{
int n, r;
printf("ENTER ANY NUMBER :");
scanf("%d", &n);
r = divisible(n);
if (r == 1)
printf("\nTHE GIVEN NUMBER IS DIVISIBLE BY 11");
else
printf("\nTHE GIVEN NUMBER IS NOT DIVISIBLE BY 11");
getch();
}
int main(){
register unsigned int i = 21;
for(;; i++){
printf("coco : %d\n", i );
if(divisible(i))
break;
}
printf("Result : %d\n", i);
return 0;
}
int main()
{
int n;
//int i;
printf("\nEnter a number: ");
scanf("%d", &n);
divisible(n);
/*if (i == 1)
printf("\nNumber %d is divisible by 11",n);
else if (i == 0)
printf("\nNumber %d is not divisible by 11",n);*/
getch();
return 0;
}
int divisible(int n)
{
int d,s=0;
while(n>0)
{
d=n%10;
s=s+d;
n=n/10;
}
if(s>9)
return divisible(s);
else{
if(s==0||s==3||s==6||s==9)
return 1;
else
return 0;
}
}
int main(int argc, char* argv[])
{
// Benchmark variables
double start, end;
// Helper variables
unsigned int i = 1, summatory = 0;
// Algorithm start
start = clock();
// Algorithm start
do
{
summatory += i++;
if( divisible(summatory) > ITERATION)
break;
}while(true);
// Algorithm end
end = clock();
printf("Algorithm end, Time: %f\n", (end - start)/CLOCKS_PER_SEC);
printf("%d\n", summatory);
return 0;
}
int divisible(int n)
{
int d,i=0,s=0,f=0,flag=0;
if(n==0)
return flag;
while(n>0)
{
d=n%10;
if(i%2==0)
s=s+d;
else
f=f+d;
n=n/10;
i++;
}
//for(j=0;j<i;j=j+2)
// s+=a[j];
//for(k=1;k<i;k=k+2)
// f+=a[k];
if(s==f)
return flag=1;
else
return divisible(s-f);
}
