Cod sursa(job #2508490)

Utilizator bigmixerVictor Purice bigmixer Data 12 decembrie 2019 12:43:12
Problema Subsecventa de suma maxima Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.34 kb
#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;

const int mod=1e9+7;
const int modx=998244353;
const int per=666013;

struct mat{
    int rows,cols;
    int arr[4][4];
    mat operator*(mat &cappa){
        mat sah;
        sah.cols = cappa.cols;
        sah.rows = rows;
        for(int i = 1 ; i <= rows ; i++)
        for(int j = 1 ; j <= cappa.cols; j++)sah.arr[i][j] = 0;
        for(int i = 1 ; i <= rows ; i++){
            for(int j = 1 ; j <= cappa.cols; j++){
                for(int k = 1 ; k <= cols ; k++){
                    sah.arr[i][j] += arr[i][k]*cappa.arr[k][j];
                    sah.arr[i][j]%=per;
                }
            }
        }
        return sah;
    }
};

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());

}