Pagini recente » Cod sursa (job #1916924) | Cod sursa (job #2499954) | Cod sursa (job #2943238) | Cod sursa (job #836336) | Cod sursa (job #2136820)
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
#define MOD 666013
class parser{
public:
parser() {}
parser(const char *file_name){
input_file.open(file_name,ios::in | ios::binary);
input_file.sync_with_stdio(false);
index&=0;
input_file.read(buffer,SIZE);}
inline parser &operator >>(int &n){
for (;buffer[index]<'0' or buffer[index]>'9';inc());
n&=0;
//sign&=0;
//sign|=(buffer[index-1]=='-');
for (;'0'<=buffer[index] and buffer[index]<='9';inc())
n=(n<<1)+(n<<3)+buffer[index]-'0';
//n^=((n^-n)&-sign);
return *this;}
~parser(){
input_file.close();}
private:
fstream input_file;
static const int SIZE=0x40000; ///4MB
char buffer[SIZE];
int index/*,sign*/;
inline void inc(){
if(++index==SIZE)
index=0,input_file.read(buffer,SIZE);}
};
class writer{
public:
writer() {};
writer(const char *file_name){
output_file.open(file_name,ios::out | ios::binary);
output_file.sync_with_stdio(false);
index&=0;}
inline writer &operator <<(int target){
aux&=0;
sign&=0;
n=target;
if (n<0)
sign=1,
buffer[index]='-',
inc();
n^=((n^-n)&-sign);
if (!n)
nr[aux++]='0';
for (;n;n/=10)
nr[aux++]=n%10+'0';
for(;aux;inc())
buffer[index]=nr[--aux];
return *this;}
inline writer &operator <<(const char *target){
aux&=0;
while (target[aux])
buffer[index]=target[aux++],inc();
return *this;}
~writer(){
output_file.write(buffer,index);output_file.close();}
private:
fstream output_file;
static const int SIZE=0x20000; ///2MB
int index,aux,n,sign;
char buffer[SIZE],nr[24];
inline void inc(){
if(++index==SIZE)
index&=0,output_file.write(buffer,SIZE);}
};
class matrix{
private:
static const int DIM=2;
public:
int a[DIM][DIM];
matrix () {
memset(a,0,sizeof(a));
}
void unit(){
for (int i=0;i<DIM;++i)
a[i][i]=1;
}
void init(){
a[0][0]=0,a[0][1]=1,a[1][0]=1,a[1][1]=1;
}
inline matrix operator * (matrix x){
matrix z;
for (int i=0;i<DIM;++i)
for (int j=0;j<DIM;++j)
for (int k=0;k<DIM;++k)
z.a[i][j]=(z.a[i][j]+1LL*x.a[i][k]*a[k][j])%MOD;
return z;
}
};
ifstream f ("kfib.in");
ofstream t ("kfib.out");
matrix lgput(matrix x,int a){
matrix y;
y.unit();
for (;a;a>>=1){
if (a&1)
y=y*x;
x=x*x;
}
return y;
}
int main(){
int n;
f>>n;
matrix x;
x.init();
x=lgput(x,n-1);
t<<x.a[1][1];
return 0;
}