The keyboard shortcut to bring up print on windows is ctrl+P, for Mac it's cmd+P.
Unless, you mean print screen - for that, there is a button that should say prt sc on your keyboard for windows, and for Mac, it's cmd <span>+ ctrl + shift + 3 to save to clipboard (or don't hold down the ctrl to save to your desktop).</span>
Solution :
x = float_(input())
y = float_(input())
z = float_(input())
res1 = x**z
res2 = x**(y**z)
res3 = abs(x-y)
res4 = (x**z)**0.5
print('{:.2f} {:.2f} {:.2f} {:.2f}'.format(res1,res2,res3,res4))
Output is :
5.0
1.5
3.2
172.47 361.66 3.50 13.13
Answer:
the second last option
Explanation:
secure HTTP is armed with passwords to ensure that only authorised users gain entry.
the data is encrypted during transmission
Answer:
The answer to this question is given below in the explanation section.
Explanation:
The for-loop given in the question is:
for ( j = 0; j < 10; j++ )
{
appendItem (myList, aNumber); //this loop append a number to a list myList
}
This loop starts from J variable's value zero and when J's value is less than 10, the loop iterate through its body until J's value becomes greater or equal to 10. As J's value exceed nine, the loop will get terminated.
So this loop repeats 10 times its loop body, at the 11th time, the condition becomes false and the loop will get terminated.
Answer:
Check the explanation
Explanation:
#!usr/bin/python
#FileName: sieve_once_again.py
#Python Version: 2.6.2
#Author: Rahul Raj
#Sat May 15 11:41:21 2010 IST
fi=0 #flag index for scaling with big numbers..
n=input('Prime Number(>2) Upto:')
s=range(3,n,2)
def next_non_zero():
"To find the first non zero element of the list s"
global fi,s
while True:
if s[fi]:return s[fi]
fi+=1
def sieve():
primelist=[2]
limit=(s[-1]-3)/2
largest=s[-1]
while True:
m=next_non_zero()
fi=s.index(m)
if m**2>largest:
primelist+=[prime for prime in s if prime] #appending rest of the non zero numbers
break
ind=(m*(m-1)/2)+s.index(m)
primelist.append(m)
while ind<=limit:
s[ind]=0
ind+=m
s[s.index(m)]=0
#print primelist
print 'Number of Primes upto %d: %d'%(n,len(primelist))
if __name__=='__main__':
sieve()
