|
User Name
|
Shadow |
|
Unique Hits
|
1,129 |
|
Real Name
|
JD |
|
Location
|
United States
Alabama |
|
Occupation
|
- - - |
|
Gender
|
Male |
|
Age
|
- - - |
|
WebSite
|
- - - |
|
|
|
|
'Variable' Class
|
C++
|
3.15 Years Ago
|
4
|
|
- - -
|
Yes
|
1,357 Chrs
|
|
|
Basically it's a class that can be handled as an int, char*, string, or a vector of int's, char*'s, string's, or vector's of.. yeah.
|
|
|
|
Project Euler #4
|
C++
|
3.95 Years Ago
|
4
|
|
8.00
|
- - -
|
657 Chrs
|
|
|
Project Euler #4
A palindromic number reads the same both ways.
The largest palindrome made from the product of
two 2-digit numbers is 9009 = 91 × 99.
Find the largest palindrome
|
|
|
|
Project Euler - Problem 2
|
C++
|
3.96 Years Ago
|
0
|
|
- - -
|
- - -
|
358 Chrs
|
|
|
Solution to #2 on Project Euler.
"Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13,
|
|
| Please login to post comments. |
|
|
Hey, how's it going? I see you've played around with Project Euler. How
many problems have you solved so far?
|
|
|
