#include<bits/stdc++.h>
using namespace std;
char str[100005];
int main()
{int n,a,b;cin>>n>>a>>b;for(int i=1;i<=n;i++){cin>>str[i];}if(str[a]!=str[b]){cout<<1<<endl;}else{cout<<0<<endl;}return 0;
}
详细解决方案
743A. Vladik and flights codeforces
热度:42 发布时间:2024-01-10 18:46:17.0
相关解决方案
- Codeforces Round #166 (Div. 二) D - Good Substrings
- Codeforces Round #165 (Div. 二)(完全)
- Codeforces Round #166 (Div. 二)
- Codeforces Round #167 (Div. 二 && Div.1)
- Codeforces Round #282 (Div. 二)-A. Digital Counter
- Codeforces Round #248 (Div. 一)——Nanami's Digital Board
- Codeforces 10C Digital Root 法令题
- Tutorial CodeForces Round 289 (Div.2) (Second Winter Computer Camp Selection 2015) 例题
- codeforces 492D Vanya and Computer Game(额。数学题?水题吧)
- Codeforces Round #199 (Div. 二) C. Cupboard and Balloons
- Codeforces Round #199 (Div. 二) C. Cupboard and Balloons
- codeforces 721B B. Passwords -- by lethalboyd
- Codeforces Round #464 (Div. 2)A. Love Triangle
- Educational Codeforces Round 63 (Rated for Div. 2) (A,B,C)
- Codeforces Round #551 (Div. 2) (A,B,C)
- (模拟)A. Vasya and Book—— Educational Codeforces Round 55 (Rated for Div. 2)
- (模拟题)B. Vova and Trophies—— Educational Codeforces Round 55 (Rated for Div. 2)
- Educational Codeforces Round 51 (Rated for Div. 2)
- CodeForces - 55D (数位dp)
- Codeforces Round #498 (Div. 3)F - Xor-Paths(dfs+中间相遇算法)
- Codeforces Round #498 (Div. 3) D - Two Strings Swaps
- Codeforces Round #493 (Div. 2) C - Convert to Ones
- Codeforces Round #496 (Div. 3) E题 Median on Segments (Permutations Edition)
- CodeForces - 617E(莫队)
- CodeForces - 835C - Star sky (dp + 周期)
- Problem - 279A - Codeforces(找规律)
- Codeforces 450B Jzzhu and Sequences(矩阵快速幂)
- CodeForces - 233B - Non-square Equation(不小心会爆int)
- CodeForces - 121A - Lucky Sum
- CodeForces - 105A