Staredit Network Profile-Scene BOW basic
Profile for BOW
Options
Send me a Message
Find my Posts
Find my Topics

Last visitors
None.

Account Information
Joined: May 31 2009, 3:17 am
Last Active: May 31 2009, 3:33 am
Status: Offline
Display Name: BOW

Statistics
Activity: 1
Posts: 0
Posts Per Day: 1
Topics: 0
Minerals: 0

Contact Information
E-Mail: Lewl coming soon // No spambots

Battle.net
Starcraft I: Not Given.
Starcraft II: Not Given.


Signature
None.
[05:33 am]
O)FaRTy1billion[MM] -- except when in my attempts to optimize I forget to make a duplicate case not possible. :P
[05:33 am]
O)FaRTy1billion[MM] -- These are pretty easy ;o
[05:32 am]
O)FaRTy1billion[MM] -- Congratulations, the answer you gave to problem 12 is correct. You are the 112723rd person to have solved this problem.
[05:25 am]
O)FaRTy1billion[MM] -- and apparently there is a problem. :(
[05:23 am]
O)FaRTy1billion[MM] -- So I made the change, ran the program again, and it finished almost immediately. xD
[05:23 am]
O)FaRTy1billion[MM] -- lol, my program was running and running and running, then I realized how silly it is for me to do "for(i=1;i<=a;i++){ if((a%i) == 0) c++; } return c;" since every time you find a divisor of a number, you can divide the number to get a new max value that rapidly gets less and less.
[05:11 am]
jjf28 -- farty's clearly mafia
[05:00 am]
O)FaRTy1billion[MM] -- for(a=0,i=1;r<500;a+=i++) oh, what fun!
[04:57 am]
O)FaRTy1billion[MM] -- woo, I get to a+=i++; :awesome:
[04:51 am]
O)FaRTy1billion[MM] -- Disregard. I was printing the wrong variable. :wob:
Please log in to shout.


Members Online: jjf28, O)FaRTy1billion[MM]