akshitagit / akshitagit/Python

MATRIX SEARCH

Abierto
#89 8 comentarios 0 reacciones 1 asignado Reclamado por @sagarr70 Ver en GitHub
algorithms datastructures DSA good first issue hacktoberfest hacktoberfest2020 hactoberfest
Lenguaje dominante
Python
Estrellas
124
Forks
109
Métricas de merge de PR
Sin PR fusionados en 30 d

Descripción

STAR THIS REPO!

Given an n x m matrix, where every row and column is sorted in increasing order, and a number x . Find if element x is present in the matrix or not.

Input Format

First line consists of two space separated integers N and M, denoting the number of element in a row and column respectively. Second line of each test case consists of N*M space separated integers denoting the elements in the matrix in row major order. Third line of each test case contains a single integer x, the element to be searched.
Constraints

1 <= N,M <= 30 0 <= A[i] <= 100000

Output Format

Print 1 if the element is present in the matrix, else 0.

Sample Input

3 3
3 30 38
44 52 54
57 60 69

62

Sample Output

0

Guía de contribución

Abrir la guía de contribución

Evaluación

Este issue todavía no se ha evaluado.

Recibe los nuevos issues en tu correo

Un resumen breve de issues de GitHub para principiantes.