본문 바로가기

호그와트

 (366)
tryhackme athena fantasia :: tryhackme GOD의 풀이 Starting Nmap 7.60 ( https://nmap.org ) at 2024-05-04 00:54 BSTHost is up (0.038s latency).Not shown: 65531 closed portsPORT    STATE SERVICE22/tcp  open  ssh80/tcp  open  http139/tcp open  netbios-ssn445/tcp open  microsoft-dsMAC Address: 02:E7:1F:28:DF:9F (Unknown)nmap -sV 10.10.244.72 -p 22,80,139,445Starting Nmap 7.60 ( https://nmap.org ) at 2024-05-04 01:00 BSTNmap scan report for atena.thm..
improving fuzzy fuzzy !! import subprocessimport randomimport stringimport sys def random_string(length, special=False):    if special:        # Generate a string that might include problematic characters        characters = '\x00' + '\xFF' * 10 + string.printable    else:        characters = string.ascii_letters + string.digits + string.punctuation    return ''.join(random.choice(characters) for i in range(length)) def..
사과 팝니다 한 입 하세요~~ #include #include ​typedef struct { char* name; int price; int count;} Item;​// Market inventoryItem items[] = { {"Quiet Quiches", 10, 12}, {"Average Apple", 15, 8}, {"Fruitful Flag", 100, 1}};int numItems = sizeof(items) / sizeof(Item);int coins = 40;​void displayItems() { printf("\nWelcome to the market!\n=====================\n"); printf("You have %d coins\n", coins); printf("\tItem\t\t\tPric..
어느새 Java가 나의 모국어가 되었다 package cookie; import java.util.Scanner; public class RoomBooking { public static double[] calculateDiscount(int mileage) { double discountPercentage = 0; if (mileage >= 100) { discountPercentage = 0.10; mileage -= 100; } else if (mileage >= 50) { discountPercentage = 0.05; mileage -= 50; } else if (mileage >= 10) { discountPercentage = 0.01; mileage -= 10; } else { System.out.println("Not enou..
컴퓨터랑 자바로 대화할 수 있는 지경에 이르렀다 public class Polynomial { int degree; long[] coefficients; // Constructor public Polynomial(int deg) { this.degree = deg; this.coefficients = new long[deg + 1]; for (int i = 0; i < deg + 1; i++) { this.coefficients[i] = 0; } } public static Polynomial copy(Polynomial source) { Polynomial newPoly = new Polynomial(source.degree); for (int i = 0; i = 0; i--) { System.out.print(source.coefficients[i..
내가 밖에서 시로 봤는데 흠흐밍 흠흐밍 하면서 돌아다니더라 public class MergeSortString { static void merge(String[] arr, int left, int middle, int right) { // Find sizes of two subarrays to be merged int n1 = middle - left + 1; int n2 = right - middle; /* Create temp arrays */ String[] L = new String[n1]; String[] R = new String[n2]; /*Copy data to temp arrays*/ System.arraycopy(arr, left, L, 0, n1); System.arraycopy(arr, middle + 1, R, 0, n2); /* Merg..
panda's attack public class RaggedArray { public static boolean finding(Integer[][] array) { for (int i = 0; i < array.length; i++) { for (int j = 0; j < array[i].length; j++) { if (array[i][j] == null || array[i][j] == 0) { System.out.print("false "); } else { System.out.print("true "); } } System.out.println(); // Move to the next line after each row } return true; } public static void main(String[] args) { ..
TwoArray.java import java.util.Scanner; public class TwoArrays { public static int findSmallest(int[][] myArray) { int result = myArray[0][0]; for (int i = 0; i myArray[i][j]) { result = myArray[i][j]; } } } return result; } public static int findBiggest(int[][] myArray) { int result = myArray[0][0]; for (int i = 0; i < myArra..

티스토리툴바