Category: ACM

Discovery Time and Finishing Time Code: //dfs using adjacency list in directed graph #include<iostream> using namespace std;…

#include<stdio.h> int main() { int m,n,c,d,matrix[10][10],transpose[10][10]; printf(“enter the number of rows and columns of matrix\n”); scanf(“%d %d”,&m,…

  #include<stdio.h> int main() { int i,j,n; printf(“Enter value of n rows: “); scanf(“%d”,&n); for(i=1; i<=n; i++)…

Anagram: #include<stdio.h> int check_anagram(char [],char []); int main() { char a[100],b[100]; int flag; printf(“Enter first string\n”); gets(a);…

#include<stdio.h> int main() { int i,j,rows; printf(“Enter the number of rows: “); scanf(“%d”,&rows); for(i=1; i<=rows; i++) {…