# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9445 | ainu7 | Solve another chuck (kriii2_S) | C++98 | 32 ms | 2792 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 <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <set>
using namespace std;
int R, C;
vector<string> res;
int arr[100][100];
void rotR(int i) {
char temp[50];
if (C > 1) { sprintf(temp, "rotR %d 1", i+1); res.push_back(temp); }
int t = arr[i][C-1];
for (int k=C-1; k>=1; k--) arr[i][k] = arr[i][k-1];
arr[i][0] = t;
}
void negC() {
char temp[50];
sprintf(temp, "negC 1"); res.push_back(temp);
for (int k=0; k<R; k++) arr[k][0] = -arr[k][0];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |