Pagini recente » Cod sursa (job #2156143) | Cod sursa (job #2187462) | Cod sursa (job #1486361) | Cod sursa (job #2243998) | Cod sursa (job #2211562)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("fibo2.in");
ofstream fout("fibo2.out");
const int MOD=46337;
vector<int>f;
int n;
int q(int ind)
{
while(ind>f.size()-1)
{
int nou=f[f.size()-1]+f[f.size()-2];
f.push_back(nou%MOD);
}
return f[ind];
}
int main()
{
f.push_back(0);
f.push_back(1);
fin>>n;
fout<<n%2<<"\n";
if(n%2==1)
{
int med=n/2;
fout<<med<<" "<<med+1<<"\n";
fout<<q(med)<<"\n"<<q(med+1)<<"\n";
fout<<q(n)<<"\n";
}
else
{
int med=n/2;
fout<<med-1<<" "<<med+1<<"\n";
fout<<q(med-1)<<"\n"<<q(med+1)<<"\n";
fout<<q(n)<<"\n";
}
return 0;
}
/**
**/