이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define FT(i,a,b) for(int i=a; i<=b; ++i)
#define FB(i,a,b) for(int i=a; i>=b; --i)
#define ll long long
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define IO(NAME) \
cin.tie(nullptr)->sync_with_stdio(false); \
if(fopen(NAME ".inp","r")) freopen(NAME ".inp","r",stdin), \
freopen(NAME ".out","w",stdout);
using namespace std;
const long long MOD = 1e9+7;
const int INF = 1e9+1;
const int maxN = 1e5+1;
int toNum(string s){
int l=s.length(),res=0;
if(l==1) return s[0]-'A'+1;
else return (s[0]-'A'+1)*26 + s[l-1]-'A'+1;
return res;
}
void sol() {
string start,stop;
cin>>start>>stop;
cout<<toNum(stop) - toNum(start)+1;
}
int main() {
sol();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |