Find Days and Months

-

C program to find the number of days and months on the basis of given input

In this post, I shared a C program to find the total number of months and the remaining days on the basis of the given input from the user.



#include <stdio.h> 
#include <conio.h>
void  main()
{
 int day,month,day1;
 printf("enter the number of days:\n");
 scanf("%d",&day);
 month=day/30;
 day1=day%30;
 printf(“month is =%d”,month);
 printf(:days are =%d,day1);
 getch();
}











Happy Coding :)

Comments

Post a Comment

Popular posts from this blog

Water Jug Problem using Depth First Search

-
Image
Problem Statement: In a Water Jug Problem you are given two jugs, one 4-gallon and one 3-gallon, a pump which has unlimited water which you can use to fill the jug, and the ground on which water may be poured. Neither jug has any measuring markings on it. How can you get exactly 2 gallons of water in the 4-gallon jug? This problem can be solve using multiple techniques of Artificial Intelligence (AI). Here we are going to solve the Water Jug Problem using the Depth First Search (DFS) Algorithm. To solve the problem with Breath First Search (BFS), check it here. Here is the code for the current problem statement. Firstly, let include all the header files. Now we have to define a structure for the nodes which we are going to use it for the further process. Below code snippet of code is for the same. #include<stdio.h> #include<conio.h> struct node { int x, y; struct node *next; }*root, *left, *right; Now we have to check weather the node whi...
Read more

DFS(Depth First Search) & BFS(Breath First Search) in C

-
Image
DFS v/s BFS Depth First Search Depth First Search for a graph is similar to  Depth First Traversal of a tree . The only catch here is, unlike trees, graphs may contain cycles, so we may come to the same node again. To avoid processing a node more than once, we use a boolean visited array. Pseudocode: Input : A graph  G  and a vertex  v  of G Output : All vertices reachable from  v  labeled as discovered A recursive implementation of DFS:
Read more