Vladik and flights (743A)

-
  1. 743A - Vladik and flights
  3. #include<iostream>
  4. using namespace std;
  5. int main()
  6.  
  7. {
  8. int n,a,b;
  9. string s;
  10. cin>>n>>a>>b;
  11. cin>>s;
  12. if(s[a-1]==s[b-1]) cout<<0;
  13. else cout<<1;
  14.  
  15.  
  16.  
  17. }

Comments

Post a Comment

Popular posts from this blog

Codeforce Problem 1703A. YES or YES?

-
A. YES or YES?   There is a string  s �  of length  3 3 , consisting of uppercase and lowercase English letters. Check if it is equal to " YES " (without quotes), where each letter can be in any case. For example, " yES ", " Yes ", " yes " are all allowable. Input The first line of the input contains an integer  t �  ( 1 ≤ t ≤ 10 3 1 ≤ � ≤ 10 3 ) — the number of testcases. The description of each test consists of one line containing one string  s �  consisting of three characters. Each character of  s �  is either an uppercase or lowercase English letter. Output For each test case, output " YES " (without quotes) if  s �  satisfies the condition, and " NO " (without quotes) otherwise. You can output " YES " and " NO " in any case (for example, strings " yES ", " yes " and " Yes " will be recognized as a positive response). Example input Copy 10 YES yES yes Yes YeS Noo orZ yEz Y...
Read more

Aptitude test assistant programmer 2018

-
 #include <stdio.h> #include <stdlib.h> int main() { char str[100]; int i; int space=0;     printf("Enter a string\n");     fgets(str,sizeof(str),stdin);     i=0;     while(i<=str[i]){  if(str[i]==' '){         space++;     }     i++; } printf("Total word count :%d" ,space+1);       return 0; }
Read more

1041A. Heist solution

-
#include <iostream> #include <algorithm> using namespace std ; int main () { long int n ; cin >> n ;   long long arr [ n ]; for ( int j = 0 ; j < n ; j ++){ cin >> arr [ j ];}   sort ( arr , arr + n );   int b = arr [ 0 ];   int l = arr [ n - 1 ];   int x = 0 ;   for ( int i = b ; i <= l ; i ++) {   x ++; }   cout << x - n ;   return 0 ; }
Read more