Jump to content

urs

Active Members
  • Content Count

    93
  • Joined

  • Last visited

  • Days Won

    3

urs last won the day on December 23 2016

urs had the most liked content!

Community Reputation

98 Excellent

1 Follower

About urs

  • Rank
    Registered user
  • Birthday 09/01/1982

Converted

  • Location
    /home/bear/
  • Occupation
    "freelancer"

Recent Profile Visitors

The recent visitors block is disabled and is not being shown to other users.

  1. da, stiu ca se putea mai dragut cu impartit/modulus cu puteri ale lui 10, da' astia suntem, cu astia defilam.
  2. import math def isKaprekar(a): n = (int)(math.pow(a, 2)) n_arr = [int(i) for i in str(n)] midd = 0 # take care of the numbers lt 10: if a == 1: return True if n < 10: return False if n % 2 == 0: midd = (int)(len(n_arr) / 2) else: midd = (int)(len(n_arr) / 2) if( (int)(''.join(str(x) for x in n_arr[0:midd])) + (int)(''.join(str(x) for x in n_arr[midd :])) == a): return True else: return False for i in range(0, 10001): # print(i) if isKaprekar(i): print(i) PiTong
  3. Am inceput cursul. Multumesc ca mi-ai amintit de el. Alles Gute!
  4. urs

    RST Bashed

    danke @wHoIS
  5. the secret is in the string, analyse the string. ai mai vazut genul asta de insiruire de caractere? daca nu, cauta si vei afla.
  6. nu, trebuie sa intelegi ce e cu stringu' ala. apoi o sa realizezi cum sa obtii link-ul.
  7. urs

    Certificare LPIC 1

    Are @CrazyTank LPIC-ul, parca
×
×
  • Create New...