Pagini recente » Cod sursa (job #1845569) | Cod sursa (job #1645725) | Cod sursa (job #372736) | Cod sursa (job #210356) | Cod sursa (job #726720)
Cod sursa(job #726720)
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("plantatie.in");
ofstream out("plantatie.out");
const int N = 502;
int n,m,x[N][N],aib[N][N];
inline void update(int I, int J, int val) {
for(;i<=n;i+=i&(-i))
for(;j<=n;j+=j&(-j))
aib[i][j]+=val;
}
inline int q(int i, int j) {
int rez = 0;
for(;i!=0;i-=i&(-i))
for(;j!=0;j-=j&(-j))
}
int main() {
int i,j;
in >> n >> m;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j) {
in >> x[i][j];
update(i,j,x[i][j]);
}
return 0;
}