thinkphp

$\int{f(x) g'(x) \ dx} = fg - \int{ g(x) f'(x) \ dx}$ 

$\int{cos^2x \ dx}  = \int{cos \ x \ cos \ x \ dx}  = \int{cos \ x  \ (sin \ x)' \ dx}  = cos \ x  \ sin \ x - \int{sin \ x  \ (cos \ x)' \ dx}  = cos \ x  \ sin \ x - \int{sin \ x  \ sin \ x \ dx}  =  cos \ x  \ sin \ x - \int{sin^2 \ x \ dx}  =  sin\ x  \ cos \ x + \int{sin^2 \ x \ dx}  =  sin\ x  \ cos \ x + \int{ (1 - cos^2 \ x) \ x \ dx} =  sin\ x  \ cos \ x + \int{ 1 \ dx} - \int{ cos^2 \ x \ dx} = sin\ x  \ cos \ x + x - \int{ cos^2 \ x \ dx}  =>  \int \cos ^2x\,dx=\frac{x+\sin x\cos x}{2}+C. $

thinkphp

def hexaGCD( x, y, z):

    def pow2(a,b):

        p = 1

        for i in range(1,b+1):
            p = p * a
        return p

thinkphp

#include <stdio.h>
#include <malloc.h>
#define fin "algsort.in"

typedef int (*ptr2)(const int a,const int b);
typedef void (*ptr1)(int*, int, ptr2);


int comp(int a, int b) {

thinkphp

#
# Square Root Babylonian Method
# @Adrian Statescu
#
def sqrt_babylonian(n):
  x = n
  y = 1.0
  eps = 0.000001
  while x - y > eps:
    x = (x + y) / 2

thinkphp

#
# Square Root Babylonian Method
# @Adrian Statescu
#
def sqrt_babylonian(n)
    x = n
    y = 1.0
    e = 0.000001
    while x - y > e
      x = (x + y) / 2

thinkphp

#include <stdio.h>
#include <malloc.h>

typedef struct Node {
        int data;
        struct Node *next;
} Node;

Node *head = NULL;

thinkphp

def make_bold(f):
    def bold_wrapper():
        return "<b>" + f() +"</b>"
    return bold_wrapper

def make_italic(f):
    def italic_wrapper():
        return "<i>" + f() + "</i>" 
    return italic_wrapper

thinkphp

from time import sleep
from sys import stdout

def printt(string, delay = 0.05):
    for c in string:
        stdout.write(c)
        stdout.flush()
        sleep(delay) 
    print("")

thinkphp

;to change your directory colors, open up your ~/.bashrc file with your editor
;and make the following entry at the end of the 

LS_COLORS=$LS_COLORS:'di=0;35:' ; export LS_COLORS

thinkphp

#include <stdio.h>
#define __repeat__ do
#define __until__(COND) while(!(COND))

int isPrime(int n) {

    if( n == 0 || n == 1 ) return 0;
    if( n == 2 || n == 3 ) return 1;    

    int i = 2,