1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
sleet_krkn [62]
2 years ago
9

Input two numbers and print their sum products difference division and remainder​

Computers and Technology
1 answer:
likoan [24]2 years ago
7 0

\tt n1=int(input("Enter\: first\:no:"))

\tt n2=int(input("Enter\: second\:no:"))

\tt sum=n1+n2

\tt diff=n1-n2

\tt pdt=n1*n2

\tt div=n1//n2

\tt rem=n1\%n2

\tt print("Sum=",sum)

\tt print("Difference=",diff)

\tt print("Product=",pdt)

\tt print ("Division=",div)

\tt print("Remainder=",rem)

Output:-

Enter first no:4

Enter second no:3

Sum=7

Difference=1

Product=12

Division=1

Remainder=1

You might be interested in
The only way to print a photo is on a special glossy paper using professional printing services in a store
DaniilM [7]

i believe this is true


8 0
2 years ago
Read 2 more answers
What is the condition for setting an alarm clock
stich3 [128]

Answer:

The time in which the alarm clock will sound

Explanation: Hope this helped please give me brainliest

6 0
2 years ago
If we compare the push function of the stack with the insertFirst function for general lists, we see that the algorithms to impl
Jet001 [13]

Answer:

True

Explanation:

<u>Algorithm for push function</u>

The method of placing data on a stack is called a push operation.

It involves these steps −

  • Check that the stack is complete.  
  • If the stack is complete, it will cause an error .  
  • Increases top to point next empty room if the stack is not complete.  
  • Adds the data component to the place of the stack where top is pointing.
  • Success returns.

<u>Algorithm for Insertfirst function</u>

  • Create a new Link with provided data.
  • Point New Link to old First Link.
  • Point First Link to this New Link.

As we can see that in both algorithms ,we are inserting data to a new nodes and incrementing/pointing to a new node for inserting data.Both algorithms uses the same approach.

8 0
3 years ago
Jamey did a lot of research on his paper topic but can't figure out where to start writing. He has a loose plan in mind, but it'
Lisa [10]
He should come up with a definite plan.
5 0
2 years ago
Read 2 more answers
Which of the following is true? Group of answer choices worst case time of Heapsort is better than worst cast time of Quicksort
Sav [38]

Answer:

Worst case time of Heapsort is better than worst case time of Quicksort.

Explanation:

Worstcase of Heapsort is nlog(n). Worstcase time of Quicksort is (n^2). Heapsort is comparison based sorting algorithm. Heapsort divides input into sorting. It is a selection sort in which we send maximum inputs for maximum elements at end. Quicksort is divide and conquer algorithm. It is considered as efficient sourcing algorithm.

8 0
3 years ago
Other questions:
  • When one block is executed after another block in order from top to bottom, this is called ______ (see picture) Question 31 opti
    8·1 answer
  • What are the coordinates of (3 comma space 8 )relative to the basis open curly brackets space (1 comma space 1 )comma space (0 c
    15·1 answer
  • Which of the following types of cloud platforms would a webmail service offered to the general public be considered?
    9·1 answer
  • When installing EMT conduit that will be exposed to wet conditions, _______ fittings should be used.
    5·2 answers
  • What is the Role of an algorithm?
    11·1 answer
  • What is the meaning of url <br>​
    7·1 answer
  • Please help me with these questions​
    12·2 answers
  • How do you enlarge an image to see more detail on it? (1 point)
    14·2 answers
  • Which statement best describes the computers all around us?
    15·1 answer
  • The process of getting listing information displayed on numerous other websites is:________
    8·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!