博文

QK(2007-10-12 19:37:00)

摘要:// Death Coil[AUdc]Tip=Death |cffffcc00C|roil - [|cffffcc00Level 1|r],Death |cffffcc00C|roil - [|cffffcc00Level 2|r],Death |cffffcc00C|roil - [|cffffcc00Level 3|r]Hotkey=WResearchtip="Learn Death |cffffcc00C|roil - [|cffffcc00Level %d|r]"Researchhotkey=W // Unholy Aura[AUau]Tip=Unholy Aura - [|cffffcc00Level 1|r],Unholy Aura - [|cffffcc00Level 2|r],Unholy Aura - [|cffffcc00Level 3|r]Researchtip="Learn |cffffcc00U|rnholy Aura - [|cffffcc00Level %d|r]"Researchhotkey=Q // Frost Nova[AUfn]Tip=Frost |cffffcc00N|rova - [|cffffcc00Level 1|r],Frost |cffffcc00N|rova - [|cffffcc00Level 2|r],Frost |cffffcc00N|rova - [|cffffcc00Level 3|r]Hotkey=WResearchtip="Learn Frost |cffffcc00N|rova - [|cffffcc00Level %d|r]"Researchhotkey=W // Frost Armor (Autocast, Lich)[AUfu]Tip=|cffffcc00F|rrost Armor - [|cffffcc00Level 1|r],|cffffcc00F|rrost Armor - [|cffffcc00Level 2|r],|cffffcc00F|rrost Armor - [|cffffcc00Level 3|r]Untip="|cffc3dbffRight-click to activate auto-casting."Hotkey=QResearchtip="Learn |cfff......

阅读全文(1946) | 评论:0

打印斜下三角形(2007-09-08 14:35:00)

摘要:int max=10;int a[10][10]={0};int i,j,t,q=0,s=0,n=max ; for(;n>0;n--) {    s=s+n;  } for(t=1,i=0,j=0;t<s+1;t++) {    a[i][j]=t;    i++;    j++;    if(i==max)    {        j=0;        q=q+1;        i=q;    } }  for(i=0;i<max;i++)  {    for(j=0;j<i+1;j++)    {printf("%d ",a[i][j]);}    printf("\n");  }......

阅读全文(2402) | 评论:0

c#作业(2007-04-18 21:32:00)

摘要:using System; namespace studywork2{    public class work    {        public static void sumjiecheng()        {            long n = 1, t = 1, s = 0;            for (; n <= 20; n++)            {                t *= n;                s += t;             }             Console.WriteLine("1到20的阶乘之和为:");            Console.WriteLine(s);        }       &n......

阅读全文(2028) | 评论:0

合并有序连表为一有序表除去被3整除(2007-04-18 14:34:00)

摘要:#define NULL 0#include"stdio.h"#include"malloc.h" typedef struct LNode{    int data;    struct LNode *next;}LNode,*LinkList;//////////////////////////////////////////////////////////////*带头结点的尾插法建立单链表,返回表头指针*/LinkList  CREATLIST(){    int data;    LinkList head,s,r;    head=(LinkList)malloc(sizeof(LNode));        /*生成头结点*/    r=head;                                      /*尾指针初值指向头结点*/  scanf("%d",&data);    while(data!=0)                              /*0为输入结束符*/    {  s=(LinkList)malloc(si......

阅读全文(2285) | 评论:0