Try   HackMD

First Find

┌──(kali㉿kali)-[~/code]
└─$ wget https://artifacts.picoctf.net/c/500/files.zip               
--2023-07-31 04:29:04--  https://artifacts.picoctf.net/c/500/files.zip
Resolving artifacts.picoctf.net (artifacts.picoctf.net)... 13.35.7.12, 13.35.7.31, 13.35.7.121, ...
Connecting to artifacts.picoctf.net (artifacts.picoctf.net)|13.35.7.12|:443... connected.
HTTP request sent, awaiting response... 200 OK
Length: 3995553 (3.8M) [application/octet-stream]
Saving to: ‘files.zip’

files.zip         100%[===========>]   3.81M  1.31MB/s    in 2.9s    

2023-07-31 04:29:11 (1.31 MB/s) - ‘files.zip’ saved [3995553/3995553]

                                                                      
┌──(kali㉿kali)-[~/code]
└─$ unzip files.zip 
Archive:  files.zip
   creating: files/
   creating: files/satisfactory_books/
   creating: files/satisfactory_books/more_books/
  inflating: files/satisfactory_books/more_books/37121.txt.utf-8  
  inflating: files/satisfactory_books/23765.txt.utf-8  
  inflating: files/satisfactory_books/16021.txt.utf-8  
  inflating: files/13771.txt.utf-8   
   creating: files/adequate_books/
   creating: files/adequate_books/more_books/
   creating: files/adequate_books/more_books/.secret/
   creating: files/adequate_books/more_books/.secret/deeper_secrets/
   creating: files/adequate_books/more_books/.secret/deeper_secrets/deepest_secrets/
 extracting: files/adequate_books/more_books/.secret/deeper_secrets/deepest_secrets/uber-secret.txt  
  inflating: files/adequate_books/more_books/1023.txt.utf-8  
  inflating: files/adequate_books/46804-0.txt  
  inflating: files/adequate_books/44578.txt.utf-8  
   creating: files/acceptable_books/
   creating: files/acceptable_books/more_books/
  inflating: files/acceptable_books/more_books/40723.txt.utf-8  
  inflating: files/acceptable_books/17880.txt.utf-8  
  inflating: files/acceptable_books/17879.txt.utf-8  
  inflating: files/14789.txt.utf-8   
                                                                      
┌──(kali㉿kali)-[~/code]
└─$ cat files/adequate_books/more_books/.secret/deeper_secrets/deepest_secrets/uber-secret.txt  
picoCTF{f1nd_15_f457_ab443fd1}

*note: grep -r works as well

┌──(kali㉿kali)-[~/code]
└─$ grep -r "pico" files        
files/adequate_books/more_books/.secret/deeper_secrets/deepest_secrets/uber-secret.txt:picoCTF{f1nd_15_f457_ab443fd1}
files/14789.txt.utf-8:brassa un picotin d'orge_. Comme depuis une demi-heure environ c'était

Big Zip

┌──(kali㉿kali)-[~/code]
└─$ wget https://artifacts.picoctf.net/c/503/big-zip-files.zip
--2023-07-31 04:30:03--  https://artifacts.picoctf.net/c/503/big-zip-files.zip
Resolving artifacts.picoctf.net (artifacts.picoctf.net)... 13.35.7.96, 13.35.7.121, 13.35.7.31, ...
Connecting to artifacts.picoctf.net (artifacts.picoctf.net)|13.35.7.96|:443... connected.
HTTP request sent, awaiting response... 200 OK
Length: 3182988 (3.0M) [application/octet-stream]
Saving to: ‘big-zip-files.zip’

big-zip-files.zip 100%[===========>]   3.04M  1.06MB/s    in 2.9s    

2023-07-31 04:30:07 (1.06 MB/s) - ‘big-zip-files.zip’ saved [3182988/3182988]

                                                                      
┌──(kali㉿kali)-[~/code]
└─$ unzip big-zip-files.zip
Archive:  big-zip-files.zip
   creating: big-zip-files/
 extracting: big-zip-files/jpvaawkrpno.txt  
  inflating: big-zip-files/oxbcyjsy.txt  
  inflating: big-zip-files/hllhxlvvdgiii.txt 
.
.
.
(omit)

┌──(kali㉿kali)-[~/code]
└─$ grep -r "pico" big-zip-files
big-zip-files/folder_pmbymkjcya/folder_cawigcwvgv/folder_ltdayfmktr/folder_fnpfclfyee/whzxrpivpqld.txt:information on the record will last a billion years. Genes and brains and books encode picoCTF{gr3p_15_m4g1c_ef8790dc}
Last changed by 
 
Natalie Lin
0
2431

Read more

50024. Grade

#include<stdio.h> #include<string.h> #include<stdlib.h> #include<ctype.h> #define N 55 #define LEN 8 int max(int a, int b){ return a * (a > b) + b * (a <= b); } int cmp(const void *a, const void *b){

Dec 2, 2023
50177. Lights Out

#include<stdio.h> #define N 4 int counter(int bd[N][N], int n){ int cnt = 0; for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ cnt += (bd[i][j]); } } return cnt;

Dec 1, 2023
50282. Bricks

a bit slower but cc = 3 #include<stdio.h> void f(int l, int hx, int hy, int hz, int x, int y, int z, int ty[2][2][2]){ if(l <= 0) return; int xx = (x - hx <= 0), yy = (y - hy <= 0), zz = (z - hz <= 0); int t = ty[xx][yy][zz]; printf("%d %d %d %d\n", t, x, y, z); int dx[8] = {1, -1, 1, -1, 1, -1, 1, -1}; int dy[8] = {1, 1, -1, -1, 1, 1, -1, -1};

Nov 30, 2023
50279. Tiles Again

#include<stdio.h> void f(int l, int hx, int hy, int x, int y){ if(l <= 0) return; #ifdef debug printf("hx, hy = %d, %d, x, y = %d, %d\n", hx, hy, x, y); #endif int xx = (x - hx <= 0), yy = (y - hy <= 0); int ty[2][2] = {{4, 2}, {3, 1}}; #ifdef debug

Nov 29, 2023
Read more from Natalie Lin
Published on HackMD