Beautiful Days at the Movies HackerRank solution in C
PROBLEM DESCRIPTION:
SOLUTION IN C :
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int reverse(int n){
int s=0,r;
while(n>0){
r = n%10;
s = s*10 + r;
n=n/10;}
return s; }
int beautifulDays(int i, int j, int k) {
int p,num=0;
for(int a=i;a<=j;a++)
{
p=abs(a - reverse(a));
if(p%k==0)
num++;
}
return num;
}
int main()
{
int i,j,k,result;
scanf("%d %d %d",&i,&j,&k);
result = beautifulDays(i, j, k);
printf("%d",result);
return 0;
}
SOLUTION IN C :
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int reverse(int n){
int s=0,r;
while(n>0){
r = n%10;
s = s*10 + r;
n=n/10;}
return s; }
int beautifulDays(int i, int j, int k) {
int p,num=0;
for(int a=i;a<=j;a++)
{
p=abs(a - reverse(a));
if(p%k==0)
num++;
}
return num;
}
int main()
{
int i,j,k,result;
scanf("%d %d %d",&i,&j,&k);
result = beautifulDays(i, j, k);
printf("%d",result);
return 0;
}
Comments
Post a Comment