Submission #1178125
Source Code Expand
#include <cstdio> #include <cstring> #include <ctime> #include <cstdlib> #include <cmath> #include <iostream> #include <string> #include <queue> #include <map> #include <stack> #include <vector> #include <algorithm> #include <set> #include <deque> #include <utility> #include <chrono> #include <sstream> #include <iomanip> #define INF 1 << 30 #define MOD 1000000007; #define pi 3.14159265358979 #define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++) #define rer(i, l, r) for (int (i) = (int)(l); (i) <= (int)(r); (i)++) #define reu(i, l, r) for (int (i) = (int)(l); (i) < (int)(r); (i)++) #define D(x) cout << x << endl #define d(x) cout << x #define all(x) (x).begin(), (x).end() #define pub(x) push_back(x) #define pob() pop_back() #define puf(x) push_front(x) #define pof() pop_front() #define mp(x, y) make_pair((x), (y)) using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<double> vd; typedef vector<long long> vll; typedef vector<string> vs; typedef pair<int, int> pii; typedef pair<long, long> pll; template<typename T, typename U> inline void amin(T &x, U y) { if (y < x) x = y; } template<typename T, typename U> inline void amax(T &x, U y) { if (x < y) x = y; } static const int dx[] = {0, 0, 1, -1}; static const int dy[] = {-1, 1, 0, 0}; int main() { string s; cin >> s; int b, e; bool flag = true; for (int i = 0; i < s.size(); i++) { if (s[i] == 'A' && flag) { flag = false; b = i; } if (s[i] == 'Z') { e = i; } } D(e - b + 1); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - A to Z String |
User | KokiYmgch |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1604 Byte |
Status | AC |
Exec Time | 9 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 | 9 ms | 640 KB |
09.txt | AC | 9 ms | 640 KB |