Answers for "Uri/beecrowd problem no - 1131 solution in C"

C
0

Uri/beecrowd problem no - 1131 solution in C

#include<stdio.h>
int main(){
    int limit = 1,counter = 0,counter1 = 0,counter2 = 0,counter3 = 0;
    while(limit != 2){
        if(limit == 1){
            int score1,score2;
            scanf("%d%d", &score1, &score2);
            if(score1 > score2){
                counter1++;
            }else{
                counter2++;
            }
            if(score1 == score2){
                counter3++;
            }
        }
        printf("Novo grenal (1-sim 2-nao)n");
        counter++;
        scanf("%d", &limit);
    }
    printf("%d grenaisn", counter);
    printf("Inter:%dn", counter1);
    printf("Gremio:%dn", counter2);
    printf("Empates:%dn", counter3);
    if(counter1 > counter2){
        printf("Inter venceu maisn");
    }
    if(counter1 < counter2){
        printf("Gremio venceu maisn");
    }
    if(counter2 == counter1){
        printf("Não houve vencedorn");
    }
    return 0;
}
Posted by: Guest on January-15-2022

Code answers related to "Uri/beecrowd problem no - 1131 solution in C"

Code answers related to "C"

Browse Popular Code Answers by Language