diff --git a/Aarushi_evenOrOdd_q2.cpp b/Aarushi_evenOrOdd_q2.cpp new file mode 100644 index 0000000..be3b218 --- /dev/null +++ b/Aarushi_evenOrOdd_q2.cpp @@ -0,0 +1,9 @@ +#include +using namespace std; + +int main(){ + int n; + cin>>n; + n%2==0? cout << "Even" : cout << "Odd"; + return 0; +} \ No newline at end of file diff --git a/Aarushi_evenOrOdd_q2.exe b/Aarushi_evenOrOdd_q2.exe new file mode 100644 index 0000000..8017cf8 Binary files /dev/null and b/Aarushi_evenOrOdd_q2.exe differ diff --git a/Aarushi_positiveOrNegative_q1.cpp b/Aarushi_positiveOrNegative_q1.cpp new file mode 100644 index 0000000..dadc057 --- /dev/null +++ b/Aarushi_positiveOrNegative_q1.cpp @@ -0,0 +1,14 @@ +#include +using namespace std; + +int main(){ + int n; + cin>>n; + if(n > 0) + cout << "Positive"; + else if(n < 0) + cout << "Negative"; + else + cout << "Zero"; + return 0; +} \ No newline at end of file diff --git a/Aarushi_positiveOrNegative_q1.exe b/Aarushi_positiveOrNegative_q1.exe new file mode 100644 index 0000000..b7379d7 Binary files /dev/null and b/Aarushi_positiveOrNegative_q1.exe differ diff --git a/Aarushi_sumN_1stNaturalnos_q3.cpp b/Aarushi_sumN_1stNaturalnos_q3.cpp new file mode 100644 index 0000000..cb467d2 --- /dev/null +++ b/Aarushi_sumN_1stNaturalnos_q3.cpp @@ -0,0 +1,14 @@ +#include +using namespace std; + +int main(){ + int n; + cin>>n; + int i=1; + int sum=0; + while(i<=n){ + sum+=i; + i++; + } + cout << sum; +} \ No newline at end of file diff --git a/Aarushi_sumN_1stNaturalnos_q3.exe b/Aarushi_sumN_1stNaturalnos_q3.exe new file mode 100644 index 0000000..c83db38 Binary files /dev/null and b/Aarushi_sumN_1stNaturalnos_q3.exe differ diff --git a/Aarushi_sumOfNNaturalno.s_q4 b/Aarushi_sumOfNNaturalno.s_q4 new file mode 100644 index 0000000..a06ea98 Binary files /dev/null and b/Aarushi_sumOfNNaturalno.s_q4 differ diff --git a/Aarushi_sumOfNNaturalno.s_q4.cpp b/Aarushi_sumOfNNaturalno.s_q4.cpp new file mode 100644 index 0000000..6de602e --- /dev/null +++ b/Aarushi_sumOfNNaturalno.s_q4.cpp @@ -0,0 +1,15 @@ +#include +using namespace std; + +int main(){ + int n; + cin>>n; + int i=1; + int sum=0; + sum = n*(n+1)/2; + // while(i<=n){ + // sum+=i; + // i++; + // } + cout << sum; +} \ No newline at end of file diff --git a/Aarushi_sumOfnosInAGivenRange_q5.cpp b/Aarushi_sumOfnosInAGivenRange_q5.cpp new file mode 100644 index 0000000..5eb717a --- /dev/null +++ b/Aarushi_sumOfnosInAGivenRange_q5.cpp @@ -0,0 +1,16 @@ +#include +using namespace std; + +int main(){ + int n, m; + cin>>n >> m; + + int sum = 0; + sum = m*(m+1)/2 - n*(n+1)/2 + n; + cout< +using namespace std; + +int main() +{ + int year; + + cin>>year; + + if(year % 400 == 0) + cout << year << " is a Leap Year"; + + else if(year % 4 == 0 && year % 100 != 0) + cout << year << " is a Leap Year"; + + else + cout << year << " is not a Leap Year"; + + return 0; +} \ No newline at end of file diff --git a/DAY 3/Aarushi_greatestOfThreeNumbres_q7.cpp b/DAY 3/Aarushi_greatestOfThreeNumbres_q7.cpp new file mode 100644 index 0000000..5f74c22 --- /dev/null +++ b/DAY 3/Aarushi_greatestOfThreeNumbres_q7.cpp @@ -0,0 +1,19 @@ +#include +using namespace std; + +int main () +{ + int num1, num2, num3; + cin >> num1 >> num2 >> num3; + + if (num1 == num2 && num2 == num3) + cout << "all are equal"; + else if (num1 > num2 && num1 > num3) + cout << num1 << " is greatest"; + else if (num2 > num1 && num2 > num3) + cout << num2 << " is greatest"; + else + cout << num3 << " is greatest"; + + return 0; +} \ No newline at end of file diff --git a/DAY 3/Aarushi_greatestOfTwoNumbers_q6.cpp b/DAY 3/Aarushi_greatestOfTwoNumbers_q6.cpp new file mode 100644 index 0000000..fc66d9b --- /dev/null +++ b/DAY 3/Aarushi_greatestOfTwoNumbers_q6.cpp @@ -0,0 +1,17 @@ +#include +using namespace std; + +int main () +{ + int num1, num2; + cin>>num1>>num2; + + if (num1 == num2) + cout << "both are equal"; + else if (num1 > num2) + cout << num1 << " is greater than " << num2; + else + cout << num2 << " is greater than " << num1; + + return 0; +} \ No newline at end of file diff --git a/DAY 3/Aarushi_primeRange_q10.cpp b/DAY 3/Aarushi_primeRange_q10.cpp new file mode 100644 index 0000000..1243f40 --- /dev/null +++ b/DAY 3/Aarushi_primeRange_q10.cpp @@ -0,0 +1,26 @@ +#include +using namespace std; + +bool isPrime(int n){ + if(n < 2) + return false; + + for(int i = 2;i < n; i++) + { + if(n % i == 0) + return false; + } + + return true; +} + +int main() +{ + int a, b; + cin>>a>>b; + + for(int i = a; i <= b; i++) + if(isPrime(i)) + cout << i << " "; + +} \ No newline at end of file diff --git a/DAY 3/Aarushi_primeRange_q10.exe b/DAY 3/Aarushi_primeRange_q10.exe new file mode 100644 index 0000000..a1b1fa8 Binary files /dev/null and b/DAY 3/Aarushi_primeRange_q10.exe differ diff --git a/DAY 3/Aarushi_prime_q9.cpp b/DAY 3/Aarushi_prime_q9.cpp new file mode 100644 index 0000000..9876daa --- /dev/null +++ b/DAY 3/Aarushi_prime_q9.cpp @@ -0,0 +1,35 @@ +#include +using namespace std; + +bool isPrime(int n) { + if (n <= 1) { + return false; + } + if (n == 2) { + return true; + } + if (n % 2 == 0) { + return false; + } + + for (int i = 2; i <= n; i += 2) { + if (n % i == 0) { + return false; + } + } + + return true; +} + +int main() { + int number; + cin >> number; + + if (isPrime(number)) { + cout << number << " is a prime number." << endl; + } else { + cout << number << " is not a prime number." << endl; + } + + return 0; +} diff --git a/DAY 3/Aarushi_reverse_q12.cpp b/DAY 3/Aarushi_reverse_q12.cpp new file mode 100644 index 0000000..039c03a --- /dev/null +++ b/DAY 3/Aarushi_reverse_q12.cpp @@ -0,0 +1,20 @@ +#include +using namespace std; + +int main () +{ + int n, rev = 0, r; + cin>>n; + + while(n != 0) + { + r = n % 10; + rev = rev * 10 + r; + n /= 10; + }; + + //output + cout <<"Reversed Number: "< +using namespace std; + +int main() +{ + int n; + cin>>n; + int sum = 0; + while(n > 0) + { + int digit = n % 10; + sum+= digit; + n = n / 10; + } + cout<