|Perl: the Markov chain saw|
Hi! Im a newbie to PERL.
I came across a size contest in spoj. The Problem was:
The number of inputs will be given as the first input. After that, a series of numbers both positive and negative are given. The program has to count only the values of the positive numbers and display the result. Eg,
Input: 5 2 -2 3 4 Output: 9
For this problem, i wrote a Perl Program. This was my Program:$a=<>; ($x=<>)>0 ? $_ += $x : 0 while $a--; print
I've heard Perl excels in short programs. But i cant make it any shorter!
Can u guys help me make it shorter???
Btw, the shortest solution length was a mind boggling "6" characters long!!!! OMG!!!
Note: Actually the characters whose ASCII values are >=32 are only counted as characters