Printable View
Lookin at your code hurts my eyes.
When I'd like to post, then I will post.
It doesn't look complete. Certainly, it will never be completed. Today or tomorrow there will be other add-ins you might wish to make.
Teachers who work mainly on their own field year after year are more knowledgeable about the area, so comparing them with those who are not sounds really..odd.
I died three years ago, resurection is impossible. Don't you ever propose any conditional terms, do you ?
Whatever...
Whatever .... ;)Quote:
Originally Posted by Skizmo
Should we book a hotel room ?
Sure... whatever.
Pretty darn BS! I believe this thread will live really long. :D :rolleyes: Or whatever...
You know your say gets me on my nerve .
Quote:
Originally Posted by Lucassergei
You forgot the first rule of remake, Lucas: Don't fock with the original-said Sydney in Scre4m. :D
I am finishing my combinatorics class in a few days,
and now running into a little problem,
How can I find out how many ways there are for a sum of distinct positive integers to be half equal to another sum, given that all these integers in both sums are lying within some defined range/domain. (that is they are taken from [1,100] only, for example).
I think this will shows up in the coming test. My answer I bet is undefined, limitless.
Your life ends here soon after today:cry::cry::cry::cry:Quote:
Originally Posted by Ledidas