# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1041549 | vjudge1 | Ljetopica (COI19_ljetopica) | C++17 | 1 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
void solve(){
ll n ,k , c1 = 0, c2 = 0;
cin >> n >> k;
string a , b , s;
cin >> s >> a >> b;
for(int i = 0 ;i < a.length(); i ++){
c1 = ((c1 * 2) + (a[i] - '0')) % MOD;
c2 = ((c2 * 2) + (b[i] - '0')) % MOD;
}
if(c1 == c2){
c1 = 0 ;
}
if(k == 0){
cout << (c1 + c2) % MOD << '\n';
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int tests = 1;
// cin >> tests;
for (int i = 1; i <= tests; i++){
solve();
}
return 0;
}
Compilation message (stderr)
# | 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... |