Submission #1369958
Source Code Expand
#include<iostream> #include <string> #include <iomanip> #include <vector> #include <queue> #include <algorithm> #include <functional> #include <math.h> #include <stack> #include <cctype> using namespace std; #define int long long #define pi 2*acos(0.0) #define FOR(i,a,b) for (int i=(a);i<(b);i++) #define REP(i,n) for (int i=0;i<(n);i++) signed main() { string s; cin >> s; int min = 999; int max = 0; REP(i, s.length()){ if (s[i] == 'A'){ min = i; break; } } for (int i = s.length()-1; i >= 0; i--){ if (s[i] == 'Z'){ max = i; break; } } cout << max - min + 1 << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - A to Z String |
User | jijimasu |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 631 Byte |
Status | AC |
Exec Time | 8 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt |
All | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
00_example_03.txt | AC | 1 ms | 256 KB |
01.txt | AC | 7 ms | 640 KB |
02.txt | AC | 6 ms | 640 KB |
03.txt | AC | 4 ms | 512 KB |
04.txt | AC | 4 ms | 512 KB |
05.txt | AC | 8 ms | 640 KB |
06.txt | AC | 8 ms | 640 KB |
07.txt | AC | 8 ms | 640 KB |
08.txt | AC | 8 ms | 640 KB |
09.txt | AC | 8 ms | 640 KB |