hello,
how can i find the amount of five digit numbers with different digits
without using arrays, nor strings.
i know one way is to separate the number into digits and make about 10 if's ,
is there a better way ?
Printable View
hello,
how can i find the amount of five digit numbers with different digits
without using arrays, nor strings.
i know one way is to separate the number into digits and make about 10 if's ,
is there a better way ?
It's not much clear what you are after.
From what I can infer, you want to parse each digit of a number separately.
This can be done(for decimal number system) by some division and modulo logic with 10.
So, you want the number of permutations of 10 items (digits) taken 5 at a time? If you count a high order zero digit as a possibility, then:
P(n,r) = n! / (n-r)!
P(10,5) = ?
Code:for (i = 10000; i < 100000; i++)
printf("%d\n", i);
what i want is
how many five digit numbers with all different digits exists?
but without using strings, nor arrays...
the most simple way is parse each number into five variables, and check for equality every pair...
is there a better way to do it ?
I think he means where each digit of the number is different.
Ex. 12345, 12346, 12347, 23456, 23457...
Question: Does a leading 0 count as a 5-digit number?
Ex. 01234, 06789...
What is your goal? To list every single number that fits the criteria, or to simply test a given number to see if that fits? That will determine how hard this task is. Start with the latter. Get a function that will return true or false for you, letting you know if a given number fits. Then if you need the former, use that function in a loop.
Quzah.
exactlyQuote:
I think he means where each digit of the number is different.
Ex. 12345, 12346, 12347, 23456, 23457...
no, five digit numbers in range from 10000 till 99999Quote:
Question: Does a leading 0 count as a 5-digit number?
Ex. 01234, 06789...
to list every single number that fits this criteria.Quote:
What is your goal? To list every single number that fits the criteria, or to simply test a given number to see if that fits? That will determine how hard this task is. Start with the latter. Get a function that will return true or false for you, letting you know if a given number fits. Then if you need the former, use that function in a loop.
functions, strings, arrays, pointers are not allowed
Well get to work. I don't see you doing anything with all of our suggestions.
Quzah.
Quote:
i know one way is to separate the number into digits and make about 10 if's ,
is there a better way ?
yes i did
I am pretty sure there would always be a better way to solve any problem no matter what it is.
So unless you post your code, i am afraid the chances of getting an useful reply are bleak.
Edit:
One inefficient way that i can think of is to use brute force to try all the combinations using five loops and
filter out the unwanted numbers using one or more ifs. Of course, some better solutions than
this are possible.