# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9761 | maniac | Solve another chuck (kriii2_S) | C++98 | 0 ms | 1168 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 <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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |