Submission #1184513

#TimeUsernameProblemLanguageResultExecution timeMemory
1184513vitosevskiBliskost (COI23_bliskost)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h> using namespace std; using ll=long long; #define F first #define S second #define sz(x) int(x.size()) string odg[2]={"ne", "da"}; int n, q; string s, t, so; int f() { int x=0; for(int i=0; i<n; i++) { int d=t[i]-s[i]+26; d%=26; x+=d; } return x%2==0; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> q; cin >> s >> t; so=s; if(q==0) { if(n==1) { cout << (s==t ? "da" : "ne") << '\n'; return 0; } cout << odg[f()] << '\n'; return 0; } // while(q--) { // int p; // char c; // cin >> p >> c; // so[p-1]=c; // s=so; // // cout << s << ' ' << t << '\n'; // cout << odg[f()] << '\n'; // } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...