# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
5984 |
2014-06-08T12:54:51 Z |
baneling100 |
라멘 (JOI14_ramen) |
C++ |
|
0 ms |
1124 KB |
#include "ramen.h"
void Ramen(int N)
{
int i, MAX=0, MIN=0;
for(i=1 ; i<=N-1 ; i++)
{
if(Compare(MAX,i)==-1)
MAX=i;
if(Compare(MIN,i)==1)
MIN=i;
}
Answer(MIN,MAX);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1124 KB |
Output is correct |
2 |
Correct |
0 ms |
1124 KB |
Output is correct |
3 |
Correct |
0 ms |
1124 KB |
Output is correct |
4 |
Correct |
0 ms |
1124 KB |
Output is correct |
5 |
Correct |
0 ms |
1124 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1124 KB |
Output is correct |
2 |
Correct |
0 ms |
1124 KB |
Output is correct |
3 |
Correct |
0 ms |
1124 KB |
Output is correct |
4 |
Correct |
0 ms |
1124 KB |
Output is correct |
5 |
Correct |
0 ms |
1124 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1124 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |