Pagini recente » Cod sursa (job #2168921) | Cod sursa (job #1634395) | Cod sursa (job #850483) | Cod sursa (job #1748902) | Cod sursa (job #518478)
Cod sursa(job #518478)
#include <fstream>
#include <vector>
using namespace std;
int main()
{
ifstream indata;
indata.open ("fractii.in");
ofstream outdata;
outdata.open ("fractii.out");
int n,i=1,p,q;
vector <char> fractii (3);
fractii[1,2]=1;
for (int z=1;z<=n;z++)
{
i*=2;
for (int j=2*i-1;j<=(2*i-1)*2;j+=2)
{
p=fractii[j]-'0';
q=fractii[j+1]='0';
if (p<=n && p+q<=n)
{
fractii.push_back(p);
fractii.push_back(p+q);
fractii.push_back(p+q);
fractii.push_back(p);
}
}
}
outdata<<strlen(fractii);
return 0;
}