-
2064659·text·935 B·2011-05-19 13:52 UTC
tried the demonstration map.
1. i can't tell where i am on the mini map.
2. my one city has 2^16-1 movement points.
3. all of my units have hitpoints of "-". shouldn't they have numbers there?
4.
-
2064657·php·1.6 KB·2011-05-19 13:49 UTC
<?php get_header(); ?>
<div class="solkisim">
<?php if (have_posts()) : while (have_posts()) : the_post(); ?>
<div class="yazilar">
<div class="has2">
<div class="tarih" style="font-fami
-
2064647·text·6.2 KB·2011-05-19 13:45 UTC
Simon:
We've had a few thoughts about the driver instructor training, and thought it easier to put them down on paper rather than try and remember the details for a phone call.
Although you ma
-
2064642·text·3.5 KB·2011-05-19 13:37 UTC
XML parsing failure
[ 7004.080291] =============================================================================
[ 7004.082946] BUG kmemleak_object: Poison overwritten
[ 7004.087829] --------------
-
2064600·text·924 B·2011-05-19 13:11 UTC
static void R_DrawSkyMesh(batch_t *batch, mesh_t *m, shader_t *shader)
{
static entity_t skyent;
batch_t b;
//float time = cl.gametime+realtime-cl.gametimemark; //warning: unused variable ‘time
-
2064589·python·168 B·2011-05-19 13:02 UTC
def eat(food):
eat.stomach.append(food)
print 'In my stomach:', eat.stomach
eat.stomach = []
eat('yangmeat')
eat('chicken')
eat('cocas')
eat('cocoa')
-
2064575·python·166 B·2011-05-19 12:56 UTC
def eat(food, inmystomach=[]):
inmystomach.append(food)
print 'In my stomach:', inmystomach
eat('yangmeat')
eat('chicken')
eat('cocas')
eat('cocoa')
-
2064572·text·1.4 KB·2011-05-19 12:54 UTC
888 888 888 d8b d8b 888
888 888 888 Y8P Y8P 888
888 888 888 888
888
-
2064571·python·155 B·2011-05-19 12:52 UTC
def recursivetest(a, depth=3):
if depth > 0:
return recursivetest(a * 2, depth - 1)
else:
return a
print(recursivetest(3))
-
2064570·text·333 B·2011-05-19 12:52 UTC
_ _ _ _ __ ____ ___ ____ __ _ _
( )/ ) ( )_( ) /__\ ( _ \ (_ _) (_ _ ) /__\ ( )_( )
) ( ) _ (
-
2064559·cpp·199 B·2011-05-19 12:43 UTC
n = a.length();
int lo = 0, hi = n - 1, ret = 0;
while(lo < hi)
{
while(lo < hi &&a[lo] == 'W') lo++;
while(lo < hi && a[hi] == 'B') hi--;
if(hi > lo) ret++;
}
-
2064544·bash·133 B·2011-05-19 12:21 UTC
if ( -d $f ) then
if ( `ls $f | wc -l` > 0 ) then
foreach f1 ($f/*)
# Whatever
end
endif
endif
-
2064542·text·307 B·2011-05-19 12:16 UTC
download_rate=0
upload_rate=0
max_uploads=100
max_peers=1000
min_peers=200
directory=/media/250/rtorrent
session=/home/torrents/session
schedule=omg_rss_sct,5,5,load_start=/home/torrents/watch/
-
2064536·text·530 B·2011-05-19 12:10 UTC
natalie@ubuntu:~/Downloads$ sudo dpkg -i install skype-ubuntu_2.2.0.25-1_i386.deb
dpkg: error processing install (--install):
cannot access archive: No such file or directory
Selecting previously
-
2064513·text·443 B·2011-05-19 11:56 UTC
Job {
Name = "xen01-day"
Type = Backup
Client = xen01-fd
JobDefs = "DefaultJob"
FileSet = "xen01f-set"
Schedule = "diff-day"
Storage = Na
-
2064509·php·213 B·2011-05-19 11:55 UTC
echo "<a href=\"index.php?strona=gwarancje.php&id={$row['id']}\">{$i}. {$row['nazwa']}</a> <small>(do {$date})</small>";
echo HTM::anchor("index.php?strona=gwarancje.php&id={$row['id']}", "{$i}. {$ro
-
2064508·text·213 B·2011-05-19 11:54 UTC
echo "<a href=\"index.php?strona=gwarancje.php&id={$row['id']}\">{$i}. {$row['nazwa']}</a> <small>(do {$date})</small>";
echo HTM::anchor("index.php?strona=gwarancje.php&id={$row['id']}", "{$i}. {$ro
-
2064426·text·4.4 KB·2011-05-19 11:06 UTC
### Eclipse Workspace Patch 1.0
#P org.jboss.ide.eclipse.as.core
Index: jbosscore/org/jboss/ide/eclipse/as/core/server/internal/LocalJBossBehaviorDelegate.java
=====================================
-
2064425·python·10.3 KB·2011-05-19 11:06 UTC
global level
import time
import random
global exp
global stre
global agi
global long_sword
global long_sword_str
global gold
global exp_c
global name
global fist
global fist_str
global he
-
2064415·c·516 B·2011-05-19 10:51 UTC
// To sort array a[] of size n: qsort(a,0,n-1)
void qsort(int a[], int lo, int hi)
{
int h, l, p, t;
if (lo < hi) {
l = lo;
h = hi;
p = a[hi];
do {
while ((l