資訊專(zhuān)欄INFORMATION COLUMN
Problem
Given a square matrix of size N x N, calculate the absolute difference between the sums of its diagonals.
Input Format
The first line contains a single integer, N. The next N lines denote the matrix"s rows, with each line containing N space-separated integers describing the columns.
Output Format
Print the absolute difference between the two sums of the matrix"s diagonals as a single integer.
Sample Input
3 11 2 4 4 5 6 10 8 -12
Sample Output
15
Explanation
The primary diagonal is:
11
5
-12
Sum across the primary diagonal: 11 + 5 - 12 = 4
The secondary diagonal is:
4
5
10
Sum across the secondary diagonal: 4 + 5 + 10 = 19
Difference: |4 - 19| = 15
Solution
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int pSum = 0, sSum = 0;
int a[][] = new int[n][n];
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
a[i][j] = in.nextInt();
}
}
for(int i=0; i
文章版權(quán)歸作者所有，未經(jīng)允許請(qǐng)勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。
轉(zhuǎn)載請(qǐng)注明本文地址：http://m.hztianpu.com/yun/66019.html
摘要：數(shù)組中重復(fù)元素的個(gè)數(shù)題目找到一個(gè)數(shù)組中重復(fù)元素的個(gè)數(shù)。能否成為題目互減，直到的時(shí)候。此方法精彩此方法更精彩找兩邊相等的 Anagram 拆分?jǐn)?shù)組 看一半操作幾次能成為另一半的anagram 題目 輸入第一行是要判斷的字符串的個(gè)數(shù)n，之后的n行輸入為需要判斷的字符串。每個(gè)字符串str，是兩個(gè)等長(zhǎng)字符串的合體，所以長(zhǎng)度一定是偶數(shù)。若為奇數(shù)，返回-1。所以str分成兩個(gè)substring，右...
Simple Array Sum Problem Given an array of N integers, can you find the sum of its elements? Input Format The first line contains an integer, N, denoting the size of the array. The second line contain...
Problem Given an array of integers, calculate which fraction of its elements are positive, which fraction of its elements are negative, and which fraction of its elements are zeroes, respectively. Pri...
Problem Your teacher has given you the task of drawing a staircase structure. Being an expert programmer, you decided to make a program to draw it for you instead. Given the required height, can you p...
Problem Given a time in AM/PM format, convert it to military (24-hour) time. Input Format A single string containing a time in 12-hour clock format. Output Format Convert and print the given time in 2...
閱讀 3056·2021-11-16 11:51
閱讀 2664·2021-09-22 15:02
閱讀 3823·2021-08-04 10:21
閱讀 3711·2019-08-30 15:43
閱讀 2015·2019-08-30 11:04
閱讀 3657·2019-08-29 17:14
閱讀 556·2019-08-29 12:16
閱讀 2989·2019-08-28 18:31
