2018年6月22日 星期五

大學課後作業C語言程式設計之火車票管理系統




大學計算機軟件技術基礎(VC)課程設計任務書 一、題目:火車票資訊管理系統;二、目的與要求 1. 目的培養學生綜合利用C++語言進行程式設計的能力,培養學生的程式設計能力、用計算機解決實際問題的能力,加強對理論知識的理解和實際運用;培養學生對軟體工程知識和方法的初步認識,提高軟件系統分析能力和程式文件建立、歸納總結的能力;提高學生的實際動手能力和獨立思考的能力。


最後的版本,不想更新了。更新也沒有什麼功能自己可以弄了。該版本修改了前幾個版本中錯誤的地方,相對完整了許多,功能也加強了。


/*----------該程式主要實現火車票資訊的管理----------*/
#include
#include
/*----------定義車次、出發站、終點站、發車時間、到達時間、票價陣列----------*/
char trains[10][10], start_station[10][10], end_station[10][10], start_time[10][10], end_time[10][10];
int price[10], i = 0, j = 0, k = 0, l = 0, x = 0; /* ----------定義全域性變數---------- */
void set( void );
void search( void );
void sum( void );
void sort( void );
void edit( void );
void del( void );
int main( void )

int o; /* ----------o在此處為選項數值---------- */
/*----------以下程式碼為主選單選項----------*/
for ( o = 1; o != 0; o )

printf( "n------------------------------------------------n" );
printf( "----------歡迎使用火車票管理系統主選單----------" );
printf( "n------------------------------------------------n" );
printf( " 1.set (錄入)n" );
printf( " 2.search (查詢)n" );
printf( " 3.sum (統計)n" );
printf( " 4.sort (排序)n" );
printf( " 5.edit (編輯)n" );
printf( " 6.del (刪除)n" );
printf( " 0.exit (退出)n" );
printf( "n請輸入要選擇的服務專案:" );
scanf( "%d", &o );
if ( o == 1 )
set();
else if ( o == 2 )
search();
else if ( o == 3 )
sum();
else if ( o == 4 )
sort();
else if ( o == 5 )
edit();
else if ( o == 6 )
del();
else if ( o == 0 )
break;
else
printf( "n請輸入正確的數字!nn" );


/*----------錄入子函式---------*/
void set( void )
i > 10 )

printf( "n----------請正確輸入1-10之間的整數!----------n" );
return;

i = i + x;
for ( j = x; j 0 )

strcpy( sort[0], trains[i] );
strcpy( trains[i], trains[j + 1] );
strcpy( trains[j + 1], sort[0] );
strcpy( sort[0], start_station[i] );
strcpy( start_station[i], start_station[j + 1] );
strcpy( start_station[j + 1], sort[0] );
strcpy( sort[0], end_station[i] );
strcpy( end_station[i], end_station[j + 1] );
strcpy( end_station[j + 1], sort[0] );
strcpy( sort[0], start_time[i] );
strcpy( start_time[i], start_time[j + 1] );
strcpy( start_time[j + 1], sort[0] );
strcpy( sort[0], end_time[i] );
strcpy( end_time[i], end_time[j + 1] );
strcpy( end_time[j + 1], sort[0] );
sort1 = price[i];
price[i] = price[j + 1];
price[j + 1] = sort1;


else if ( k == 2 )

for ( i = 0; i 0 )

strcpy( sort[0], trains[i] );
strcpy( trains[i], trains[j + 1] );
strcpy( trains[j + 1], sort[0] );
strcpy( sort[0], start_station[i] );
strcpy( start_station[i], start_station[j + 1] );
strcpy( start_station[j + 1], sort[0] );
strcpy( sort[0], end_station[i] );
strcpy( end_station[i], end_station[j + 1] );
strcpy( end_station[j + 1], sort[0] );
strcpy( sort[0], start_time[i] );
strcpy( start_time[i], start_time[j + 1] );
strcpy( start_time[j + 1], sort[0] );
strcpy( sort[0], end_time[i] );
strcpy( end_time[i], end_time[j + 1] );
strcpy( end_time[j + 1], sort[0] );
sort1 = price[i];
price[i] = price[j + 1];
price[j + 1] = sort1;


else if ( k == 3 )

for ( i = 0; i 0 )

strcpy( sort[0], trains[i] );
strcpy( trains[i], trains[j + 1] );
strcpy( trains[j + 1], sort[0] );
strcpy( sort[0], start_station[i] );
strcpy( start_station[i], start_station[j + 1] );
strcpy( start_station[j + 1], sort[0] );
strcpy( sort[0], end_station[i] );
strcpy( end_station[i], end_station[j + 1] );
strcpy( end_station[j + 1], sort[0] );
strcpy( sort[0], start_time[i] );
strcpy( start_time[i], start_time[j + 1] );
strcpy( start_time[j + 1], sort[0] );
strcpy( sort[0], end_time[i] );
strcpy( end_time[i], end_time[j + 1] );
strcpy( end_time[j + 1], sort[0] );
sort1 = price[i];
price[i] = price[j + 1];
price[j + 1] = sort1;


else if ( k == 4 )

for ( i = 0; i 0 )

strcpy( sort[0], trains[i] );
strcpy( trains[i], trains[j + 1] );
strcpy( trains[j + 1], sort[0] );
strcpy( sort[0], start_station[i] );
strcpy( start_station[i], start_station[j + 1] );
strcpy( start_station[j + 1], sort[0] );
strcpy( sort[0], end_station[i] );
strcpy( end_station[i], end_station[j + 1] );
strcpy( end_station[j + 1], sort[0] );
strcpy( sort[0], start_time[i] );
strcpy( start_time[i], start_time[j + 1] );
strcpy( start_time[j + 1], sort[0] );
strcpy( sort[0], end_time[i] );
strcpy( end_time[i], end_time[j + 1] );
strcpy( end_time[j + 1], sort[0] );
sort1 = price[i];
price[i] = price[j + 1];
price[j + 1] = sort1;


else if ( k == 5 )

for ( i = 0; i 0 )

strcpy( sort[0], trains[i] );
strcpy( trains[i], trains[j + 1] );
strcpy( trains[j + 1], sort[0] );
strcpy( sort[0], start_station[i] );
strcpy( start_station[i], start_station[j + 1] );
strcpy( start_station[j + 1], sort[0] );
strcpy( sort[0], end_station[i] );
strcpy( end_station[i], end_station[j + 1] );
strcpy( end_station[j + 1], sort[0] );
strcpy( sort[0], start_time[i] );
strcpy( start_time[i], start_time[j + 1] );
strcpy( start_time[j + 1], sort[0] );
strcpy( sort[0], end_time[i] );
strcpy( end_time[i], end_time[j + 1] );
strcpy( end_time[j + 1], sort[0] );
sort1 = price[i];
price[i] = price[j + 1];
price[j + 1] = sort1;


else if ( k == 6 )

for ( i = 0; i price[j + 1] ? 1 : 0;
if ( l > 0 )

strcpy( sort[0], trains[i] );
strcpy( trains[i], trains[j + 1] );
strcpy( trains[j + 1], sort[0] );
strcpy( sort[0], start_station[i] );
strcpy( start_station[i], start_station[j + 1] );
strcpy( start_station[j + 1], sort[0] );
strcpy( sort[0], end_station[i] );
strcpy( end_station[i], end_station[j + 1] );
strcpy( end_station[j + 1], sort[0] );
strcpy( sort[0], start_time[i] );
strcpy( start_time[i], start_time[j + 1] );
strcpy( start_time[j + 1], sort[0] );
strcpy( sort[0], end_time[i] );
strcpy( end_time[i], end_time[j + 1] );
strcpy( end_time[j + 1], sort[0] );
sort1 = price[i];
price[i] = price[j + 1];
price[j + 1] = sort1;


else
printf( "n----------你的輸入錯誤!----------nn" );
/*----------排序工作流程結束----------*/
printf( "n-------------------------------------------------------------n" );
printf( "車次 出發站 終點站 發車時間 到達時間 票價" );
printf( "n-------------------------------------------------------------n" );
for ( i = 0; i = 1 && j 0 )

for (; j

效果圖:




呵呵噠~~~





http://www.buzzfunnews.com/20180621939.html

心情煩悶需要新鮮事刺激一下嗎?請上:http://www.buzzfunnews.com

沒有留言:

張貼留言