Felix021

#include <stdio.h>
#include <stdlib.h>
#ifdef __GNUC__
    #define WARN_IF_UNUSED __attribute__ ((warn_unused_result))
#else
    #define WARN_IF_UNUSED
#endif


struct node {
    int v;
    struct node *next;
};

struct linklist {
    struct node *head;
    struct node *tail;
};

WARN_IF_UNUSED int init(struct linklist ll[], int n) {
    int i;
    for (i = 0; i < n; ++i) {
        ll[i].head = (struct node *)malloc(sizeof(struct node));
        if (ll[i].head == NULL) {
            return 0;
        }
        ll[i].head->next = NULL;
        ll[i].tail = ll[i].head;
    }
    return 1;
}

void dump(struct linklist *ll) {
    struct node *p = ll->head->next;
    while (p != NULL) {
        printf("%d ", p->v);
        p = p->next;
    }
    printf("\n");
}

WARN_IF_UNUSED int push(struct linklist *ll, int v) {
    struct node *p = (struct node *)malloc(sizeof(struct node));
    if (p == NULL) {
        return 0;
    }
    p->v = v;
    p->next = NULL;
    ll->tail->next = p;
    ll->tail = p;
    return 1;
}

int isEmpty(struct linklist *ll) {
    return (ll->head->next == NULL) ? 1 : 0;
}


int pop(struct linklist *ll) {
    if (isEmpty(ll)) {
        exit(1);
    }
    struct node *p = ll->head;
    ll->head = p->next;
    free(p);
    return ll->head->v;
}

void radixSort(int a[], int n) {
    struct linklist ll[10];
    int flag, i, j, t, fact = 1;
    if (init(ll, 10) == 0) {
        exit(2);
    }
    do {
        printf("---------------\n");
        flag = 0;
        for (i = 0; i < n; ++i) {
            t = a[i] / fact % 10;
            flag += !!t;
            //printf("%d: %d\n", a[i], t);
            if (push(&ll[t], a[i]) == 0) {
                exit(2);
            }
        }
        for (i = 0, j = 0; i < 10; ++i) {
            printf("%d: ", i);
            dump(&ll[i]);
        }
        for (i = 0, j = 0; i < 10; ++i) {
            while (isEmpty(&ll[i]) == 0) {
                a[j] = pop(&ll[i]);
                j++;
            }
        }
        fact *= 10;
    }while (flag != 0);
}

int main() {
    int a[] = {26,62,187,32,8754359,45324,54654,0,331,321312,12,4324,87,98};
#define N (sizeof(a) / sizeof(int))
    radixSort(a, N);
    int i;
    for (i = 0; i < N; ++i) {
        printf("%d ", a[i]);
    }
    printf("\n");
    return 0;
}

javascript:var trs=new Array();trs=getData();sorttrs(10,1);sorttrs(9,0);display(trs);function sorttrs(col,di){var i,j,t;for(i=0;i<trs.length-1;++i){for(j=1;j<trs.length-i-1;++j){if(di==0){if(trs[j][col] > trs[j+1][col]){t=trs[j];trs[j]=trs[j+1];trs[j+1]=t;}}else{if(trs[j][col]<trs[j+1][col]){t=trs[j];trs[j]=trs[j+1];trs[j+1]=t;}}}}}function display(){var gb=0,gx=0,zb=0,zx=0;var gbx=0,gxx=0,zbx=0,zxx=0;for(var i=1;i<trs.length;++i){var a=trs[i][8]*trs[i][10];var b=new Number(trs[i][8]);switch(trs[i][9]){case '公共必修':gb+=a;gbx+=b;break;case '公共选修':gx+=a;gxx+=b;break;case '专业必修':zb+=a;zbx+=b;break;case '专业选修':zx+=a;zxx+=b;break;}}document.writeln("公共必修: "+gb+"/"+gbx+"="+(gb/gbx)+"<br/>");document.writeln("公共选修: "+gx+"/"+gxx+"="+(gx/gxx)+"<br/>");document.writeln("专业必修: "+zb+"/"+zbx+"="+(zb/zbx)+"<br/>");document.writeln("专业选修: "+zx+"/"+zxx+"="+(zx/zxx)+"<br/>");document.writeln("总学分: "+(gbx+gxx+zbx+zxx));document.writeln("<table border=\"1\">");for(var i=0;i<trs.length;++i){document.writeln("<tr>");for(var j=0;j<trs[i].length;++j){var td=trs[i][j];if(i==0){td='<b>'+td+'</b>';}document.writeln("<td>"+td+"</td>");}document.writeln("</tr>");}}function getData(){function countTDChilds(tr){var trc=tr.childNodes;var count=0;for(var i=0;i<trc.length;++i){if(trc[i].tagName=="TD")count++;}return count;}function getTDChilds(tr){var trc=tr.childNodes;var tds=new Array();for(var i=0;i<trc.length;++i){if(trc[i].tagName=="TD")tds.push(trc[i].innerHTML);}return tds;}var isIE=document.all?true:false;var frames=document.getElementsByTagName("iframe");var doc=null;for(var i=0;i<frames.length;++i){if(frames[i].name=="mainIFR"){if(isIE){doc=frames[i].document;}else{doc=frames[i].contentWindow.document;}break;}}if(doc==null)doc=document;var tbl=doc.getElementsByTagName("table")[0];var tb=null;for(var i=0;i<tbl.childNodes.length;++i){var tb=tbl.childNodes[i];if(tb.tagName=='tbody')break;}var trs=new Array();for(var i=0;i<tb.childNodes.length;++i){var obj=tb.childNodes[i];if(obj.tagName=='TR'){if(countTDChilds(obj)==11){trs.push(getTDChilds(obj));}}}return trs;}

javascript:

var trs = new Array();

trs = getData();
sorttrs(10, 1); /* 成绩,降序 0升序,1降序 */
sorttrs(9, 0); /* 课程类型,升序 */
display();

function sorttrs(col, di){
    var i, j, t;
    for(i = 0; i < trs.length - 1; ++i){
        for(j = 1; j < trs.length - i - 1; ++j){
            if(di == 0){
                if(trs[j][col] > trs[j+1][col]) {
                    t = trs[j];
                    trs[j] = trs[j+1];
                    trs[j+1] = t;
                }
            } else {
                if(trs[j][col] < trs[j+1][col]) {
                    t = trs[j];
                    trs[j] = trs[j+1];
                    trs[j+1] = t;
                }
            }
        }
    }
}
function display(){
    var gb = 0, gx = 0, zb = 0, zx = 0; /*g=公共 z=专业 b=必修 z=选修*/
    var gbx = 0, gxx = 0, zbx = 0, zxx = 0; /*公共必修学分*/
    for(var i = 1; i < trs.length; ++i){
        var a = trs[i][8] * trs[i][10];
        var b = new Number(trs[i][8]);
        switch(trs[i][9]) {
            case '公共必修': gb += a; gbx += b; break;
            case '公共选修': gx += a; gxx += b; break;
            case '专业必修': zb += a; zbx += b; break;
            case '专业选修': zx += a; zxx += b; break;
        }
    }
    document.writeln("<html>\n<head>\n  <title>成绩<\/title>\n<\/head>\n<body>");
    document.writeln("公共必修: " + gb + " / " + gbx + " = " + (gb/gbx) + "<br/>");
    document.writeln("公共选修: " + gx + " / " + gxx + " = " + (gx/gxx) + "<br/>");
    document.writeln("专业必修: " + zb + " / " + zbx + " = " + (zb/zbx) + "<br/>");
    document.writeln("专业选修: " + zx + " / " + zxx + " = " + (zx/zxx) + "<br/>");
    document.writeln("总学分: " + (gbx + gxx + zbx + zxx));
    document.writeln("<table border=\"1\">");
    for(var i = 0; i < trs.length; ++i){
        document.writeln("  <tr>");
        for(var j = 0; j < trs[i].length; ++j){
            var td = trs[i][j];
            if(i == 0){
                td = '<b>' + td + '</b>';
            }
            document.writeln("    <td>" + td + "</td>");
        }
        document.writeln("  </tr>");
    }
    document.writeln('</body>\n</html>');
}

function getData(){
    function countTDChilds(tr){
        var trc = tr.childNodes;
        var count = 0;
        for(var i = 0; i < trc.length; ++i) {
            if(trc[i].tagName == "TD") count++;
        }
        return count;
    }
    function getTDChilds(tr){
        var trc = tr.childNodes;
        var tds = new Array();
        for(var i = 0; i < trc.length; ++i){
            if(trc[i].tagName == "TD") tds.push(trc[i].innerHTML);
        }
        return tds;
    }
    var isIE = document.all?true:false;
    var frames = document.getElementsByTagName("iframe");
    var doc = null;
    for(var i = 0; i < frames.length; ++i){
        if (frames[i].name == "mainIFR"){
            if(isIE){
                doc=frames[i].document;
            }else{
                doc = frames[i].contentWindow.document;
            }
            break;
        }
    }
    if(doc == null) doc = document;
    var tbl = doc.getElementsByTagName("table")[0];
    var tb = null;
    for(var i = 0; i < tbl.childNodes.length; ++i){
        var tb = tbl.childNodes[i];
        if(tb.tagName == 'tbody') break;
    }
    var trs = new Array();
    for(var i = 0; i < tb.childNodes.length; ++i){
        var obj = tb.childNodes[i];
        if(obj.tagName == 'TR'){
            if(countTDChilds(obj) == 11){
                trs.push(getTDChilds(obj));
            }
        }
    }
    return trs;
}

    unsigned int a = 1;
    int b = 0;
    while (a + b >= 0) {
        b--;
    }

    movl  $1, -4(%ebp)
    movl  $0, -8(%ebp)
L2:
    movl  -4(%ebp), %eax
    leal  -8(%ebp), %eax
    decl  (%eax)
    jmp  L2

// modified from http://acm.scs.bupt.cn/hefei/hefei.js

String.prototype.trim= function(){  
    // 用正则表达式将前后空格  
    // 用空字符串替代。  
    return this.replace(/(^\s*)|(\s*$)/g, "");  
}

/**
* enables highlight  rows in data tables
*/
function table_Init(container) {
    // for every table row ...
try{
    var rows = container.rows;
    for ( var i = 0; i < rows.length; i++ ) {
        for (var j = 0 ; j < rows[i].cells.length ; ++j) {
            rows[i].cells[j].className = 'nowrap';
            if (j > 3) {
                
                try {
                    var text = rows[i].cells[j].innerHTML;
                    
                    var AC = new RegExp("^\\d+/\\d+$");
                    var TRY = new RegExp("^\\d+/--$");
                    var NOTTRY = new RegExp("^0/--$");
                    if (NOTTRY.test(text)){
                        //rows[i].cells[j].className += ' notry';
                    }
                    else if (TRY.test(text)){
                        rows[i].cells[j].className += ' try';
                    }
                    else if (AC.test(text)){
                        rows[i].cells[j].className += ' ac';
                    }
                }
                catch (err) {
                }
            }
        }
                
        
        // ... with the class 'odd' or 'even' ...
        if (i % 2 == 1) {
            rows[i].className = 'odd';
        }
        else {
            rows[i].className = 'even';
        }

        // ... add event listeners ...
        // ... to highlight the row on mouseover ...
        //if ( navigator.appName == 'Microsoft Internet Explorer' ) {
        // but only for IE, other browsers are handled by :hover in css
        rows[i].onmouseover = function() {
            this.className += ' hover';
        }
        rows[i].onmouseout = function() {
            this.className = this.className.replace( ' hover', '' );
        }
       // }
    }
}
catch (err){
    alert(err.description);
}
}

<?php

$dirname = "ooxx";
$pattern = 'google';
$replace = 'baidu';
$DontReplace = true;

replace_rec($dirname);

function replace_rec($dirname, $layer = 0){
    global $DontReplace;
    static $cnt = 0;
    $dir = scandir($dirname);
    natcasesort($dir);
    foreach($dir as $item){
        if($item == '.' || $item == '..') continue;
        $path = "$dirname/$item";
        if(is_dir($path)){
            replace_rec($path, $layer+1);
        }else if(is_file($path)){
            $str = file_get_contents($path);
            if(strpos($str, $pattern) === false) continue;
            if($DontReplace == false){
                $str = str_replace($pattern, $replace, $str);
                file_put_contents($path, $str);
            }  
            $cnt++;
            for($i = 0; $i < $layer; $i++) echo '  '; echo "$cnt: $path\n";
        }else{
            echo "UNKNOWN TYPE\n";
        }  
    }  
}
?>