Pagini recente » Cod sursa (job #2201762) | Cod sursa (job #2470138) | Cod sursa (job #458549) | Cod sursa (job #2577814) | Cod sursa (job #632353)
Cod sursa(job #632353)
#include<iostream>
#include<fstream>
using namespace std;
int main()
{int n,max=0,v[10],i,j,k,M;
ifstream f1("medie.in");
ofstream f2("medie.out");
f1>>n;
f2<<endl;
for(i=0;i<n;i++)
{f1>>v[i];
f2<<endl;}
for(i=0;i<n;i++)
{for(j=0;j<n;j++)
for(k=0;k<n;k++)
{M=0;
if((v[j]<v[k])&&(v[i]!=v[k])&&(v[i]!=v[j]))
M=(v[j]+v[k])/2;
if(m==v[i])
max++;}}
f2<<max;
f1.close();
f2.close();
return 0;}