亂貼小站

來源：魏小亮的博客 （作者是Facebook的移動技術總監）、http://blog.jobbole.com/33834/

有不少的朋友問過這個問題：在中學裡面參加NOI，在大學參加ACM/ICPC，TopCoder，最後對實際工作究竟有多少用處？我把自己的一些理解總結了一下跟大家討論。

我是在94~96年參加NOI和集訓隊，99~2000年參加ACM/ICPC，2002左右玩了半年TopCoder，後來就很少關注編程競賽了，所以可能對近幾年競賽模式的變化不瞭解。另外我目前主要在工業界工作，所以“實際工作”主要指的是在IT工業界的技術型工作。

我想競賽培養的能力可以分成幾個類型：

1、基本技術技能。我想參加競賽而且成績不錯的朋友，基本上都有三個非常出色而且難得的基本技術能力：算法設計、快速編程和自我調試。這是所有比賽都必須的： 給定一個問題，需要很快地設計出算法，很快地編寫出程序，並且在整個算法設計和編程過程中不斷拷問自己的設計和程序，儘早發現漏洞、完善設計，最後在提交結果之前通過一系列的測試儘量提高程序通過競賽評委測試的概率。 這三項基本能力是工作裡面非常有用的。 大部分公司的技術面試也集中在這三項基本技能裡面。競賽經驗的確讓優秀的參賽者在實際工作中獲得先發優勢，一般IOI/ICPC/TopCoder的優秀參賽者都很容易獲得公司錄取，並且在起始級別的工程師崗位上作得非常出色。

2、獨立學習的能力和自信心。我想大部分的NOI參 賽者都是中學就開始學習中學課程裡面不函括的內容：面向對象程序設計、數據結構、圖論和網絡流理論、算法理論、離散數學等等。如果一個參賽者是通過自己獨 立學習這些課外知識而在競賽裡面脫穎而出的，她一定有獨立學習的能力和自信心，同時相信自己能夠很快的學會各種新知識。這個能力和自信在工作中非常重要：計算機語言日新月異，從Pascal/C到C++/Java到Python/PHP/Javascript/Objective-C⋯⋯一個人不可能從一開始就懂得所有的知識，但只要自信自己能學會任何新的語言和概念（並且的確可以學會），那他就可以敢於面對未知的挑戰。在工作中，這些“敢吃螃蟹第一人”往往會得到更多機會去開發新項目、創建新公司。

3、表達能力。這一點我本人在吳文虎老師指導的NOI冬令營裡面獲益匪淺。當時吳老師要求每位冬令營選手挑選一個複雜的競賽問題深入研究解法，最後寫成論文，並且在冬令營裡面做報告。吳老師親自把關，指導論文 裡面寫不清楚或者報告裡面說不清楚的地方。這是我第一次學會如何把一個技術問題寫清楚、說清楚。這樣的訓練雖然跟競賽成績本身沒有直接的關係，但能夠讓競 賽選手的表達能力上了一個台階。表達能力對實際工作有非常重要的意義：現代的大型軟件系統開發不是一個英雄人物就能完成的，如果一個子系統的算法和程序不 能清晰地被理解，那這個子系統和它的作者就成為單一故障點(Single Point Of Failure) —— 只要作者一度假，就沒有人能維護或者擴展這部分。基於這種風險，大家寧願用一個更慢更費內存但能被其他人看懂的解決方案。在這兩年的招聘過程中，我看到不少這樣的可惜例子：不少ACM/ICPC的選手能在15分鐘之內寫出一個很巧妙的算法，在機器上編譯、測試例子都通過。 但在黑板上或程序註釋裡面，他們花20分鐘也沒能說清楚這個算法為什麼是對的，為什麼要用這個算法。

4、合作能力：NOI/IOI/TopCoder更多的是單槍匹馬，而ACM/ICPC對合作能力的培養更有幫助。三個編程高手共用一台機器，緊缺資源誰先用誰後用，如何分工，這些問題在實際工作中每天都會遇到，如果一個選手在ICPC裡面學會如何跟隊友協調、如何培養信任，那她在實際工作裡面就很容易融入一個團隊，在團隊裡面找到自己的發力點 ，很快為團隊作出貢獻。

5、志同道合的朋友圈：一般來說，願意花額外時間參加競賽的學生都是喜歡寫程序的，因為喜歡，他們往往更容易在這方面越做越好。我10年前在競賽過程中認識的老對手，現在還有很多是好朋友，不時能聯繫一下，得到他們的指導、交換最新的行業信息和趨勢。這一點雖然對實際工作沒有直接幫助，但我覺得是參加競賽獲得的最寶貴的東西。

這些大概是我在比賽裡面學到的最有用的一些東西。下次有時間的時候打算整理一下實際工作裡面有哪些是競賽裡面學不到的。

－－－－－－－－－－－－－－－－－－－－－－－

文章推薦：《編程競賽和邏輯謎題網站大集合》

#include<stdlib.h>
#include<stdio.h>
#include<string.h>
#include<sys/mman.h>
#include<sys/stat.h>
#include<unistd.h>
#include<fcntl.h>
#define FILE_LENGTH 10000

int main(int argc,char *argv[])
{
        if(argc!=2)
    {
        printf("Usage: %s filename\n",argv[0]);
        return 0;
    }
        int fd,count=0;
        char *map_memory,*ca;
        
        fd = open(argv[1], O_RDWR | O_CREAT, S_IRUSR | S_IWUSR);
        
        lseek(fd, FILE_LENGTH+1, SEEK_SET);
        write(fd, "", 1);
        lseek(fd, 0, SEEK_SET);
        map_memory =(char*) mmap(0, FILE_LENGTH, PROT_WRITE, MAP_SHARED, fd, 0);
        close(fd);
        
        ca = map_memory;
        while( FILE_LENGTH>count && fgets(ca,FILE_LENGTH-count,stdin)!=NULL )
        {
                int tmp = strlen(ca);
                count += tmp;
                ca += tmp;
        }
        
        munmap(map_memory, FILE_LENGTH);
        return 0;
}

#include<stdlib.h>
#include<stdio.h>
#include<string.h>
#include<sys/mman.h>
#include<sys/stat.h>
#include<unistd.h>
#include<fcntl.h>
#define FILE_LENGTH 10000

int main(int argc,char *argv[])
{
        if(argc!=4)
    {
        printf("Usage: %s filename start_pos end_pos\n",argv[0]);
        return 1;
    }
        int start_pos=0, end_pos=0;
        start_pos = atoi(argv[2]);
        end_pos = atoi(argv[3]);
        if(start_pos<0 || end_pos>FILE_LENGTH || start_pos>end_pos)
        {
                puts("start_pos or end_pos error. Please try again.");
        return 1;
        }
        int fd,i;
        char *map_memory;
        
        fd = open(argv[1], O_RDWR | O_CREAT, S_IRUSR | S_IWUSR);
        
        lseek(fd, FILE_LENGTH+1, SEEK_SET);
        write(fd, "", 1);
        lseek(fd, 0, SEEK_SET);
        map_memory =(char*) mmap(0, FILE_LENGTH, PROT_WRITE, MAP_SHARED, fd, 0);
        close(fd);
        
        printf("Substring from [%d] to [%d] is: ",start_pos,end_pos);
        for(i=start_pos-1;i<end_pos;i++)
                printf("%c",*(map_memory+i));
        puts("");
        
        munmap(map_memory, FILE_LENGTH);
        return 0;
}

#include<stdio.h>
#include<unistd.h>
#include<fcntl.h>
#include<string.h>

struct flock* file_lock(short type,short whence)
{
        static struct flock ret;
        ret.l_type = type;
        ret.l_start = 0;
        ret.l_whence = whence;
        ret.l_len = 0;
        ret.l_pid = getpid();
        return &ret;
}

int main()
{
        printf("1.exclusive lock(write lock)\n");
        printf("2.share lock(read lock)\n");
        printf("Choose lock type -> ");
        int ia;
        scanf("%d",&ia);
        int fd = open("lock.txt",O_RDWR|O_APPEND);
        //printf("fd = %d\n",fd);
        if(ia==1)
        {
                if(fcntl(fd, F_SETLK, file_lock(F_WRLCK, SEEK_SET))==0)
                        printf("F_WRLCK success.\n");
                else 
                {
                        printf("F_WRLCK fail.\n");
                        return 0;
                }
        }
        else
        {
                if(fcntl(fd, F_SETLK, file_lock(F_RDLCK, SEEK_SET))==0)
                        printf("F_RDLCK success.\n");
                else 
                {
                        printf("F_RDLCK fail.\n");
                        return 0;
                }
        }
        ia= 0;
        do
        {
                printf("If you want to unlock file and end program,\n");
                printf("please input 1 -> \n");
                scanf("%d",&ia);
        }while(ia!=1);
        fcntl(fd, F_SETLK, file_lock(F_UNLCK, SEEK_SET));
        close(fd);
}

#include<stdio.h>
#include<unistd.h>
#include<fcntl.h>
#include<string.h>

struct flock* file_lock(short type,short whence)
{
        static struct flock ret;
        ret.l_type = type;
        ret.l_start = 0;
        ret.l_whence = whence;
        ret.l_len = 0;
        ret.l_pid = getpid();
        return &ret;
}

int main()
{
        printf("1.exclusive lock(write lock)\n");
        printf("2.share lock(read lock)\n");
        printf("3.not use lock\n");
        printf("Choose lock type -> ");
        int ia;
        scanf("%d",&ia);
        int fd = open("lock.txt",O_RDWR|O_APPEND);
        if(ia==1)
        {
                if(fcntl(fd, F_SETLK, file_lock(F_WRLCK, SEEK_SET))!=0)
                        printf("F_WRLCK fail.\n");
                else 
                        printf("F_WRLCK success.\n");
        }
        else if(ia==2)
        {
                if(fcntl(fd, F_SETLK, file_lock(F_RDLCK, SEEK_SET))!=0)
                        printf("F_RDLCK fail.\n");
                else 
                        printf("F_RDLCK success.\n");
        }
        char ca[10000];
        if(read(fd, ca, 10000)<0)printf("Can't read file.\n");
        else
        {
                printf("Read file:\n");
                puts(ca);
        }
        strcpy(ca,"\n\nab write success.\n");
        if(write(fd, ca, strlen(ca))<0)printf("Can't write file.\n");
        else
        {
                printf("write file success.\n");
        }
        fcntl(fd, F_SETLK, file_lock(F_UNLCK, SEEK_SET));
        close(fd);
}

/*
mount /dev/sda1 /mnt
mount -o remount,mand /mnt
*/
#include<stdio.h>
#include<unistd.h>
#include<fcntl.h>
#include<string.h>

struct flock* file_lock(short type,short whence)
{
        static struct flock ret;
        ret.l_type = type;
        ret.l_start = 0;
        ret.l_whence = whence;
        ret.l_len = 0;
        ret.l_pid = getpid();
        return &ret;
}

int main()
{
        printf("1.exclusive lock(write lock)\n");
        printf("2.share lock(read lock)\n");
        printf("Choose lock type -> ");
        int ia;
        scanf("%d",&ia);
        int fd = open("mandlock.txt",O_RDWR|O_APPEND);
        //printf("fd = %d\n",fd);
        if(ia==1)
        {
                if(fcntl(fd, F_SETLK, file_lock(F_WRLCK, SEEK_SET))==0)
                        printf("F_WRLCK success.\n");
                else 
                {
                        printf("F_WRLCK fail.\n");
                        return 0;
                }
        }
        else
        {
                if(fcntl(fd, F_SETLK, file_lock(F_RDLCK, SEEK_SET))==0)
                        printf("F_RDLCK success.\n");
                else 
                {
                        printf("F_RDLCK fail.\n");
                        return 0;
                }
        }
        ia= 0;
        do
        {
                printf("If you want to unlock file and end program,\n");
                printf("please input 1 -> \n");
                scanf("%d",&ia);
        }while(ia!=1);
        fcntl(fd, F_SETLK, file_lock(F_UNLCK, SEEK_SET));
        close(fd);
}

#include<stdio.h>
#include<unistd.h>
#include<fcntl.h>
#include<string.h>

struct flock* file_lock(short type,short whence)
{
        static struct flock ret;
        ret.l_type = type;
        ret.l_start = 0;
        ret.l_whence = whence;
        ret.l_len = 0;
        ret.l_pid = getpid();
        return &ret;
}

int main()
{
        printf("1.exclusive lock(write lock)\n");
        printf("2.share lock(read lock)\n");
        printf("3.not use lock\n");
        printf("Choose lock type -> ");
        int ia;
        scanf("%d",&ia);
        int fd = open("mandlock.txt",O_RDWR|O_APPEND);
        if(ia==1)
        {
                if(fcntl(fd, F_SETLK, file_lock(F_WRLCK, SEEK_SET))!=0)
                        printf("F_WRLCK fail.\n");
                else 
                        printf("F_WRLCK success.\n");
        }
        else if(ia==2)
        {
                if(fcntl(fd, F_SETLK, file_lock(F_RDLCK, SEEK_SET))!=0)
                        printf("F_RDLCK fail.\n");
                else 
                        printf("F_RDLCK success.\n");
        }
        char ca[10000];
        if(read(fd, ca, 10000)<0)printf("Can't read file.\n");
        else
        {
                printf("Read file:\n");
                puts(ca);
        }
        strcpy(ca,"\n\nab write success.\n");
        if(write(fd, ca, strlen(ca))<0)printf("Can't write file.\n");
        else
        {
                printf("write file success.\n");
        }
        fcntl(fd, F_SETLK, file_lock(F_UNLCK, SEEK_SET));
        close(fd);
}

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<sstream>
using namespace std;

int freeFrameList[] = {4,7,8,5,1,2,11,12,10,13,14,15};
int freeFrameCnt = 12, freeFrameIndex = 0;
string frame[16] = {"ee","","","ww","","","gg","","","ff","","","","","",""};
string processA[] = {"ab","ef","cd","gh","xa","ta","ab","cg"};
string processB[] = {"rx","yy","zz","ww","mr","mk","fn","zx"};

void show_all(bool ba=false)
{
        if(!ba)
        {
                for(int i=0;i<79;i++)
                        cout<<"=";
                cout<<endl;
        }
        printf("\n%s\n","ProcessA");
        for(int i=0;i<8;i++)printf(" %-2d",i);
        puts("");
        for(int i=0;i<8;i++)printf("%3s",processA[i].c_str());
        printf("\n\n%s\n","ProcessB");
        for(int i=0;i<8;i++)printf(" %-2d",i);
        puts("");
        for(int i=0;i<8;i++)printf("%3s",processB[i].c_str());
        printf("\n\n%s\n","freeFrameList");
        for(int i=freeFrameIndex;i<freeFrameCnt;i++)printf("%3d",freeFrameList[i]);
        printf("\n\n%s\n","frame");
        for(int i=0;i<16;i++)printf(" %-2d",i);
        puts("");
        for(int i=0;i<16;i++)printf("%3s",frame[i].c_str());
        puts("");puts("");
}

int main()
{
        string sa;
        show_all(true);
        for(int i=0;i<freeFrameCnt && cout<<"Enter next (ProcessName/page No) -> " && getline(cin,sa);i++)
        {
                sa.erase(0,sa.size()-3);
                istringstream ssin(sa);
                char ca;
                int ia;
                ssin>>ca>>ia;
                switch(ca)
                {
                case 'a':case 'A':
                        frame[freeFrameList[freeFrameIndex++]] = processA[ia];
                        break;
                case 'b':case 'B':
                        frame[freeFrameList[freeFrameIndex++]] = processB[ia];
                        break;
                }
                show_all();
        }
}
/*
ProcessA 0
ProcessB 1
ProcessA 4
ProcessB 5
ProcessB 7
ProcessA 7
ProcessA 2
ProcessB 6
*/

/*
Step1: Using the fork() function to create a new process.

Step2: Using command line to kill the process.
        kill -kill 1899

Step3: Repeat step1 and use system calls to kill process.
        
*/
#include<stdio.h>
#include<unistd.h>

int main()
{
    pid_t newpid = fork();
    if(newpid==0)
    {
        for(;;)
            pause();
    }
    printf("pid = %d\n",newpid);
    wait(NULL);
    printf("Child process is finished.\n");
}

#include<stdio.h>
#include<unistd.h>
#include<signal.h>

int main()
{
    pid_t newpid;
    printf("Input the pid of the process you want to kill -> ");
    scanf("%d",&newpid);
    kill(newpid,SIGKILL);
}

#include<stdio.h>
#include<unistd.h>
#include<signal.h>

struct sigaction newact;

/* here is the signal handler */ 
void catch_alarm_2(int sig_num)   /* the argument is signal number  */
{   
    /* re-set the signal handler again to catch_int, for next time */
    sigaction(SIGINT, &newact, NULL);
}
void catch_int_1(int sig_num)   /* the argument is signal number  */
{   
    /* re-set the signal handler again to catch_int, for next time */
    signal(SIGINT, catch_int_1);
    printf("How are you?\n",sig_num);
}
void catch_int_2(int sig_num)   /* the argument is signal number  */
{   
    /* re-set the signal handler again to catch_int, for next time */
    signal(SIGINT, catch_int_2);
    printf("I am fine!\n",sig_num);
}
void catch_alarm_1(int sig_num)   /* the argument is signal number  */
{   
    /* re-set the signal handler again to catch_int, for next time */
    signal(SIGINT, catch_int_2);
    signal(SIGALRM, catch_alarm_2);
    alarm(3);
}

int main(int argc, char* argv[])
{
    sigaction(SIGINT, NULL, &newact);
    
    /* set the INT (Ctrl-C) signal handler to 'catch_int' */
    signal(SIGINT, catch_int_1);
    signal(SIGALRM, catch_alarm_1);
    alarm(3);

    /* now, lets get into an infinite loop of doing nothing. */
    for ( ;; )
        pause();
} 

/*
Compile Command:
    gcc -o a a.c -pthread
*/
#include<pthread.h>
#include<stdio.h>
#include<stdlib.h>

void *PrintHello(void *arg)
{
    printf("This is Hello Thread\n");
    printf("Thread ID:%lu\n",pthread_self());
    printf("Argument: %d\n",(int)arg);
    //printf("Argument: %d\n",*(int*)arg);
    pthread_exit(NULL);
}
 
int main()
{
    pthread_t thread;
    int rc,t=100;
    rc = pthread_create( &thread, NULL, PrintHello, (void*)t);
    if(rc)
    {
        printf("ERROR: return code from pthread_create() is %d\n",rc);
        exit(-1);
    }
    rc = pthread_join( thread, NULL);
    if(rc)
    {
        printf("ERROR: return code from pthread_join() is %d\n",rc);
        exit(-1);
    }
    return 0;
}

/*
Compile Command:
    gcc -o b b.c -pthread
 
Questions:
#   Observe all of the results you got, and think about what
    problem does it have? (10pts.)
#   Compare to fork() process by doing all the same thing to
    the global variable, can you figure out what’s the
    difference between them? (10pts.)
 
*/
#include<pthread.h>
#include<stdio.h>
#include<stdlib.h>
 
int count = 0;
 
void *PrintHello(void *arg)
{
    int ia=250000;
    //printf("%d) Start: count = %d\n",(int)arg, count);
    while(ia--)
    {
        count++;
        //usleep(1);
    }
    //printf("%d) End: count = %d\n",(int)arg, count);
    printf("Thread %d: ID %lu Completed.\n",(int)arg,pthread_self());
    pthread_exit(NULL);
}
 
int main()
{
    pthread_t thread[4];
    int rc,t;
    for(t=0;t<4;t++)
    {
        rc = pthread_create( &thread[t], NULL, PrintHello, (void*)t);
        if(rc)
        {
            printf("ERROR: return code from pthread_create() is %d\n",rc);
            exit(-1);
        }
    }
    for(t=0;t<4;t++)
    {
        rc = pthread_join( thread[t], NULL);
        if(rc)
        {
            printf("ERROR: return code from pthread_join() is %d\n",rc);
            exit(-1);
        }
    }
    printf("Value = %d\n",count);
    return 0;
}

/*
Compile Command:
    gcc -o c c.c -pthread
 
*/
#include<pthread.h>
#include<unistd.h>
#include<stdio.h>
#include<string.h>
#include<sys/types.h>
#include<sys/ipc.h>
#include<sys/msg.h>
#include<stdlib.h>
#include "msg_que.h"
 
long int ProgramID = 1; // 1 or 2
int closeMsgQue = 0;
 
void *MsgSend(void *arg)
{
    key_t key=0x1234;
        int msqid = msgget(key,IPC_CREAT | 0666);
        oslab_msg_st msg_buffer;
        while( printf("Enter some text: "),fgets(msg_buffer.msg_text,256,stdin))
        {
                msg_buffer.oslab_msg_type = ProgramID;
                msgsnd(msqid,(void*)&msg_buffer,sizeof(msg_buffer)-sizeof(long int),0);
                if(strcmp(msg_buffer.msg_text,"exit\n")==0)
                {
            closeMsgQue = 1;
                        break;
        }
        }
    pthread_exit(NULL);
}
void *MsgGet(void *arg)
{
    key_t key=0x1234;
        int msqid = msgget(key,IPC_CREAT | 0666);
        oslab_msg_st msg_buffer;
        struct msqid_ds msq_id;
        msgctl(msqid,IPC_STAT,&msq_id);
        while( msgrcv(msqid,(void*)&msg_buffer,sizeof(msg_buffer)-sizeof(long int),3-ProgramID,0) )
        {
                printf("Received: %s\n",msg_buffer.msg_text);
                if(strcmp(msg_buffer.msg_text,"exit\n")==0)
                {
                        if(closeMsgQue)msgctl(msqid,IPC_RMID,&msq_id);
                        break;
                }
        }
    pthread_exit(NULL);
}
 
int main()
{
    pthread_t thread[2];
    int rc,t;
    rc = pthread_create( &thread[0], NULL, MsgSend, (void*)t);
    if(rc)
    {
        printf("ERROR: return code from pthread_create() is %d\n",rc);
        exit(-1);
    }
    rc = pthread_create( &thread[1], NULL, MsgGet, (void*)t);
    if(rc)
    {
        printf("ERROR: return code from pthread_create() is %d\n",rc);
        exit(-1);
    }
    rc = pthread_join( thread[0], NULL);
    if(rc)
    {
        printf("ERROR: return code from pthread_join() is %d\n",rc);
        exit(-1);
    }
    rc = pthread_join( thread[1], NULL);
    if(rc)
    {
        printf("ERROR: return code from pthread_join() is %d\n",rc);
        exit(-1);
    }
    return 0;
}

// WA
// BY taichunmin
// NCPC 2011 pb
#include<iostream>
#include<fstream>
#include<sstream>
using namespace std;
int va[1000000];
int va_c;
int main()
{
        //freopen("pb.in","r",stdin);
        int ta;
        cin>>ta;
        string sa;
        while(ta--)
        {
                int ia,ib;
                cin>>ia;
                cin.get();
                getline(fin,sa);
                va_c=0;
                istringstream ssin(sa);
                while(ssin>>ib)
                {
                        bool ba=true;
                        for(int k=0;k<va_c;k++)
                                if(va[k]>=ib)
                                {
                                        va[k]=ib;
                                        ba=false;
                                        break;
                                }
                        if(ba)va[va_c++]=ib;
                }
                cout<<va_c<<endl;
        }
        return 0;
}

// WA
// BY taichunmin
// NCPC 2011 pd
#include<iostream>
#include<sstream>
#include<fstream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int ia,ib;
struct ta_t
{
        string n;
        int v;
}attr[10];
int fa(string sa)
{
        bool is_num=true;
        for(int i=0;i<sa.size() && is_num;i++)
                if(!('0'<=sa[i] && sa[i]<='9')is_num=false;
        if(is_num)
        {
                istringstream ssin(sa);
                int temp;
                ssin>>temp;
                return temp;
        }
        else
        {
                for(int i=0;i<ia;i++)
                        if(attr[i].n==sa)return attr[i].v;
        }
        return 2147483647;
}
int main()
{
        //freopen("pd.in","r",stdin);
        int ta;
        cin>>ta;
        while(ta--)
        {
                cin>>ia>>ib;
                string sa,sname,sx,sy;
                for(int i=0;i<ia;i++)
                        cin>>attr[i].n>>attr[i].v;
                cin.get();
                bool ba=true;
                for(int i=0;i<ib;i++)
                {
                        getline(cin,sa);
                        if(!ba)continue;
                        istringstream ssin(sa);
                        ssin>>sname;
                        bool bb=true;
                        while(getline(ssin,sa,'('))
                        {
                                ssin>>sx;
                                getline(ssin,sy,')');
                                sy.erase(0,3);
                                //cout<<"sy = "<<sy<<endl;
                                if(fa(sx)<=fa(sy))
                                {
                                        bb=false;
                                        break;
                                }
                        }
                        if(bb)
                        {
                                ba=false;
                                cout<<sname<<endl;
                        }
                }
        }
}

// AC
// BY morris1028
// NCPC 2011 ph
#include<stdlib.h>
#include<stdio.h>
#include<string.h>
int A[100000],HASH[1000000],size;
struct Node{
        int v,s;
        int next;
}Node[200000];
int insHash(int v,int index)
{
        int m = v%1000000;
        if(HASH[m]==0) {
                size++;
                HASH[m]=size;
                Node[size].v=v, Node[size].s=index;
                Node[size].next=0;
                return -1;
        }
        int now=HSAH[m],pre=0;
        while(now)
        {
                if(Node[now].v>v || (Node[now].v==v && Node[now].s>index))
                        break;
                else pre=now, now=Node[now].next;
        }
        size++;
        if(pre == 0) HASH[m]=size;
        else Node[pre].next=size;
        Node[size].v=v,Node[size].s=index;
        Node[size].next=now;
        return -1;
}
int find(int v,int index)
{
        int m=v%1000000;
        int now=HASH[m], pre=0;
        while(now)
        {
                if(Node[now].v==v && Node[now].s>index)
                        return Node[now].s;
                else pre=now, now=Node[now].next;
        }
        return -1;
}
int Print(){
        int now, pre, i=0;
        for(int i=0;i<10;i++)
        {
                now=HASH[i];
                while(now)
                {
                        printf("(%d,%d)->",Node[now].v,Node[now].s);
                        pre=now, now=Node[now].next;
                }
                puts("===");
        }
        return 0;
}
int main(){
        //freopen("ph.in","r",stdin);
        int n,k,i;
        while(scanf("%d", &n)==1 && n) {
                for(i=0;i<n;i++)
                        scanf("%d",&A[i];
                memset(HASH, 0, sizeof(HASH));
                scanf("%d", &k);
                int sum=0,tmp;
                size=1;
                for(i=0;i<n;i++)
                {
                        A[i]%=k;
                        sum+=A[i];
                        sum%=k;
                        if(sum<0) sum+=k;
                        insHash(sum,i);
                }
                /* Print();*/
                sum=0;
                int flag=0;
                tmp=find(0,-1);
                if(tmp!=-1)
                {
                        printf("%d %d\n",1,tmp+1);
                        flag=1;
                }
                for(i=0;i<n;i++){
                        A[i]%=k;
                        sum+=A[i];
                        sum%=k;
                        if(sum<0) sum+=k;
                        tmp=find(sum,i);
                        /* printf("%d\n",tmp);*/
                        if(tmp!=-1 && flag==0)
                        {
                                printf("%d %d\n",i+2,tmp+1);
                                flag=1;
                                break;
                        }
                }
                if(flag==0)
                        printf("no solutions.\n");
        }
        return 0;
}
/*
7
2 5 1 -4 5 9 3
10
11 -3 1 13 -5 6 1 -8 -4 5
10
*/

// AC
// BY morris1028
// NCPC 2011 pk
#include<stdlib.h>
#include<stdio.h>
#include<string.h>
#define oo 2147483647
int map[1000][1000],Mt[1000];
int gcd(int x,int y)
{
        int t;
        while(y)
                t=x, x=y, y=t%y;
        return x;
}
int Used[1000], Time[1000], Ans;
int DFS(int T,int now,int start) {
        int last= oo,i,tmp,flag=0,ttry=0;
        Time[now] = T;
        /*printf("%d %d\n",now,T);*/
        for(i=0;i<Mt[now];i++){
                if(Used[map[now][i]]==0) {
                        used[map[now][i]]=1;
                        tmp=DFS(T+1, map[now][i],0);
                        if(tmp>=T) flag=1;
                        last=tmp<last?tmp:last;
                        ttry++;
                } else {
                        tmp=Time[map[now][i]];
                        last=tmp<last?tmp:last;
                }
        }
        if(start==1) {
                if(ttry>1)
                        Ans++;
        } else {
                Ans += flag;
        }
        /*printf("key : %d %d\nn", now,flag);*/
        return last;
}
int main() {
        //freopen("pk.in","r",stdin);
        int T,i,j,A[1001],n;
        scanf("%d",&T);
        while(T--)
        {
                scanf("%d",&n);
                for(i=0;i<n;i++)
                        scanf("%d",&A[i]);
                memset(map, 0, sizeof(map));
                memset(Mt, 0, sizeof(Mt));
                memset(Used, 0, sizeof(Used));
                memset(Time, 0, sizeof(Time));
                Ans=0;
                for(i=0;i<n;i++) {
                        for(j=i+1;j<n;j++) {
                                int tmp=gcd(A[i],A[j]);
                                if(tmp!=1) {
                                        map[i][Mt[i]++]=j;
                                        map[j][Mt[j]++]=i;
                                }
                        }
                }
                for(i=0;i<n;i++)
                        if(Used[i]==0) {
                                Used[i] =1,Time[i] = 1;
                                DFS(1,i,1);
                        }
                printf("%d\n",Ans);
        }
        return 0;
}

#include<iostream> using namespace std; int main() { int t1,ia,va[50][2]; long long oa,ob; cin>>t1; while(t1--) { cin>>ia; oa=0; for(int i=0;i<ia;i++) cin>>va[i][0]>>va[i][1]; for(int i=0;i<ia;i++) for(int j=i+1;j<ia;j++) { ob=(((long long)va[i][0])-va[j][0])*(va[i][1]-va[j][1]); if(ob<0)ob=-ob; if(ob>oa)oa=ob; } cout<<oa<<endl; } }
#include<stdio.h> #include<stdlib.h> struct Queue{ int x, y; }Queue[81]; int N = 3, Map[9][9], Qt, Find; int Check(int x, int y, int Num) { int a, b; for(a=0;a<N*N;a++) if(Map[x][a] == Num && y!=a) return 0; for(a=0;a<N*N;a++) if(Map[a][y] == Num && x!=a) return 0; int xx=x/N*N, yy=y/N*N; for(a=0;a<N;a++) for(b=0;b<N;b++) if(Map[xx+a][yy+b] == Num && (xx+a!=x && yy+b!=y)) return 0; return 1; } void DFS(int Now) { if(Find==1) return; int a, b; if(Now == Qt) { Find=1; for(a = 0; a < 9;puts(""), a++) { for(b = 0; b < 8; b++) { printf("%d ", Map[a][b]); } printf("%d", Map[a][8]); } return; } for(a = 1; a <= 9; a++) if(Check(Queue[Now].x, Queue[Now].y, a)==1) { Map[Queue[Now].x][Queue[Now].y]=a; DFS(Now+1); Map[Queue[Now].x][Queue[Now].y]=0; } } int main() { int a, b, No; while(scanf("%d",&Map[0][0])==1) { Qt=0, No=0; if(Map[0][0]==0) Queue[Qt].x=0, Queue[Qt].y=0, Qt++; for(a = 0; a < 9; a++) for(b = 0; b < 9; b++) { if(a == 0 && b == 0) continue; scanf("%d",&Map[a][b]); if(Map[a][b]==0) Queue[Qt].x=a, Queue[Qt].y=b, Qt++; } Find=0; if(No==0) DFS(0); if(Find==0) puts("NO SOLUTION"); } return 0; } /* 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 */
/**********************************************************************************/ /* Problem: c121 "Fibonacci Freeze" from ACM 495 */ /* Language: CPP (1469 Bytes) */ /* Result: AC judge by zeroserver@ZeroJudge */ /* Author: taichunmin at 2009-02-06 13:13:37 */ /**********************************************************************************/ #include<iostream> using namespace std; long long ia[93]={0,1};//int 47 long long 93 string sa[4910]; string add(string fsa,string fsb) { string tsa; int strl=fsa.size(),stra=fsa.size(),strb=fsb.size(); if(fsb.size()>strl)strl=fsb.size(); strl++; tsa.resize(strl); fsa.resize(strl); fsb.resize(strl); for(int i=0;i<strl;i++)tsa[i]='0'; for(int i=stra;i<strl;i++)fsa[i]='0'; for(int i=strb;i<strl;i++)fsb[i]='0'; bool ba=true; for(int i=0;i<strl-1;i++) tsa[i]+=fsa[i]-'0'+fsb[i]-'0'; for(int i=0;i<strl-1;i++) if(tsa[i]>'9') { if(i==strl-2)ba=false; tsa[i+1]+=(tsa[i]-'0')/10; tsa[i]=(tsa[i]-'0')%10+'0'; } if(ba)tsa.resize(strl-1); return tsa; } int main() { //freopen("testdata\\pro19.in","r",stdin); //freopen("pro19.out","w",stdout); for(int i=2;i<93;i++)ia[i]=ia[i-1]+ia[i-2]; long long ib=ia[91]; while(ib>0) { sa[0]+=(char)(ib%10+'0'); ib/=10; } ib=ia[92]; while(ib>0) { sa[1]+=(char)(ib%10+'0'); ib/=10; } sa[0]=add(sa[0],sa[1]); sa[1]=add(sa[0],sa[1]); for(int i=2;i<4910;i++)sa[i]=add(sa[i-2],sa[i-1]); while(cin>>ib) { if(ib<=92)cout<<ia[ib]<<endl; else { for(int i=sa[ib-93].size()-1;i>-1;i--)cout<<sa[ib-93][i]; cout<<endl; } } //system("pause"); }
#include<stdio.h> #include<stdlib.h> int Ans[100]; void DFS(int n, int last, int now) { if(n < 0) return; int i; if(n == 0) { for(i = 0; i < now-1; i++) printf("%d ", Ans[i]); printf("%d\n", Ans[now-1]); return; } for(i = last+1; i <= n; i++) Ans[now] = i, DFS(n-i, i, now+1); } int main() { int n; while(scanf("%d", &n) == 1) { DFS(n, 0, 0); } return 0; }
#include<iostream> #include<sstream> using namespace std; int va[10000]; int va_c; int main() { int ia,ib,itotal; string sa; while(cin>>ia) { getline(cin,sa); va_c=itotal=0; istringstream ssin(sa); while(ssin>>ib)va[va_c++]=ib; for(int i=0;i<va_c;i++) itotal+=va[i]; itotal=ia-itotal-va_c+1; //cout<<"itotal="<<itotal<<endl; bool firsta=true,firstb=true; for(int i=0;i<va_c;i++) { if(firsta)firsta=false; else cout<<" 0"; for(int j=0;j<va[i];j++) { if(firstb)firstb=false; else cout<<' '; cout<<((j<itotal)?0:1); } } for(int i=0;i<itotal;i++)cout<<" 0"; cout<<endl; } }

好難得拿了個第一名@@ - team214

這個是在我期末那周拚出來的數獨遊戲
其實很久以前就很想寫樹讀了
但是一來沒有什麼壓力
二來C++也不是合寫這種
三來我Visual C++不熟悉，寫不出這種東西
所以一直拖到了現在才寫出數獨遊戲!!
另外 裡面還有一些附屬檔案
我就放到下面的這個連結給大家抓吧

http://dl.dropbox.com/u/12113131/program/sudoku.rar

import java.awt.*; import java.awt.event.*; import javax.swing.*; import java.io.*; import java.util.*; public class sudoku extends JFrame // implements ActionListener implements KeyListener { private JPanel gameBoard,settingBoard,tempPanel[]; private JButton btn[],loadbtn,designbtn; private JTextField filename; private String columnSpace,rowSpace; private Font btnFont; // 字形 private int SIZE = 600, win; private FileAction fileAction; private GameAction gameAction; private Color warnningColor; private int checkSet[][]; public static void main(String[]args) { sudoku new_game = new sudoku(); new_game.setVisible(true); } public sudoku() { super("數獨遊戲"); // 視窗標題 btnFont = new Font(null,Font.BOLD,30); // 設定字形大小gameBoard = new JPanel(); setSize(SIZE + 17, SIZE + 57); // 設定視窗大小 setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); // 設定右上方的 X 可關閉程式 setLayout(new BorderLayout()); // 設定版面 (BorderLayout 是有五個方向的排版方式) setResizable(false); // 設定不可變更視窗大小 columnSpace="　"; rowSpace=" 　"; tempPanel = new JPanel[2]; add(new JLabel(rowSpace),BorderLayout.WEST); add(new JLabel(columnSpace),BorderLayout.NORTH); settingBoard = new JPanel(); settingBoard.setLayout(new FlowLayout()); settingBoard.add(new JLabel("檔案名稱：")); filename = new JTextField("save.txt",20); settingBoard.add(filename); fileAction = new FileAction(); loadbtn = new JButton("Load"); loadbtn.addActionListener(fileAction); settingBoard.add(loadbtn); designbtn = new JButton("Design"); designbtn.addActionListener(fileAction); settingBoard.add(designbtn); add(settingBoard,BorderLayout.SOUTH); gameBoard = new JPanel(); gameAction = new GameAction(); gameBoard.setLayout(new GridLayout(3,3)); // 設定排版為九個格子 (GridLayout 是很像畫格子的排版方式) btn = new JButton[81]; for(int i=0;i<9;i++) { tempPanel[0] = new JPanel(); tempPanel[0].setLayout(new BorderLayout()); tempPanel[0].add(new JLabel(rowSpace),BorderLayout.EAST); tempPanel[0].add(new JLabel(columnSpace),BorderLayout.SOUTH); tempPanel[1] = new JPanel(); tempPanel[1].setLayout(new GridLayout(3,3)); for(int j=0;j<9;j++) { int index = i/3*27 + i%3*3 + j/3*9 + j%3; btn[index] = new JButton(""); // 設定按鈕文字 btn[index].addActionListener(gameAction); // 設定按鈕的動作 btn[index].setActionCommand(""+index); // 設定按鈕的指令 (將按鈕的編號轉成 String 設定給 ActionCommand) btn[index].setFont(btnFont); // 設定按鈕的字形 tempPanel[1].add(btn[index]); // 將按鈕加進 gameBoard } tempPanel[0].add(tempPanel[1],BorderLayout.CENTER); gameBoard.add(tempPanel[0]); } warnningColor = Color.RED; win = 0; checkSet = new int[27][9]; for(int i=0;i<9;i++) for(int j=0;j<9;j++) { checkSet[i][j]= i *9 + j; // 水平 checkSet[9+i][j]= j *9 + i; // 垂直 checkSet[18+i][j]=(i/3*3+j/3) *9 + (i%3*3+j%3); // 九宮格 } add(gameBoard, BorderLayout.CENTER); // 將 gameBoard 加到視窗的中央 } private int check() { //if(win == 1)return win; win = 1; clear_btn_background(); for(int i=0;i<checkSet.length;i++) if(check_paint(checkSet[i]))win = -1; for(int i=0;i<81 && win==1;i++) if(btn[i].getText().equals(""))win = 0; return win; } private boolean check_paint(int checkArr[]) { boolean paint = false; int data[] = new int[10]; for(int i=0;i<data.length;i++) data[i]=0; for(int i=0;i<checkArr.length;i++) { if( btn[ checkArr[i] ].getText().equals(""))continue; int temp = Integer.parseInt( btn[ checkArr[i] ].getText() ); if(data[temp]!=0) { if(data[temp]<0)data[temp]=-data[temp]; btn[data[temp]-1].setBackground(warnningColor); paint = true; data[temp]=-checkArr[i]-1; } else data[temp]=checkArr[i]+1; } for(int i=0;i<data.length;i++) if(data[i]<0) { btn[-data[i]-1].setBackground(warnningColor); paint = true; } return paint; } private void clear_btn() { for(int i=0;i<81;i++) { btn[i].setText(""); btn[i].setActionCommand(""+i); } designbtn.setText("Design"); designbtn.setActionCommand("Design"); win = 0; clear_btn_background(); } private void clear_btn_background() { for(int i=0;i<81;i++) btn[i].setBackground(null); } private int next_val(int temp,int val) { boolean num[] = {false,false,false,false,false,false,false,false,false,false}; int ia; for(int i=0;i<9;i++) { ia=temp/9*9+i; if(btn[ia].getActionCommand().length()>2)num[getVal(ia)]=true; ia=i*9+temp%9; if(btn[ia].getActionCommand().length()>2)num[getVal(ia)]=true; ia= temp/27*27 + temp%9/3*3 + i/3*9 + i%3 ; if(btn[ia].getActionCommand().length()>2)num[getVal(ia)]=true; } for(int i=val+1;i<10;i++) if(!num[i])return i; return 0; } private int getVal(int temp) { if(!(btn[temp].getText().equals(""))) return Integer.parseInt(btn[temp].getText()); // 若該按鈕有文字則將該string用int 傳回 return 0; // 否則傳回0 } private void setVal(int temp,int val) { if(val!=0)btn[temp].setText(""+val); else btn[temp].setText(""); } private class GameAction implements ActionListener { public void actionPerformed(ActionEvent e) { int index = Integer.parseInt(e.getActionCommand()); if(index>99)return; index %= 100; int val = getVal(index); if( designbtn.getText().equals("Design") ) // 開始設計了，將按鈕變成 Save { designbtn.setText("Save"); designbtn.setActionCommand("Save"); } if( designbtn.getText().equals("Save")) // 設計功能下，沒有辦法按下 New val=(val+1)%10; else if( designbtn.getText().equals("New")) val=next_val(index,val); // 可替換成搜尋函式 setVal(index,val); check(); if(win==1) { JOptionPane.showMessageDialog(null,"恭喜你解開這個數獨啦!!\n你可以按 New 進行設計新的題目\n或按 Load 來讀取"+filename.getText()); } } } private class FileAction implements ActionListener { public void actionPerformed(ActionEvent e) { if(e.getActionCommand().equals("Load")) { Scanner fin = null; try { fin = new Scanner(new FileInputStream( filename.getText() )); } catch(Exception error) { JOptionPane.showMessageDialog(null,"無法讀取 "+filename.getText()+"\n請確認該檔案是否存在。"); clear_btn(); return ; } if( !(designbtn.getText().equals("Design")) && win != 1 && JOptionPane.showConfirmDialog(null, "目前的遊戲進度將會被覆蓋，是否繼續?", "檔案讀取", JOptionPane.YES_NO_OPTION) != JOptionPane.YES_OPTION) return; for(int i=0;i<81 && fin.hasNextInt();i++) { int val = fin.nextInt(); if(val!=0) { btn[i].setText(""+val); btn[i].setActionCommand(""+(i+100)); } else { btn[i].setText(""); btn[i].setActionCommand(""+i); } } fin.close(); win = 0; check(); if(win==-1)JOptionPane.showMessageDialog(null,"讀入的題目不符數獨規則，\n請手動在該檔案內更改完成後重新讀入。"); else if(win==1)JOptionPane.showMessageDialog(null,filename.getText()+" 內的題目已經獲勝。"); designbtn.setText("New"); designbtn.setActionCommand("New"); } else if(e.getActionCommand().equals("Save")) { if(win==-1)JOptionPane.showMessageDialog(null,"目前設計的題目不符數獨規則，\n請在紅色色塊處更改完成後再按 Save。"); else if(win==1)JOptionPane.showMessageDialog(null,"目前設計的題目已經獲勝，無法儲存為題目。"); if(win!=0)return; PrintWriter fout = null; try { fout = new PrintWriter(new FileOutputStream( filename.getText() )); } catch(Exception error) { filename.setText("Can Read The File."); return; } if( JOptionPane.showConfirmDialog(null, filename.getText()+" 將會被覆蓋，是否繼續?", "盤面設計儲存", JOptionPane.YES_NO_OPTION) != JOptionPane.YES_OPTION) return; for(int i=0;i<81;i++) { int val=getVal(i); fout.printf("%4d",val); if(i%9==8)fout.println(); else fout.print(" "); } fout.close(); clear_btn(); } else if(e.getActionCommand().equals("New")) { if( win != 1 && JOptionPane.showConfirmDialog(null, "遊戲盤面將會被清空，是否繼續?", "開新遊戲", JOptionPane.YES_NO_OPTION) != JOptionPane.YES_OPTION) return; clear_btn(); } else if(e.getActionCommand().equals("Design")) { designbtn.setText("Design"); designbtn.setActionCommand("Design"); JOptionPane.showMessageDialog(null,"現在可以進行數獨的題目設計，設計完後請按 Save。\n若想開始遊戲請輸入正確的檔名之後按下 Load。"); } } } }

內容 ：

輸入說明 ：

輸出說明 ：

範例輸入 ：

4
0 5 0 6
6 0 5 6
1 6 0 6
1 1 1 0
1 1 1 1 4 4 2 2 2 3
5
0 1 1 1 1
1 0 2 2 2
1 1 0 2 1
2 1 3 0 1
3 2 3 4 0
4 2 4 1 5 4 3 2 1

範例輸出 ：

6
5

提示 ：

出處 ：

/**********************************************************************************/ /* Problem: b060 "5. 快遞服務" from 95全國資訊學科能力決賽 */ /* Language: CPP */ /* Result: AC (428ms, 1404KB) on ZeroJudge */ /* Author: taichunmin at 2011-06-20 01:52:18 */ /* 感謝 morris1028 指導。 */ /**********************************************************************************/ #include<iostream> #include<sstream> using namespace std; #define MAX_COST 2147483647 struct array2 { int e[200][200]; }va[2],*pre,*now,empty,cost; void inline fa(int ra,int rb,int rvalue) { if(ra>rb)swap(ra,rb); if(now->e[ra][rb]>rvalue)now->e[ra][rb]=rvalue; } void debug_now() { int size=4; for(int i=0;i<size;i++) { for(int j=0;j<size;j++) printf("%4d",now->e[i][j]); printf("\n"); } //system("pause"); } int main() { for(int i=0;i<200;i++) { empty.e[i][i]=0; for(int j=i+1;j<200;j++) empty.e[i][j]=MAX_COST; } int ia; istringstream ssin; string sa; while(cin>>ia) { for(int i=0;i<ia;i++) for(int j=0;j<ia;j++) cin>>cost.e[i][j]; cin.get(); getline(cin,sa); ssin.clear(); ssin.str(sa); va[1]=empty; va[1].e[0][1]=0; int p_pre=3,p_now; pre=&va[0]; now=&va[1]; //debug_now(); while(ssin>>p_now) { swap(pre,now); *now=empty; for(int i=0;i<ia;i++) for(int j=i+1;j<ia;j++) if(pre->e[i][j]!=MAX_COST) { fa(i,j, pre->e[i][j] + cost.e[p_pre-1][p_now-1]); fa(p_pre-1,j, pre->e[i][j] + cost.e[i][p_now-1]); fa(i,p_pre-1, pre->e[i][j] + cost.e[j][p_now-1]); } p_pre=p_now; //debug_now(); } p_pre=now->e[0][1]; for(int i=0;i<ia;i++) for(int j=i+1;j<ia;j++) if(p_pre>now->e[i][j])p_pre=now->e[i][j]; cout<<p_pre<<endl; } //system("pause"); }

 作者  cses (5858)                                            看板  C_and_CPP
 標題  [問題] 關於 xa xb 的猜數字遊戲AI
 時間  Fri Jun 17 23:49:07 2011
───────────────────────────────────────

其實是最近老師開了這個題目給我們

要我們寫出一個簡單的AI來讓電腦跟我們玩 幾A幾B的猜數字遊戲

就是...我們自訂一組數字，而電腦就是隨機產生一組亂數來問我們幾A幾B

我們回答他幾A幾B ， 一直到猜出數字 4A 0B 這樣

之前爬文有看到隨機產生1~9亂數這部分有看到一種方法是"增加某數字出現的權重"

想問問這種語法要怎麼寫呢 ?

由於本人是C的無敵新手，只看著課本找到srand()這個亂數函式

想問  那種可以控制亂數出現比例的方法 要怎麼寫...

題目:

題目的意思應該是輸入123456789
然後就會分別輸出下面的東西
我目前只想到輸出三角形的這個程式碼@@
(輸出的部分先用"*"表示)
可是答案當然不是長這樣= =
#include <stdio.h>
#include <stdlib.h>
int main(void)
{
        int i,j,n=5;
        for(i=1; i<=n; i++) {
                for(j=1; j<=i; j++)
                        printf("*");
                printf("\n");
        }
        system("pause"); return(0);
}

然後我程式學的也不是很好,
剛剛一直把學過的東西在腦理想一遍
不知道要怎樣才能用所學的東西拼出這個程式> <
現在完全屬於卡住的狀態@@
P.S不瞞各位說這是期末作業,然後這題占總成績10%這樣QAQ
有請高手指點Q_Q

程式碼如下，請務必看懂，不懂請留言發問。
#include <stdio.h> #include <string.h> #include <stdlib.h> int main(void) { int i,j; char cNUM[10]="123456789"; for(i=0;i<9;i+=2) printf("%9s\n",&cNUM[i]); printf("\n\n"); for(i=0;i<9;i+=2) { for(j=0;j<strlen(cNUM);j++) printf("%c",(j>=i)?cNUM[j]:' '); printf("\n"); } printf("\n\n"); for(i=0;i<9;i+=2) { for(j=strlen(cNUM)-1;j>=i;j--) printf("%c",cNUM[j]); printf("\n"); } printf("\n\n"); system("pause"); }

這個學期將要結束了

我來吧我這學期的所有程式碼貼上來

就當作這半學期課程中的一個紀錄吧

作業一

/** @author 戴均民 學號：4098056061 資工二 日期：2011/03/05 備註：作業一 The Babylonian algorithm to compute the square root of a number n is as follows: 1.Make a guess at the answer (you can pick n/2 as your initial guess) 2.Compute r = n /guess 3.Set guess = (guess + r) / 2 4.Go back to step 2 for as many iterations as necessary. The more you repeat steps 2 and 3, the closer guess will become to the square root of n. Write a program that inputs an integer for n, iterates through the Babylonian algorithm until the value of guess is the same as the value of Math.sqrt(n) to the fifth decimal place. For each iteration, print out the value of guess and the difference between guess and Math.sqrt(n) as double to six decimal places. At the end of your program, print out the number of guesses as an int and the value of guess as a double to five decimal places. 第二次上傳更新內容：2011/3/10 1.解決輸入 81 時最後的 Guess 會顯示 9.00001 的問題。 2.將迴圈中的輸出進行格式化，採用 %17.6f 來輸出 Guess，以配合輸入最大值 2147483647 */ import java.util.Scanner; //為了要使用 Scanner 來進行輸入，所以需要 import 這個 package public class hw1_4098056061 //class hw1_4098056061 { public static void main( String [] args )//main function { Scanner cin = new Scanner( System.in );//用來讀取標準輸入的 Scanner int n, guesses_c = 0; //n 是代表要逼近其平方根的數字, guesses_c是為了要計算執行次數的變數 double guess, r, sqrt_n; //guess 就是題目中的猜測, r 是演算法中需要的變數, //sqrt_n 是用來儲存由 Math.sqrt(n) 所回傳 n 的平方根值 //因為呼叫 Math.sqrt() 是非常花費時間的，故每輸入一次 n 只呼叫 Math.sqrt() 一次 System.out.println( " !學號:4098056061 !姓名:戴均民 !作業:作業一 !日期:2011/03/05" ); System.out.println( " !本程式可重複輸入 !若要結束請輸入 Ctrl+Z" ); for(int i=0;i<80;i++)System.out.print("="); System.out.print( "\nInput a number -> " ); //提示使用者輸入資料 while( cin.hasNext() ) //loop for inputs { //cin.hasNext() 是用來確認是否還有測資需要處理, //這樣比較容易測試程式,不用再重複執行 n = cin.nextInt();//讀取一個整數存進 n guess = n / 2.0;//Step 1 of Babylonian algorithm sqrt_n = Math.sqrt( n );//儲存 n 的平方根來決定結束條件 guesses_c = 0;//計算迴圈的執行次數 System.out.printf( "Math.sqrt(%d) = %.6f\n", n, sqrt_n ); //先輸出一次正確的 Math.sqrt(n) 以便檢查程式的正確性 while( true )//因為迴圈的結束條件寫在迴圈內, 所以這裡就設定為無窮迴圈 { System.out.printf( "%3d: Guess = %17.6f,\tDifference = %.6f\n", guesses_c, guess, guess-sqrt_n ); //每次迴圈都顯示出 Guess, 以及 Guess 和 Math.sqrt(n) 的差距到小數第六位 if( guess - sqrt_n < 0.00001 && guess - sqrt_n > -0.00001) { guess=Math.floor(guess*100000)/100000.0; System.out.printf( "\nthe number of guesses = %d, guess = %.5f\n", guesses_c, guess ); break; //利用差距小於正負 0.00001 的方式，就可以確定其精確度在小數五位數的地方。 //達到條件的時候，就跳出這個迴圈。 } r = n / guess;//Step 2 of Babylonian algorithm guess = ( guess + r ) / 2;//Step 3 of Babylonian algorithm guesses_c ++;//增加計數器 }//end loop for Babylonian algorithm's Step 2 and 3 System.out.print( "Input a number -> " ); //提示使用者輸入下一筆資料 }//end loop for inputs }//end of main function }//end of class hw1_4098056061

作業二

/** @author 戴均民 Student ID: 4098056061 Homework: Homework 2 Date: 2011/03/16 Problem: The game of Pig is a sample two player dice game in which the first player to reach 100 or more points wins. Players take turns. On each turn a player rolls a six-sided die. After each roll: . If the player rolls a 1, then the player gets no new points and it becomes the other player's turn. . If the player rolls 2 through 6, then he can either: . ROLL AGAIN or . HOLD. At this point the sum of all rolls is added to the player's score and it becomes other player's turn. Write a program that plays the gmae of Pig, where one player is a human and the other is the computer. When it is the human's turn, the program should show the score of both players and the previous roll. Allow the human to input "r" to roll again or "h" to hold. The computer program should play according to following rule: . Keep rolling when it is the computer's turn until it has accumulated 20 or more points, then hold. If the computer wins or rolls a 1, then the turn ends immediately. Allow the human to roll first. The following line of code can be used to generate a randon number between 1 and 6 that can correspond to the dice roll: int diceroll = (int) (Math.random() * 6) + 1; */ import java.util.Scanner; //為了要使用 Scanner 來進行輸入，所以需要 import 這個 package public class hw2_4098056061 //class hw2_4098056061 { public static void pause(Scanner cin)//需要暫停程式時，就可以用這個函式 { for(int i=0;i<54;i++)System.out.print(" "); //為了讓等等顯示的文字靠右 System.out.print("<Press ENTER to continue>"); cin.nextLine();// read until press enter } public static void main(String [] args)//main function { int[] score = new int [2]; //這個陣列用來儲存雙方的分數，[0]->人類，[1]->電腦 String input; //讀取用的變數 int turn = 0, diceroll, sum_of_turn, turn_counter; // trun: 現在是誰的回合, diceroll: 存亂數得到的數字, // sum_of_turn: 這一回合內的累積分數, turn_counter: 計算這一回合跑了幾次 Scanner cin = new Scanner( System.in ); //use Scanner to read data from standerd input System.out.println(" << Game Of Pig >>"); score[0] = score[1] = 0; //將兩個玩家的成績初始化 while( score[0] < 100 && score[1] < 100 ) //while_of_turn { //都沒有到達100，回合就繼續 sum_of_turn = turn_counter = 0; //將這回合的相關變數歸零 while_of_roll: while( true ) //丟骰子的迴圈 { if( turn_counter == 0 ) //如果這個回合是第一次丟骰子，則會顯示這是誰的回合 { System.out.println("\nIt's "+ ( (turn == 0) ? "your" : "computer's") +" turn! Score: "+score[turn]); } else if( turn == 0 )//人類的回合，而且非第一次丟骰子 { System.out.print("Your score now is " +( score[turn] + sum_of_turn ) + ". Please choose to ROLL AGAIN (r) or HOLD (h) -> "); while(true) //在輸入非 r 且非 h 的時候，這個迴圈會一直重複執行 { input = cin.nextLine(); if( input.equalsIgnoreCase("h") )break while_of_roll; //讀取到 h 的時候跳出丟骰子的迴圈 if( input.equalsIgnoreCase("r") )break; //讀取到 r 的時候只跳出這層迴圈 } } else //電腦的回合，而且非第一次擲骰。 { System.out.print("Computer's score now is " +( score[turn] + sum_of_turn ) + ". "); if( sum_of_turn >= 20)//一直丟到這回合的成績不小於 20 { System.out.println("Computer desides to HOLD!"); pause(cin); //在電腦決定 HOLD 時才暫停 break; } else System.out.println("Computer desides to ROLL AGAIN!"); } diceroll = (int) (Math.random() * 6) + 1; //生產亂數來模擬丟骰子 System.out.println(" * "+((turn == 0)?"you":"computer")+" roll " + diceroll + " point."); if( diceroll == 1 )//丟到 1 的話什麼分數都得不到，而且還要換人 { sum_of_turn = 0; //把分數歸零 System.out.println(" * Unfortunately, "+ ( (turn == 0) ? "your" : "computer's") +" score back to "+score[turn]+" and end up this turn."); pause(cin); //暫停程式 break; } sum_of_turn += diceroll; //把骰子丟到的點數加進這回合的分數內 if( score[turn] + sum_of_turn >= 100) break; //如果分數不小於 100 分則跳出這層迴圈 turn_counter ++; //計數器增加 }//end of while_of_roll score[turn] += sum_of_turn; //把回合的分數加進個人的分數內 turn = 1 - turn; //換人 }//end of while_of_turn System.out.println("\n\n * Congratulations! "+ ( (score[0] >= 100) ? "You" : "Computer" ) +" wins the game of Pig."); }//end of main function }//end of class hw2_4098056061

作業三

/** @author 戴均民 Student ID: 4098056061 Homework: Homework 3 Date: 2011/03/31 Related Files: hw3_4098056061.java Problem: 寫一個Java程式，處理有關分數(fraction)形式的有理數(rational numbers)運算。 Define a class called Fraction for performing arithmetic with fractions. Write a main method to test all the functionalities of the Fraction class. Use integer variables to represent the private data of the class-- the numerator and the denominator. Provide a no-argument constructor that initializes numerator and denominator to 0 and 1, respectively. Also, provide a two-argument constructor that initializes numerator and denominator to the initial values given at the declaration of the object. The constructor should store the fraction in reduced form. For example, the fraction 2/4 would be stored in the object as 1 in the numerator and 2 in the denominator. Provide public methods that perform each of the following tasks: (a) Adding two Fraction numbers. The result should be stored in reduced form. (b) Multiplying two Fraction numbers. The result should be stored in reduced form. (c) Printing Fraction numbers in the form a/b, where a is the numerator and b is the denominator. (d) Printing Fraction numbers in floating-point format. */ import java.util.StringTokenizer; //為了分析 String，以便處理字串形式為參數的分數建構子，所以需要 StringTokenizer 這個 package。 public class Fraction { //start class_of_Fraction private int numerator, denominator; //numerator 分子，denominator 分母。 Fraction() //沒有參數的建構子。 { clear(); //直接設定為 0/1。 } Fraction( int fia, int fib ) //有兩個整數為參數的建構子。 { numerator = fia; denominator = fib; this.format(); //檢查分子分母並格式化。 } Fraction( String fsa ) //以一個字串為參數的建構子。 { StringTokenizer sta = new StringTokenizer( fsa, "/ " ); // 以斜線和空格當作字串的分割字元，建立一個 StringTokenizer。 if( sta.countTokens() >= 2 ) //只有在 Tokens 的數量超過 2，才進行儲存。 { numerator = Integer.parseInt( sta.nextToken() ); denominator = Integer.parseInt( sta.nextToken() ); this.format(); //檢查分子分母並格式化。 } else clear(); //不足兩個 Tokens，所以直接設定為 0/1。 } private int gcd() //呼叫後會回傳分子和分母的最大公因數。 { int ia = numerator, ib = denominator, ic; if( ia<0 ) ia=-ia; //保證分子為正數 if( ib<0 ) ib=-ib; //保證分母為正數 while( ib>0 ) //利用公式 gcd( a, b ) = gcd( b, a%b ) 來求得最大公因數 { ic = ia % ib; ia = ib; // ia 的值已經沒有用了，所以拿 ib 來放進 ia ib = ic; // 將剛剛所保留下來的 ia % ib 放進 ib } return ( (ia>0) ? ia : 1 ); //避免 a 和 b 都是 0 時會回傳 0，造成除以零的錯誤。 } public void clear() //將資料設定為 0/1，這是在呼叫空建構子，或是有奇怪的錯誤時會自動呼叫的函式 { numerator = 0; denominator = 1; } public int get_numerator() //取得分子的值，提供外部得知私人資料的管道 { return numerator; } public int get_denominator() //取得分母的值，提供外部得知私人資料的管道 { return denominator; } private void format() //檢查資料的正確性，並使資料格式化。(格式化的意思是：分母保持正整數，並且為最簡分數) { if( denominator == 0 )//如果分母為零 { this.clear();//清空這個分數 System.out.println(" ### Illegal operation. This Fraction has been forced to 0/1. ###"); //顯示錯誤訊息 } else if( denominator < 0 )//如果分母是負數 { denominator = -denominator; //保持分母是正的 numerator = -numerator; //也將分子變號 } //要做這個處理的原因，是因為再顯示 a/b 的時候，b 若為負數，會導致顯示結果錯誤，故保持分母為正。 int gcd_t = this.gcd(); numerator /= gcd_t; denominator /= gcd_t; /* 在這裡不能寫成和下面一樣的描述： numerator /= this.gcd(); denominator /= this.gcd(); 因為 gcd() 的值會隨著分子和分母變動，故必須先用一個變數存下未變動前的 gcd() 然後再把分子分母一起做相除的動作。 */ } public void print_Fraction() //以 a/b 的方式顯示資料 { System.out.printf( "%d/%d", numerator, denominator); } public double print_double() //以浮點數的方式顯示資料 { double da = ( (double) numerator) / denominator; System.out.print(da); return da; } //接下來的這幾個函式都是以 new 一個新的物件來回傳，這是為了可以保留舊資料。 //並且讓資料檢查的工作全部交給建構子，物件的建構子結束之後，就不再更動內部資料。 //全部都使用靜態函式的方式宣告，所以在使用的時候須使用 Fraction.XXX public static Fraction negative( Fraction ffa) { //負分數 -a/b return new Fraction( -ffa.get_numerator(), ffa.get_denominator() ); } public static Fraction reciprocal( Fraction ffa) { //倒數 (a/b)^-1 = b/a return new Fraction( ffa.get_denominator(), ffa.get_numerator() ); } public static Fraction add( Fraction ffa, Fraction ffb ) { //加法 a/b * c/d = (a*d+b*c) / b*d return new Fraction( ffa.get_numerator() * ffb.get_denominator() + ffa.get_denominator() * ffb.get_numerator(), ffa.get_denominator() * ffb.get_denominator() ); } public static Fraction sub( Fraction ffa, Fraction ffb ) { //減法 a/b - c/d = (a*d-b*c) / b*d return new Fraction( ffa.get_numerator() * ffb.get_denominator() - ffa.get_denominator() * ffb.get_numerator(), ffa.get_denominator() * ffb.get_denominator() ); } public static Fraction multi( Fraction ffa, Fraction ffb ) { //乘法 a/b * c/d = a*c / b*d return new Fraction( ffa.get_numerator() * ffb.get_numerator(), ffa.get_denominator() * ffb.get_denominator() ); } public static Fraction div( Fraction ffa, Fraction ffb ) { //除法 a/b / c/d = a*d / b*c return new Fraction( ffa.get_numerator() * ffb.get_denominator(), ffa.get_denominator() * ffb.get_numerator() ); } }
/** @author 戴均民 Student ID: 4098056061 Homework: Homework 3 Date: 2011/03/31 Related Files: Fraction.java Problem: 寫一個Java程式，處理有關分數(fraction)形式的有理數(rational numbers)運算。 Define a class called Fraction for performing arithmetic with fractions. Write a main method to test all the functionalities of the Fraction class. Use integer variables to represent the private data of the class-- the numerator and the denominator. Provide a no-argument constructor that initializes numerator and denominator to 0 and 1, respectively. Also, provide a two-argument constructor that initializes numerator and denominator to the initial values given at the declaration of the object. The constructor should store the fraction in reduced form. For example, the fraction 2/4 would be stored in the object as 1 in the numerator and 2 in the denominator. Provide public methods that perform each of the following tasks: (a) Adding two Fraction numbers. The result should be stored in reduced form. (b) Multiplying two Fraction numbers. The result should be stored in reduced form. (c) Printing Fraction numbers in the form a/b, where a is the numerator and b is the denominator. (d) Printing Fraction numbers in floating-point format. */ public class hw3_4098056061 { public static void detail_of_Fraction(String sa,Fraction ffa) { //這個函式會執行 Fraction 的兩個顯示函式。 System.out.println(sa+" :"); System.out.print("print_Fraction() : "); ffa.print_Fraction(); System.out.print("\nprint_double() : "); ffa.print_double(); System.out.print("\n\n"); } public static void main( String [] args ) { System.out.println( " #學號:4098056061 #姓名:戴均民 #作業:作業三 #日期:2011/03/31" ); System.out.println( " #本程式還有負分數、倒數、減法及除法運算。" ); for(int i=0;i<80;i++)System.out.print("="); System.out.println("========== Constructor 建構子 ==========\n"); Fraction fa = new Fraction(); Fraction fb = new Fraction( 2, 3); Fraction fc = new Fraction( "12/9"); detail_of_Fraction( "fa", fa); detail_of_Fraction( "fb", fb); detail_of_Fraction( "fc", fc); System.out.println("========== Negative 負分數 ==========\n"); detail_of_Fraction( "-fa", Fraction.negative( fa) ); detail_of_Fraction( "-fb", Fraction.negative( fb) ); detail_of_Fraction( "-(-fc)", Fraction.negative( Fraction.negative( fc)) ); System.out.println("========== Reciprocal 倒數 ==========\n"); detail_of_Fraction( "1/fa", Fraction.reciprocal( fa) ); detail_of_Fraction( "1/fb", Fraction.reciprocal( fb) ); detail_of_Fraction( "1/(1/fc)", Fraction.reciprocal( Fraction.reciprocal( fc)) ); System.out.println("========== Add 加法 ==========\n"); detail_of_Fraction( "fa + fb", Fraction.add( fa, fb) ); detail_of_Fraction( "fa + fc", Fraction.add( fa, fc) ); detail_of_Fraction( "fa + (fb + fc)", Fraction.add(fa, Fraction.add( fb, fc)) ); System.out.println("========== Sub 減法 ==========\n"); detail_of_Fraction( "fa - fb", Fraction.sub( fa, fb) ); detail_of_Fraction( "fa - fc", Fraction.sub( fa, fc) ); detail_of_Fraction( "fa - (fb - fc)", Fraction.sub(fa, Fraction.sub( fb, fc)) ); System.out.println("========== Multi 乘法 ==========\n"); detail_of_Fraction( "fa * fb", Fraction.multi( fa, fb) ); detail_of_Fraction( "fa * fb * fc", Fraction.multi( Fraction.multi(fa, fb), fc) ); detail_of_Fraction( "fb * fc", Fraction.multi( fb, fc) ); System.out.println("========== Div 除法 ==========\n"); detail_of_Fraction( "fa / fb", Fraction.div( fa, fb) ); detail_of_Fraction( "fc / fa", Fraction.div( fc, fa) ); detail_of_Fraction( "fb / fc", Fraction.div( fb, fc) ); } }

作業四

/* @Author: 戴均民 @student_id: 4098056061 @purpose: test Complex.java @history: 2011/05/06 Finished! */ public class Ch5_7 { public static void main(String [] args) throws java.io.IOException { //test constructor System.out.println((new Complex())+", "+(new Complex(3.14))+", "+(new Complex(new Complex(24,-9)))+", "+(new Complex(2.0,-1.0))); Complex ta=new Complex(3,4); Complex tb=new Complex(2,-3); //test add, sub, mul System.out.println("add: "+(Complex.add(ta,tb))+" "+(ta.add(tb))); System.out.println("sub: "+(Complex.sub(ta,tb))+" "+(ta.sub(tb))); System.out.println("mul: "+(Complex.mul(ta,tb))+" "+(ta.mul(tb))); System.in.read(); } }
/* @Author: 戴均民 @student_id: 4098056061 @purpose: homework 4 (Ch5 No.7) @history: 2011/05/06 Finished! */ public class Complex //class Complex { public double real,imaginary; //real:複數的實數部分、imaginary:複數的虛數部分 public Complex() {//無參數的建構子，會將複數初始化成 0+0i real=imaginary=0; } public Complex( double realPart ) {//只有一個double參數的建構子，代表複數的實數部分 real=realPart; imaginary=0; } public Complex( double rea, double ima ) {//兩個double參數的建構子，分別為實樹和虛數部分 real=rea; imaginary=ima; } public Complex( Complex tb ) {//複製內容的建構子 real=tb.real; imaginary=tb.imaginary; } public boolean equals( Complex ta ) {//比較兩個內容是否相同 return (real==ta.real && imaginary==ta.imaginary); } public String toString() {//把複數顯示成 ?+?i return ( " " + real + ( ( imaginary >= 0 ) ? " + " : " - " ) + ( ( imaginary >= 0 ) ? imaginary : (-imaginary) ) + "i " ); } public static Complex add( Complex ta, Complex tb ) {//static 加法 return new Complex( ta.real + tb.real, ta.imaginary + tb.imaginary); } public static Complex sub( Complex ta, Complex tb ) {//static 減法 return new Complex( ta.real - tb.real, ta.imaginary - tb.imaginary); } public static Complex mul( Complex ta, Complex tb ) {//static 乘法 return new Complex( ta.real * tb.real- ta.imaginary * tb.imaginary, ta.real * tb.imaginary + ta.imaginary * tb.real ); } public Complex add( Complex tb ) {//加法 return new Complex( real + tb.real, imaginary + tb.imaginary); } public Complex sub( Complex tb ) {//減法 return new Complex( real - tb.real, imaginary - tb.imaginary); } public Complex mul( Complex tb ) {//乘法 return new Complex( real * tb.real- imaginary * tb.imaginary, real * tb.imaginary + imaginary * tb.real ); } }

作業五

/* @Author: 戴均民 @student_id: 4098056061 @purpose: homework 5 (Ch6 No.14) @history: 2011/05/10 Finished! */ import java.util.Scanner; public class Ch6_14 { public static void main(String [] args) { int va[]=new int [10]; int pass=98765; int input; boolean login=false; Scanner cin=new Scanner(System.in); while(true) { login=true; //First, assuming the login is successful. //If the login is not set to false later, //represent the password is correct. for(int i=0;i<10;i++) va[i]=(int)(Math.random()*3+1); //Generate challenge by Math.random() //Because Math.random() returns a double between 0 and 1. //Multiply by three make the double between 0 and 3. //Add 1 to make the double between 1 and 4 //And convert the double to integer to produce a random number between 1 and 3 //p.s. The probability that the random interger equal to 4 is too smail to be ignore. System.out.println("PIN: 0 1 2 3 4 5 6 7 8 9"); System.out.print( "NUM: "); for(int i=0;i<10;i++) System.out.printf("%2d",va[i]); System.out.printf("\n\nPlease input password, input -1 to cancel -> "); input=cin.nextInt(); if(input<0)break; //when user input smailer then 0, STOP the program. int temppass=pass; //use password's backup for(int i=0;i<5 && login;i++) { if(va[temppass%10]!=input%10)login=false; temppass/=10; input/=10; } System.out.println("Login: "+login+"\n\n"); } } }

作業六

/* * School: National Chung Hsing University * Department: Department Of Computer Science And Engineering * Student ID: 4098056061 * Name: Chun-Min Tai * Date: 2011/05/20 * Related Files: No. * Homework: Lab#6 * Program: To pratice inheritance of class Document. */ class Document { private String text; public Document(String text) // constructor { this.text = text; } public String toString() // also an accessor of text { return this.text; } public Document() {} public void setText(String text) // mutator of text { this.text = text; } } class Email extends Document // inherit from Document { private String sender,recipient,title; public Email(String text,String sender,String recipient,String title) { // constructor super(text); // use the Document's constructor this.sender = sender; this.recipient = recipient; this.title = title; } public String toString() // overridding the same name function in Document { return ("Sender: " + sender + "\n" + "Recipient: " + recipient + "\n" + "Title: " + title + "\n" + "text: " + super.toString()); // use Document's toString() to access text } public Email() { super(); } public void setSender(String sender) // mutator of sender { this.sender = sender; } public void setRecipient(String recipient) // mutator of recipient { this.recipient = recipient; } public void setTitle(String title) // mutator of title { this.title = title; } public String getSender() // accessor of sender { return this.sender; } public String getRecipient() // accessor of recipient { return this.recipient; } public String getTitle() // accessor of title { return this.title; } } class File extends Document // inherit from Document { private String pathname; public File(String text,String pathname) // constructor { super(text); // use the Document's constructor this.pathname=pathname; } public String toString() // overridding the same name function in Document { return ("Pathname: " + pathname + "\n" + "text: " + super.toString()); // use Document's toString() to access text } public File() { super(); } public void setPathname(String pathname) // mutator of pathname { this.pathname = pathname; } public String getSender() // accessor of pathname { return this.pathname; } } public class lab6_4098056061 { public static boolean ContainsKeyword(Document docObject,String keyword) { // the ability of this function is the same as the textbook provided one. return (boolean)(docObject.toString().indexOf(keyword,0) >= 0); } public static boolean isPrint=false; // isPrint is to save whether print any data. ( used in function display_data ) public static void display_data(Document docObject,String keyword) { // display what keyword to search and the Document's toString() if(isPrint) // if isPrint is true, then print two new blank lines. System.out.println("\n"); else isPrint=true; // because this function must print, so set isPrint to true System.out.println("Contain \"" + keyword + "\" keyword? " + ContainsKeyword(docObject,keyword) + "\n" + "Content ->\n" + docObject.toString()); } public static void main(String [] args) { Email emaila = new Email("This is the body field of a test email.", "testfrom@mail.nchu.edu.tw", "testto@mail.nchu.edu.tw", "test title"); File filea = new File ("This is the data field of a test file.", "./test.file"); display_data(emaila,"test"); display_data(emaila,"nchu"); display_data( filea,"test"); display_data( filea,"nchu"); } }

作業七

import java.util.StringTokenizer; import java.util.Scanner; class MonthException extends Exception { public MonthException() { super("Wrong Month."); } } class DayException extends Exception { public DayException() { super("Wrong Day."); } } class YearException extends Exception { public YearException() { super("Wrong Year."); } } class NumericalDateException extends Exception { public NumericalDateException() { super("Wrong NumericalDate."); } } public class Lab7 { public static String ConvertDateFromNumericalToNormal(String NumericalDate,Scanner cin) { int year,month,day; int month_day[]={0,31,28,31,30,31,30,31,31,30,31,30,31}; String month_name[]={"","January ","February ","March ","April ","May ","June ","July ","August ","September ","October ","November ","December "}; while(true){ try { StringTokenizer sta = new StringTokenizer( NumericalDate, "/ " ); if( sta.countTokens()!=3 ) throw new NumericalDateException(); month = Integer.parseInt( sta.nextToken() ); day = Integer.parseInt( sta.nextToken() ); year = Integer.parseInt( sta.nextToken() ); break; } catch(Exception e) { System.out.print("Please Input NumericalDate again -> "); NumericalDate = cin.nextLine(); }}; while(true){ try { if( year<1000 || year>3000 ) throw new YearException(); break; } catch(YearException e) { System.out.print("Please Input Year again -> "); year = cin.nextInt(); }}; while(true){ try { if( month<1 || month>12 ) throw new MonthException(); break; } catch(MonthException e) { System.out.print("Please Input Month again -> "); month = cin.nextInt(); }}; while(true){ try { if(year%4==0 && year%100!=0 || year%400==0)month_day[2]=29; else month_day[2]=28; if( day<1 || day>month_day[month]) throw new DayException(); break; } catch(DayException e) { System.out.print("Please Input Day again -> "); day = cin.nextInt(); }}; return month_name[month] + day + ", " + year; } public static void main(String [] args) { Scanner cin=new Scanner(System.in); String input; while(true) { System.out.print("Please Input a Numerial Date String. (ex.12/25/2000)\nInput 'exit' will close program.\n -> "); input = cin.nextLine(); if(input.equals("exit"))break; System.out.println("\n"+input+" => "+ConvertDateFromNumericalToNormal(input,cin)+"\n"); } } }

作業八

之前在網路上認識的聯合大學的學弟，說他被要求做一個OOXX的程式，我一時玩心大起，就寫了一個可以用方向鍵操控的O，並希望藉此引導那個學弟寫出足以拿出來炫耀的壓箱寶。

備註：一定要用Dev-C++編譯喔~

俊佑也看一下~李威誼加油。

#include<iostream> #include<conio.h> using namespace std; int show(int va[][3]) { char sign[3][9]={" ","╭╮╰╯","╲╱╱╲"}; system("cls"); cout<<endl; for(int i=0;i<8;i++) { cout<<' '; for(int j=0;j<8;j++) { if(i%3!=2 && j%3!=2) cout<<sign[ va[i/3][j/3] ][ (i%3)*4 + (j%3)*2 ] <<sign[ va[i/3][j/3] ][ (i%3)*4 + (j%3)*2+1 ]; else if(i%3==2) { if(j%3!=2)cout<<"─"; else cout<<"┼"; } else if(j%3==2)cout<<"│"; } cout<<endl; } cout<<endl; } int main() { int va[3][3]; for(int i=0;i<3;i++) for(int j=0;j<3;j++) va[i][j]=0; int pos_x=0,pos_y=0; char key; va[0][0]=1; show(va); while(true) { if(!kbhit())continue; key=getch(); if(key==-32) { key=getch(); if(key!=72 && key!=80 && key!=75 && key!=77)continue; //上下左右 } else continue; va[pos_y][pos_x]=0; pos_x=(pos_x+(key==77)-(key==75)+3)%3; pos_y=(pos_y+(key==80)-(key==72)+3)%3; va[pos_y][pos_x]=1; show(va); } system("pause"); }

真的比XX的學弟認真多了 = =

#include<iostream> using namespace std; char va[1000][1000]={};//R int vb[1000]={},ia,ib,ic,id;//vb=Cost,vc=Row_Count string sa; struct ta_t { int cost,weight; string result,choice; }; ta_t best_ta={2147483647,0,"",""}; string fa(string sa,int fia) { for(int i=0;i<ia;i++) if(sa[i]=='1' || va[i][fia]==1)sa[i]='1'; return sa; } void fb(ta_t ta,int fia) { ta_t tb={ta.cost+1,ta.weight+vb[fia],ta.result,ta.choice}; tb.result=fa(tb.result,fia); tb.choice[fia]='1'; bool ba=true; for(int i=0;ba && i<ia;i++) if(tb.result[i]=='0')ba=false; if(ba) { if(tb.cost<best_ta.cost || (tb.cost==best_ta.cost && tb.weight<best_ta.weight)) best_ta=tb; return; } for(int i=fia+1;tb.cost<=best_ta.cost && i<ib;i++) if(tb.choice[i]=='0')fb(tb,i); } void fc(ta_t ta,int fia) { ta_t tb={ta.cost+1,ta.weight+vb[fia],ta.result,ta.choice}; tb.result=fa(tb.result,fia); tb.choice[fia]='1'; bool ba=true; for(int i=0;ba && i<ia;i++) if(tb.result[i]=='0')ba=false; if(ba) { if(tb.cost==best_ta.cost && tb.weight==best_ta.weight) { for(int i=0;i<ib;i++) if(tb.choice[i]=='1')printf("%d ",i+1); printf("\n"); } return; } for(int i=fia+1;tb.cost<=best_ta.cost && i<ib;i++) if(tb.choice[i]=='0')fc(tb,i); } int main(int argc,char* argv[]) { if(argc!=2)return 0; FILE* fin=fopen(argv[1],"r"); fscanf(fin,"%d %d",&ia,&ib); for(int i=0;i<ib;i++) fscanf(fin,"%d",&vb[i]); while(fscanf(fin,"%d %d",&ic,&id)!=EOF) va[ic-1][id-1]=1; /* for(int i=0;i<ia;i++) for(int j=0;j<ib;j++) printf("%d%s",va[i][j],((j!=ib-1)?" ":"\n")); */ for(int i=0;i<ia;i++)sa+="0"; ta_t ta1={0,0,sa,sa}; for(int i=0;i<ib;i++)fb(ta1,i); for(int i=0;i<ib;i++)fc(ta1,i); printf("(%d,%d)\n",best_ta.cost,best_ta.weight); system("pause"); }

這一題是碩一庭瑋學長問我的作業
嘆氣阿~這樣的程式碼要花我兩天的功夫
我的腦袋真的是越來越鈍了
太久沒有練程式
去參加接下來的NCPC都有點心虛
怎麼辦?

下面是這一題的測資檔
4 4 1 2 4 3 1 1 1 4 2 1 2 3 3 2 3 3 4 4
7 7 3 3 3 3 2 3 2 1 1 1 5 2 5 2 7 3 5 4 2 4 3 4 4 5 3 5 6 6 4 7 6 7 7
11 6 2 2 2 2 3 3 1 1 1 2 2 1 2 2 3 1 3 3 4 1 4 3 5 2 5 4 6 2 6 4 7 3 7 6 8 3 9 4 9 5 10 4 11 5 11 6
16 12 4 4 4 4 4 4 4 4 4 4 4 4 1 4 2 4 2 5 2 6 3 5 4 7 5 1 5 2 5 3 6 2 7 10 8 3 9 1 10 11 11 12 12 10 12 11 12 12 13 8 14 6 15 7 15 8 15 9 16 9
20 6 3 4 4 4 4 5 1 5 2 5 2 6 3 4 3 6 4 4 5 2 5 4 6 2 6 4 7 2 8 2 9 1 10 1 10 5 11 1 12 1 12 5 13 1 14 1 15 1 16 1 17 3 18 3 19 3 20 3

這是視窗程式設計的作業一
趁題目還很簡單的時候
來給他瘋一下
以後就沒機會這麼玩了@@

話說 寫完整個就超有成就感的說XD 

/* 視窗程式設計第1次作業_4098056061_戴均民_v1.cpp DeadLine: 99/10/18 Type: C++/CLI */ #include "stdafx.h" #include <cstdlib> // 為了使用 system() 函式需要使用 cstdlib 的標頭檔 using namespace System; int main()// 在此程式中 main 不須有參數，故刪除 { Random rand; // 宣告亂數物件 array<String^>^ num={"zero","one","two","three","four","five","six","seven","eight","nine"}; // 直接宣告一個對應表 以避免使用 if 或 switch // array<String^> num[10]={...} 無法編譯成功，勿用!! std::system("title 按下 Enter 鍵可以生產亂數喔 ~ 若非只輸入 Enter 則程式會自動結束"); // 利用 cmd 指令來更改程式執行時的視窗標題 // 因為 system() 不屬於 namespace System，故前面須加上 std:: // system() 函式不可給予 L"..." 的字串!! Console::Write(L"按下 Enter 鍵可以生產亂數喔 ~"); // 為了排版美觀，這裡不用 WriteLine() 換行，利用 ReadLine() 產生的換行即可 // 為了讓程式可以一直產生亂數，故使用迴圈 // 同時，這個迴圈也可讓程式不要馬上結束，以便使用者觀看結果 // 為了要讓程式能在若非只按 Enter 的話程式就自動結束了，故加了 =="" 的判斷式 while(Console::ReadLine()=="") { Int32 a=(static_cast<Int32> (rand.NextDouble()*89999))+10000,b=0; // 有關亂數的用法在書的 P220 // 在書上的用法是先宣告指標再 gcnew 一個新變數，我在這裡是直接宣告 // 老師題目只要求超過一萬，故我的程式決定只生成五位數的亂數 // rand.NextDouble() 只會生成一個介於 0~1 之間的亂數 // 乘上 89999 後，亂數範圍介於 0~89999 之間 // 最後 再強制轉型為 Int32 之後，再加上 10000 即可保證亂數一定是五位數 // 換句話說，就是介於 10000~99999 之間的亂數 Console::Write(L"{0} -> ",a); // 輸出這個亂數的阿拉伯數字型態 // 為了想要取出某個位數，又不想多宣告一個陣列 // 故利用 %10 來取出個位數，然後再用 /10 以便下一次迴圈可以讀到十位數 // 但是這種取法，只能從最小位元開始取數字，故先做一次翻轉的動作 // 地下的這個 for 迴圈，會將如 12345 的數字轉成 54321 // 利用剛剛已經預先歸零的變數 b 來將 a 的數字翻轉 for(Int32 i=0;i<5;i++) { b*=10; // 先將 b 乘以十是為了要挪出個位數的空間 b+=a%10; // 將 b 加上 a 的個位數 (即 a%10 的結果) a/=10; // 將 a 除以十是為了下一次迴圈可以讀到在這一次迴圈中的十位數 } // 將原本的亂數 a 翻轉之後，a 的值應該已經為零 (因為作了五次 a/=10;) // 翻轉後的值會存在 b 之中，一樣在使用迴圈取出其個位數 // 然後直接將這個個位數對應到轉換表內 // 並且馬上將轉換表的結果利用 Write 輸出 // 在這裡一樣為了美觀，故不使用 WriteLine 來換行 // 在英文字之間輸出 \t 對齊輸出會比較好看 for(Int32 i=0;i<5;i++) { Console::Write(L"{0}\t",num[b%10]); b/=10; // 將 b 除以十是為了下一次迴圈可以讀到在這一次迴圈中的十位數 } } return 0; } // 加了好多註解，好累 = = // 下次不這麼玩了

學到新東西總是讓人雀躍不已阿
特別是曾經困擾過我的問題:)

#include<iostream> using namespace std; int main() { cout<< __LINE__ <<endl; // 這一行的行號 cout<< __FILE__ <<endl; // 原始檔的檔名 cout<< __DATE__ <<endl; // 編譯時的日期 cout<< __TIME__ <<endl; // 編譯時的時間 cout<< __cplusplus <<endl; // 可以使用C++函式 cout<< __STDC__ <<endl; // 可以使用C函式 cout<< __func__ <<endl; // 顯示現在所在的函式 cout<< __FUNCTION__ <<endl; // 顯示現在所在的函式 cout<< __PRETTY_FUNCTION__ <<endl; // 顯示現在所在的函式宣告 system("pause"); }

上面這個是個很好玩的小知識
再來的這個
就是我剛剛所講困擾過我許久的問題
就是 scanf("%c",&ca); 會讀取到換行字元的問題
以前在大一的時候上C語言沒學到
沒想到在大二自願去當助教的時候學到了= =
原來有兩種方式可以處理阿
第一種是用 fflush(stdin); //清空緩衝區
第二種方法是在讀取%c之前加一個空格
scanf("_%c",&ca); // 要在那個底線的位置空格
學到這個用法我還是比較高興的
因為我之前只會笨笨的用C++的cin.get()來讀掉多餘的換行符號= =

還有還有
就是在C++裡面判斷型態的方法
#include<iostream> #include<typeinfo> using namespace std; int main() { cout<<"The type of int is "<<typeid(int).name()<<endl; cout<<"The type of bool is "<<typeid(bool).name()<<endl; cout<<"The type of char is "<<typeid(char).name()<<endl; cout<<"The type of float is "<<typeid(float).name()<<endl; cout<<"The type of double is "<<typeid(double).name()<<endl; cout<<"The type of long long is "<<typeid(long long).name()<<endl; cout<<"The type of short int is "<<typeid(short int).name()<<endl; cout<<"The type of const int is "<<typeid(const int).name()<<endl; cout<<"The type of unsigned int is "<<typeid(unsigned int).name()<<endl; //typeid 是一種 class，非函式!! 故無法 cout << typeid(int) ; system("pause"); }