an760cw/pvjc23
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Update 'du5/program.c'

Browse Source
This commit is contained in:
Anzhelika Nikolaieva 2023-03-24 14:02:41 +00:00
parent 00364efe4f
commit 322882789e
1 changed files with 61 additions and 68 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

129
du5/program.c
View File

@ -1,84 +1,77 @@
#include<stdio.h> #include<stdio.h>
#include <string.h> #include <string.h>
#include <stdbool.h> #include <stdbool.h>
struct clovek struct celovek{
{ int golos;
int holos;
char name[60]; char name[60];
}; };
void printAll(struct clovek clovek[50],int number_clovek){ void printAll(struct celovek celovek[50],int number_celovek){
printf("Vysledky:\n"); printf("Vysledky:\n");
for (size_t i = 0; i < number_clovek; i++) for (size_t i = 0; i < number_celovek; i++){
{ printf("%d", celovek[i].golos);
printf("%d", clovek[i].holos); printf("%s", celovek[i].name);
printf("%s", clovek[i].name);
} }
} }
void readDellSame(bool je_toiste, bool je_dobre, int* number_clovek, struct clovek clovek[50]){
for (size_t i = 0; i >=0; i++) void readDellSame(bool odinakovyi, bool dobre, int* number_celovek, struct celovek celovek[50]){
{ for (size_t i = 0; i >=0; i++){
char step_name[60]; char step_name[60];
int step_holos =0; int step_golos =0;
int r = scanf("%d", &step_holos); int b = scanf("%d", &step_golos);
if (r == -1) if (b == -1){
{
break; break;
} }
if (step_holos == 0)
{ if (step_golos == 0){
je_dobre = true; dobre = true;
} }
fgets(step_name, 60 , stdin);//prečíta riadok z terminálu fgets(step_name, 60 , stdin);//prečíta riadok z terminálu
for (size_t j = 0; j <*number_clovek; j++)
{ for (size_t j = 0; j <*number_celovek; j++){
if(strcmp (clovek[j].name, step_name)==0 && je_dobre == false ){//porovnáva struny if(strcmp (celovek[j].name, step_name)==0 && dobre == false ){//porovnáva struny
clovek[j].holos += step_holos; celovek[j].golos += step_golos;
je_toiste = true; odinakovyi = true;
i--; i--;
} }
} }
if ((je_toiste == false|| *number_clovek == 0) && je_dobre == false) if ((odinakovyi == false|| *number_celovek == 0) && dobre == false){
{ celovek[i].golos = step_golos;
clovek[i].holos = step_holos; strcpy(celovek[i].name, step_name);//strcpy-koreluje časti pamäte
strcpy(clovek[i].name, step_name);//strcpy-koreluje časti pamäte *number_celovek = *number_celovek +1 ;
*number_clovek = *number_clovek +1 ;
} }
je_toiste = false; odinakovyi = false;
} }
} }
void sortMas(int number_clovek, struct clovek clovek[50]){ void sort(int number_celovek, struct celovek celovek[50]){
for (size_t i = 0; i <number_clovek; i++) for (size_t i = 0; i <number_celovek; i++){
{ for (size_t j = i; j < number_celovek; j++){
for (size_t j = i; j < number_clovek; j++) if (celovek[i].golos == celovek[j].golos){
{ if(celovek[i].name[1] > celovek[j].name[1]){
if (clovek[i].holos == clovek[j].holos) int tmp = celovek[i].golos;
{
if(clovek[i].name[1] > clovek[j].name[1]){
int tmp = clovek[i].holos;
char tmp_name[60]; char tmp_name[60];
strcpy(tmp_name, clovek[i].name); strcpy(tmp_name, celovek[i].name);
clovek[i].holos = clovek[j].holos; celovek[i].golos = celovek[j].golos;
strcpy(clovek[i].name, clovek[j].name); strcpy(celovek[i].name, celovek[j].name);
clovek[j].holos = tmp; celovek[j].golos = tmp;
strcpy(clovek[j].name, tmp_name); strcpy(celovek[j].name, tmp_name);
} }
if(clovek[i].name[1] == clovek[j].name[1])
{ if(celovek[i].name[1] == celovek[j].name[1]){
if(clovek[i].name[2] > clovek[j].name[2]){ if(celovek[i].name[2] > celovek[j].name[2]){
int tmp = clovek[i].holos; int tmp = celovek[i].golos;
char tmp_name[60]; char tmp_name[60];
strcpy(tmp_name, clovek[i].name); strcpy(tmp_name, celovek[i].name);
clovek[i].holos = clovek[j].holos; celovek[i].golos = celovek[j].golos;
strcpy(clovek[i].name, clovek[j].name); strcpy(celovek[i].name, celovek[j].name);
clovek[j].holos = tmp; celovek[j].golos = tmp;
strcpy(clovek[j].name, tmp_name); strcpy(celovek[j].name, tmp_name);
} }
} }
} }
@ -86,32 +79,32 @@ void sortMas(int number_clovek, struct clovek clovek[50]){
} }
} }
int main(){ int main(){
struct clovek clovek[50]; struct celovek celovek[50];
int number_clovek = 0; int number_celovek = 0;
bool je_toiste = false; bool odinakovyi = false;
bool je_dobre = false; bool dobre = false;
readDellSame(je_toiste, je_dobre, &number_clovek,clovek); readDellSame(odinakovyi, dobre, &number_celovek,celovek);
for (size_t i = 0; i < number_clovek-1; i++) for (size_t i = 0; i < number_celovek-1; i++)
{ {
for (size_t j = 0; j < number_clovek - i-1; j++) for (size_t j = 0; j < number_celovek - i-1; j++)
{ {
if (clovek[j].holos < clovek[j+1].holos) if (celovek[j].golos < celovek[j+1].golos)
{ {
int tmp = clovek[j+1].holos; int tmp = celovek[j+1].golos;
char tmp_name[60]; char tmp_name[60];
strcpy(tmp_name, clovek[j+1].name); strcpy(tmp_name, celovek[j+1].name);
clovek[j+1].holos = clovek[j].holos; celovek[j+1].golos = celovek[j].golos;
strcpy(clovek[j+1].name, clovek[j].name); strcpy(celovek[j+1].name, celovek[j].name);
clovek[j].holos = tmp; celovek[j].golos = tmp;
strcpy(clovek[j].name, tmp_name); strcpy(celovek[j].name, tmp_name);
} }
} }
} }
sortMas(number_clovek, clovek); sort(number_celovek, celovek);
printAll(clovek, number_clovek); printAll(celovek, number_celovek);
return 0; return 0;
} }