-
2035079·text·1.2 KB·2010-12-31 14:04 UTC
Index: src/common/paws/pawslistbox.cpp
===================================================================
--- src/common/paws/pawslistbox.cpp (Revision 6659)
+++ src/common/paws/pawslistbox.cpp (A
-
2035067·text·807 B·2010-12-31 13:42 UTC
/* sample example: `gcc -o foo bar -lm`
* having inane equation n(n+sqrt(n))=L where:
* n increments as m=1; n=(++m)**2 .. so only integers are used
* the highest value of sqrt(n) is FF (255) so n cou
-
2035057·text·4.5 KB·2010-12-31 13:22 UTC
1 :: 2
4 :: 24
9 :: 108
16 :: 320
25 :: 750
36 :: 1512
49 :: 2744
64 :: 4608
81 :: 7290
100 :: 11000
121 :: 15972
144 :: 22464
169 :: 30758
196 :: 41160
225 :: 54000
256 :: 69632
289 :: 88434
324 :: 1
-
2035052·text·807 B·2010-12-31 13:06 UTC
/* sample example: `gcc -o foo bar -lm`
* having inane equation n(n+sqrt(n))=L where:
* n increments as m=1; n=(++m)**2 .. so only integers are used
* the highest value of sqrt(n) is FF (255) so n cou
-
2035036·text·382 B·2010-12-31 12:38 UTC
on *:TEXT:*done*:#:{
if ($nick != St) { halt }
/scon 1 /msg #Complete-Chan 9 $+ $strip($1-) $+
}
}
on *:TEXT:COMPLETE*:#:{
if ($nick != SCRAP) { halt }
-
2035009·diff·539 B·2010-12-31 11:52 UTC
diff -r f6ba4e16addd -r 378e86913081 v4l/compat.h
--- a/v4l/compat.h Fri Dec 31 12:26:51 2010 +0100
+++ b/v4l/compat.h Fri Dec 31 12:33:14 2010 +0100
@@ -14,7 +14,7 @@
#define INIT_DELAYED_WORK(a
-
2035008·diff·539 B·2010-12-31 11:50 UTC
diff -r f6ba4e16addd -r 378e86913081 v4l/compat.h
--- a/v4l/compat.h Fri Dec 31 12:26:51 2010 +0100
+++ b/v4l/compat.h Fri Dec 31 12:33:14 2010 +0100
@@ -14,7 +14,7 @@
#define INIT_DELAYED_WORK(a
-
2035005·diff·539 B·2010-12-31 11:49 UTC
diff -r f6ba4e16addd -r 378e86913081 v4l/compat.h
--- a/v4l/compat.h Fri Dec 31 12:26:51 2010 +0100
+++ b/v4l/compat.h Fri Dec 31 12:33:14 2010 +0100
@@ -14,7 +14,7 @@
#define INIT_DELAYED_WORK(a
-
2035004·text·539 B·2010-12-31 11:49 UTC
diff -r f6ba4e16addd -r 378e86913081 v4l/compat.h
--- a/v4l/compat.h Fri Dec 31 12:26:51 2010 +0100
+++ b/v4l/compat.h Fri Dec 31 12:33:14 2010 +0100
@@ -14,7 +14,7 @@
#define INIT_DELAYED_WORK(a
-
2034893·text·4.5 KB·2010-12-31 07:50 UTC
1 :: 2
4 :: 24
9 :: 108
16 :: 320
25 :: 750
36 :: 1512
49 :: 2744
64 :: 4608
81 :: 7290
100 :: 11000
121 :: 15972
144 :: 22464
169 :: 30758
196 :: 41160
225 :: 54000
256 :: 69632
289 :: 88434
324 :: 1
-
2034883·text·288 B·2010-12-31 07:22 UTC
/* example code: `gcc -o prd krk.c -lm` */
#include <stdio.h>
#include <math.h>
unsigned main(void)
{
unsigned m, n, l;
m = n = 1;
l = pow(255, 2);
for(n = 1; n <= l; n = pow(++m, 2)) {
unsig
-
2034882·text·823 B·2010-12-31 07:21 UTC
/* sample example: `gcc -o foo bar -lm`
* having inane equation n(n+sqrt(n))=L where:
* n increments as m=1; n=(++m)**2 .. so only integers are used
* the highest value of sqrt(n) is FF (255) so n cou
-
2034879·text·3.9 KB·2010-12-31 07:12 UTC
tom sun says
hi?
Lynn says
hi
tom sun says
oh your lynn arent you?
you have the same name as my firend lol
Lynn says
whoa, what a coincidence, are you guys good friends?
tom sun says
I h
-
2034868·actionscript·103 B·2010-12-31 06:36 UTC
Hello ! I'm new on this forum, hope to talk to you soon :)
I love carsn seotons and tuning, and you ?
-
2034825·c·823 B·2010-12-31 04:43 UTC
/* sample example: `gcc -o foo bar -lm`
* having inane equation n(n+sqrt(n))=L where:
* n increments as m=1; n=(++m)**2 .. so only integers are used
* the highest value of sqrt(n) is FF (255) so n cou
-
2034822·c·788 B·2010-12-31 04:40 UTC
/* sample example: `gcc -o foo bar -lm`
* having inane equation n(n+sqrt(n))=L where:
* n increments as m=1; n=(++m)**2 .. so only integers are used
* the highest value of sqrt(n) is FF (255) so n cou
-
2034804·c·718 B·2010-12-31 04:09 UTC
/* sample example:
* having inane equation n(n+sqrt(n))=L where:
* n increments as m=1; n=(++m)**2 .. so only integers are used
* the highest value of sqrt(n) is FFFF (255) so n could be up to 255**2
-
2034803·c·743 B·2010-12-31 04:07 UTC
/* sample example:
* having inane equation n(n+sqrt(n))=L where:
* n increments as m=1; n=(++m)**2 .. so only integers are used
* the highest value of sqrt(n) is FFFF (255) so n could be up to 255**2
-
2034800·perl·1.5 KB·2010-12-31 03:56 UTC
#!/usr/bin/perl
##
## builds %struct_hash with following inside:
## keys are identifiers ..
## `$struct_hash{$_}->{'str'} is utf8 string descr
## `$struct_hash{$_}->{'parent'}`is full parent identifie
-
2034789·c·743 B·2010-12-31 03:28 UTC
/* sample example:
* having inane equation n(n+sqrt(n))=L where:
* n increments as m=1; n=(++m)**2 .. so only integers are used
* the highest value of sqrt(n) is FFFF (255) so n could be up to 255**2