Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
Pretty much to sum up my thoughts, I like to think I'm not an elitist prick. I use Linux because Windows is expensive. I use Linux because compared to other Unix likes it is more polished. I use Linux because I fix Windows computers for a living, and I really don't like coming home to the shit I have to deal with at work.
- don't care about viruses and spywareSo get a virus scanner or firewall?
Virus scanners frequently don't work. If they did I wouldn't have a job. I typically have to manually remove malware from a computer manually because no virus scanners pick up the file. (files that virustotal.com 0/39)
- operating system doesn't crash when running more than 2 applicationsThat depends on your system specs, doesn't it? I could run ten times that with my 1,6 Ghz CPU and 512 MB RAM. I guess yours sucks then.
Come now, the process scheduler for Linux is way better. Seriously, have you actually used Linux? Right now I'm generating a fractal movie and my load average is near 4.0, and I can still watch a movie without it skipping.
- free operating systemEver heard of pirating?
I'm not against people making money off of programming, if they want to. Actually, this is where I want to do eventually. If you don't want to pay for Windows. piracy isn't the best option.
- easier to use when used to itThat's VERY subjective though.
It is subjective, but it's also better documented. Linux is still a little rough around the edges, and if you care about polish and want to pony up $300 for a copy of Vista that's your prerogative.
Moreover, from the perspective of someone who fixes broken computers for a living, I've got a pretty good idea of some of the complexities of support for both Linux and Windows. And to be honest, Windows is more self healing, but when it screws the pooch it really, really screws the pooch.
For instance, Stop: 0x0000C1F5. This blue screen happens when something screws up during a Vista SP1 installation. This bluescreen is caused by disk corruption in the Transaction File Log. This is part of the NTFS FileSystem, and before I solved this issue (Fri Mar 07, 2008 2:57 pm) the only way to fix this issue is zero fill the disk and then reinstall Vista. A simple reinstall wouldn't work because it would crash the installer. You can't back up the disk to another computer running Vista because it will crash that computer too.
What's the fix? Boot into Linux (preferably a distribution with ntfs-3g) and:
Me, on the GS forums wrote:
Replace /dev/sda1 with the appropriate block device for your hard drive's active partition.
Code:
mount -t /dev/sda1 /disk
cd /disk/\$Extend/\$RmMetadata
cp \$Txf \$Txf.bak
cp \$TxfLog \$TxfLog.bak
rm -rf \$Txf/* \$TxfLog/*
cd /disk/Windows/System32/config
cp TxR TxR.bak
rm -rf TxR/*
cd /
umount /disk
And then Ctrl+Alt+Delete and the computer should boot.
This requires a running non-Windows kernel. A Windows kernel will not let you enter the $Extend directory or modify its contents.
I still get about 1 of these every month, and at the peak I got about 6 of these in a day. When a fix for a rather common problem requires knowing the gory details of your filesystem's metadata, well, something's wrong with that.
- operating system doesn't eat up 15 Gigabytes of Disk SpaceThe price ratio is around 0.8$/GB if I'm not mistaken, so I guess you can afford that.
But why waste it?
- operating system doesn't need 2 Gigs of RAM to run smoothFYI Vista needs 1 GB, XP needs MUCH less. I could run it smoothly with my 512 MB rig as stated above.
System requirements for XP is 128MB of Ram, system requirements for Vista with Aero enabled is 1 GB. It's not pleasant to run XP with 128MB RAM and it's not fun to run Vista with 1 GB.
- software for everything you need, but free (legally)I have software for everything I need, legally.
Except, you know, Windows.
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
Bisqwit wrote:
dunnius wrote:
Xkeeper wrote:
There is one, turn off Javascript
On my old G4 Mac that I use for seeding the videos, the animation causes the CPU usage to go to 100%.
On X11 based Firefox clients, the animation indeed causes horrible CPU usage.
Therefore I have disabled it for X11 based Firefox clients, identified by the string "X11;" in the HTTP user agent. If "G4 Mac" has this same mishap, maybe I should disable it for that one too.
However, I do not know how to identify G4 browsers.
How odd, I'm using firefox, and Mario shows up for me on the workbench. It doesn't however om nom nom my CPU time.
My Useragent is: Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv:1.9.0.5) Gecko/2008121623 Ubuntu/8.10 (intrepid) Firefox/3.0.5
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
CtrlAltDestroy wrote:
Sorry if this was already known, but I was playing SMB3 on the Wii the other day and accidentally did this, and it looks like it could maybe be useful in a 100% TAS, so I'll put it on the table.
http://dehacked.2y.net/microstorage.php/info/1921995004/wand.fm2
Grabbing the wand off the top of the screen, take note of how fast the falling sequence happens.
This is already known, and it's performed in the Mario Adventure TAS.
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
This is a dump of the code received for the contest. I will write up some commentary later on, if anyone wants to write up commentary for their own code, let me know. (or, you know, just post it here)
46 characters, by DK64 and DarkKobold, written in Matlab
print 1," ".join(str(i) for i in range(1001)if any(not i%k for k in range(2,i))and i%7)
96 characters, by Andymac, written in Python
d='1'
for i in range(1001):
if i%7>0and any([i%n==0for n in range(2,i)]):d=d+' '+str(i)
print d
96 characters, by POV-Ray Mascot, written in Haskell
k=[x|x<-[1..1000],not(all(>0)[mod x y|y<-[2..x-1]])&&mod x 7>0];main=putStr$unwords$map show$1:k
101 characters, by Bisqwit, written in QBASIC
?"1";:FOR n=1TO 1000
IF n MOD 7THEN
FOR c=2TO n\2:IF n MOD c=0THEN?STR$(n);:EXIT FOR
NEXT
END IF
NEXT
102 characters, by Bisqwit, written in GW-BASIC
1?"1";:FOR n=1TO 1000
2IF n MOD 7=0THEN 5
3p=n:FOR c=2TO p\2:IF p MOD c=0THEN?STR$(p);:p=1
4NEXT
5NEXT
105 characters, by Pauli, written in Python
o='1'
for p in filter(lambda n:n%7>0 and any([n%i<1 for i in range(2,n)]),range(1001)):o+=' %d'%p
print o
118 characters, by YtterbiJum, written in Python
import sys
w=sys.stdout.write
w('1')
for i in range(1001):
if i%7!=0 and any([i%n==0 for n in range(2,i)]):w(' %d'%i)
145 characters, by Pauli, written in C#
using System;class P{static void Main(){Console.Write(1);for(int n=2;n++<1E3;)for(int i=1;++i<n;)if(n%i<1&&n%7>0){Console.Write(" "+n);break;};}}
149 characters, by qFox, written in java
class B{public static void main(String[] a){int i,j;System.out.print(i=1);for(;i++<1e3;)for(j=1;++j<i;System.out.print(i%7>0&&i%j<1?" "+(j=i):""));}}
150 characters, by Blublu, written in java
class r{public static void main(String[]a){String s="1";for(int n,i=1;i<1001;i++)for(n=2;n<i;n++)if(i%n==0&i%7>0){s+=" "+i;n=i;}System.out.print(s);}}
260 characters, by YtterbiJum, written in Whitespace (transliterated, spaces become A and tabs become B, newline becomes C, remove the newlines I inserted to stop the page from breaking)
345 characters, by AndyMac, written in LOLCODE (untested, my interpreter didn't understand LOL LOLCATS R 2, but LOLCODE is still not syntactically stable.)
HAI
CAN HAS STDIO?
I HAS A CHEEZEBURGER
I HAS A LOLCATZ
IM IN YR LOOP
UP CHEEZEBURER!!1
LOL LOLCATZ R 2
IM IN YR LOOP
IZ CHEEZEBURGER LEFTOVER LOLCATZ LIEK 0 AND CHEEZEBURGER LEFTOVER 7 NOT LIEK 0?
YARLY
VISIBLE CHEEZEBURGER
GTFO
KTHX
UP LOLCATZ!!1
IZ CHEEZEBURGER LIEK LOLCATZ? GTFO. KTHX
KTHX
IZ CHEEZEBURGER LIEK 1000? GTFO. KTHX
KTHX
KTXHBYE
502, by Pauli, uses Befunge
" 1",,4v @
>11p11g8555***`|
+ 1
1 1
g
g 7
1 %
1 v p331 _v
^ < <
2
2
.2
gp
1v p<
12 2
^ _^2 2
g g +
3 >11gv 1
3 v -1< g
2
` 2
^ _11g22g%|
^ p330<
EDIT: Postmortem submissions:
118 characters, by bkDJ, written in C++
#include <iostream>
int main(){for(int n=1,c;n<1001;++n){for(c=2;n>1&&c<n&&n%c++;){}if(n%7&&c-n){std::cout<<n<<" ";}}}
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
Eh, I'm more than willing to change the rules to make them more permissive if I feel I've made a mistake (which I do in this case,) but I'd be against changing the rules to make it less permissive.
In other news, with the latest leader board update I should have all of the backlog taken care of. If I missed your entry it was probably just an oversight, please notify me.
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
The reason for the rule change is mostly because someone pointed out to me that the actual codegolf.com's rules function in that fashion (which is what I was initially aiming for anyway.)
http://codegolf.com/help wrote:
What are the rules for entering?
You can upload any code that you believe will fulfill the requirements of the challenge. There are no requirements on how you format your code in terms of line length or number of lines. You can enter all challenges, and you can enter them using all of the available languages if you want to.
There are a couple of restrictions that may affect you :
* You can only submit an entry every 2 minutes.
* You can only upload files which are equal to or smaller than 51,200 bytes in size.
* You will be unable to import/require/include any modules or files in your solution. You have to write all the code yourself, and it has to be in the code file you upload.
There are a couple of things about your code's execution that might be useful to know :
* Execution of your code will stop after 4 seconds of wall time. Any code which is stopped in this manner will be deemed to have failed.
* Trailing whitespace from your output and the reference output you are trying to match will be stripped when they are being compared.
If you are unsure about whether or not your output will match with the expected output I wrote a short perl script to pipe your output through before passing it through md5sum:
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
Because of general outcry, feeling bad about rejected otherwise functional code, and having read over the rules at codegolf.com regarding this, I'm removing the requirement to not have trailing whitespace. I'm working to restore the leaderboard from entries already received.
I will strip trailing whitespace from any output before comparing it to the expected output from here on out.
No need to resubmit at this time.
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
Mitjitsu wrote:
I might try this some time next week. Doing the challenge isn't hard, it's coming up with the most efficient possible code. Would it be defined by the least lines or characters?
I count characters, whitespace does count as a character, if you are on a \r\n OS and your submission is more than one line long you might want to strip out that \r.
It would be very unfair of me to strip whitespace out of the count because if someone wants to make a submission using whitespace then it's an autowin. :)
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
qFox wrote:
andymac> maybe this will help... (was gonna post this anyways ;p)
[12:39:36] <Didgeridoodle> I need to contact one of those code golf pythoners from the forum
[12:40:25] <Didgeridoodle> tell them a secret :>
[12:40:47] <Shinryuu> secret... what kind of secret?
[12:41:34] <Didgeridoodle> if they do this:
[12:41:43] <Didgeridoodle> print("hello world"),
[12:41:49] <Didgeridoodle> with that comma afterwards, yes
[12:41:59] <Didgeridoodle> then print will not print a newline
Actually, I know this behavior. To be honest, I was surprised when I found out if that is the last print statement in the program and no other function prints characters to the screen, then python will put in a line feed anyway when the program exits. JOY
example:
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
I'd like you to count to one million and skip every prime number and every number divisible by 7 as a demonstration that no one is perfect.
<curtmack> Okay I am now constructing a text file entitled "Numbers from 1 to 1 million skipping primes and multiples of 7.txt"
<curtmack> after which I'll have a response for OmnipotentEntity
<curtmack> of course I'm cheating since I'm using a program
<curtmack> it's 5.2 megabytes
<curtmack> I took it as a challenge
<curtmack> gedit got confused about the encoding
<OmnipotentEntity> curtmack, code golf it,
<OmnipotentEntity> I'll challenge you.
So open challenge, code golf this, standard code golfing rules apply. PM me your code, several versions are OK, challenge closes at 7 Jan 7:00AM GMT. I'll keep a leaderboard here and update it continuously as submissions come in and release the code after the challenge is done.
I have my single submission, I, of course, cannot improve upon it when I begin receiving submissions. So my submission is immutable.
For brevity and execution speed, this challenge is for only numbers up to 1000. You may use any language and they will be placed in the following categories (partially arbitraily chosen):
a) perl
b) php
c) python
d) ruby
e) anything and everything else
expected output:
Notice, space delimited. Trailing whitespace will be removed from your submission before it is compared against the expected output.
EDIT: A few of you have been not getting the formatting down so, the md5sum of solution is: e5520566aa3e1456e05d1f17d91ab9d4
To check your solution simply run the program, strip the whitespace from the end and pipe the output to an md5sum utility. (contact me if you need help doing this.)
EDIT: Clarification, output is expected to STDOUT, not to a file.
EDIT: Code written in a different language will be accepted and placed into another category, I just don't know how much interest this will generate so I didn't want to overwhelm people.
EDIT: Yes, you may submit code as many times as you would like in as many different languages as you like.
EDIT: Clarification, leaderboard values are in characters, not in lines.
EDIT: Clarification, of the categories and allowed languages.
EDIT: Removed the no trailing whitespace requirement, walking through the submissions to find the ones that I rejected under that rule but are valid now.
Leaderboard:
Perl:
56, OmnipotentEntity*
61, Bisqwit
76, Blublu
PHP:
60, qFox & Bisqwit
62, Tub
69, Bisqwit
75, pauli
84, qFox
Python:
83, lagdotcom
87, Mueen Nawaz
96, andymac
105, pauli
118, YtterbiJum
Ruby:
50, flagitious
59, pauli
79, Bisqwit
Others:
46, DK64_Master & DarkKobold (uses matlab)
79, Bisqwit (uses Javascript)
82, Warp (uses C, produces bad output when used with -O flags)
83, Warp (uses C)
84, Bisqwit (uses C)
96, POV-Ray Mascot (uses Haskell)
101, Bisqwit (uses QBASIC)
102, Bisqwit (uses GW-BASIC)
145, pauli (uses C#)
149, qFox (uses java)
150, Blublu (uses java)
260, YtterbiJum (uses WhiteSpace)
345, Andymac (LOLOLOLOL)
507, Pauli (uses befunge)
Postmortem submissions:
118, bkDJ (uses C++)
* (immutable score)
Leaderboard update: updated at 12/30/2008 17:30 GMT, several new versions were submitted, I don't have time to test them all yet, remember your md5sum should be e5520566aa3e1456e05d1f17d91ab9d4
Leaderboard update: updated at 12/31/2008 3:15 GMT, removed rejected versions, will send PM replies instead, flagitious blew right into the lead with an amazing ruby hack, I still haven't tested the PHP code, I'll get that done in the next few hours.
Leaderboard update: updated at 1/1/2009 2:15 GMT, Blublu updated his java version and shaved a few characters, pauli updated his ruby submission a bit and shaved of a few as well.
Leaderboard update: updated at 1/1/2009 6:00 GMT, pauli submitted a C# and a php version, added them
Leaderboard update: updated at 1/2/2009 19:30 GMT, should be up to date, if I'm missing you let me know.
Leaderboard update: Pauli and blublu are duking it out java vs. C#, it's kinda entertaining, *popcorn*
Leaderboard update: updated at 1/7/2009 20:00 GMT, all submissions have been updated, I'm writing up the synopsis of the code received, thanks for the submissions. It's been fun. :D
Leaderboard update: updated at 1/7/2009 20:30 GMT, opps missed pauli's 75-byte PHP solution, corrected
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
Xkeeper wrote:
OmnipotentEntity wrote:
Besides, you can't simply sort by movie number or author name under the filename scheme.
That isn't the point. The point of this is to make movie filenames useful. Sorting is still applicable, as it will sort by game, then goal, then date and so on (at least alphabetically).
If you want sorting by movie number or author, use the site. This is primarily to make it so that a key input movie stores information about what the hell it is.
It completely fucking boggles my mind how such a simple concept gets so much opposition.
I'm not in opposition to this, I'm just playing devil's advocate and trying to determine what the hell it is you want. I'd actually like to see this implemented. :)
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
