Pagini recente » Arhiva de probleme | Cod sursa (job #3283340) | Cod sursa (job #2982445) | Cod sursa (job #2141179) | Cod sursa (job #1528591)
/***************************************************
* Alex Palcuie
* Romania - 2015
* alex [dot] palcuie [at] gmail [dot] com
* http://blog.palcu.ro/
****************************************************/
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// Defines
#define NAME(n) #n
#define prv(v,n) dbv((v), (#v), (n))
#define prw(v) dbw((v), (#v))
#define F first
#define S second
#define pb push_back
#define sz size()
#define mp make_pair
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
// Constants
typedef vector<vector<unsigned long long>> Matrix;
const int N = 1<<10;
const int INF = 0x3f3f3f3f;
const int MOD = 666013;
void debug_matrix(Matrix m) {
for (int i=0; i<m.size(); i++) {
for (int j=0; j<m[i].size(); j++)
cerr << m[i][j] << " ";
cerr << "\n";
}
cerr << "\n";
}
// Functions
Matrix get_fib_matrix() {
Matrix ret = {{1,1}, {1,0}};
return ret;
}
Matrix multiply(Matrix a, Matrix b) {
Matrix ret = {{0,0}, {0,0}};
for (int i=0; i<2; i++)
for (int j=0; j<2; j++) {
ret[i][j] = 0;
for (int k=0; k<2; k++)
ret[i][j] = (ret[i][j] + a[i][k] * b[k][j]) % MOD;
}
return ret;
}
Matrix power(Matrix m, int x) {
if (x == 0 || x == 1)
return m;
Matrix temp = power(m, x/2);
if (x%2 == 0) {
return multiply(temp, temp);
} else {
return multiply(multiply(get_fib_matrix(), temp), temp);
}
}
int fib(int x) {
if (x == 0)
return 0;
Matrix ret = power(get_fib_matrix(), x-1);
return ret[0][0];
}
int main(){
ifstream fin("kfib.in");
ofstream fout("kfib.out");
int x; fin >> x;
fout << fib(x) << "\n";
return 0;
}