Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

NEED URGENT HELP

Name: edo-chan 2011-12-28 11:11

sup /prog/

Ive asked this everywer already but peopl seem too lame to make even a simple program like so i hope the mighty anon programers of 4chan are more skilled

what im trying to do is to Write a method taking two parameters x and n that computes the nth power of x without using ^ or declaring a new variable inside the method or using Math lib.
and it has to be coded in JAVA (i know it sux but dont ask why i use dat shit)
hep plox!

Name: Anonymous 2011-12-28 18:25

>>38

I don't get it. If x and n are both single argument lambda thingies, how do you define addition, multiplication and the like?

Name: Anonymous 2011-12-28 18:32

NEED URGENT ANUS

Name: Anonymous 2011-12-28 18:35

>>39
ENTERPRISE QUALITY JAVA


#ifdef __STDC__
        double pow(double x, double y)  /* wrapper pow */
#else
        double pow(x,y)                 /* wrapper pow */
        double x,y;
#endif
{
#ifdef _IEEE_LIBM
        return  __ieee754_pow(x,y);
#else
        double z;
        z=__ieee754_pow(x,y);
        if(_LIB_VERSION == _IEEE_|| isnan(y)) return z;
        if(isnan(x)) {
            if(y==0.0)
                return __kernel_standard(x,y,42); /* pow(NaN,0.0) */
            else
                return z;
        }
        if(x==0.0){
            if(y==0.0)
                return __kernel_standard(x,y,20); /* pow(0.0,0.0) */
            if(finite(y)&&y<0.0)
                return __kernel_standard(x,y,23); /* pow(0.0,negative) */
            return z;
        }
        if(!finite(z)) {
            if(finite(x)&&finite(y)) {
                if(isnan(z))
                    return __kernel_standard(x,y,24); /* pow neg**non-int */
                else
                    return __kernel_standard(x,y,21); /* pow overflow */
            }
        }
        if(z==0.0&&finite(x)&&finite(y))
            return __kernel_standard(x,y,22); /* pow underflow */
        return z;
#endif
}

Name: Anonymous 2011-12-28 18:38


#ifdef __STDC__
static const double
#else
static double
#endif
bp[] = {1.0, 1.5,},
dp_h[] = { 0.0, 5.84962487220764160156e-01,}, /* 0x3FE2B803, 0x40000000 */
dp_l[] = { 0.0, 1.35003920212974897128e-08,}, /* 0x3E4CFDEB, 0x43CFD006 */
zero    =  0.0,
one     =  1.0,
two     =  2.0,
two53   =  9007199254740992.0,  /* 0x43400000, 0x00000000 */
huge    =  1.0e300,
tiny    =  1.0e-300,
        /* poly coefs for (3/2)*(log(x)-2s-2/3*s**3 */
L1  =  5.99999999999994648725e-01, /* 0x3FE33333, 0x33333303 */
L2  =  4.28571428578550184252e-01, /* 0x3FDB6DB6, 0xDB6FABFF */
L3  =  3.33333329818377432918e-01, /* 0x3FD55555, 0x518F264D */
L4  =  2.72728123808534006489e-01, /* 0x3FD17460, 0xA91D4101 */
L5  =  2.30660745775561754067e-01, /* 0x3FCD864A, 0x93C9DB65 */
L6  =  2.06975017800338417784e-01, /* 0x3FCA7E28, 0x4A454EEF */
P1   =  1.66666666666666019037e-01, /* 0x3FC55555, 0x5555553E */
P2   = -2.77777777770155933842e-03, /* 0xBF66C16C, 0x16BEBD93 */
P3   =  6.61375632143793436117e-05, /* 0x3F11566A, 0xAF25DE2C */
P4   = -1.65339022054652515390e-06, /* 0xBEBBBD41, 0xC5D26BF1 */
P5   =  4.13813679705723846039e-08, /* 0x3E663769, 0x72BEA4D0 */
lg2  =  6.93147180559945286227e-01, /* 0x3FE62E42, 0xFEFA39EF */
lg2_h  =  6.93147182464599609375e-01, /* 0x3FE62E43, 0x00000000 */
lg2_l  = -1.90465429995776804525e-09, /* 0xBE205C61, 0x0CA86C39 */
ovt =  8.0085662595372944372e-0017, /* -(1024-log2(ovfl+.5ulp)) */
cp    =  9.61796693925975554329e-01, /* 0x3FEEC709, 0xDC3A03FD =2/(3ln2) */
cp_h  =  9.61796700954437255859e-01, /* 0x3FEEC709, 0xE0000000 =(float)cp */
cp_l  = -7.02846165095275826516e-09, /* 0xBE3E2FE0, 0x145B01F5 =tail of cp_h*/
ivln2    =  1.44269504088896338700e+00, /* 0x3FF71547, 0x652B82FE =1/ln2 */
ivln2_h  =  1.44269502162933349609e+00, /* 0x3FF71547, 0x60000000 =24b 1/ln2*/
ivln2_l  =  1.92596299112661746887e-08; /* 0x3E54AE0B, 0xF85DDF44 =1/ln2 tail*/

#ifdef __STDC__
        double __ieee754_pow(double x, double y)
#else
        double __ieee754_pow(x,y)
        double x, y;
#endif
{
        double z,ax,z_h,z_l,p_h,p_l;
        double y1,t1,t2,r,s,t,u,v,w;
        int i0,i1,i,j,k,yisint,n;
        int hx,hy,ix,iy;
        unsigned lx,ly;

        i0 = ((*(int*)&one)>>29)^1; i1=1-i0;
        hx = __HI(x); lx = __LO(x);
        hy = __HI(y); ly = __LO(y);
        ix = hx&0x7fffffff;  iy = hy&0x7fffffff;

    /* y==zero: x**0 = 1 */
        if((iy|ly)==0) return one;

    /* +-NaN return x+y */
        if(ix > 0x7ff00000 || ((ix==0x7ff00000)&&(lx!=0)) ||
           iy > 0x7ff00000 || ((iy==0x7ff00000)&&(ly!=0)))
                return x+y;

    /* determine if y is an odd int when x < 0
     * yisint = 0       ... y is not an integer
     * yisint = 1       ... y is an odd int
     * yisint = 2       ... y is an even int
     */
        yisint  = 0;
        if(hx<0) {
            if(iy>=0x43400000) yisint = 2; /* even integer y */
            else if(iy>=0x3ff00000) {
                k = (iy>>20)-0x3ff;        /* exponent */
                if(k>20) {
                    j = ly>>(52-k);
                    if((j<<(52-k))==ly) yisint = 2-(j&1);
                } else if(ly==0) {
                    j = iy>>(20-k);
                    if((j<<(20-k))==iy) yisint = 2-(j&1);
                }
            }
        }

    /* special value of y */
        if(ly==0) {
            if (iy==0x7ff00000) {       /* y is +-inf */
                if(((ix-0x3ff00000)|lx)==0)
                    return  y - y;      /* inf**+-1 is NaN */
                else if (ix >= 0x3ff00000)/* (|x|>1)**+-inf = inf,0 */
                    return (hy>=0)? y: zero;
                else                    /* (|x|<1)**-,+inf = inf,0 */
                    return (hy<0)?-y: zero;
            }
            if(iy==0x3ff00000) {        /* y is  +-1 */
                if(hy<0) return one/x; else return x;
            }
            if(hy==0x40000000) return x*x; /* y is  2 */
            if(hy==0x3fe00000) {        /* y is  0.5 */
                if(hx>=0)       /* x >= +0 */
                return sqrt(x);
            }
        }

        ax   = fabs(x);
    /* special value of x */
        if(lx==0) {
            if(ix==0x7ff00000||ix==0||ix==0x3ff00000){
                z = ax;                 /*x is +-0,+-inf,+-1*/
                if(hy<0) z = one/z;     /* z = (1/|x|) */
                if(hx<0) {
                    if(((ix-0x3ff00000)|yisint)==0) {
                        z = (z-z)/(z-z); /* (-1)**non-int is NaN */
                    } else if(yisint==1)
                        z = -1.0*z;             /* (x<0)**odd = -(|x|**odd) */
                }
                return z;
            }
        }

        n = (hx>>31)+1;

    /* (x<0)**(non-int) is NaN */
        if((n|yisint)==0) return (x-x)/(x-x);

        s = one; /* s (sign of result -ve**odd) = -1 else = 1 */
        if((n|(yisint-1))==0) s = -one;/* (-ve)**(odd int) */

    /* |y| is huge */
        if(iy>0x41e00000) { /* if |y| > 2**31 */
            if(iy>0x43f00000){  /* if |y| > 2**64, must o/uflow */
                if(ix<=0x3fefffff) return (hy<0)? huge*huge:tiny*tiny;
                if(ix>=0x3ff00000) return (hy>0)? huge*huge:tiny*tiny;
            }
        /* over/underflow if x is not close to one */
            if(ix<0x3fefffff) return (hy<0)? s*huge*huge:s*tiny*tiny;
            if(ix>0x3ff00000) return (hy>0)? s*huge*huge:s*tiny*tiny;
        /* now |1-x| is tiny <= 2**-20, suffice to compute
           log(x) by x-x^2/2+x^3/3-x^4/4 */
            t = ax-one;         /* t has 20 trailing zeros */
            w = (t*t)*(0.5-t*(0.3333333333333333333333-t*0.25));
            u = ivln2_h*t;      /* ivln2_h has 21 sig. bits */
            v = t*ivln2_l-w*ivln2;
            t1 = u+v;
            __LO(t1) = 0;
            t2 = v-(t1-u);
        } else {
            double ss,s2,s_h,s_l,t_h,t_l;
            n = 0;
        /* take care subnormal number */
            if(ix<0x00100000)
                {ax *= two53; n -= 53; ix = __HI(ax); }
            n  += ((ix)>>20)-0x3ff;
            j  = ix&0x000fffff;
        /* determine interval */
            ix = j|0x3ff00000;          /* normalize ix */
            if(j<=0x3988E) k=0;         /* |x|<sqrt(3/2) */
            else if(j<0xBB67A) k=1;     /* |x|<sqrt(3)   */
            else {k=0;n+=1;ix -= 0x00100000;}
            __HI(ax) = ix;

        /* compute ss = s_h+s_l = (x-1)/(x+1) or (x-1.5)/(x+1.5) */
            u = ax-bp[k];               /* bp[0]=1.0, bp[1]=1.5 */
            v = one/(ax+bp[k]);
            ss = u*v;
            s_h = ss;
            __LO(s_h) = 0;
        /* t_h=ax+bp[k] High */
            t_h = zero;
            __HI(t_h)=((ix>>1)|0x20000000)+0x00080000+(k<<18);
            t_l = ax - (t_h-bp[k]);
            s_l = v*((u-s_h*t_h)-s_h*t_l);
        /* compute log(ax) */
            s2 = ss*ss;
            r = s2*s2*(L1+s2*(L2+s2*(L3+s2*(L4+s2*(L5+s2*L6)))));
            r += s_l*(s_h+ss);
            s2  = s_h*s_h;
            t_h = 3.0+s2+r;
            __LO(t_h) = 0;
            t_l = r-((t_h-3.0)-s2);
        /* u+v = ss*(1+...) */
            u = s_h*t_h;
            v = s_l*t_h+t_l*ss;
        /* 2/(3log2)*(ss+...) */
            p_h = u+v;
            __LO(p_h) = 0;
            p_l = v-(p_h-u);
            z_h = cp_h*p_h;             /* cp_h+cp_l = 2/(3*log2) */
            z_l = cp_l*p_h+p_l*cp+dp_l[k];
        /* log2(ax) = (ss+..)*2/(3*log2) = n + dp_h + z_h + z_l */
            t = (double)n;
            t1 = (((z_h+z_l)+dp_h[k])+t);
            __LO(t1) = 0;
            t2 = z_l-(((t1-t)-dp_h[k])-z_h);
        }

    /* split up y into y1+y2 and compute (y1+y2)*(t1+t2) */
        y1  = y;
        __LO(y1) = 0;
        p_l = (y-y1)*t1+y*t2;
        p_h = y1*t1;
        z = p_l+p_h;
        j = __HI(z);
        i = __LO(z);
        if (j>=0x40900000) {                            /* z >= 1024 */
            if(((j-0x40900000)|i)!=0)                   /* if z > 1024 */
                return s*huge*huge;                     /* overflow */
            else {
                if(p_l+ovt>z-p_h) return s*huge*huge;   /* overflow */
            }
        } else if((j&0x7fffffff)>=0x4090cc00 ) {        /* z <= -1075 */
            if(((j-0xc090cc00)|i)!=0)           /* z < -1075 */
                return s*tiny*tiny;             /* underflow */
            else {
                if(p_l<=z-p_h) return s*tiny*tiny;      /* underflow */
            }
        }
    /*
     * compute 2**(p_h+p_l)
     */
        i = j&0x7fffffff;
        k = (i>>20)-0x3ff;
        n = 0;
        if(i>0x3fe00000) {              /* if |z| > 0.5, set n = [z+0.5] */
            n = j+(0x00100000>>(k+1));
            k = ((n&0x7fffffff)>>20)-0x3ff;     /* new k for n */
            t = zero;
            __HI(t) = (n&~(0x000fffff>>k));
            n = ((n&0x000fffff)|0x00100000)>>(20-k);
            if(j<0) n = -n;
            p_h -= t;
        }
        t = p_l+p_h;
        __LO(t) = 0;
        u = t*lg2_h;
        v = (p_l-(t-p_h))*lg2+t*lg2_l;
        z = u+v;
        w = v-(z-u);
        t  = z*z;
        t1  = z - t*(P1+t*(P2+t*(P3+t*(P4+t*P5))));
        r  = (z*t1)/(t1-two)-(w+z*w);
        z  = one-(r-z);
        j  = __HI(z);
        j += (n<<20);
        if((j>>20)<=0) z = scalbn(z,n); /* subnormal output */
        else __HI(z) += (n<<20);
        return s*z;
}

Name: >>38 2011-12-28 18:39

the only one I've seen so far is a representation for numbers as a stack of dinner plates, and addition looks like:

|||||| + |||||||||
= ||||||| + ||||||||
= |||||||| + |||||||
= ||||||||| + ||||||
= |||||||||| + |||||
= ||||||||||| + ||||
= |||||||||||| + |||
= ||||||||||||| + ||
= |||||||||||||| + |
= ||||||||||||||| + nil
= |||||||||||||||

subtraction:

|||||||||| - |||||||||
= ||||||||| - ||||||||
= |||||||| - |||||||
= ||||||| - ||||||
= |||||| - |||||
= ||||| - ||||
= |||| - |||
= ||| - ||
= || - |
= | - nil
= |

Name: Anonymous 2011-12-28 18:44

>>44

__kernal_standard

            case 20:
                /* pow(0.0,0.0) */
                /* error only if _LIB_VERSION == _SVID_ */
                exc.type = DOMAIN;
                exc.name = "pow";
                exc.retval = zero;
                if (_LIB_VERSION != _SVID_) exc.retval = 1.0;
                else if (!matherr(&exc)) {
                        (void) WRITE2("pow(0,0): DOMAIN error\n", 23);
                        errno = EDOM;
                }
                break;
            case 21:
                /* pow(x,y) overflow */
                exc.type = OVERFLOW;
                exc.name = "pow";
                if (_LIB_VERSION == _SVID_) {
                  exc.retval = HUGE;
                  y *= 0.5;
                  if(x<zero&&rint(y)!=y) exc.retval = -HUGE;
                } else {
                  exc.retval = HUGE_VAL;
                  y *= 0.5;
                  if(x<zero&&rint(y)!=y) exc.retval = -HUGE_VAL;
                }
                if (_LIB_VERSION == _POSIX_)
                  errno = ERANGE;
                else if (!matherr(&exc)) {
                        errno = ERANGE;
                }
                break;
            case 22:
                /* pow(x,y) underflow */
                exc.type = UNDERFLOW;
                exc.name = "pow";
                exc.retval =  zero;
                if (_LIB_VERSION == _POSIX_)
                  errno = ERANGE;
                else if (!matherr(&exc)) {
                        errno = ERANGE;
                }
                break;
            case 23:
                /* 0**neg */
                exc.type = DOMAIN;
                exc.name = "pow";
                if (_LIB_VERSION == _SVID_)
                  exc.retval = zero;
                else
                  exc.retval = -HUGE_VAL;
                if (_LIB_VERSION == _POSIX_)
                  errno = EDOM;
                else if (!matherr(&exc)) {
                  if (_LIB_VERSION == _SVID_) {
                        (void) WRITE2("pow(0,neg): DOMAIN error\n", 25);
                      }
                  errno = EDOM;
                }
                break;
            case 24:
                /* neg**non-integral */
                exc.type = DOMAIN;
                exc.name = "pow";
                if (_LIB_VERSION == _SVID_)
                    exc.retval = zero;
                else
                    exc.retval = zero/zero;     /* X/Open allow NaN */
                if (_LIB_VERSION == _POSIX_)
                   errno = EDOM;
                else if (!matherr(&exc)) {
                  if (_LIB_VERSION == _SVID_) {
                        (void) WRITE2("neg**non-integral: DOMAIN error\n", 32);
                      }
                  errno = EDOM;
                }
                break;
            case 42:
                /* pow(NaN,0.0) */
                /* error only if _LIB_VERSION == _SVID_ & _XOPEN_ */
                exc.type = DOMAIN;
                exc.name = "pow";
                exc.retval = x;
                if (_LIB_VERSION == _IEEE_ ||
                    _LIB_VERSION == _POSIX_) exc.retval = 1.0;
                else if (!matherr(&exc)) {
                        errno = EDOM;
                }
                break;

Name: Anonymous 2011-12-28 18:44

>>41
Terrible!
If we define the natural number n to be the functional exponentiation of a procedure f, we get 0 = λf.λx.x = KI; 1 = λf.λx.fx = λf.f = I; 2 = λf.λx.f(fx); 3 = λf.λx.f(f(fx)); ....
succ n = n + 1 is defined as λn.λf.λx.f(nfx), because fn+1(x) = f(fn(x)).
n+m is just applying n times succ to m, n+m = succn(m) = λn.λm.n succ m.
n*m is either defined by applying n times m to a function f, n*m = (fm)n = λn.λm.λf.n (m f), or by applying n times +m to 0, n*m = λn.λm.m (+n) 0.
n^m is applying n times applying m times a function f, similar to multiplication: n^m = fnm = λn.λm.λf.(mn)f = λn.λm.mn

Name: >>41,45 2011-12-28 19:07

>>45's name should have been 41, my bad.

Name: kodak_gallery_programmer !!kCq+A64Losi56ze 2011-12-28 20:00

I feel like I'm watching the special olypmics of computer programming.

Name: Anonymous 2011-12-28 20:10

>>49
kodak-kun! You're back! Hax my anus!

Name: Anonymous 2011-12-28 21:01

>>49

we all have to start somewhere kodak-kun.

Name: Anonymous 2011-12-29 5:14

kodak-kunt never contributes anything other than scorn for others.

Name: Anonymous 2011-12-29 6:38

>>52
What would he contribute anyway? He's not a competent programmer.

Name: Anonymous 2011-12-29 6:40

>>55
nice dubs bro

Name: Anonymous 2011-12-29 6:53

>>54
Thank you.

Name: Anonymous 2011-12-29 9:15

public class file {
    public static void main(String arg[]){
        System.out.println(powerup(Integer.parseInt(arg[0]),Integer.parseInt(arg[1])));
    }  
    private static int powerup(int x, int n){
        if (n == 1){
            return x;
        }else if (n == 0){
            return 1;
        }else{
            return x * powerup(x, n-1);
        }  
    }  
}  

yeah I'm new here so I don't know how to monospace this.

Name: Anonymous 2011-12-29 9:20



public class file {
    public static void main(String arg[]){
        System.out.println(powerup(Integer.parseInt(arg[0]),Integer.parseInt(arg[1])));
    }  
    private static int powerup(int x, int n){
        if (n == 1){
            return x;
        }else if (n == 0){
            return 1;
        }else{
            return x * powerup(x, n-1);
        }  
    }  
}


That should be better. Btw, are there any extensions similar to 4chan X for the BBSes?

Name: Anonymous 2011-12-29 10:03

power :: (Num a, Integral b) => a -> b -> a
power a b = getProduct . mconcat . map Product $ genericReplicate b a

-- (^) :: (Num a, Integral b) => a -> b -> a

Name: Anonymous 2011-12-29 10:12

>>58
getProduct . mconcat . map Product . (. flip genericReplicate)?

Name: Anonymous 2011-12-29 10:24

>>59
It would be better to apply the Product before the genericReplicate.

Name: IisMathwizard 2011-12-29 13:56

Not sure if OP is retarded or troll...

Name: IisMathwizard 2011-12-29 14:11

// @Author: IisMathwizard

public class someClass{
    static int count = 0; //OP Said not within the method so
    // global
    public static void main(){
        System.out.println(powerUp(10,12) + "");
        }
    public static int powerUp(int x, int n){
        count = 0;
        for(;count < n-1; count ++){
            x*=x;
            }
        return x;
        }
    }

Name: IisMathwizard 2011-12-29 14:18

**Quick edit to allow for entering of zero and negatives
// @Author: IisMathwizard

public class someClass{
    static int count = 0;//OP Said not within the method so
    static boolean neg = false; // global
    public static void main(){
        System.out.println(powerUp(10,12) + "");
        }
    public static double powerUp(int x, int n){
        count = 0;
        neg = false;
        if(n == 0){
            return 1;
        }
        if(n < 0){
            n = -1 *n;
            neg = true;
            }
        for(;count < n-1; count ++){
            x*=x;
            }
        if(neg){
            return (1/(double)x);
            }
        return x;
        }
    }

Name: Anonymous 2011-12-29 14:57

>>62,63
that + "" in your println is completely unnecessary. Also, making your variables global is purposely misinterpreting the question.
Yes, OP could have phrased it more clearly.
No, you're not smart for purposely misinterpreting it.
Take a look at one of the recursive examples above, that's the way it should be done

Name: IisMathwizard !!b/mIEkVC6+3Cvk1 2011-12-29 15:41

1. It is Necessary, it will not typecast to string for you so you must force it with a ' + "" '
2. I was reading what was giving...
3. true
4. Not trying to be asshole
5. What about x = 2 n = 560? STACK OVERLOAD I like the for loop better

Name: kodak_gallery_programmer !!kCq+A64Losi56ze 2011-12-29 16:07

>>65
I can't tell if you're trolling or just plain dumb.

Name: kodak_gallery_programmer !!kCq+A64Losi56ze 2011-12-29 16:10

>>65
Also you uneducated toilet scrubber..

5. What about x = 2 n = 560? STACK OVERLOAD I like the for loop better

Masks one of the loop invariants. Man you're hella dumb. I see no real possible future for you as a computer better. The best you might be able to do is tech support at some hick firm. Geeze, do us all a favor and just go kill yourself.

Name: IisMathwizard !!b/mIEkVC6+3Cvk1 2011-12-29 16:13

At least 1 holds up while using Netbeans IDE

Name: IisMathwizard !!b/mIEkVC6+3Cvk1 2011-12-29 16:15

I dare you to try x=2 and n=560 and show me a screenshot of both code and output and tell me that it's not going to have a stack error
I DARE YOU

Name: Anonymous 2011-12-29 16:15

>>1

POWER MY ANUS

Name: IisMathwizard !!b/mIEkVC6+3Cvk1 2011-12-29 16:19

>>67
Watch out we got a bad ass over here!

Name: Anonymous 2011-12-29 16:20

mailto:noko versus Kodak Gallery Autist

Name: IisMathwizard !!b/mIEkVC6+3Cvk1 2011-12-29 16:22

Sorry about that.. It's my default cause im usually on /g/ or /a/ or /c/ or... well i could go on and on

Name: kodak_gallery_programmer !!kCq+A64Losi56ze 2011-12-29 16:22

>>68
Using something like netbeans is a lame substitute for an editor like emacs and a proper makefile. But of your monkey ass wouldn't know something like this. Also, that is a for loop. Not a while loop. While they might look they same the surface, they really aren't (in Java).

Again, you're dumb. And again, I see no real future for you as a computer programming.

Name: kodak_gallery_programmer !!kCq+A64Losi56ze 2011-12-29 16:24

>>71
No, but at least I know enough to be able to do this kind of crap for a living.

Name: kodak_gallery_programmer !!kCq+A64Losi56ze 2011-12-29 16:25

>>71
And now, by all means, tell us all what you do for a living. Tell us about the software you helped write that is used by over 40 million people.

Name: IisMathwizard !!b/mIEkVC6+3Cvk1 2011-12-29 16:26

So would you point me in the direction of the while loop because i remember posting about is the for loop... And netbeans is decent IDE for when you need things done quickly... I'd normally type it in notepad but i have Netbeans open for a project at the time of reading...

Name: Anonymous 2011-12-29 16:26

>>75
You actually convinced somebody to pay you for writing broken pow implementations in Java? AMAZING.

Name: Anonymous 2011-12-29 16:27

>>74-76
Fuck off and die you cock sucking faggot.

Name: Anonymous 2011-12-29 16:29

>>74
Kodak-san uses Emacs, my nigga right here.

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List