# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
89008 | nika | Luxury burrow (IZhO13_burrow) | C++14 | 2 ms | 376 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>
using namespace std;
long long int z[1000][1000],a,b,c,d,e,f=1,g=0,h,i;
int main()
{
cin>>a>>b>>c;
for(i=1;i<=a;i++){
for(d=1;d<=b;d++){
cin>>z[i][d];
if((f<=z[i][d]) && (z[i][d]<c)){
f=z[i][d];
}
}}
i=1;
h=f;
while(f<c){
f=f*i;
i++;
if(f<c){
f=h;
}
}
cout<<i-1<<" "<<f;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |