在xp中tc环境下实现的 销售管理系统(可切换繁体和简体,可设密码,可通过修改代码修改字体颜色)

本文介绍了一个基于C语言开发的销售数据统计与分析系统,该系统能够实现销售记录的录入、查询、统计和图表展示等功能。通过链表结构存储数据,支持按不同维度进行查询与统计,并能以柱状图形式展现销售情况。

第二部分

 
/*老板目录部分开始*/
menu22(struct Ritongji *head)
{
    int yuangongxiaoshou=0;
    int number,i;
    struct Ritongji *p=head;
    if(p==NULL)
    {
        cleardevice();
        hanzishuru("无记录",0,0,GREEN);
        getch();
        return 0;
    }
    cleardevice();
    hanzishuru("请输入要查询的员工",0,0,GREEN);
    gotoxy(20,1);
    scanf("%d",&number);
    while (p!=NULL)
    {
        for(i=0;i<=4;i++)
        {
            yuangongxiaoshou+=p->Yuangong[number].p[i];
        }
        p=p->next;
    }
    printf("%d",yuangongxiaoshou);
    getch();
}

menu23(struct Ritongji *head)
{
    int yuangongxiaoshou=0;
    int number,i;
    struct Ritongji *p=head;
    if(p==NULL)
    {
        cleardevice();
        hanzishuru("无记录",0,0,GREEN);
        getch();
        return 0;
    }
    cleardevice();
    hanzishuru("请输入要查询的产品",0,0,GREEN);
    gotoxy(20,1);
    scanf("%d",&number);
    while (p!=NULL)
    {
        for(i=0;i<=3;i++)
        {
            yuangongxiaoshou+=p->Yuangong[i].p[number];
        }
        p=p->next;
    }
    printf("%d",yuangongxiaoshou);
    getch();
}


menu24(int *tongji,int yuangong)
{
    int k;
    int yuangongxiaoshou;
    for(k=0;k<=4;k++)
    {
        yuangongxiaoshou+=*(tongji+yuangong*5+k);
    }
    printf("%d",yuangongxiaoshou);
}

menu25(struct Ritongji *head)            /*某日业绩查询。*/
{
    struct Ritongji *p=head;
    int year;
    int month;
    int day;
    if(p==NULL)
    {
        cleardevice();
        hanzishuru("无记录",0,0,GREEN);
        getch();
        return 0;
    }
    cleardevice();
    hanzishuru("请输入年份",0,0,GREEN);
    gotoxy(12,1);
    scanf("%d",&year); 
    cleardevice();
    hanzishuru("请输入月份",0,0,GREEN);
    gotoxy(12,1);
    scanf("%d",&month); 
    cleardevice();
    hanzishuru("请输入日期",0,0,GREEN);
    gotoxy(12,1);
    scanf("%d",&day);
    getchar();
    while(p!=NULL)
    {
        if((p->year==year)&&(p->month==month)&&(p->day==day))
        {
            shuchu(p);
            getch();
            return 0;
        }
        p=p->next ;
    }
    cleardevice();
    hanzishuru("未找到",0,0,GREEN);
}

menu26(struct Ritongji *head)
{
    struct Ritongji *p=head;
    int year;
    int month;
    int day;
    int leixing;
    int j,k;
    int chanping[31];
    for(j=0;j<=30;j++)
    {
        chanping[j]=0;
    }
    if(p==NULL)
    {
        cleardevice();
        hanzishuru("无记录",0,0,GREEN);
        getch();
        return 0;
    }
    cleardevice();
    hanzishuru("请输入年份",0,0,GREEN);
    gotoxy(12,1);
    scanf("%d",&year); 
    cleardevice();
    hanzishuru("请输入月份",0,0,GREEN);
    gotoxy(12,1);
    scanf("%d",&month);
    cleardevice();
    hanzishuru("请输入产品",0,0,GREEN);
    gotoxy(12,1);
    scanf("%d",&leixing);
    getchar();
    while(p!=NULL)
    {
        if((p->year==year)&&(p->month==month))
        {
            for(j=0;j<=3;j++)
            {
                chanping[p->day]+=p->Yuangong[j].p[leixing];
            }
        }
        p=p->next ;
    }
    showimage(31,chanping);
}
/*老板目录部分结束*/

/*其它功能代码*/
showimage(int daynumber,int *product)/*入口参数为这个月的天数和这个月的销售情况数列*/
{
    /*此行用于函数内部测试 int product[31]={18,20,13,14,18,15,11,8,23,12,6,9,6,1,8,6,8,22,13,4,2,3,1,4,3,2,3,4,2,3,1}; */
    int i=0,j,k;  /*j,k用于画图时的循环变量*/
    int maxproductday=0;/*记录产品最高的天是哪一天*/
    daynumber--;
    cleardevice();/*清屏函数*/
    for(i=0;i<=daynumber;i++)
    {
        if(product[i]>23)
        {
            hanzishuru("产品数字过大(超过二十三),不支持",0,0,GREEN);
            getch();
            return 0;
        }
    }
    for(i=1;i<=daynumber;i++)
    {
        if(product[i]>product[maxproductday])
            maxproductday=i;
    }
    printf("\n");
    for(j=0;j<=daynumber;j++) /*这是用于显示每一列的循环*/
    {
        for(k=0;k<=product[maxproductday]-product[j]-1;k++)
        {
            printf(" ");
            gotoxy(wherex()-1,wherey()+1);
        }/*用于显示每一列的空格*/
        for(k=0;k<=product[j]-1;k++)
        {
            printf("%c",219);
            gotoxy(wherex()-1,wherey()+1);
        }/*用于显示每一列的实心方格数*/
        if((j+1)%5==0)
        {
            printf("  %d\b\b",j+1);
            if((j+1)>=10)
            {
                gotoxy(wherex()-2,wherey());
            }
            else
                gotoxy(wherex()-1,wherey());
        }
        gotoxy(wherex(),wherey()-1);
        gotoxy(wherex()+2,wherey()-product[maxproductday]+1);/*光标移动到行首*/
    }
    gotoxy(wherex(),wherey()+product[maxproductday]-1);
    getch();
}

xianshibaobiao(int *tongji)  /*用于报表的刷新*/
{
    int j,k;
    printf("\t");
    gotoxy(0,0) ;
    for(k=0;k<=4;k++)
    {
        printf("p");
        printf("%d\t",k);
    }
    printf("\n");
    gotoxy(2,0);
    for(j=0;j<=3;j++)
    {
        printf("NO.");
        printf("%d\t",j);
        for(k=0;k<=4;k++)
        {
            printf("%d\t",*(tongji+j*5+k));
        }
        printf("\n");
    }
}


int shuaxinbaobiao(struct Ritongji *head,int year,int month,int *tongji) /*用于报表的重新统计*/
{
    int j,k;
    struct Ritongji *p=head;
    for(j=0;j<=3;j++)
    {
        for(k=0;k<=4;k++)
        {
            *(tongji+j*5+k)=0;
        }
    }
    if(p==NULL)
    {
        hanzishuru("无记录",0,0,GREEN);
        getch();
        return 0;
    }
    while(p!=NULL)
    {
        if((p->year==year)&&(p->month==month))
        {
            for(j=0;j<=3;j++)
            {
                for(k=0;k<=4;k++)
                {
                    *(tongji+j*5+k)+=p->Yuangong[j].p[k];
                }
            }
        }
        p=p->next ;
    }
}

jilubaocun(struct Ritongji *head)/*链表记录保存*/
{
    struct Ritongji *p1=head; 
    int j,k;
    jiluwenjian=fopen("jilu.txt","w");
    if(p1==NULL)
    {

        fprintf(jiluwenjian,"");
    }
    while(p1!=NULL)
    {
        fprintf(jiluwenjian,"%d %d %d ",p1->year,p1->month,p1->day);
        for(j=0;j<=3;j++)
        {
            for(k=0;k<=4;k++)
            {
                fprintf(jiluwenjian,"%d ",p1->Yuangong[j].p[k]);
            }
        }
        fprintf(jiluwenjian,"\n");
        p1=p1->next;
    }
    fclose(jiluwenjian) ;
}

int duqujilu(struct Ritongji **head)/*链表记录读取*/ /*  *head初始值必须是NULL*/
{                                                                           
    int j,k;
    int year;
    int day;
    int month;
    struct Ritongji **pr=head;
    if((jiluwenjian=fopen("jilu.txt","r"))==NULL)
        return 0;
    fscanf(jiluwenjian,"%d");
    if(feof(jiluwenjian))
        return 0;
    fseek(jiluwenjian,0,SEEK_SET);
    while(!feof(jiluwenjian))
    {
        *pr=(struct Ritongji *)malloc(sizeof(struct Ritongji));  
        fscanf(jiluwenjian,"%d%d%d",&(*pr)->year,&(*pr)->month,&(*pr)->day);
        (*pr)->next=NULL;
        for(j=0;j<=3;j++)                          
        {
            for(k=0;k<=4;k++)
            {
                fscanf(jiluwenjian,"%d",&((*pr)->Yuangong[j].p[k]));
            }
        }
        pr=&((*pr)->next);
        fscanf(jiluwenjian,"\n");
    }
}

int peizhiduqu(char *mima,int *zitipeizhi)
{
    peizhiwenjian=fopen("peizhi.txt","r");
    fscanf(peizhiwenjian,"%s",mima);
    fscanf(peizhiwenjian,"%d",zitipeizhi);
    fclose(peizhiwenjian);
}

int peizhibaocun(char *mima,int ziti)
{
    peizhiwenjian=fopen("peizhi.txt","w");
    fprintf(peizhiwenjian,"%s",mima);
    fprintf(peizhiwenjian,"\n");
    fprintf(peizhiwenjian,"%d",ziti);
    fprintf(peizhiwenjian,"\n");
    fclose(peizhiwenjian);
}


/*其它功能代码结束*/

main()
{
    struct Ritongji *head=NULL;
    struct Ritongji *p;
    int i1,i2,i3,t;
    int yuangong;
    int tongji [4][5];   /*用于每个月报表的统计*/
    int yuangongtongji[4];   /*用于员工销售额的统计*/
    int year;
    int month;
    int day;
    int zitipeizhi;
    char * mima[15]={0};
    char * mimahedui[15]={1};
    int cuowucishu=0;
    tuxingchushihua();  /*初始化图形界面*/
    setbkcolor(BLACK);
    peizhiduqu(mima,&zitipeizhi);
    if(0==zitipeizhi)
    {
        if ((fp=fopen( "1hzk32", "rb"))==NULL)
        {
            printf("Can't open haz32,Please add it");
            getch();
            exit(0);
        }  /*打开字库文件*/
    }
    else
    {
        if ((fp=fopen( "2hzk32", "rb"))==NULL)
        {
            printf("Can't open haz32,Please add it");
            getch();
            exit(0);
        }  /*打开字库文件*/
    }
    if(strcmp(mima,"000000000000000"))
    {
        cleardevice();
        hanzishuru("请输入密码",0,0,GREEN);
        gotoxy(12,1);
        scanf("%s",mimahedui);
        while(strcmp(mimahedui,mima))
        {
            cleardevice();
            hanzishuru("密码错误,请输入密码",0,0,GREEN);
            gotoxy(22,1);
            cuowucishu++;
            if(cuowucishu==3)
            {
                cleardevice();
                hanzishuru("密码错误超过三次,程序将退出",0,0,GREEN);
                getch();
                closegraph();
                exit(0);
            }
            scanf("%s",mimahedui);
        }
        getchar();
    }
    duqujilu(&head);/*自动从文件中读取销售记录*/
    while (1)
    {
        cleardevice();
        setbkcolor(BLACK);
        menu1();
        gotoxy(44,18);       /*显示基本目录*/
        i1=getchar();
        getchar();
        switch(i1)
        {
            fflush(stdin);
        case '1': fflush(stdin);
                   for(t=0;t!=1;)
                  {  
                      cleardevice();
                      menuyuangong();
                      gotoxy(44,19);
                      i2=getchar();
                      getchar();
                      switch(i2)
                      {
                      case '1':  head=menu11(head);    break;
                      case '2':  head=menu12(head);    break;         /*正常的记录模块*/
                      case '3':  menu13(&head);         break;
                      case '4':  t=1;                  break;
                      default: ;
                      }
                  }
            break;
        case '2': for(t=0;t!=1;)
                  {
                      fflush(stdin);
                      cleardevice();
                      menulaoban();
                      gotoxy(34,19);
                      i3=getchar();
                      getchar();
                      switch(i3)
                      {
                      case '1':
                          {
                              cleardevice();
                              hanzishuru("输入要统计的年份",0,0,GREEN);
                              gotoxy(18,1);
                              scanf("%d",&year);
                              cleardevice();
                              hanzishuru("输入要统计的月份",0,0,GREEN);
                              gotoxy(18,1);
                              scanf("%d",&month);
                              cleardevice();
                              getchar();
                              shuaxinbaobiao(head,year,month,tongji);
                              xianshibaobiao(tongji);
                              getch();
                              break;
                          }
                      case '2':
                          {
                              menu22(head);
                              break;
                          }
                      case '3':menu23(head);                break;
                      case '4':
                          {
                              cleardevice();
                              hanzishuru("请输入年份",0,0,GREEN);
                              gotoxy(12,1);
                              scanf("%d",&year); 
                              cleardevice();
                              hanzishuru("请输入月份",0,0,GREEN);
                              gotoxy(12,1);
                              scanf("%d",&month); 
                              cleardevice();
                              hanzishuru("输入要查询的员工",0,0,GREEN);
                              gotoxy(18,1);
                              scanf("%d",&yuangong);
                              getchar();
                              shuaxinbaobiao(head,year,month,tongji);
                              menu24(tongji,yuangong);
                              getch();
                              break;
                          }
                      case '5': menu25(head);                     break;
                      case '6': menu26(head);                     break;
                      case '7': menusheding(mima,&zitipeizhi); getchar();                   break;
                      case '8': t=1;      break;
                      default: ;
                      }
                  }
            break;
        case '3':
                   jilubaocun(head);/*链表记录保存*/
                     peizhibaocun(mima,zitipeizhi);/*配置保存*/
                    closegraph();
                     exit(1);
        default:;
        }
    }
}

/*
打开程序自动提取文件的配置信息和记录信息,没有则新建
关闭程序时自动保存配置信息和记录信息
*/

内容概要:本文系统整理了《微软面试100题完整版(含解析+备考指南)2026最新求职资源》,涵盖算法编程、逻辑思维、计算机基础、系统设计与工程实践、职场综合五大核心题型,共100道高频原题,均来自微软近十年真实面试题库,剔除过时内容,新增AI工程应用、轻量化系统设计等2026年前沿考点。每道题目配有详细解题思路与考察要点,覆盖数据结构、动态规划、位运算、网络协议、数据库事务、微服务架构、高并发设计等关键技术领域,并包含逻辑推理、工程排查、产品权衡等综合素质题目,全面适配微软海内外各岗位面试需求。此外,文章还提供分层刷题策略、地域差异化备考建议及完整资源获取路径,助力求职者高效通关初面、复面与终面。; 适合人群:准备应聘微软的应届毕业生、1-5年工作经验的技术岗从业者(如软件开发、算法、测试、数据、运维等),以及计划投递微软海外岗位的求职者;尤其适合缺乏系统面试准备、希望提升解题思维与工程表达能力的人群。; 使用场景及目标:①针对微软技术面试中的算法题进行专项突破,掌握最优解法与代码规范;②训练逻辑思维与系统设计能力,应对高阶岗位考察;③准备终面综合问题,提升职场素养与岗位匹配度表达;④根据国内/海外不同考点调整复习重点,实现精准备考。; 阅读建议:此资源以真题为核心,强调解题思路而非死记硬背,建议按“分类刷题—总结模板—模拟手撕—复盘优化”流程学习,重点关注代码边界处理、复杂度优化与中英文表达逻辑,结合自身背景补充项目复盘与系统设计练习,全面提升面试实战能力。
内容概要:本文围绕永磁同步电机(PMSM)的二阶线性自抗扰矢量控制系统展开深入研究,重点实现了基于Simulink的系统建模仿真。研究采用二阶线性自抗扰控制(LADRC)策略,结合扩张状态观测器(ESO)对系统内部动态外部扰动进行实时估计与前馈补偿,有效提升了电机在负载突变、参数摄动等复杂工况下的转速控制精度、动态响应速度与系统鲁棒性。文中详细构建了电流环与转速环的双闭环矢量控制架构,系统分析了控制器关键参数的设计方法、观测器带宽的整定原则以及整体系统的稳定性条件,并通过大量仿真实验验证了所提出控制方案相较于传统PI控制在抗干扰能力、响应性能鲁棒性方面的显著优越性。; 适合人群:具备自动控制理论、电机控制原理、现代控制理论等相关专业知识,熟悉Simulink/Matlab仿真环境,且有一定工程实践经验的电气工程、自动化、控制科学与工程等领域的硕士/博士研究生、科研人员及从事高性能电机驱动系统开发的工程技术人员。; 使用场景及目标:①为高等院校科研机构提供先进电机控制算法的教学案例与科研实验平台,深化对自抗扰控制(ADRC)理论的理解;②为企业在高性能伺服驱动、新能源汽车电驱系统、工业自动化等领域的下一代控制器研发提供可靠的技术参考、仿真验证方案原型设计基础;③帮助研究人员系统掌握ADRC的核心思想、设计流程及其在高精度运动控制系统中的具体工程实现方法。; 阅读建议:学习者应具备扎实的自动控制与电机学理论基础及Simulink建模能力,建议结合韩京清教授的经典ADRC文献进行原理性学习,深入理解ESO的观测机理与TD的安排机制。在仿真实践中,应动手调试控制器带宽、观测器增益等核心参数,对比分析不同扰动工况(如突加负载、转速指令跳变)下的系统响应曲线,以直观感受控制性能的差异。为进一步深化研究,可将该仿真模型与硬件在环(HIL)测试平台或实际电机实验平台对接,完成从算法设计、仿真验证到物理实现的完整闭环验证流程。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值