| JuggaloAnt | so anyone see anything im missing to shorten that code? |
| ology | designing shit to break when updated is a bad practice |
| JuggaloAnt | its $b=0; not just $b; and its x and y now. |
| ofer | are you trying to write obfuscated code ? |
| JuggaloAnt | nah. just trying to make it the shortest possible thats how golf is played =) |
| ofer | yeah, you can do some stuff. |
| RichiH | ofer: the || '' makes sure i do not get undef? |
| ofer | RichiH, yeap. RichiH, it's just fault-tolerance not really needed JuggaloAnt, paste new code, I'll shorten it for you |
| webtroll | wow, i never seen so many nerds in my life... a waste too, considering perl is a joke of a programming language and targetted for use with noob programmers. why not learn something and actually work with a real language? |
| ofer | perlbot, ops |
| perlbot | thrig paladin somni kitchen bod rindolf Chris62vw khisanth tybalt89 simcop2387 sili tag BinGOs beth |
| action | RichiH briefly ponders sorting the thing |
| RichiH | briefly ponders sorting the thing ofer: the input data will be very clean, but yah, i added it |
| JuggaloAnt | for$x(2..97){$y=0;for(2..$x){if($_!=$x&&!($x%$_)){$y=1;}}if(!$y){print"$a is prime.\n";}} for$x(2..97){$y=0;for(2..$x){if($_!=$x&&!($x%$_)){$y=1;}}if(!$y){print"$x is prime.\n";}} ** |
| action | RichiH decides sorting is probably not worth it |
| RichiH | decides sorting is probably not worth it |
| ofer | JuggaloAnt, how many bytes ? |
| JuggaloAnt | the shorter the better. its 87 now i think. |
| ofer | it's 89 |
| JuggaloAnt | from the =0 |