-
2047625·text·179 B·2011-04-18 04:43 UTC
For sure:
[C]
AnoHana
Irohana
Gintama
Probably/Maybe:
Ao no Exorcist
Deadman Wonderland
Tiger and Bunny
Sket Dance
Steins;Gate
Probably not:
Nichijou
Dog Days
-
2047621·text·633 B·2011-04-18 04:24 UTC
http://www.openoffice.org/
http://projects.gnome.org/dia/
http://www.abisource.com/
http://inkscape.org/
http://www.scribus.net/canvas/Scribus
http://bluefish.openoffice.nl/index.html
-
2047617·text·127 B·2011-04-18 03:47 UTC
char num;
.
.
.
for (int s =10;s!=41;s++){
num = char(s)+".txt";
outputFile(num);
.
.
.
outputFile.close();
}
-
2047612·text·4 B·2011-04-18 03:04 UTC
¬¬
-
2047609·text·205 B·2011-04-18 02:45 UTC
on *:TEXT:*:#valvearg2-alpha:{
if (%b == $null) { set %b 1
}
if (%b < 5) {
inc %b
timer 1 10 unset %b
}
if (%b == 5) { mode $chan +m
unset %b
timer 1 30 mode $chan -m
-
2047607·bash·3.6 KB·2011-04-18 02:37 UTC
#! /bin/sh
### BEGIN INIT INFO
# Provides: virtualbox-!!SHORTNAME
# Required-Start: $local_fs $remote_fs vboxdrv vboxnet
# Required-Stop: $local_fs $remote_fs
# Default-Start:
-
2047606·text·3.6 KB·2011-04-18 02:36 UTC
#! /bin/sh
### BEGIN INIT INFO
# Provides: virtualbox-!!SHORTNAME
# Required-Start: $local_fs $remote_fs vboxdrv vboxnet
# Required-Stop: $local_fs $remote_fs
# Default-Start:
-
2047605·text·477 B·2011-04-18 02:33 UTC
>>> import re
>>> re.compile("(HP\s*(?P<curhp>[0-9]+)/(?P<maxhp>[0-9]+))")
<_sre.SRE_Pattern object at 0xb76576b0>
>>> a=re.compile("(HP\s*(?P<curhp>[0-9]+)/(?P<maxhp>[0-9]+))")
>>> c=a.match("HP
-
2047604·text·1.1 KB·2011-04-18 02:09 UTC
Tracing route to 67.230.181.246 over a maximum of 30 hops
1 3 ms <1 ms <1 ms 10.10.47.2
2 17 ms 16 ms 16 ms cgsc-d10a-wan-rt1.sjrb.ad [10.1.140.129]
3 17 ms 16 ms
-
2047603·text·207 B·2011-04-18 02:08 UTC
on *:TEXT:*:#valvearg2-alpha:{
if (%b == $null) { set %b 1
}
if (%b < 5) {
inc %b
timer 1 10 unset %b
}
if (%b == 5) { mode $chan +m
unset %b
timer 1 30 mode $chan -m
-
2047602·text·2.4 KB·2011-04-18 02:06 UTC
// ==UserScript==
// @name EightSixTwo
// @namespace http://blog.xkcd.com/2011/02/18/distraction-affliction-correction-extensio/
// @description An extension for distraction affli
-
2047601·text·2.6 KB·2011-04-18 02:06 UTC
// ==UserScript==
// @name EightSixTwo
// @namespace http://blog.xkcd.com/2011/02/18/distraction-affliction-correction-extensio/
// @description An extension for distraction
-
2047598·text·232 B·2011-04-18 02:01 UTC
http://kimjongillookingatthings.tumblr.com/post/4586024919/looking-at-snowflakes
http://kimjongillookingatthings.tumblr.com/post/4557341190/looking-at-milk
http://kimjongillookingatthings.tumblr.com
-
2047593·text·1.0 KB·2011-04-18 01:44 UTC
doonz@ss1:~/torrents/complete$ traceroute 67.230.181.246
traceroute to 67.230.181.246 (67.230.181.246), 30 hops max, 60 byte packets
1 192.168.1.1 (192.168.1.1) 0.202 ms 0.188 ms 0.229 ms
2
-
2047592·text·1.4 KB·2011-04-18 01:38 UTC
doonz@ss1:~/torrents/complete$ traceroute passthepopcorn.me
traceroute to passthepopcorn.me (85.17.5.15), 30 hops max, 60 byte packets
1 192.168.1.1 (192.168.1.1) 0.125 ms 0.149 ms 0.187 ms
2
-
2047591·text·189 B·2011-04-18 01:34 UTC
Could not retrieve mirrorlist http://updates.vmd.citrix.com/XCP/1.0.0/domain0/mirrorlist error was
[Errno 14] HTTP Error 404: Not Found
Error: Cannot find a valid baseurl for repo: citrix
-
2047588·php·17.0 KB·2011-04-18 00:53 UTC
<?php
/* cryptbin 0.6 public release */
/* cryptbin is written by Nadim Kobeissi (http://nadim.cc) and released under the
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported licens
-
2047586·text·1.9 KB·2011-04-18 00:27 UTC
Trabalhos práticos
Todos os trabalhos práticos devem ser entregues utilizando as seguintes orientações:
Orientações gerais
* Todos os trabalhos devem ser feitos individualmente, a não ser que
-
2047584·python·1.7 KB·2011-04-18 00:19 UTC
#!/usr/bin/python
# -*- coding: utf-8 -*-
#define max 10
livros = [11,90,123,321,22,34,54]
livros.append(10)
print "\nVetor desordenado: \n"
print livros
tam = len(livros)
def subirHeap(li
-
2047576·python·1.4 KB·2011-04-17 23:59 UTC
#!/usr/bin/python
# -*- coding: utf-8 -*-
#define max 10
livros = [11,90,123,321,22,34,54]
livros.append(10)
print "\nVetor desordenado: \n"
print livros
tam = len(livros)
def subirHeap(li