# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
485561 |
2021-11-08T09:19:56 Z |
groupATSU |
Bajka (COCI20_bajka) |
C++14 |
|
0 ms |
204 KB |
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
#include <set>
#include <cstring>
#include <queue>
#include <map>
#include <cmath>
#define aldgebu return
#define ff first
#define sc second
#define pb push_back
#define pii pair <int,int>
#define p push
#define ll long long
#define pll pair<ll, ll>
using namespace std;
const ll inf = 1e9;
const ll mod = 1e9 + 7;
const ll m = 1e9 + 9;
void Dontfuckedup(){
int N, M;
string s, s1;
cin >> N >> M >> s >> s1;
cout << 5;
}
int32_t main () {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T = 1; //cin >> T;
while (T--)Dontfuckedup();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |