Cod sursa(job #2211562)

Utilizator FunnyStockyMihnea Andreescu FunnyStocky Data 10 iunie 2018 21:47:31
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#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;
}
/**

**/