Submission #9761

#TimeUsernameProblemLanguageResultExecution timeMemory
9761maniacSolve another chuck (kriii2_S)C++98
0 / 4
0 ms1168 KiB
#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 timeMemoryGrader output
Fetching results...