Submission #1306315
Source Code Expand
#include<iostream> #include<map> #include<set> #include<string> #include<algorithm> #include<cmath> #include<vector> using namespace std; typedef long long ll; typedef unsigned long long ull; const int inf = 999999999; const double pi = acos(-1); #define rep(i,m,n) for(int i = (m); i < (int)(n); i++) #define mod(i) ((i)%(ll)(1e9 + 7)) #define divm(a,b) (mod(a * modpow((ll)b,(ll)(1e9+5)))) #define rsort(a,b,c) sort(a, b, greater<c>()) ll modpow(ll i,ll j){ ll tmp=1; while(j){ if(j%2)tmp=mod(tmp*i);i=mod(i*i);j/=2;}return tmp;} /////////////////////////////////////////////////////////////////////////// int main(){ char c; cin >> c; cout << int(c-'A')+1 <<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - A |
User | hirata0517masato |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 727 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
all | A.txt, B.txt, C.txt, D.txt, E.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
A.txt | AC | 1 ms | 256 KB |
B.txt | AC | 1 ms | 256 KB |
C.txt | AC | 1 ms | 256 KB |
D.txt | AC | 1 ms | 256 KB |
E.txt | AC | 1 ms | 256 KB |