Roman Numerals are a way of telling numbers years ago.
It is what the Romans used to use years ago for their numbers.
EXAMPLES: I = One II = Two III = 3 IV = Four ... and so on.
In simple Python code: def convertToAngle(num): while True: if num < 0: num = 360 - num elif num > 360: num -= 360 else: break return num
# include <stdio.h> void Rec_Dec_To_Bin (int num); void main () { int num; int base; printf ("Enter the decimal number to convert it binary.\n"); scanf ("%d", &num); printf ("The number in decimal is : %d\n", num); printf ("\n"); printf ("The %d in binary is : ", num); Rec_Dec_To_Bin (num); printf ("\n\n"); } void Rec_Dec_To_Bin (int num) { if (((num / 2) != 0) && (num > 1)) { Rec_Dec_To_Bin ((num / 2)); } printf ("%d", (num % 2)); }
# include <stdio.h> main() { int num,count,sum; count=0; sum=0; printf("enter an integer :"); scanf("%d",&num); printf("ur num is : %d \n",num); while (num!=0) { count++; sum+=num%10; num/=10; } printf("sum of the digits is : %d",sum); }
i=2 rem=1 echo "Enter a number" read num if [ $num -lt 2 ] then echo "$num is not prime" exit 0 fi while [ $i -le `expr $num / 2` -a $rem -ne 0 ] do rem=`expr $num % $i` i=`expr $i + 1` done if [ $rem -ne 0 ] then echo "$num is prime" else echo "$num is not prime" fi
You need two utility functions. The first determines if a given number is prime or not. The second finds the next prime after a given number. The following function can be used to determine if a given integer is prime: bool is_prime (const unsigned num) { if (num<2) return false; if (0==(num%2)) return num==2; unsigned max_factor = (unsigned) sqrt ((double) num) + 1; unsigned factor; for (factor=3; factor<max_factor; ++factor) if (0==(num%factor)) return false; return true; } The following function can be used to determine the next prime after the given integer: unsigned next_prime (unsigned num) { while (!is_prime (++num)); return num; } Now you can print a series of primes using the following: int main (void) { unsigned num=1; while (num<10000) { num = next_prime (num); printf ("%d is prime\n", num); } return 0; }
#include<iostream> #include<sstream> #include<exception> std::string decimal_to_roman (unsigned num) { std::stringstream ss {}; while (num>0) { if (num>10000) throw std::range_error ( "ERROR: decimal_to_roman (unsigned num) [num is out of range]"); else if (num==10000) { ss<<"[M]"; num-=10000; } else if (num>=9000) { ss<<"[CM]"; num-=9000; } else if (num>=5000) { ss<<"[D]"; num-=5000; } else if (num>=4000) { ss<<"[CD]"; num-=4000; } else if (num>=1000) { ss<<"M"; num-=1000; } else if (num>=900) { ss<<"CM"; num-=900; } else if (num>=500) { ss<<"D"; num-=500; } else if (num>=400) { ss<<"CD"; num-=400; } else if (num>=100) { ss<<"C"; num-=100; } else if (num>=90) { ss<<"XC"; num-=90; } else if (num>=50) { ss<<"L"; num-=50; } else if (num>=40) { ss<<"XL"; num-=40; } else if (num>=10) { ss<<"X"; num-=10; } else if (num==9) { ss<<"IX"; num-=9; } else if (num>=5) { ss<<"V"; num-=5; } else if (num==4) { ss<<"IV"; num-=4; } else if (num>=1) { ss<<"I"; num-=1; } } return ss.str(); } int main (void) { for (unsigned n=1; n<=10000; ++n) { try { std::cout << n << "\t = " << decimal_to_roman(n) << std::endl; } catch (std::range_error& e) { std::cerr<<e.what()<<std::endl; break; } } }
unsigned binary_to_gray (unsigned num) { return num ^ (num >> 1); } unsigned gray_to_binary (unsigned num) { /* note: assumes num is no more than 32-bits in length */ num ^= (num >> 16); num ^= (num >> 8); num ^= (num >> 4); num ^= (num >> 2); num ^= (num >> 1); return num ; }
num num num
In simple Python code: def convertToAngle(num): while True: if num < 0: num = 360 - num elif num > 360: num -= 360 else: break return num
num 1 is predator num 2 is the beast num 3 is mimi num 4 is peachy and num 5 is centi
Dim x As String x = "HELLO" Dim tmpString As String tmpString = Nothing For j = 0 To x.Length - 1 Dim int int=x.Length - 1 int=int-j tmpString=x(j) Next
Num Num Num........................ XD hehehe...........
#include #include void main() { int rev num=0; while(num>0) { rev num=rev num*10+num%10; num=num%10; } return rev_num; } int main(); { int num=4562; printf("reverse of number is%d",reverse digit(num)); getch(); return o; }
this is the script Harry: I,m harry potter, school is for losers, I,m totally awsome Snape: Harry Potter, you've been absent from potions class for 3 weeks and I have no choice but to (goes muffled)num num num num num num Harry Potter num num num (harry punches snape then plays saxaphone) awsome
aaj kya num aaane wala hai bhai
#include<stdio.h> #include<math.h> bool is_prime(unsigned num) { unsigned max, factor; if (num<2) return false; if (!(num%2)) return num==2; max = (unsigned) sqrt((double)num) + 1.0; for (factor=3; factor<max; ++factor) if (!(num%factor)) return false; return true; } int main() { unsigned num; for (num=1; num<=100; ++num) if (is_prime(num)) printf ("%u is prime\n", num); return 0; }
Function is_prime(ByVal num As Integer) As Boolean If num < 0 Then num = num * -1 If num < 2 Then Return False If num Mod 2 = 0 Then Return num = 2 Dim max As Integer = Math.Sqrt(num) For div As Integer = 3 To max Step 2 If num Mod div = 0 Then Return False Next Return True End Function Sub Main() For num As Integer = 0 To 100 If is_prime(num) Then Console.Write(num) Console.WriteLine(" is prime") End If Next End Sub