Submission #2100336
Source Code Expand
#include<iostream> #include<string> #include<cstdio> #include<algorithm> #include<cstdlib> #include<cmath> #include<vector> #include<utility> #include<queue> #include<stack> #include<set> #include<map> #include<unordered_set> #include<bitset> using namespace std; //#define MODE 1 #ifdef MODE #define DEB(X) cout<< #X <<": "<<X<<" "; #define ARDEB(i,X) cout<< #X <<"["<<i<<"]: "<<X[i]<<" "; #define END cout<<endl; #else #define DEB(X) {} #define ARDEB(i,X) {} #define END {} #endif typedef long long int ll; typedef pair<int,int> P; struct edge{int to,cost;}; #define REP(i,n) for(int i=0;i<(n);i++) #define Endl endl const int INF=100000000; int main(){ string s,t; cin>>s>>t; reverse(t.begin(),t.end()); cout<<((s==t)?"YES":"NO")<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Rotation |
User | mamime19 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 795 Byte |
Status | AC |
Exec Time | 8 ms |
Memory | 764 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 8 ms | 764 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |