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;

}

Comments

Post a Comment

Popular posts from this blog

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