Pagini recente » Cod sursa (job #2274429) | fmi-no-stress-2012/solutii/berarii2 | Cod sursa (job #2534945) | Cod sursa (job #1576033) | Cod sursa (job #753973)
Cod sursa(job #753973)
#include<fstream>
using namespace std;
ifstream fin("file.in");
ofstream fout("file.out");
long long int v[1000000], n,i,j,f;
void citire()
{ int c=1;
fin>>n;
for(i=0;i<n;i++)
{
v[i]=c;
c++;
}
}
void ir_()
{ for(i=0;i<n;i++)
{ for(j=0;j<n;j++)
{
if(v[i]>1&&v[j]>1)
{
if(v[i]==v[j]+1||v[j]==v[i]+1)
{
f++;
}
}
if(v[i]==1||v[j]==1)
{
f++;
}
}
}
}
int main()
{ citire();
ir_();
fout<<f;
return 0;
}