current position:Home>Can someone help me see if there is a problem with the code, why the operation is not successful, and there are no errors
Can someone help me see if there is a problem with the code, why the operation is not successful, and there are no errors
2022-01-27 03:04:12 【CSDN Q & A】
#include "stdafx.h"
#include <stdlib.h>
#include <malloc.h>
#include <conio.h>
#define n 5 / Set up , Changeable /
#define m 3 / Set up , Changeable /
#define w 2 / Set up , Changeable /
struct achievement /* Define the structure that represents the grade /
{int schoolnumber;/ School number /
char name[20]; / full name /
int mark; / fraction /
int result;};
struct pro / Represents the structure of the project /
{int tag;/ Item number */
struct achievement ach[m+w];
int number;
};
struct Node
{struct pro date;
struct Node next;
};
void main()
{
int i,j,t;
int x[n]={0};int y[n]={0}; / x[n] and y[n] Indicates the total scores of men's and women's groups respectively */
struct Node head;
struct Node p;
struct Node q;
if((head=(struct Node)malloc(sizeof(struct Node)))==NULL) exit(1);
head->next=NULL; / Initialize single chain table /
p=head;
for(i=0;i<m+w;i++) /* Enter grades */
{
j=i+1;
printf(" Please enter the first %d Information about a project \n",j);
p->date.number=j;
printf(" The number of times the name is taken is :");
scanf_s("%d",p->date.tag);
{ printf(" Incorrect input , Please re-enter !");
getchar(); / Add this function to prevent the program from entering an infinite loop when an input error occurs /
getchar();
printf(" The number of times the name is taken is :");
scanf_s("%d",p->date.tag);
}
t=1;
while(t<=p->date.tag)
{
printf(" The first %d First name :",t);
scanf_s("%s",p->date.ach[t-1].name);
printf(" The first %d Famous school :",t);
scanf_s("%d",p->date.ach[t-1].schoolnumber);
printf(" The first %d The score of the first name :",t);
scanf_s("%d",p->date.ach[t-1].mark);
p->date.ach[t-1].result=t;
t++;
}
if(j!=m+w)/ Note that there /
{q=(struct Node)malloc(sizeof(struct Node)); / Generate new nodes */
p->next=q;
p=q;
p->next=NULL;
}
}
for(i=0;i<n;i++) /* Produce transcripts */
{
j=i+1;
printf("\n School %d school report :\n",j);
p=head;
while(p!=NULL)
{
t=1;
while(t<=p->date.tag)
{
if(p->date.ach[t-1].schoolnumber==j)
{
printf(" Award winning projects :%d ",p->date.number);
printf(" Ranking :%d ",p->date.ach[t-1].result);
printf(" Name of the winner :%s ",p->date.ach[t-1].name);
printf(" Score :%d \n",p->date.ach[t-1].mark);
if(p->date.number<=m)
x[i]=x[i]+p->date.ach[t-1].mark;
else
y[i]=y[i]+p->date.ach[t-1].mark;
}
t++;
}
p=p->next;
}
printf("\n Total score of men's group :%d ",x[i]);
printf(" Total score of women's group :%d \n",y[i]);
printf(" Total group score :%d\n",x[i]+y[i]);
}
for(i=0;i<m+w;i++) /* Free the requested memory space */
{p=head->next;
free(head);
head=p;
}
_getch();
}
copyright notice
author[CSDN Q & A],Please bring the original link to reprint, thank you.
https://en.cdmana.com/2022/01/202201270304073594.html
The sidebar is recommended
- Spring IOC container loading process
- [thinking] the difference between singleton mode and static method - object-oriented programming
- Hadoop environment setup (MySQL environment configuration)
- 10 minutes, using node JS creates a real-time early warning system for bad weather!
- Git tool
- Force deduction algorithm - 92 Reverse linked list II
- What is the sub problem of dynamic programming?
- C / C + +: static keyword summary
- Idea does not have the artifacts option when configuring Tomcat
- Anaconda can't open it
guess what you like
-
I don't know how to start this
-
Matlab simulation of transportation optimization algorithm based on PSO
-
MySQL slow log optimization
-
[Vue] as the window is stretched (larger, smaller, wider and higher), the text will not be displayed
-
Popular Linux distributions for embedded computing
-
Suzhou computer research
-
After installing SSL Certificate in Windows + tomcat, the domain name request is not successful. Please answer!!
-
Implementation time output and greetings of jQuery instance
-
The 72 year old uncle became popular. Wu Jing and Guo fan made his story into a film, which made countless dreamers blush
-
How to save computer research
Random recommended
- Springboot implements excel import and export, which is easy to use, and poi can be thrown away
- The final examination subjects of a class are mathematical programming, and the scores are sorted and output from high to low
- Two pronged approach, Tsinghua Professor Pro code JDK and hotspot source code notes, one-time learning to understand
- C + + recursive knapsack problem
- The use of GIT and GitHub and the latest git tutorial are easy to understand -- Video notes of crazy God speaking
- PostgreSQL statement query
- Ignition database test
- Context didn't understand why he got a high salary?, Nginxfair principle
- Bootstrap switch switch control user's guide, springcloud actual combat video
- A list that contains only strings. What other search methods can be used except sequential search
- [matlab path planning] multi ant colony algorithm grid map path planning [including GUI source code 650]
- [matlab path planning] improved genetic algorithm grid map path planning [including source code phase 525]
- Iinternet network path management system
- Appium settings app is not running after 5000ms
- Reactnative foundation - 07 (background image, status bar, statusbar)
- Reactnative foundation - 04 (custom rpx)
- If you want an embedded database (H2, hsql or Derby), please put it on the classpath
- When using stm32g070 Hal library, if you want to write to flash, you must perform an erase. If you don't let it, you can't write continuously.
- Linux checks where the software is installed and what files are installed
- SQL statement fuzzy query and time interval filtering
- 69. Sqrt (x) (c + + problem solving version with vs runnable source program)
- Fresh students are about to graduate. Do you choose Java development or big data?
- Java project: OA management system (java + SSM + bootstrap + MySQL + JSP)
- Titanic passenger survival prediction
- Vectorization of deep learning formula
- Configuration and use of private image warehouse of microservice architect docker
- Relearn JavaScript events
- For someone, delete return 1 and return 0
- How does Java dynamically obtain what type of data is passed? It is used to judge whether the data is the same, dynamic data type
- How does the database cow optimize SQL?
- [data structure] chain structure of binary tree (pre order traversal) (middle order traversal) (post order traversal) (sequence traversal)
- Webpack packaging optimization solution
- 5. Operation element
- Detailed explanation of red and black trees
- redhat7. 9 install database 19C
- Blue Bridge Cup notes: (the given elements are not repeated) complete arrangement (arrangement cannot be repeated, arrangement can be repeated)
- Detailed explanation of springboot default package scanning mechanism and @ componentscan specified scanning path
- How to solve the run-time exception of test times
- Detailed explanation of k8s management tool kubectl
- Android system view memory command