sdvcrx

void inplace_swap(int *x, int *y)
{
    *y = *x ^ *y;
    *x = *x ^ *y;
    *y = *x ^ *y;
}

sdvcrx

#include <stdio.h>

int main(void)
{
    int a = 0x80000000;
    printf("os is %d\t%d\n", a, sizeof(int));
    union ut {
        short s;
        char c[2];
    } u;

sdvcrx

mysqldump -u root -p linuxcast > linuxcast_backup.sql

mysql -u root -p linuxcast < linuxcast_backup.sql

sdvcrx

#include <stdio.h>

#define MAXSIZE 25
#define OK 1
#define ERROR 0

typedef int Status;
typedef int SElemType;
typedef struct {
    SElemType data[MAXSIZE];

sdvcrx

import base64

def xunlei_url_encode(url):
    return 'thunder://'+base64.encodestring('AA'+url+'ZZ').replace('\n', '')

def xunlei_url_decode(url):
    assert url.startswith('thunder://')
    url = base64.decodestring(url[10:])
    assert url.startswith('AA') and url.endswith('ZZ')
    return url[2:-2]

sdvcrx

#include <stdio.h>
#define MAXNUM 100 // Count数组大小(M)
/* 功能：桶式排序
 * 输入: 待排序数组arrayForSort[]
 * 待排序数组大小arraySize (N)
 * 上界maxitem，元素都落在[0, maxitem]
 * 输出 void
 * 时间复杂度 O(M+N)
 */

sdvcrx

int checkSymbol(Stack S){
  char ch;
  while((ch = getchar()) != '#'){
    if(ch == '(' || ch == '[' || ch == '{'){
      Push(ch, S);
    }
    else if(ch == ')' || ch == ']' || ch == '}'){
      if(isEmpty(S))
        Error("Stack is empty");
      else{

sdvcrx

#include <ctype.h>
#include <stdio.h>

int main(void)
{
    int ch;
    while((ch = getchar()) != EOF) {
        putchar(toupper(ch));
    }
    return 0;

sdvcrx

def uniqify_list(seq):
    seen = Set()
    return [x for x in seq if x not in seen and not seen.add(x)]

sdvcrx

import argparse
parser = argparse.ArgumentParser()
parser.add_argument("square", type=int,
                    help="display a square of a given number")
parser.add_argument("-v", "--verbosity", action="count", default=0,
                    help="increase output verbosity")
args = parser.parse_args()
answer = args.square**2
if args.verbosity >= 2:
    print "the square of {} equals {}".format(args.square, answer)