Cod sursa(job #1326326)
| Utilizator | Data | 25 ianuarie 2015 10:32:22 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream f("36.txt");
ofstream g("36.out");
double v[1000];
int main()
{
int n,i,j,s=0,k,t=1,q;
f>>n;
for(i=1;i<=n;i++)
{f>>v[i];s+=v[i];}
for(i=1;i<=n;i++)
{
if(i%2==0)
{ q=s;
for(j=n;j>=i;j--)
{
v[j+1]=v[j];
}
n++;
k=n-2-t;t++;
s=s-v[i-1]-v[i+1];
v[i]=(double)s/(double)k;
s=q;
}
}
for(i=1;i<=n;i++)
{
g<<v[i]<<" ";
}
return 0;
}
