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

#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;
}

#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;
}