當前位置:首頁 » 編程語言 » 浙江大學城市學院c語言上機

浙江大學城市學院c語言上機

發布時間: 2024-07-28 04:00:00

⑴ 鏌充繆嫻欐睙澶у﹀煄甯傚﹂櫌 鍓鏁欐巿

鏌充繆錛岀敺鎬э紝鐩鍓嶆媴浠繪禉奼熷ぇ瀛﹀煄甯傚﹂櫌鐨勫壇鏁欐巿錛屽悓鏃舵媴浠諱俊鎮綆$悊涓庝俊鎮緋葷粺緋諱富浠諱互鍙婄綉緇滀笌璁$畻閲嶇偣瀹為獙瀹ゅ壇涓諱換銆俒2]


鍦ㄦ暀瀛﹂嗗煙錛屾煶淇婁富瑕佽嚧鍔涗簬璁$畻鏈烘暀瀛﹀伐浣滐紝浠栦富璁茬殑璇劇▼鍖呮嫭銆婃暟鎹緇撴瀯銆嬨併奦B紼嬪簭璁捐°嬨併奀紼嬪簭璁捐°嬨併婃暟鎹搴撳師鐞嗕笌搴旂敤銆嬩互鍙娿婄$悊淇℃伅緋葷粺銆嬨備粬鐨勬暀瀛﹁〃鐜版繁鍙楄ゅ彲錛屽氭¤崳鑾峰煄甯傚﹂櫌鏁欏︿紭縐涓絳夊栵紝浣撶幇浜嗗叾娣卞帤鐨勬暀瀛﹀姛搴曞拰涓撲笟鐭ヨ瘑銆


鍦ㄧ戠爺鏂歸潰錛屾煶淇婇暱鏈熶笓娉ㄤ簬璁$畻鏈哄簲鐢ㄧ殑鐮旂┒鍜屽紑鍙戙備粬浣滀負欏圭洰璐熻矗浜烘垨涓昏佸弬涓庤咃紝鎴愬姛瀹屾垚浜嗗氶」鍘呭矓綰т互涓婄戠爺欏圭洰錛屽叾涓涓欏硅幏寰椾簡鐪佺戞妧榪涙ュ栵紝榪樻湁涓欏硅幏寰椾簡嫻欐睙澶у︾殑鏁欏︽垚鏋滃栥備粬鐨勭爺絀跺疄璺典赴瀵岋紝縐緔浜嗕赴瀵岀殑欏圭洰緇忛獙銆傛ゅ栵紝浠栬繕鍙備笌浜嗗氭湰璁$畻鏈哄簲鐢ㄩ嗗煙鐨勬暀鏉愮紪鍐欙紝涓哄︽湳鐣屽拰鏁欒偛棰嗗煙鍋氬嚭浜嗛噸瑕佽礎鐚銆




鎵╁睍璧勬枡

鏌充繆錛屽洓宸濈渷鎴愰兘甯傞噾鐗涘尯钀ラ棬鍙h楅亾鍔炰簨澶勫厷宸ュ斿斿憳銆佹﹁呴儴閮ㄩ暱銆

⑵ C璇璦 奼備袱鍩庡競闂磋窛紱

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define SIZE 3
#define pi 3.14
typedef struct city{
char Cname[21];
float Lat;
float Lon;
} CITY;

typedef struct {
int Nb_cities;
CITY Cities[SIZE];
} CITIES_LIST;

void main(){
FILE * fp;
CITIES_LIST list, list1;
int i,j,a[SIZE],b[SIZE],n1,n2,tem,tem1;
float d,dis;
if((fp=fopen("citylist","wb+"))==NULL){
printf("file open error");
exit(0);
}
printf("杈撳叆鍩庡競涓鏁\n");
scanf("%d",&list.Nb_cities);
printf("杈撳叆鍩庡競鍚嶅強鍏剁粡綰搴\n");
for(i=0;i<SIZE;i++){
scanf("%s%f%f",list.Cities[i].Cname,&list.Cities[i].Lat,&list.Cities[i].Lon);
fwrite(&list.Cities[i],sizeof(struct city),1,fp);
}

fclose(fp);

if((fp=fopen("citylist","rb"))==NULL){
printf("file open error");
exit(0);
}
printf("鎵鏈夊煄甯傚垪琛\n");
for(i=0;i<SIZE;i++){
fread(&list1.Cities[i],sizeof(struct city),1,fp);
printf("%s %6.2f%6.2f",list1.Cities[i].Cname,list1.Cities[i].Lat,list1.Cities[i].Lon);
printf("\n");
}
printf("\n");

fclose(fp);
i=0;

printf("杈撳叆鐩鏍囧煄甯傜紪鍙鳳紝浠-1緇撴潫");
printf("\n");
while(a[i]!=-1&&i<SIZE){
scanf("%d",&a[i]);
i++;
}
n1=i;
i=0;

printf("杈撳叆璧峰嬪煄甯傜紪鍙鳳紝浠-1緇撴潫\n");
while(b[i]!=-1&&i<SIZE){
scanf("%d",&b[i]);
i++;
}

n2=i;
printf("DESTINATION ");
for(i=0;i<n1;i++){
tem=a[i];
printf("%s ",list1.Cities[tem].Cname);
}
printf("\n");

for(i=0;i<n2;i++){
tem=b[i];
printf("%s ",list1.Cities[tem].Cname);
for(j=0;j<n1;j++){
tem1=a[j];
dis=6378*(acos(cos(list1.Cities[tem].Lat/pi)*cos(list1.Cities[tem1].Lat/pi)*cos(list1.Cities[tem].Lat/pi-list1.Cities[tem1].Lat/pi)+sin(list1.Cities[tem].Lat/pi)*sin(list1.Cities[tem1].Lat/pi)));;
printf("%-8.2f ",dis);
}
printf("\n");
}
}

鎴戝垰瀛c璇璦涓嶄箙錛岀▼搴忓啓鐨勪笉濂斤紝榪欎釜褰撳仛鏄緇冧範錛屽彲浠ヨ$畻璺濈誨拰鍐欏叆鍩庡競淇℃伅鍒版枃浠訛紝浣嗘槸鏈榪戞墠寮濮嬬湅鏂囦歡鎿嶄綔鎵浠ヨ繕涓嶇煡閬撴庝箞灝哊b_cities鍐欏湪鏂囦歡寮澶達紝璇曚簡鍙婃¢兘鏈夊紓甯革紝鍔熷姏涓嶅燂紝鍒絎戞垜

熱點內容
oracle升級腳本 發布:2025-01-16 09:37:39 瀏覽:21
垂直式壓縮 發布:2025-01-16 09:15:38 瀏覽:532
dijkstra演算法復雜度 發布:2025-01-16 09:15:35 瀏覽:607
伺服器出錯連接不上該怎麼辦 發布:2025-01-16 09:15:31 瀏覽:401
kc語言 發布:2025-01-16 09:14:50 瀏覽:544
停車場管理系統c語言 發布:2025-01-16 09:02:35 瀏覽:437
學校宣傳片拍攝腳本 發布:2025-01-16 09:00:50 瀏覽:155
ubuntuphpmcrypt 發布:2025-01-16 08:26:46 瀏覽:429
安卓圖片如何添加蘋果的水墨印 發布:2025-01-16 08:18:12 瀏覽:731
fmp腳本 發布:2025-01-16 08:12:23 瀏覽:231