### Solved Problem 29

parent 220032e3
Showing with 35 additions and 0 deletions
29/README 0 → 100644
 Question: Consider all integer combinations of a^b for 2 <= a <= 5 and 2 <= b <= 5: 22=4, 23=8, 24=16, 25=32 32=9, 33=27, 34=81, 35=243 42=16, 43=64, 44=256, 45=1024 52=25, 53=125, 54=625, 55=3125 If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms: 4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125 How many distinct terms are in the sequence generated by ab for 2 <= a <= 100 and 2 <= b <= 100? Answer: 9183
29/main.cpp 0 → 100644
 #include #include #include using namespace std; const int MIN = 2; const int MAX = 100; int main() { map list; for(int a = MIN; a <= MAX; a++) { for(int b = MIN; b <= MAX; b++) { list[pow(a,b)] = true; } } cout << list.size() << endl; return 0; }
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!