Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <iomanip>
- #include <vector>
- #include <string>
- #include <cstring>
- #include <cmath>
- #include <algorithm>
- #include <set>
- #include <queue>
- #include <map>
- using namespace std;
- const long long inf = 2000000007;
- vector<vector<long long> > vec;
- vector<vector<long long> > matr, a;
- long long mod;
- vector<vector<long long> > operator*(const vector<vector<long long> > &x, const vector< vector<long long> > &y)
- {
- vector<vector<long long> > rez;
- long long n = x.size();
- long long m = y[0].size();
- long long l = y.size();
- rez.resize(n);
- for (long long i = 0; i < n; i++)
- rez[i].resize(m);
- for (long long i = 0; i < n; i++)
- for (long long j = 0; j < m; j++)
- {
- for (long long k = 0; k < l; k++)
- rez[i][j] += (x[i][k] * y[k][j]) % mod;
- rez[i][j] %= mod;
- }
- return rez;
- }
- vector<vector<long long> > mypow(const vector<vector<long long> > &x, long long k)
- {
- if (k == 0)
- {
- vector<vector<long long> > s;
- s.resize(a.size());
- for (long long i = 0; i < a.size(); i++)
- {
- s[i].resize(a[i].size());
- s[i][i] = 1;
- }
- return s;
- }
- if (k == 1)
- return x;
- if (k % 2 == 0)
- return mypow(x * x, k / 2);
- else
- return mypow(x, k - 1) * x;
- }
- int main()
- {
- ios_base::sync_with_stdio(0);
- cin.tie(0);
- cout.tie(0);
- //freopen("important.in", "r", stdin);freopen("important.out", "w", stdout);
- long long n = 5;
- vec.resize(n);
- matr.resize(n);
- long long x;
- for (long long i = 0; i < n; i++)
- {
- cin >> x;
- vec[i].push_back(x);
- matr[i].resize(n);
- }
- for (long long i = 0; i < n - 1; i++)
- matr[i][i + 1] = 1;
- for (long long i = 0; i < n; i++)
- {
- cin >> x;
- matr[n - 1][i] = x;
- }
- long long m;
- cin >> m >> mod;
- for (long long i = 0; i < m; i++)
- {
- cin >> x;
- if (x < 6)
- {
- cout << vec[x - 1][0] << " ";
- continue;
- }
- a = mypow(matr, x - 1) * vec;
- cout << a[0][0] % mod << " ";
- }
- // system("PAUSE");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement