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

Update 'du6/program.c'

Browse Source
This commit is contained in:
Anzhelika Nikolaieva 2023-04-04 13:42:35 +00:00
parent cdd408b5c9
commit 3190f1a721
1 changed files with 28 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

46
du6/program.c
View File

@ -3,37 +3,47 @@
#include <stdlib.h>
#define MAXIMALNE_STUDENTOV 1000
#define MENA 100
int main(){
char spisok[MAXIMALNE_STUDENTOV][50]; //pole na ukladanie mien studentov
char spisok[MAXIMALNE_STUDENTOV][MENA]; //pole na ukladanie mien studentov
int prijaty, mien, a, b, c = 0;
int maximalne_studentov, num_studentov = 0;
if(scanf("%d", &prijaty) != 1 || prijaty <= 0){ //nacitanie studentov na prijatie
printf("Nespravny vstup\n");
if(scanf("%d", &maximalne_studentov) != 1){ //precitane si maximalny pocet prijatych studentov
puts("Nespravny vstup");
return 1;
}
while(scanf("%s", spisok[mien]) == 1){ //nacitanie zoznamu mien studentov
mien++;
while(fgets(spisok[num_studentov], MENA, stdin)){ //precitajte si zoznam studentskych prihlasok
spisok[num_studentov][strcspn(spisok[num_studentov], "\n")] = '\0'; //odstranie koncovoho znaka noveho riadku
if(spisok[num_studentov][0] == '\0'){ //zastavnie citanie ak najdeni prazdny riadok alebo koniec suboru
break;
}
if(mien == 0){ //kontrola, ci boli nacitane nejake mena
printf("Ziadne prihlasky\n");
return 0;
for(int a = 0; a < num_studentov; a++){ //skontrolujem duplicitne mena
if(strcmp(spisok[a], spisok[num_studentov]) == 0){
puts("Ziadne prihlasky");
return 1;
}
}
num_studentov++;
if(num_studentov >= maximalne_studentov){ //po dosiahnuti maximalneho poctu studentov zastavte citanie
break;
}
}
for(int a = 0; a < num_studentov; a++){
for(int b = a +1; b < num_studentov; b++){
if(strcmp(spisok[a], spisok[b]) > 0){
char p[MENA]
}
}
}