Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <string.h>
- #include <stdio.h>
- #include <stdlib.h>
- #include <vector>
- using namespace std;
- int s[111][111];
- int n;
- void input(){
- scanf("%d",&n);
- for (int i=0;i<n;i++)
- for (int j=0;j<n;j++)
- scanf("%d",&s[i][j]);
- }
- void solve(){
- int sum0 = 0;
- int sum1 = 0;
- int min0 = 0;
- int min1 = 0;
- for (int i=0;i<n;i++){ // i == hang
- for (int j=0;j<n;j++){ // j == cot
- // duong cheo chinh
- if ( i == j ){
- sum0 += s[i][j];
- if ( i == 0 )
- min0 = s[i][j];
- else
- min0 = min(min0,s[i][j]);
- }
- // duong cheo phu
- if ( i + j == n-1 ){
- sum1 += s[i][j];
- if ( i == 0 )
- min1 = s[i][j];
- else
- min1 = min(min1,s[i][j]);
- }
- }
- }
- printf("%d %d %d %d\n",sum0,min0,sum1,min1);
- }
- int main(){
- freopen("input.txt","r",stdin);
- int ntest;
- scanf("%d",&ntest);
- for (int itest=0;itest<ntest;itest++){
- input();
- solve();
- printf("\n");
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement