| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 19247 |
2016-02-22T15:08:45 Z |
gs14004 |
Uniting (kriii2_U) |
C++14 |
|
11 ms |
2112 KB |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <assert.h>
#include <iostream>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
const int mod = 1e9 + 7;
int n, a[100005];
int main(){
scanf("%d",&n);
lint s = 0, sc = 0, fc = 1;
for(int i=0; i<n; i++){
scanf("%d",&a[i]);
s += a[i];
sc += a[i] * a[i];
}
for(int i=2; i<=n; i++){
fc *= (1ll * i * (i-1)) % mod;
fc %= mod;
}
s = (s * s - sc) / 2;
printf("%lld\n%lld",s,fc);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 11 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 12 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2112 KB |
Output is correct |
| 14 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 15 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 16 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 17 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 18 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 19 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 20 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 21 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 22 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 23 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 24 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 25 |
Correct |
4 ms |
2112 KB |
Output is correct |
| 26 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 27 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 28 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 29 |
Correct |
2 ms |
2112 KB |
Output is correct |
| 30 |
Correct |
1 ms |
2112 KB |
Output is correct |
| 31 |
Correct |
3 ms |
2112 KB |
Output is correct |
| 32 |
Correct |
3 ms |
2112 KB |
Output is correct |
| 33 |
Correct |
6 ms |
2112 KB |
Output is correct |
| 34 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 35 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 36 |
Correct |
7 ms |
2112 KB |
Output is correct |
| 37 |
Correct |
5 ms |
2112 KB |
Output is correct |
| 38 |
Correct |
6 ms |
2112 KB |
Output is correct |
| 39 |
Correct |
5 ms |
2112 KB |
Output is correct |
| 40 |
Correct |
7 ms |
2112 KB |
Output is correct |
| 41 |
Correct |
4 ms |
2112 KB |
Output is correct |
| 42 |
Correct |
9 ms |
2112 KB |
Output is correct |
| 43 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 44 |
Correct |
8 ms |
2112 KB |
Output is correct |
| 45 |
Correct |
7 ms |
2112 KB |
Output is correct |
| 46 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 47 |
Correct |
11 ms |
2112 KB |
Output is correct |
| 48 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 49 |
Correct |
0 ms |
2112 KB |
Output is correct |
| 50 |
Correct |
0 ms |
2112 KB |
Output is correct |
