# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
641060 | Benmath | Horses (IOI15_horses) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
}
cout<<maxi;
}
/*
int main()
{
cout << "Hello world!" << endl;
return 0;
}
*/