Dsa201 PSV - 800153

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 8

input = input.

split('\n');
let tc = +input[0]
let line = 1;
for(let i=0;i<tc;i++){
let n = +input[line];
line++;
let str = input[line];
line++;
myFunc(n,str);
}
input = input.split('\n');
let tc = +input[0]
let line = 1;
for(let i=0;i<tc;i++){
let n = +input[line];
line++;
let arr = input[line].split(' ').map(Number);
line++;
myFunc(n,arr);
}
for(let i=0;i<M;i++){
let bag ="";
for(let j=0;j<N;j++){
bag+=mat[j][i]+" ";
}
console.log(bag);
}
let symmetric = true;
for(let i=0;i<n;i++){
if(mat[i]!==mat[n-1-i]){
symmetric=false;
}
}

if(symmetric){
for(let i=0;i<n;i++){
for(let j=0;j<n;j++){
if(mat[][]!==mat[][]){
symmetric=false;
}
}
}
}
else{
console.log("NO");
}
let symmetric = true;
for(let i=0;i<n;i++){
if(mat[i]!==mat[n-1-i]){
symmetric=false;
}
}

if(symmetric){
for(let i=0;i<n;i++){
for(let j=0;j<n;j++){
if(mat[j][i]!==mat[j][n-1-i]){
symmetric=false;
}
}
}
if(symmetric){
console.log("YES");
}
else{
console.log("NO");
}
}
else{
console.log("NO");
}
let bag = ""; else{
let count = 0; for(let i=0;i<M;i++){
let row =0; bag+=matrix[row][i]+" ";
while(count<N*M){ count++;
if(row%2===0){ }
for(let i=M-1;i>=0;i--){ row++;
bag+=matrix[row][i]+" "; }
count++; console.log(bag);
}
}
}
let bag = "";
let count = 0;
let row =0;
while(count<N*M){
if(row%2===0){
for(let i=M-1;i>=0;i--){
bag+=matrix[row][i]+" ";
count++;
}
}
else{
for(let i=0;i<M;i++){
bag+=matrix[row][i]+" ";
count++;
}
}
row++;
}
console.log(bag);

You might also like