# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9416 | ainu7 | Solve another chuck (kriii2_S) | C++98 | 0 ms | 1680 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 main()
{
int R, C;
cin >> R >> C;
int arr[100][100] = {0};
for (int i=0; i<R; i++)
for (int j=0; j<C; j++)
cin >> arr[i][j];
vector<string> res;
char temp[50];
for (int i=0; i<R; i++) {
for (int j=0; j<C; j++) {
sprintf(temp, "rotR %d 1", i+1); res.push_back(temp);
int t = arr[i][C-1];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |