Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: Re: '96 ACM Problem A

by jjdraco (Scribe)
on Oct 12, 2002 at 02:18 UTC ( #204719=note: print w/ replies, xml ) Need Help??


in reply to Re: '96 ACM Problem A
in thread '96 ACM Problem A

hmmm... I'm going to have to give this code a lot of thought. I seem to have a problem thinking this way and the way I wrote it it just seemed to flow better in my mind. I'll see if I can't think through your code, even thow I can understand any given statement in your example, over all I need to do some reflecking on it to really see whats going to. On one note, the reason I took my input from STDIN is it seems to me that is what the problem called for and I wanted to keep to the rules of the problem. In all honesty thow, I guess it doesn't really matter since I'm just doing it for learning perposes anyway

jjdraco
learning Perl one statement at a time.


Comment on Re: Re: '96 ACM Problem A

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://204719]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (6)
As of 2014-07-26 00:31 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (175 votes), past polls