c考试程序设计源码（c语言程序设计考试软件）
本文目录一览：
- 1、c语言程序设计！跪求源码！
- 2、C语言程序设计源代码
- 3、计算机初级C语言程序设计、、、就是设计一个简单程序的源代码
- 4、hi，朋友，能给我一份《C语言程序设计》课程在线考试系统的源码吗？多多谢
- 5、C语言程序设计 源代码+注释
c语言程序设计！跪求源码！
#includestdio.h
#define Mon 1
#define Tues 2
#define Wed 3
#define Thur 4
#define Fri 5
#define Sat 6
#define Sun 0
#define January_days 31
#define February_days 28
#define March_days 31
#define April_days 30
#define May_days 31
#define June_days 30
#define July_days 31
#define August_days 31
#define September_days 30
#define October_days 31
#define November_days 30
#define December_days 31
#define first1month January_days
#define first2month January_days+February_days
#define first3month January_days+February_days+March_days
#define first4month January_days+February_days+March_days+April_days
#define first5month January_days+February_days+March_days+April_days+May_days
#define first6month January_days+February_days+March_days+April_days+May_days+June_days
#define first7month January_days+February_days+March_days+April_days+May_days+June_days \
+July_days
#define first8month January_days+February_days+March_days+April_days+May_days+June_days \
+July_days+August_days
#define first9month January_days+February_days+March_days+April_days+May_days+June_days \
+July_days+August_days+September_days
#define first10month January_days+February_days+March_days+April_days+May_days+June_days \
+July_days+August_days+September_days+October_days
#define first11month January_days+February_days+March_days+April_days+May_days+June_days \
+July_days+August_days+September_days+October_days+November_days
int known_weekday = Tues;
int known_year = 1901;
int konwn_month = 1;
int known_day = 1;
int day_count(int month)
{
switch(month)
{
case 1: return 0;break;
case 2: return first1month;break;
case 3: return first2month;break;
case 4: return first3month;break;
case 5: return first4month;break;
case 6: return first5month;break;
case 7: return first6month;break;
case 8: return first7month;break;
case 9: return first8month;break;
case 10: return first9month;break;
case 11: return first10month;break;
case 12: return first11month;break;
}
}
/*char * month_name(int month)
{
switch(month)
{
case 1:
return "January";
break;
case 2:
return "February";
break;
case 3:
return "March";
break;
case 4:
return "April";
break;
case 5:
return "May";
break;
case 6:
return "June";
break;
case 7:
return "July";
break;
case 8:
return "August";
break;
case 9:
return "September";
break;
case 10:
return "October";
break;
case 11:
return "November";
break;
case 12:
return "December";
break;
default:
break;
}
}*/
char * month_name(int month)
{
switch(month)
{
case 1:
return "一月";
break;
case 2:
return "二月";
break;
case 3:
return "三月";
break;
case 4:
return "四月";
break;
case 5:
return "五月";
break;
case 6:
return "六月";
break;
case 7:
return "七月";
break;
case 8:
return "八月";
break;
case 9:
return "九月";
break;
case 10:
return "十月";
break;
case 11:
return "十一月";
break;
case 12:
return "十二月";
break;
default:
break;
}
}
/*按格式打印某年某月名称*/
void first_line_print(int month, int year)
{
//printf("%20s %d \n",month_name(month),year);
printf("%8d年 %s \n",year, month_name(month));
}
/*按格式打印星期名称*/
void week_print()
{
//printf("%-6s%-6s%-6s%-6s%-6s%-6s%-6s\n","Sun.", "Mon.", "Tues.", "Wed.", "Thur.", "Fri.", "Sat.");
printf("%-3s%-3s%-3s%-3s%-3s%-3s%-3s\n","日", "一", "二", "三", "四", "五", "六");
}
/*计算该年该月份与已知日子之间的距离天数*/
int date_distance_count(int month, int year)
{
int leap_year_count = 0;
int i;
int distance;
if (year known_year)
{
for (i=known_year; iyear; i++)
{
if(((i%4 == 0) (i%100 != 0) ) || (i%400 == 0))
{
leap_year_count++;
}
}
if (month 2)
{
if(((year%4 == 0) (year%100 != 0) ) || (year%400 == 0))
{
leap_year_count++;
}
}
}
else
if (year == known_year)
{
if (month 2)
{
leap_year_count = 1;
}
}
distance = (year - known_year)*365 + leap_year_count + day_count(month);
return distance;
}
/*确定该月份第一天是星期几*/
int makesure_firstday_weekday(int month, int year)
{
int date_distance = 0;
int weekday;
date_distance = date_distance_count(month, year);
weekday = (known_weekday + date_distance)%7;
return weekday;
}
/*依次打印出该月份的日子*/
void print_in_turn(int month, int firstday, int year)
{
int i = 1;
int weekday;
switch(firstday)
{
case Sun:
break;
case Mon:
printf("%-3s","");
break;
case Tues:
printf("%-6s","");
break;
case Wed:
printf("%-9s","");
break;
case Thur:
printf("%-12s","");
break;
case Fri:
printf("%-15s","");
break;
case Sat:
printf("%-18s","");
break;
}
switch(month)
{
case 1:
case 3:
case 5:
case 7:
case 8:
case 10:
case 12:
{
for(i=0; i31; i++)
{
weekday = (firstday + i)%7;
printf("%-3d",i+1);
if(weekday == Sat)
{
printf("\n");
}
}
break;
}
case 2:
{
if(((year%4 == 0) (year%100 != 0) ) || (year%400 == 0)) /*闰年*/
{
for(i=0; i29; i++)
{
weekday = (firstday + i)%7;
printf("%-3d",i+1);
if(weekday == Sat)
{
printf("\n");
}
}
break;
}
else /*平年*/
{
for(i=0; i28; i++)
{
weekday = (firstday + i)%7;
printf("%-3d",i+1);
if(weekday == Sat)
{
printf("\n");
}
}
break;
}
}
case 4:
case 6:
case 9:
case 11:
{
for(i=0; i30; i++)
{
weekday = (firstday + i)%7;/*计算该天是星期几*/
printf("%-3d",i+1);
if(weekday == Sat)
{
printf("\n");/*如果是星期六，则换行*/
}
}
break;
}
}
}
void date_print(int month, int year)
{
int firstday;
firstday = makesure_firstday_weekday(month, year);
print_in_turn(month, firstday, year);
printf("\n");
}
void main_month(int month, int year)
{
first_line_print(month, year);
week_print();
date_print(month, year);
printf("\n\n");
}
void main_calendar(int year)
{
int i;
for(i=1; i=12; i++)
{
main_month(i, year);
}
}
int main()
{
int year;
printf("请输入年份：year = ");
scanf("%d",year);
printf("\n");
while(year 1902)
{
printf("请输入大于1901的年份\n");
printf("请输入年份：year = ");
scanf("%d",year);
printf("\n");
}
main_calendar(year);
scanf(" ");
return 0;
}
C语言程序设计源代码
VS2005 下测试通过 c考试程序设计源码你试试
#includestdio.h
#includeconio.h
void main()
{
char CH;
int daxie = 0,xiaoxie = 0,shuzi = 0,qita = 0;
while (1)
{
CH = getch();
if (CH == 26)
{
break;
}
printf("%c",CH);
if (CH=48 CH=57)
{
shuzi++;
}
else if (CH=97 CH=122)
{
xiaoxie++;
}
else if (CH=65 CH=90)
{
daxie++;
}
else
qita++;
}
printf("\n数字:%d 大写字母:%d 小写字母:%d 其c考试程序设计源码他:%d\n",shuzi,daxie,xiaoxie,qita);
system("pause");
}
计算机初级C语言程序设计、、、就是设计一个简单程序的源代码
#includestdio.h
void main ( )
{
double a,b,c,s,v;
printf("input a,b,c:");//要有引号，不要回车
scanf("%lf%lf%lf",a,b,c);//double对应%lf long float
s=a*b;
v=a*b*c;
printf("%f %f %f\n",a,b,c);//浮点数输出用%f
printf("s=%f,v=%f\n",s, v); //
}
hi，朋友，能给我一份《C语言程序设计》课程在线考试系统的源码吗？多多谢
系统没有，不过我有视频，不知道你需要不，因为我是自学，我现在就在看，感觉还不错。一听就能听懂的那种，感觉比较适合我这样入门刚学的人。最吸引的地方就是讲的难理解的概念讲的特别好，用形象比喻举例讲概念，比如变量比喻成装东西的盒子，我一下子就理解了变量赋值为什么是从右往左。还有很多这样类似的比喻。比我之前看的什么郝斌曾怡金文的晦涩难懂的都好多了。
C语言程序设计 源代码+注释
采用广度优先搜索即可，程序如下：
char A[64][64]= {"..###","#....","#.#.#","#.#.#","#.#.."};//迷宫，A,R,C这里预设，实际请改成输入
int M[64][64] = {0}, //标记走过的点
R = 5, C = 5;
//判断点(x,y)是否可达
bool pass(int x, int y)
{
return x=0 x=R y=0 y=C
A[x][y]=='.' !M[x][y];
}
//广度搜索
int steps()
{
struct{ int x, y, depth;}Queue[256], t; //队列
int front = 0, rear = 0, //头尾指标
di[4][2] = {{1,0},{0,-1},{-1,0},{0,1}}; //方向数组
int i, new_x, new_y;
Queue[rear].x = 0; //初始点入队
Queue[rear].y = 0;
Queue[rear++].depth = 1;
M[0][0] = 1; //标记该店
while(front != rear)
{
t = Queue[front++]; //出队
for(i=0; i4; i++) //遍历每个方向
{
new_x = t.x+di[i][0]; //产生新的坐标
new_y = t.y+di[i][1];
if(pass( new_x, new_y)) //若可达
{
if(new_x==R-1 new_y==C-1)return t.depth+1; //结束条件
//入队
Queue[rear].x = new_x;
Queue[rear].y = new_y;
Queue[rear++].depth = t.depth+1;
M[new_x][new_y] = 1; //同样标记入队的点
}
}
}
return -1; //无法走到终点，返回-1
}
int main()
{
printf("%d", steps());
}
