Assignment 2 Question 1

-
/* name: vinayak sharma
smvdu, jammu ECE
code description: finding triangular matrix
*/
#include <stdio.h>
int main()
{
int j=0;
int i=0;
int n;
int a;
int b=0;
int req=0;
int max=0;
int x=0;
int y=0;
int z=0;
int flag1=0;
int flag2=0;
int res=0;

scanf("%d", &n);

req = (((n*n) - n)/2);   // both the formula will help us know the number of zeroes we require for getting the triangular matrix
max = ((n*n) - n);

while (j<n)       // this loop is for numbering the rows and columns
{
i=0;
while (i<n)   // Main input of the matrix will go into this loop
{
scanf("%d",&a);
if (i != j)   // for detecting values outside the diagonal
{
if (a == 0)
{
b = b + 1;  // every time we detect a zero we will store it in the b variable
}
if (!(a == 0))     // for detecting the special case bug
{
x = i;
y = j;
z = y ;

if ( x > z )
{
flag1 = flag1 + 1;
}

if ( x < z )
{
flag2 = flag2 + 1;
}

}
} 
i = i + 1;
}
j = j + 1;
}

if ((flag1 > 0) && (flag2 > 0))
{
printf("no");
b = -1;
}

if (!(b==-1))
{
if ( b >= req)
{
printf("yes");
}
if ( b < req)
{
printf("no");
}
}
return 0;
}

Comments

Post a Comment

Popular posts from this blog

Assignment 6 Question 3

-
#include <stdio.h> int main() { int n,m; scanf("%d %d", &m ,&n ); int s[n]; s[0]=m; int i=1; int j=0; int flag=0; int count=1; for(i=1;i<n;i++) { s[i]=(2*s[i-1])%n; for(j=0;j<i;j++) { if(i==j) { continue; } if(s[i]==s[j]) { flag=1; } } if(flag) { break; } count++; } printf("%d", count); return 0; }
Read more

Assignment 8 Question 1

-
#include <stdio.h> #include <stdlib.h> struct DoublyLinkedList{ int data; struct DoublyLinkedList *prev; struct DoublyLinkedList *next; }; void removeNode ( struct DoublyLinkedList **headptr, struct DoublyLinkedList **tailptr, struct DoublyLinkedList *ptr) { if ( ptr == *headptr ){ *headptr = ptr->next; (*headptr)->prev = NULL; }else{ if ( ptr == *tailptr ) { *tailptr = ptr->prev; (*tailptr)->next=NULL; }else{ ptr->prev->next = ptr->next; ptr->next->prev = ptr->prev; } } free ( ptr ); ptr = NULL; return; } void removeData ( struct DoublyLinkedList **headptr, struct DoublyLinkedList **tailptr, int n) { struct DoublyLinkedList *curr; curr = *headptr; while ( curr != NULL && curr->data != n ){ curr = curr->next; } if ( curr != NULL ){ removeNode(headptr, tailptr, curr); } return; } struct DoublyLinkedList *createNode(int n) {...
Read more

Assignment 7 Question 2

-
#include <stdio.h> #include <stdlib.h> struct node {     int data;     struct node *next; }; typedef struct node NODE; int main() {     NODE *head=NULL;     NODE *tail=NULL;     int a,n;     scanf("%d",&a);     while(a!=-1)     {         NODE *s;         s=(NODE *)malloc(sizeof(NODE));         s->data=a;         s->next=NULL;         if(head==NULL)         {              head=s;              tail=s;         }         else         {             tail->next=s;             tail=s;         }         scanf("%...
Read more