مهندسی نرم افزار و کارگاه عمومی

## Sample code Lecture 3

## Find the square root of a perfect square

##x = 144

##ans = 0

##while (ans*ans < x): ans = ans + 1

##    

##print ans

##if (x/2)*2==x:

##    print 'even'

##else:

##    print 'odd'

##n=raw_input('Enter a number: ')

##Deffensive Programming

##x = -15

##ans = 0

##if x >= 0:

##    while ans*ans < x:

##        ans = ans + 1

##    if ans*ans != x:

##        print x ,'is not a perfect square number!'

##    else:

##        print 'ans = ',ans

##

##else:

##    print x, 'is a negative number'

##x = 10

##i = 1

##while i< x:

##    if x%i == 0:

##        print 'divisor ' , i

##    i = i+1

##x = 120

##for i in range(1,x):

##    if x%i == 0:

##        print 'divisor ',i

##

##

##x = 120

##divisors = ()

##for i in range(1, x):

##    if x%i == 0:

##        divisors = divisors + (i, )

##print divisors

s1 = 'abcdefg'

s2 = 'hijklmn'

##selecting

##print s1

##print s1[0]

##print s1[3]

##print s1[-1]

####slicing

##print s1[2:4]

##print s1[:3]

##print s1[3:]

##

##

##print s1.find('cde')

##

##print s1==s2

##print s1< s2

##print s1 > s2

##

x = 195244

sumDigits = 0

print x

for c in str(x):

    sumDigits += int(c)

print sumDigits