Submission #1177926
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; int n; cin >> s >> n; D(s[n - 1]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 添字 |
User | KokiYmgch |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1420 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |