Skip to main content

Posts

Showing posts from March, 2021

Adjacency List in a Graph

   from collections import defaultdict graph=defaultdict(list) v,e=map(int,input().split()) for i in range(e):     u,v=map(str,input().split())     graph[u].append(v)     graph[v].append(u)      for i in graph:     print(i,"->",graph[i]) Input: 7 9 A B A C A F C E C F C D D E D G G F Output: F -> ['A', 'C', 'G'] C -> ['A', 'E', 'F', 'D'] G -> ['D', 'F'] D -> ['C', 'E', 'G'] A -> ['B', 'C', 'F'] E -> ['C', 'D'] B -> ['A']       
Post a Comment
Read more

Prime Number Check

     #include <stdio.h> int isprime(int n) {     if(n==2 || n==3) return 1;     if(n==1 || n%2==0 || n%3==0) return 0;          for (int i=5;i<=sqrt(n);i=i+6)     {         if(n%i==0 || n%(i+2)==0) return 0;     }     return 1; } int main() {     printf("%d\n",isprime(57));     printf("%d",isprime(61));          return 0; }
Post a Comment
Read more