일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | |||||
3 | 4 | 5 | 6 | 7 | 8 | 9 |
10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | 19 | 20 | 21 | 22 | 23 |
24 | 25 | 26 | 27 | 28 | 29 | 30 |
- 중복제거
- blog
- Delphi
- python3
- advColumnGrid
- pythonanywhere
- c#
- pyhcarm
- Push
- declare
- anaconda3
- github
- queryset
- COMMIT
- Django
- get_object_or_404
- 델파이
- TMS
- templates
- delphi 10.3
- MSSQL
- hackerrank
- python 3.7
- Visual Studio
- dbadvgrid
- HTML
- 백준
- GIT
- rank
- PyCharm
- Today
- Total
목록전체 글 (60)
DevHyun
www.hackerrank.com/domains/sql P(R) represents a pattern drawn by Julia in R rows. The following pattern represents P(5): * * * * * * * * * * * * * * * Write a query to print the pattern P(20). 번역 : 5개부터 시작해서 하나씩 줄여나가면서 별을 찍었듯이 20개 부터 시작해서 별을 찍어라 프로그래밍 언어 시작할때 반복문 예제로 많이 쓰이는 그 문제! 풀이 : 일단 SELECT 문으로는 힘들것 같아서 프로시져를 사용하기로 생각했음! 생각보다 어려웠다. PRINT REPLICATE를 몰랐다면 못풀었을 듯.. REPLICATE 함수 자체는 원하는 숫자만큼 원하..
www.hackerrank.com/domains/sql Query the two cities in STATION with the shortest and longest CITY names, as well as their respective lengths (i.e.: number of characters in the name). If there is more than one smallest or largest city, choose the one that comes first when ordered alphabetically. The STATION table is described as follows: where LAT_N is the northern latitude and LONG_W is the west..
www.hackerrank.com/domains/sql Find the difference between the total number of CITY entries in the table and the number of distinct CITY entries in the table. The STATION table is described as follows: where LAT_N is the northern latitude and LONG_W is the western longitude. For example, if there are three records in the table with CITY values 'New York', 'New York', 'Bengalaru', there are 2 dif..