#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
#define LL long long
int r,c;
LL a[101][101],re;
void solve(){
scanf("%d %d",&r,&c);
for(int i = 0; i< r; i++){
for(int j = 0; j < c; j++){
scanf("%lld",&a[i][j]);
re+= abs(a[i][j]);
}
}
printf("%lld 1\n",re);
puts("rotC 2 1");
}
int main(void){
solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
0 ms |
1168 KB |
Output is partially correct |
2 |
Partially correct |
0 ms |
1168 KB |
Output is partially correct |
3 |
Partially correct |
0 ms |
1168 KB |
Output is partially correct |
4 |
Incorrect |
0 ms |
1168 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |