Cod sursa(job #2251108)
Utilizator | Data | 1 octombrie 2018 09:50:14 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.73 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,sol=0,v[3]={0};
int Cont(int k)
{
if(k==1) return 1;
for(int i=2;i<=n;i++)
if(v[1]%i==0 && v[2]%i==0) return 0;
return 1;
}
void Back()
{
int k=1;
while(k>0)
{
if(k>2)
{
sol++;
k--;
}
else
if(v[k]<n)
{
v[k]++;
if(Cont(k))
k++;
}
else
{
v[k]=0;
k--;
}
}
}
int main()
{
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin>>n;
Back();
fout<<sol;
return 0;
}