Cod sursa(job #3251622)
Utilizator | Data | 26 octombrie 2024 12:11:33 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
using namespace std;
int a[3][3],b[3][3],c[3][3];
void inm()
{
c[1][1]=a[1][2]*b[2][1]%666013;
c[1][2]=a[1][1]*b[1][2]%666013+a[1][2]*b[2][2]%666013;
for(int i=1;i<=1;i++)
{
for(int j=1;j<=2;j++)
{
a[i][j]=c[i][j];
}
}
}
int main()
{
int n;
a[1][1]=1;
a[1][2]=1;
b[1][2]=1;
b[2][2]=1;
b[2][1]=1;
cin>>n;
for(int i=1;i<n-1;i++)
{
inm();
}
cout<<a[1][2]%666013;
return 0;
}