#include<stdio.h>
int R, C;
int map[101][101];
int main()
{
int sum = 0;
scanf("%d %d", &R, &C);
for(int i = 1; i <= R; i++) for(int j = 1; j <= C; j++){
scanf("%d", &map[i][j]);
if(map[i][j] > 0) sum += map[i][j];
else sum -= map[i][j];
}
printf("%d 2\nrotC 2 1\nnegR 2\n", sum);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
0 ms |
1128 KB |
Output is partially correct |
2 |
Partially correct |
0 ms |
1128 KB |
Output is partially correct |
3 |
Partially correct |
0 ms |
1128 KB |
Output is partially correct |
4 |
Incorrect |
0 ms |
1128 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |