Submission #1781576

---

Source Code Expand

#include<array>
#include<cmath>
#include<iostream>
#include<iomanip>
#include<iso646.h>
#include<queue>
#include<stack>
#include<string>
#include<vector>

#define FOR(counter,initial_value,condition) for(int counter = initial_value; counter < condition;counter++)

void insertionSort(int A[], int N) {
	FOR(i, 1, N) {
		int v = A[i];
		int j = i - 1;
		while (j >= 0 and A[j] > v) {
			A[j + 1] = A[j];
			j--;
		}
		A[j+1] = v;
	}
}


int
main()
{	
	std::string s;
	int i;
	std::cin >> s >> i;
	std::cout << s[i-1] << std::endl;
}

Submission Info

Judge Result