Scribd
Upload
220 views

Kpit Code Day-2

The document contains C code implementations of various math and logic problems. There are multiple functions defined across different code blocks that take integer inputs and return integer outputs, implementing operations like counting primes between ranges, calculating digital root of a number, validating time strings, calculating factorials, binomial coefficients, checking if a number is perfect, counting squares between ranges, finding difference of primes in a range, calculating average of quadratic roots, determining triangle types from side lengths, and identifying quadrant of a 2D point.

Uploaded by

Debasis Dutta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
220 views

Kpit Code Day-2

The document contains C code implementations of various math and logic problems. There are multiple functions defined across different code blocks that take integer inputs and return integer outputs, implementing operations like counting primes between ranges, calculating digital root of a number, validating time strings, calculating factorials, binomial coefficients, checking if a number is perfect, counting squares between ranges, finding difference of primes in a range, calculating average of quadratic roots, determining triangle types from side lengths, and identifying quadrant of a 2D point.

Uploaded by

Debasis Dutta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

#include<stdio.

h>
#include<stdlib.h>

int prime_count(int input1,int input2)


{
int flag,count=0;
for (int i = input1; i <= input2; i++)
{
if (i == 1 || i == 0)
{
continue;
}
flag = 1;
for (int j = 2; j <= i / 2; ++j)
{
if (i % j == 0)
{
flag = 0;
break;
}
}
if (flag == 1)
count++;
}

return count;
}
int main()
{
int n1, n2;
scanf("%d", &n1);
scanf("%d", &n2);
printf("%d", prime_count(n1, n2));
return 0;
}
#include <stdio.h>
#include <string.h>

int digit_Root(int input1)


{
int sum=0;
while (input1>0)
{
sum+=input1%10;
input1/=10;
}
if(sum>9)
{
return digit_Root(sum);
}
else
{
return sum;
}
}
int main()
{
int n1;
scanf("%d", &n1);
printf("%d", digit_Root(n1));
return 0;
}
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

char *substr(const char *src, int m, int n)


{
int len = n - m;
char *dest = (char *)malloc(sizeof(char) * (len + 1));
for (int i = m; i < n && (*(src + i) != '\0'); i++)
{
*dest = *(src + i);
dest++;
}
*dest = '\0';
return dest - len;
}

int valid(char *input1)


{
int len = strlen(input1);
char *hour = substr(input1, 0, 2);
char *min = substr(input1, 3, 5);
char *sec = substr(input1, 6, len);

int hh = atoi(hour);
int mm = atoi(min);
int ss = atoi(sec);
if (hh < 24 && mm < 60 && ss < 60)
{
return (hh * 3600 + mm * 60 + ss);
}
else
{
if (hh >= 24)
{
return hh;
}
else if (mm >= 60)
{
return mm;
}
else if (ss >= 60)
{
return ss;
}
}
}

int main()
{
char *format = "15:02:30";
printf("%d", valid(format));
return 0;
}

#include <math.h>
#include <stdio.h>

int factorial(int n)
{
if(n==0)
{
return 1;
}
int fact=1;
for(int i=2;i<=n;i++)
{
fact=fact*i;
}
return fact;
}

int nCr(int input1,int input2)


{
return
factorial(input1)/(factorial(input2)*factorial(input1-input2));
}
int main()
{
int n, r;
scanf("%d", &n);
scanf("%d", &r);
printf("%d", nCr(n,r));
return 0;
}

#include <stdio.h>
#include<string.h>

int isPerfect(long long int n)


{
long long int sum = 1;
for (long long int i = 2; i * i <= n; i++)
{
if (n % i == 0)
{
if (i * i != n)
{
sum = sum + i + n / i;
}
else
{
sum = sum + i;
}
}
}
if (sum == n && n != 1)
{
return 1;
}
return 0;
}

int main()
{
int n=28;
printf("%d",isPerfect(n));
return 0;
}

#include<stdio.h>
#include<string.h>
#include<stdlib.h>

int countSquares(int input1, int input2)


{
int cnt = 0;
for (int i = input1; i <= input2; i++)
{
for (int j = 1; j * j <= i; j++)
{
if (j * j == i)
{
cnt++;
}
}
}
return cnt;
}

int main()
{
int a = 25, b = 49;
printf("%d",countSquares(a, b));
return 0;
}

#include <stdio.h>
#include <string.h>

int size(int num1, int num2)


{
int flag;
int count = 0;
for (int i = num1 + 1; i < num2; ++i)
{
flag = 0;
for (int j = 2; j <= i / 2; ++j)
{
if (i % j == 0)
{
flag = 1;
break;
}
}
if (flag == 0)
{
count++;
}
}
return count;
}

int diff_primes_in_range(int input1, int input2)


{
int c = size(input1, input2);
int array[c];
int flag, k = 0;
for (int i = input1; i <= input2; i++)
{
if (i == 1 || i == 0)
{
continue;
}
flag = 1;
for (int j = 2; j <= i / 2; ++j)
{
if (i % j == 0)
{
flag = 0;
break;
}
}
if (flag == 1)
{
array[k] = i;
k++;
}
}
int array_size = sizeof(array) / sizeof(array[0]);
int diff = array[array_size - 1] - array[0];
return diff;
}

int main()
{
int a, b;
scanf("%d", &a);
scanf("%d", &b);
printf("%d", diff_primes_in_range(a, b));
return 0;
}

#include <math.h>
#include <stdio.h>
double quadratic_roots(int input1, int input2, int input3)
{
double discriminant, root1, root2, realPart, imagPart;
double av;
discriminant = input2 * input2 - 4 * input1 * input3;
if (discriminant > 0)
{
root1 = (-input2 + sqrt(discriminant)) / (2 * input1);
root2 = (-input2 - sqrt(discriminant)) / (2 * input1);
av = (double)(root1 + root2) / 2;
return av;
}
else if (discriminant == 0)
{
root1 = root2 = -input2 / (2 * input1);
av = (double)(root1 + root2) / 2;
return av;
}
else
{
realPart = -input2 / (2 * input1);
imagPart = sqrt(-discriminant) / (2 * input1);
return 0;
}
}

int main()
{
int n1, n2, n3;
scanf("%d", &n1);
scanf("%d", &n2);
scanf("%d", &n3);
double ans = quadratic_roots(n1, n2, n3);
if (ans == 0.0)
{
printf("0");
}
else
{
printf("%0.1lf", ans);
}
}

#include <stdio.h>
#include <string.h>
int triangle(int input1, int input2, int input3)
{
if(input1==input2&&input2==input3&&input3==input1)
{
return 1;
}
else if(input1==input2||input1==input3||input2==input3)
{
return 2;
}
else
if((input1+input2)>input3&&(input2+input3)>input1&&(input3+inpu
t1)>input2)
{
return 3;
}
else
{
return 0;
}
}
int main()
{
int n1,n2,n3;

scanf("%d", &n1);
scanf("%d", &n2);
scanf("%d", &n3);
printf("%d", triangle(n1,n2,n3));
return 0;
}

#include<stdio.h>
#include<string.h>

int quadrant_of_a_point(int input1,int input2)


{
if(input1>0&&input2>0)
{
return 1;
}
else if(input1<0&&input2>0)
{
return 2;
}
else if(input1<0&&input2<0)
{
return 3;
}
else if(input1>0&&input2<0)
{
return 4;
}
else if(input1==0||input2==0)
{
return 0;
}
}
int main()
{
int n1,n2;
scanf("%d",&n1);
scanf("%d", &n2);
printf("%d", quadrant_of_a_point(n1, n2));
return 0;
}

You might also like