본문 바로가기 메뉴 바로가기

IT GOGO

프로필사진
  • 글쓰기
  • 관리
  • 태그
  • 방명록
  • RSS

IT GOGO

검색하기 폼
  • Category (387)
    • Free Board (1)
    • Life (70)
      • IT (16)
      • NEWS (20)
      • Snowboard & Ski (8)
      • Camping & Climbing (3)
      • Camera (1)
      • Food & Cafe (6)
      • Investment (4)
      • Etc.. (12)
    • Computer (290)
      • Algorithms (9)
      • C (17)
      • JAVA (30)
      • Android (105)
      • HTML,PHP,Javascript (5)
      • Linux/Unix (14)
      • Tizen (3)
      • MFC (15)
      • Cocos2d-x (5)
      • Win32 API (3)
      • VBS (Visual Basic Sc.. (7)
      • OS (Windows, Linux, .. (38)
      • Python (3)
      • Tool (25)
      • Etc (10)
      • Google (Adsense,AdMo.. (1)
    • Project (21)
      • Remote (19)
      • Alarm & Weather (2)
  • 방명록

Programming Challenges (2)
[Programming Challenges] 문제12 암호깨기 (Crypt Kicker)

문제12 암호깨기 (Crypt Kicker) A common but insecure method of encrypting text is to permute the letters of the alphabet. In other words, each letter of the alphabet is consistently replaced in the text by some other letter. To ensure that the encryption is reversible, no two letters are replaced by the same letter.Your task is to decrypt several encoded lines of text, assuming that each line uses a d..

Computer/Algorithms 2017. 7. 5. 01:36
[Programming Challenges] 문제1 3n+1문제

문제1 3n+1문제출처 : http://www.programming-challenges.com/ Consider the following algorithm to generate a sequence of numbers. Start with an integer n. If n is even, divide by 2. If n is odd, multiply by 3 and add 1. Repeat this process with the new value of n, terminating when n = 1. For example, the following sequence of numbers will be generated for n = 22:22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 ..

Computer/Algorithms 2017. 7. 5. 01:21
이전 1 다음
이전 다음

파트너스 활동을 통해 일정액의 수수료를 제공받을 수 있음



Total
Today
Yesterday
TAG
  • DTS
  • Java
  • Android
  • Linux
  • 안드로이드
  • 디바이스트리
  • 리눅스
  • device tree
  • C언어
  • VBS
more
최근에 달린 댓글


Blog is powered by Tistory / Designed by Tistory

티스토리툴바