Cod sursa(job #367735)
Utilizator | Data | 23 noiembrie 2009 12:42:21 | |
---|---|---|---|
Problema | Arbori indexati binar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream.h>
int a[100],c[100],n,m,i,t,k,j;
void creare()
{
int i=1;
while(i<=n)
{
while((i&(1<<k))==0)k++;
t=i-(1<<k)+1;
for(j=t;j<=i;j++)
c[i]+=a[j];
}
}
int main()
{
int i;
ifstream f("aib.in");
ofstream g("aib.out");
f>>n>>m;
for(i=1;i<=n;i++)f>>a[i];
creare();
for(i=1;i<=n;i++)cout<<c[i];
return 0;
}