https://i0.wp.com/eblogarithm.com/wp-content/uploads/2016/12/Codeforces-Round-384-Div-2-problem-A-Vladik-and-flights-Solution-in-CC1.png?fit=640%2C360

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;
}
(Visited 22 times, 1 visits today)



There are no comments

Add yours

Leave a Reply

%d bloggers like this: