write a paragraph in 150 to 200 about drive against illiteracy​

Answer:

The thing is 1 chef prepare another chef

Explanation:

Hope it helps u :)

Answer:

1. Why was Jack’s mother angry?

Answer:

Jack’s mother was angry because she thought he was foolish in getting five magic beans for their cow.

2. Why was Jack surprised when reaching the sky?

Answer:

By morning the beanstalk reached high into the sky. Jack was so surprised.

3. What did Jack find when he reached the top?

Answer:

Jack found a huge castle when he reached the top of the beanstalk

Answer:

l=list(map(int,input().split()))

k=min(l)

l.remove(k)

m=1;flag=0

for i in l:

m=m*i

m=m+k

for i in range(2,m):

if(m%i==0):

flag=1

break

print("None" if flag else m)

Answer:

#include <iostream>

using namespace std;

int main() {

   int a[10];

   int i,j,k,q,p,t;

   bool prime=true;

   cout<<"\nEnter the numbers: ";

   for(i=0;i<10;i++)

   cin>>a[i];

   for(i=0;i<10;i++)

   {

       for(j=0;j<10;j++)

       {

           if(a[i]<a[j])

           {

               t=a[i];

               a[i]=a[j];

               a[j]=t;

           }

       }

   }

   q=a[0];

   for(p=2;p<10^10;p++)

   {

       for(k=2;k<10^10;k++)

       {

           if(i%k==0)

           {

           prime=false;

           break;

           }

           else

           {

               for(i=0;i<10;i++)

               {

                   if(p%a[i]!=q)

                   break;

                   else

                   cout<<p;

               }

           }

       }

   }

   return 0;

}

Explanation:

1. Declare necessary variables and an array to store the numbers.
2. Take the numbers as input from the user and store them in the array.
3. Arrange the numbers in ascending order to get the smallest of all the input numbers.
4. Using the for loop, check which number is prime.
5. If a prime number is encountered, it is divided by all of the input values except the smallest to get the remainder using the modulo operator.
6. The remainder is compared with the smallest value.
7. If the remainder is the same after dividing the prime number by all the input values, it is printed.

#SPJ3

Answer:

ক) অসুস্থ খ) দামি গ) জোড়ে ঘ) পর ঙ) শহরে