-
Notifications
You must be signed in to change notification settings - Fork 0
/
CPP0212.cpp
102 lines (87 loc) · 1.95 KB
/
CPP0212.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
#define chk cout << "<< * checked * >>" << endl;
#define db cout << '<' << "i" << '=' << i << '>' << endl
using namespace std;
vector<long long> s(1000000, 0);
void sieve (long long n) {
s[0] = 1, s[1] = 1;
for (long long i=2; i<=n; i++){
if(s[i] == 0){
for (long long j=i+i; j<=n; j+=i) {
s[j] = 1;
}
}
}
}
long long checkNT(long long n){
if(n <= 1) return 0;
if(n <= 3) return 1;
if(n % 2 == 0 || n % 3 == 0) return 0;
for(long long i=2; i<=sqrt(n); i++){
if(n % i == 0) return 0;
}
return 1;
}
long long calSum(long long n){
long long m = n, sum = 0;
while (m != 0) {
sum += m%10;
m /= 10;
}
return sum;
}
long long BCNN(long long a, long long b){
return a*b / __gcd(a, b);
}
long long cal(long long x, long long a){
long long ans = x;
long long tmp = 0;
for(int i=0; i<=20; i++){
if(pow(10, i) > x){
tmp = i;
break;
}
}
a--;
while(a--){
ans = ans*pow(10, tmp)+x;
}
// cout << ans << endl;
return ans;
}
long long gcd(long long x,long long y){
if (y==0) return x;
return gcd(y,x%y);
}
#define modulo 1000000007
int main () {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long modul = 1e9 + 7;
long long t;
cin >> t;
while(t --){
long long n, x;
cin >> n >> x;
long long a[2000];
for(int i = 0; i < n; ++i) {
cin >> a[i];
}
long long ans = 0;
for(int i = 0; i < n; ++i) {
long long tmp = 1;
for (int j = n - i - 1; j > 0; --j) {
tmp = (tmp * x) % modulo;
}
ans += a[i] * tmp;
if (ans > modulo) {
ans %= modulo;
}
}
cout << ans << endl;
}
return 0;
}