http://www.madras.fife.sch.uk/maths/...s/fact020.html
Hi, just thought I would share what I've been wanting to work on for several months, and just in the past couple of days finally decided to learn how to make.
Vampire Number Finder/Hunter (name isn't important)
There are other vampire numbers beside the multiplication type but for now I want to stick with just these to keep it simple.
(## x ## x ##) Fangs: _ (min=2)
(### x ###) Fang Digits: _ (min=2)
I'll let this code snippet show you how far I've gotten:
I've been wracking my brain tying to figure out how to do different numbers of fangs without writing a bunch of different nested for loops...Code:#include <iostream>
int main()
{
int digits;
int t1 = 1;
int t2 = 9;
int i1;
int i2;
int i3;
int i4;
std::cout << "Fang Digits: ";
std::cin >> digits;
for (i1 = 1; i1 < digits; i1++)
{
t1 = t1 * 10;
}
for (i2 = 1; i2 < digits; i2++)
{
t2 = t2 * 10 + 9;
}
std::cout << t1 << " to " << t2 << std::endl;
for (i3 = t1; i3 <= t2; i3++)
{
for (i4 = t1; i4 <= t2; i4++)
{
std::cout << i3 << " x " << i4 << " = " << i3 * i4 << std::endl;
}
}
return 0;
}
ps: I've been at this only 2 days. (can't get past pointers in most online tutorials)