0
What else can I help you with?
How do you solve x squared minus 10x plus 29 equals zero?
Use the quadratic formula, with a = 1, b = -10, c = 29.Use the quadratic formula, with a = 1, b = -10, c = 29.Use the quadratic formula, with a = 1, b = -10, c = 29.Use the quadratic formula, with a = 1, b = -10, c = 29.
What is the value of XCIX?
X = 10, C = 100, I = 1 x to the left of C = -10, I to the left of X = -1 So, XCIX = 99
What temperature is 10 degrees lower than 1 degree C?
-9 C
How were the numbers 1 10 100 1.000 written by Romans?
1 - i, 10 - x, 100 - c, 1000-m (all letters should be capitalized
C plus plus program to store first 10 prime numbers in an array?
#include <iostream> bool isPrime(int p) { if( p<=1 ( p>2 && p%2==0 ))return( false );int max = (int)sqrt(( double ) p ) + 1;for( int i=3; i<=max; i+=2 )if( p%i==0 )return( false );return( true ); } int main() { int primes[10]; int count=0, num=0; while( count!= 10 ) {num+=num>2?2:1;if( isPrime(num) )primes[count++]=num;}for( int i=0; i<10; ++i )std::cout << primes[i] << std::endl;return( 0 ); }
How do you write a program in c that will count from 1 to 10 and its square for each count?
int i; for (i=1; i<=10; i++) printf ("%d %d\n", i, i*i);
How do you count to 10 on the alphabet?
A b c d12 231 312 10
How do you count the no of keywords in c?
1. Get the list of the keywords. 2. Use your fingers to count.
What does 15 N on a C F mean?
If we count 10 as 1 & 0, 11 as 1 & 1 and 12 as 1 & 2, then there are fifteen individual 'numbers' on the face of a standard clock. So, 15 N on a C F = 15 Numbers on a Clock Face
What is the least count of the thermometer?
The minimum reading that can be taken in a thermometer on a degree c scale is the least count of itfor example,the least count of a clinical thermometer is 1/5 or 0.2degree c because there are 5 subdivisions of 1 division
Witch animal haze 10 letters in its name?
The chinchilla does. Just count them 'C' 1, 'h' 2, 'i' 3, 'n' 4, 'c' 5, 'h' 6, 'i' 7, 'l' 8, 'l' 9, 'a' 10. So that would be your answer.
What is least count of thermometer?
The minimum reading that can be taken in a thermometer on a degree c scale is the least count of itfor example,the least count of a clinical thermometer is 1/5 or 0.2degree c because there are 5 subdivisions of 1 division
Write a 'c' program to accept 'n' numbers from user store these number into an array count the numbers of occurrence of each numbers?
#include<stdio.h> #include<conio.h> void main() { int a[10],i,j,k; int count=1,num[10],pos=0; clrscr(); printf("Enter the Array Element "); for(i=0;i<10;i++) { scanf("%d",&a[i]) ; }//close the for loop for(i=0;i<10;i++) { count=1,pos++; for(j=0;j<10;j++) { if(a[i]==a[j]) { for(k=j;k<10;j++) a[k]=a[k+1] }//close the if count++; }//close the for loop num[pos] = count; }//close the for loop for(i=0;i<pos;i++) printf("Repeted Number of IN Arrary %d",num[i]); }//close the main
How do you solve x squared minus 10x plus 29 equals zero?
Use the quadratic formula, with a = 1, b = -10, c = 29.Use the quadratic formula, with a = 1, b = -10, c = 29.Use the quadratic formula, with a = 1, b = -10, c = 29.Use the quadratic formula, with a = 1, b = -10, c = 29.
What to do to write a c program to input a number then a digit and findout the place value of that digit?
#include<stdio.h> int main() { int d,j=1,i,flag=0,count=0,k=0; int b[]; char a[],c; printf("enter the number="); scanf("%s",a); printf("enter the digit="); scanf("%c",&c); printf("the place value of given digit is:"); for(i=0;a[i]!='\0';i++) { if(a[i]==c) { b[k]==a[i]-'0'; b[k]=b[k]=*j; flag=1; count++; k++; } j=j*10; } if(flag==1) { printf("the place value of given digit %c is:",c); for(i=0;i<count;i++) printf("\n%d",b[i]); } else printf("your entered digit is not present in number"); return 0; }
What is the value of XCIX?
X = 10, C = 100, I = 1 x to the left of C = -10, I to the left of X = -1 So, XCIX = 99
Program to find the occurrences of a given character in a string in c plus plus?
#include#includesize_t count_char (const std::string& s, const char c){size_t count = 0;size_t offset = 0;while ((offset = s.find(c, offset)) != s.npos){++count;++offset;}return count;}int main(){std::string str {"Hello world!"};std::cout
