#include "secret.h"
int a[10000];
void Init(int N, int A[]){
for(int i=0;i<N;i++){
a[i]=A[i];
}
}
int Query(int L , int R){
int r;
r=Secret(a[L+1],a[L]);
for(int i=L+2;i<=R;i++){
r=Secret(r,a[i]);
}
return r;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
107 ms |
2304 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015. |
2 |
Incorrect |
110 ms |
2280 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 73015528. |
3 |
Incorrect |
112 ms |
2304 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 11839748. |
4 |
Incorrect |
405 ms |
4152 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 12075716. |
5 |
Incorrect |
418 ms |
4400 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 505071630. |
6 |
Incorrect |
409 ms |
4200 KB |
Wrong Answer: Query(915, 915) - expected : 282904741, actual : 433343255. |
7 |
Incorrect |
425 ms |
4172 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 639831104. |
8 |
Incorrect |
422 ms |
4236 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 537067800. |
9 |
Incorrect |
424 ms |
4248 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 555492839. |
10 |
Incorrect |
457 ms |
4264 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 812141133. |