URI Solution 1125 Formula 1 - Solution in C++ | Ad Hoc

URI Solution 1125 Formula 1 - Solution in C++ | Ad Hoc

URI Online Judge Solution Formula 1  | Ad Hoc
URI Main Link - https://www.urionlinejudge.com.br/judge/en/problems/view/1125

Problem Name: URI Problem - Formula 1
Problem Number : URI - 1125
Online Judge : URI Online Judge Solution
Level: Ad Hoc
Solution Language : C plus plus

URI Solution 1125 Code in CPP:

#include <cstdio>
#include <cstring>
using namespace std;

int g, p, s, k;
int corrida[101][101], sistema[101], ponto[101];

int main()
{
 int m;
 while(scanf("%i %i", &g, &p) && (g || p))
 {
  for (int i = 0; i < g; ++i)
  {
   for (int j = 0; j < p; ++j)
   {
    scanf("%i", &corrida[i][j]);
   }
  }

  scanf("%i", &s);

  while(s--)
  {
   memset(ponto, 0, sizeof(ponto)); 
   memset(sistema, 0, sizeof(sistema));
   scanf("%i", &k);

   for (int i = 0; i < k; ++i)
    scanf("%i", &sistema[i]);

   for (int i = 0; i < g; ++i)
   {
    for (int j = 0; j < p; ++j)
    {
     ponto[j] += sistema[corrida[i][j]-1];
    }
   }

   m = 0;

   for (int i = 0; i < p; ++i)
    if( ponto[i] > m) 
     m = ponto[i];

   bool f = true;

   for (int i = 0; i < p; ++i)
   {
    if(ponto[i] == m){
     if(f){
      printf("%d", i + 1);
      f = false;
     }else{
      printf(" %d", i + 1);
     }
    }
   }
   printf("\n");
  }
 }

 return 0;
}