Cod sursa(job #1810994)
| Utilizator | Data | 20 noiembrie 2016 19:06:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.77 kb |
#include <fstream>
#include<iostream>
#include <cmath>
using namespace std;
int main()
{
ifstream fin("culori.in");
ofstream fout("culori.out");
long long cmp=0,x,n;
fin>>n;
if (n==1)
fout<<5<<endl;
else
{
if (n==2)
fout<<8<<endl;
else
{
if (n==3)
fout<<14<<endl;
else
{
if (n%2==0)
cmp=8;
else
cmp=14;
x=n/2;
double k=3;
int l;
l=pow(k,x-1);
cmp=cmp*round(l);
fout<<cmp<<endl;
}
}
}
fin.close();
fout.close();
}
