Submission #1137979

#TimeUsernameProblemLanguageResultExecution timeMemory
1137979adhityamvBliskost (COI23_bliskost)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h>
using namespace std;
void solve(){
    int n,q;
    cin >> n >> q;
    assert(q==0);
    string ss,tt;
    cin >> ss >> tt;
    int s[n];
    int t[n];
    for(int i=0;i<n;i++) s[i]=(ss[i]-'a');
    for(int i=0;i<n;i++) t[i]=(tt[i]-'a');
    int es=0;
    int os=0;
    int et=0;
    int ot=0;
    for(int i=0;i<n;i++){
        if(i%2==0){
            es+=(s[i]);
            et+=(t[i]);
        }
        if(i%2!=0){
            os+=(s[i]);
            ot+=(t[i]);
        }
    }
    if((et-es)%26==(ot-os)%26){
        cout << "da";
    } else{
        cout << "ne";
    }
}
signed main(){
    solve();
}
#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...