# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9496 | lemonsqueeze | Solve another chuck (kriii2_S) | C++98 | 24 ms | 2492 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 <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int n, m;
int a[101][101];
int tmp[101];
vector<string> ans;
string pjsdream_to_string (long long x)
{
static char res[12];
sprintf (res, "%lld", x);
return res;
}
void rotR (int i, int k)
{
if (k==0) return;
ans.push_back ("rotR " + pjsdream_to_string ((long long)i) + " " + pjsdream_to_string ((long long )k));
for (int j=1; j<=m; j++) tmp[j%m] = a[i][j];
for (int j=1; j<=m; j++) a[i][j] = tmp[(j-k+m) % m];
}
void rotC (int j, int k)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |