Cod sursa(job #904967)
| Utilizator | Data | 5 martie 2013 09:47:23 | |
|---|---|---|---|
| Problema | Arbori indexati binar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <string>
#define maxN 10005
using namespace std;
int n, m, a[maxN], b[maxN];
int main()
{
ifstream f ("aib.in");
ofstream g ("aib.out");
f >> n >> m;
for(int i = 1; i <= n; i ++)
{
f >> a[i];
for(int j = i - (i ^ (i & (i - 1))) + 1; j <= i; j ++)
b[i] += a[i];
}
int x;
for(int i = 0; i < m; i ++)
{
f >> x
switch(x)
{
case 1:
break;
case 2:
break;
}
}
}