728x90 반응형 분류 전체보기110 [Atcoder] D - Friends (C++) Problem Problem Statement There are NN persons called Person 11 through Person NN. You are given MM facts that "Person AiAi and Person BiBi are friends." The same fact may be given multiple times. If XX and YY are friends, and YY and ZZ are friends, then XX and ZZ are also friends. There is no friendship that cannot be derived from the MM given facts. Takahashi the evil wants to divide the NN pe.. 2021. 1. 13. [Codility] Lesson10 - Prime and Composite numbers : CountFactors (c++) Problem A positive integer D is a factor of a positive integer N if there exists an integer M such that N = D * M. For example, 6 is a factor of 24, because M = 4 satisfies the above condition (24 = 6 * 4). Write a function: int solution(int N); that, given a positive integer N, returns the number of its factors. For example, given N = 24, the function should return 8, because 24 has 8 factors, .. 2021. 1. 12. [IT리뷰] 화이트 모니터에 어울리는 컴퓨터용 스피커 추천! 브리츠 Istana 스피커! 컴퓨터용 스피커를 드디어!!! 구매했어요~~ 여러 스피커를 비교해보다가 제가 고른것은 브리츠 BR-Istana 스피커! 저는 아래 사이트에서 구매했답니다 ㅎㅎ smartstore.naver.com/hanasound/products/4730257535?NaPm=ct%3Dkjtxq1a2%7Cci%3Dcheckout%7Ctr%3Dppc%7Ctrx%3D%7Chk%3D39a3cd07480472aca54d4fa1718afddb07de69b1 브리츠 BR-Istana 2채널 USB전원 컴퓨터 스피커 : 브리츠 마니아 채널 : 2.0채널부가기능 : 에어덕트단자 : 헤드폰전원 : USBPC연결 : 3.5mm정격출력 : 4W품목 : PC스피커 smartstore.naver.com 브리츠 BR-Istana 스피커는 2채널 .. 2021. 1. 12. [Codility] Lesson9 - Maximum Slice Problem: MaxSliceSum (c++) Problem A non-empty array A consisting of N integers is given. A pair of integers (P, Q), such that 0 ≤ P ≤ Q < N, is called a slice of array A. The sum of a slice (P, Q) is the total of A[P] + A[P+1] + ... + A[Q]. Write a function: int solution(vector &A); that, given an array A consisting of N integers, returns the maximum sum of any slice of A. For example, given array A such that: A[0] = 3 A.. 2021. 1. 10. 이전 1 2 3 4 5 6 7 ··· 28 다음 728x90 반응형
