Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- using namespace std;
- int main()
- {
- int n,m,k;
- ifstream f("pavaj.in");
- f>>n>>m>>k;
- int a,S[n+1][m+1];
- for(int i=0;i<=n;++i)
- S[i][0]=0;
- for(int j=0;j<=m;++j)
- S[0][j]=0;
- for(int i=1;i<=n;++i)
- for(int j=1;j<=m;++j)
- f>>a,S[i][j]=S[i-1][j]+S[i][j-1]-S[i-1][j-1]+a;
- int L1,C1,L2,C2;
- ofstream g("pavaj.out");
- while(k--)
- {
- f>>L1>>C1>>L2>>C2;
- if(L1>L2)
- swap(L1,L2);
- if(C1>C2)
- swap(C1,C2);
- int SUMA=S[L2][C2]-S[L1-1][C2]-S[L2][C1-1]+S[L1-1][C1-1];
- if(SUMA==0)
- g<<0<<'\n';
- else
- if(SUMA==(L2-L1+1)*(C2-C1+1))
- g<<1<<'\n';
- else
- g<<2<<'\n';
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment