█████████ ████ ███░░░░░███ ░░███ ███ ░░░ ██████ ███████ ██████ ██████ ░███ ███░░███ ███░░███ ███░░███ ███░░███ ░███ ░███ ░███░███ ░███ ░███████ ░███ ░███ ░░███ ███░███ ░███░███ ░███ ░███░░░ ░███ ░███ ░░█████████ ░░██████ ░░████████░░██████ ░░██████ ░░░░░░░░░ ░░░░░░ ░░░░░░░░ ░░░░░░ ░░░░░░

Envío 1140

Problema 0xe1 - Cuadrado mágico

  • Autor: aebernalmunoz
  • Fecha: 2020-10-11 02:22:08 UTC (Hace alrededor de 4 años)
Caso # Resultado Tiempo Memoria
#1
Error de compilación
                      Compilation time limit exceeded.
                    
#2
Error de compilación
                      Compilation time limit exceeded.
                    
#3
Error de compilación
                      Compilation time limit exceeded.
                    
#4
Error de compilación
                      Compilation time limit exceeded.
                    
#5
Error de compilación
                      Compilation time limit exceeded.
                    
#6
Error de compilación
                      Compilation time limit exceeded.
                    
#7
Error de compilación
                      Compilation time limit exceeded.
                    
#8
Error de compilación
                      Compilation time limit exceeded.
                    
#9
Error de compilación
                      Compilation time limit exceeded.
                    
#10
Correcto
0.071 s 10 KBi
#11
Error de compilación
                      Compilation time limit exceeded.
                    
#12
Error de compilación
                      Compilation time limit exceeded.
                    
#13
Error de compilación
                      Compilation time limit exceeded.
                    
#14
Error de compilación
                      Compilation time limit exceeded.
                    
#15
Error de compilación
                      Compilation time limit exceeded.
                    
#16
Error de compilación
                      Compilation time limit exceeded.
                    
#17
Error de compilación
                      Compilation time limit exceeded.
                    
#18
Error de compilación
                      Compilation time limit exceeded.
                    
#19
Error de compilación
                      Compilation time limit exceeded.
                    
#20
Error de compilación
                      Compilation time limit exceeded.
                    
Puntos totales: 5 / 100

Código

import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;

class Main{
	static class Reader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public Reader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public Reader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public String readLine() throws IOException {
			byte[] buf = new byte[64]; // line length
			int cnt = 0, c;
			while ((c = read()) != -1) {
				if (c == '\n')
					break;
				buf[cnt++] = (byte) c;
			}
			return new String(buf, 0, cnt);
		}

		public int nextInt() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (neg)
				return -ret;
			return ret;
		}

		public long nextLong() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nextDouble() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();

			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (c == '.') {
				while ((c = read()) >= '0' && c <= '9') {
					ret += (c - '0') / (div *= 10);
				}
			}

			if (neg)
				return -ret;
			return ret;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}
	}

	public static void main(String[] args) throws NumberFormatException, IOException {
		Reader s = new Reader();
		int a[][] = new int[100][100];
		int row, col, D1 = 0, D2 = 0, base = 0;
		boolean isMagic = true;
		int n = s.nextInt();
		for (int r = 0; r < n; r++) {
			for (int c = 0; c < n; c++) {
				a[r][c] = s.nextInt();
			}
		}

		for (int i = 0; i < n; i++) {
			base += a[0][i];
			D1 += a[i][i];
			D2 += a[n - 1 - i][i];
		}
		if (base == D1 && base == D2) {

			for (int r = 0; r < n; r++) {
				row = 0;
				col = 0;
				for (int c = 0; c < n; c++) {
					row += a[r][c];
					col += a[c][r];
				}
				if (base != col || base != row) {
					isMagic = false;
					break;
				}
			}
		}
		System.out.println(isMagic ? "Yes" : "No");
	}

}