tuankiet65

#include <stdio.h>

int h, m, s, n;
int total_s;

int to_timestamp(int h, int m, int s) {
    return (h * (60 * 60)) + (m * 60) + s;
}

void to_hms_tuple(int timestamp, int *h, int *m, int *s) {

tuankiet65

#include <cstring>
#include <cmath>
#include <iomanip>
#include <cstdio>
#define sqr(x) ((x) * (x))

#define debug(a) printf a
//#define debug(a) ;

FILE *in, *out;

tuankiet65

import requests
import re
import time
from bs4 import BeautifulSoup

# Login by some means (in the browser, curl, etc) and paste the cookie value here
COOKIES = {
	"__tawkuuid": "",
	"SHARINGSESSID4S": ""
}

tuankiet65

#include <fstream>
#include <iostream>

std::ifstream in("fib2.inp");
std::ofstream out("fib2.out");

struct fib_str {
    uint32_t len;
    uint32_t count_a;
};

tuankiet65

#include <cstdio>
#include <algorithm>
#include <vector>

int n;
std::vector<int> a;

int main(){
    int i, tmp;
    int count_1 = 0, count_2 = 0, len = 0;

tuankiet65

using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows.Forms;
 

tuankiet65

Low Entropy

Solution

Getting all public key pairs

• There are only 30 primes in the random pool in which p and q was chosen, so there're a maximum of 465 p*q pairs. What's more, p != q, so the number drops down to 435.
• As the number is small, we can put nc in a loop to continously get p*q pairs until we have the required unique pairs:

while true; do nc vuln2014.picoctf.com 51818 | tail -n 1 >> keys.txt; done

tuankiet65

URxvt.secondaryScreen: 1
URxvt.secondaryScroll: 0

URxvt.background: #000000
URxvt.foreground: #ffffff

URxvt*color0:  #000000
URxvt*color1:  #B40000
URxvt*color2:  #00AA00
URxvt*color3:  #AAAA00

tuankiet65

minimum damamge 2
    spell params: rolls 2 sides 4 penalty 0
    possible 16 invalid 0
    spell params: rolls 1 sides 8 penalty 0
    possible 8 invalid 1
minimum damamge 10
    spell params: rolls 10 sides 6 penalty -10
    possible 60466176 invalid 89518
    spell params: rolls 1 sides 6 penalty 1
    possible 6 invalid 6

tuankiet65

#include <cstdio>
#include <iostream>
#include <cstring>

FILE *in, *out;

char s[10001];

int k, q, len, i, x, y;
short table[10000][10000];