Submission #15052

#TimeUsernameProblemLanguageResultExecution timeMemory
15052hongjun7씽크스몰 (kriii3_TT)C++98
10 / 30
10000 ms16708 KiB
#include <cstdio> #define MN 1000005 int n, m; long long a[MN], b[MN]; int main() { scanf("%d%d", &n, &m); for (int i = 0; i <= n; i++) scanf("%lld", a + i); for (int i = 0; i <= m; i++) scanf("%lld", b + i); long long res = 0, x; for (int k = 0; k <= n + m; k++) { x = 0; for (int i = 0; i <= k; i++) if (i <= n && k-i <= m) x += a[i] * b[k - i]; res ^= x; } printf("%lld", res); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...