Cod sursa(job #3273907)
Utilizator | Data | 4 februarie 2025 13:39:51 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
int a[2][2],b[2][2],ans[2][2];
const int mod=666013;
void init(){
ans=[0][0]=1;
ans[0][1]=1;
ans[1][1]=1;
a[0][0]=1;
a[0][1]=2;
}
int multi(int a[2][2],int b[2][2]){
int c[2][2]={};
for(int i=0;i<2;i++){
for(int j=0;j<2;j++){
for(int k=0;k<2;k++){
c[i][j]=(c[i][j]+(1LL*c[i][k]*c[k][j])%mod)%mod;
}
}
}
}
int main()
{
cout << "Hello world!" << endl;
return 0;
}