int main(void){
int n = 0, m = 0, f = 0;
int i = 0;
unsigned long number1 = 4778, number2 = 8477;
n = is_permutation(number1,number2);
for(i = 100; i < 1000000 ; i++){
if(is_staggering(i) == 0){
m++;
}
}
f = is_permutation_nostring(number1,number2);
printf("%d\n%d\n%d\n",n,m,f);
return 0;
}
int main(void)
{
unsigned long n1 = 743526;
unsigned long n2 = 237654;
unsigned long n3 = 743526;
unsigned long n4 = 123765;
unsigned long n5 = 66666;
unsigned long n6 = 144358;
unsigned long myN = 0;
int myCount = 0;
printf("%d\n", is_permutation(n1, n2) == 1);
printf("%d\n\n", is_permutation_no_strings(n1, n2) == 1);
printf("%d\n", is_permutation(n3, n4) == 0);
printf("%d\n\n", is_permutation_no_strings(n3, n4) == 0);
printf("%d\n", is_staggering(n5) == 1);
printf("%d\n", is_staggering(n6) == 1);
printf("%d\n", is_staggering(n1) == 0);
for(myN = 100; myN < 1000000; myN++)
{
if(is_staggering(myN) == 0)
{
myCount++;
}
}
printf("%d", myCount+100);
return 0;
}
