Codeforces Round #384 (Div. 2), problem: (A) Vladik and flights Solution in C/C++

By |2017-04-07T22:11:47+00:00December 17th, 2016|Categories: C/C++, Programming|Tags: , , , , , , , |

#include<stdio.h> int main() { int i,j,n,a,b; char s[100003]; scanf("%d%d%d",&n,&a,&b); scanf("%s",s); if(s[a-1]==s[b-1]) { printf("0"); } else printf("1"); return 0; }