# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
641061 | 2022-09-15T21:35:13 Z | Benmath | Horses (IOI15_horses) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include<horses.h> using namespace std; int init(int N, int X[], int Y[]) { int pro=1; int maxi=0; for(int i=0;i<N;i++){ pro=pro*X[i]; int pro1=pro*Y[i]; if(pro1>maxi){ maxi=pro1; } } return maxi; } /* int main() { cout << "Hello world!" << endl; return 0; } */