743A - Vladik and flights - CodeForces Solution


constructive algorithms greedy implementation *1200

Please click on ads to support us..

Python Code:

n,a,b = list(map(int, input().split()))
s = input()
a-=1
b-=1
        
print((ord(s[a])-58) ^ (ord(s[b])-58))

C++ Code:

#include <bits/stdc++.h>
#define ll long long
#define ui int 
#define ff first
#define ss second
#define pb push_back
#define mp  make_pair
#define pii pair<int,int>
#define vi  vector<int>
#define mii map<int,int>
#define w(x) int x; cin>>x; while(x--)
using namespace std;
int main(){
    int n,a,b;
    cin >> n >> a >> b;
    vector<char> i(n);
    for(int j = 0; j < n;j++){
      cin >> i[j];
    };
    char x = i[a - 1];
    if(i[a -1] != i[b-1]){
      cout << 1;
    }else{
      cout << 0;
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

281A - Word Capitalization
1646A - Square Counting
266A - Stones on the Table
61A - Ultra-Fast Mathematician
148A - Insomnia cure
1650A - Deletions of Two Adjacent Letters
1512A - Spy Detected
282A - Bit++
69A - Young Physicist
1651A - Playoff
734A - Anton and Danik
1300B - Assigning to Classes
1647A - Madoka and Math Dad
710A - King Moves
1131A - Sea Battle
118A - String Task
236A - Boy or Girl
271A - Beautiful Year
520B - Two Buttons
231A - Team
479C - Exams
1030A - In Search of an Easy Problem
158A - Next Round
71A - Way Too Long Words
160A - Twins
1A - Theatre Square
1614B - Divan and a New Project
791A - Bear and Big Brother
1452A - Robot Program
344A - Magnets