# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1137980 | adhityamv | Bliskost (COI23_bliskost) | C++20 | 35 ms | 10300 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+os)%26==(ot+es)%26){
cout << "da";
} else{
cout << "ne";
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |