Submission #3374334
Source Code Expand
#include <iostream> #include <algorithm> #include <cmath> #include <limits> #include <vector> #include <cstdio> #include <bits/stdc++.h> #include <set> #include <map> #include <stdio.h> #include <stack> #include <queue> #include <deque> #include <numeric> #include<bits/stdc++.h> #include <utility> #define ALL(obj) (obj).begin(), (obj).end() #define FOR(i,a,b) for(int i = (a); i < (b); i++) #define RFOR(i,a,b) for(int i = (a); (b) <= i; i--) #define REP(i,n) for(int i = 0; i < (n); i++) #define RREP(i,n) for(int i = n; n <= i; i--) #define ABS(a) ((a < 0) ? ((-1)*(a)) : (a)) #define elif else if #define MOD 1000000007 #define INF (1<<29) using namespace std; using ll = long long; map <int ,int> mpa,mpb; typedef pair<ll, ll> P; priority_queue<P, vector<P>, greater<P>> pque; int main(){ ios::sync_with_stdio(false); cin.tie(NULL); int N; cin >> N; char a[N][N]={0}; for(int i=0;i<N;i++){ for(int j=0;j<N;j++){ cin >> a[i][j]; } } for(int i=0;i<N;i++){ for(int j=N-1;j>=0;j++){ cout << a[j][i]; } cout << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 回転 |
User | arks1225 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1137 Byte |
Status | RE |
Exec Time | 115 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 0 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | RE | 115 ms | 256 KB |
001.txt | RE | 98 ms | 256 KB |
002.txt | RE | 97 ms | 256 KB |
003.txt | RE | 97 ms | 256 KB |
004.txt | RE | 98 ms | 256 KB |
005.txt | RE | 99 ms | 256 KB |
006.txt | RE | 102 ms | 256 KB |
007.txt | RE | 99 ms | 256 KB |
008.txt | RE | 100 ms | 256 KB |
009.txt | RE | 99 ms | 256 KB |
010.txt | RE | 98 ms | 256 KB |