Submission #523263


Source Code Expand

Copy
#include <bits/stdc++.h>

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  string s;
  for(int i=0;cin>>s;++i){
	if(i > 0) cout << " ";
	if(s[0] == 'L')
	  cout << "<";
	else if(s[0] == 'R')
	  cout << ">";
	else
	  cout << "A";
  }
  cout << endl;

  return 0;
}

Submission Info

Submission Time
Task A - スペース高橋君
User okaduki
Language C++11 (GCC 4.9.2)
Score 100
Code Size 1160 Byte
Status
Exec Time 26 ms
Memory 932 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 example_0.txt, example_1.txt, example_2.txt
All 100 / 100 corner_0.txt, corner_1.txt, corner_2.txt, example_0.txt, example_1.txt, example_2.txt, maxrand_0.txt, maxrand_1.txt, maxrand_2.txt, random_0.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt
Case Name Status Exec Time Memory
corner_0.txt 26 ms 800 KB
corner_1.txt 25 ms 928 KB
corner_2.txt 25 ms 804 KB
example_0.txt 25 ms 808 KB
example_1.txt 24 ms 800 KB
example_2.txt 25 ms 928 KB
maxrand_0.txt 24 ms 924 KB
maxrand_1.txt 25 ms 924 KB
maxrand_2.txt 25 ms 804 KB
random_0.txt 25 ms 796 KB
random_1.txt 25 ms 928 KB
random_2.txt 25 ms 924 KB
random_3.txt 25 ms 800 KB
random_4.txt 25 ms 932 KB