Submission #9342

#TimeUsernameProblemLanguageResultExecution timeMemory
9342lemonsqueezeUniting (kriii2_U)C++98
1 / 4
12 ms1868 KiB
#include <cstdio> const int N = 100000; typedef long long int64; const int64 MOD = 1000000007; int n; int64 s[N]; int main(void) { scanf("%d", &n); int64 sum = 0; for (int i = 0; i < n; i++) { scanf("%lld", &s[i]); sum += s[i]; } int64 ans = 0, kase = 1; for (int i = 0; i < n; i++) { sum -= s[i]; ans += sum * s[i]; } printf("%lld\n", ans); for (int i = 1; i <= n; i++) { kase = (kase * (int64)i) % MOD; } printf("%lld\n", kase); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...