Create XOR MATRIX
Open
algorithms
bitmasking
C
CPP
good first issue
hacktoberfest
Hacktoberfest2020
- Dominant language
- C++
- Stars
- 504
- Forks
- 436
- PR merge metrics
- No merged PRs in 30d
Description
You are given a matrix A of size nxm. Find any suitable integer sequence C of size n such that A[1][c[1]]^A[2][c[2]]^….^A[n][c[n]] is greater than 0. Output Format : IF there is no solution , just print “NIE” , otherwise first print “TAK” and then print configuration.
Input Format
Given a matrix of A of size (n X m)
Constraints
n, m<=500, A[i][j]<1024
Output Format
If there is no solution , just print “NIE” , otherwise first print “TAK” and then print configuration.
Sample Input
3 2
0 0
0 0
0 0
Sample Output
NIE
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.