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 ?
This is a discussion on five digit number with different digits within the C Programming forums, part of the General Programming Boards category; hello, how can i find the amount of five digit numbers with different digits without using arrays, nor strings. i ...
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 ?
HOPE YOU UNDERSTAND.......
By associating with wise people you will become wise yourself
It's fine to celebrate success but it is more important to heed the lessons of failure
We've got to put a lot of money into changing behavior
PC specifications- 512MB RAM, Windows XP sp3, 2.79 GHz pentium D.
IDE- Microsoft Visual Studio 2008 Express Edition
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.
Not everything that can be counted counts, and not everything that counts can be counted
- Albert Einstein.
No programming language is perfect. There is not even a single best language; there are only languages well suited or perhaps poorly suited for particular purposes.
- Herbert Mayer
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) = ?
"Owners of dogs will have noticed that, if you provide them with food and water and shelter and affection, they will think you are god. Whereas owners of cats are compelled to realize that, if you provide them with food and water and shelter and affection, they draw the conclusion that they are gods."
-Christopher Hitchens
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...
"I am probably the laziest programmer on the planet, a fact with which anyone who has ever seen my code will agree." - esbo, 11/15/2008
"the internet is a scary place to be thats why i dont use it much." - billet, 03/17/2010
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.
Hope is the first step on the road to disappointment.
exactlyI 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 99999Question: Does a leading 0 count as a 5-digit number?
Ex. 01234, 06789...
to list every single number that fits this criteria.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.
Hope is the first step on the road to disappointment.
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.
Last edited by stevesmithx; 05-03-2009 at 12:43 PM.
Not everything that can be counted counts, and not everything that counts can be counted
- Albert Einstein.
No programming language is perfect. There is not even a single best language; there are only languages well suited or perhaps poorly suited for particular purposes.
- Herbert Mayer