hacker.org

java : package hacker.org; import java.math.BigInteger; public class ThePowersThatBe { public static void main(String[] args) { BigInteger b = new BigInteger("17"); b = b.pow(39); b = b.pow(11); String resOp = b.toString(); String sol = ""; for(int i=0;i<resOp.length();i=i+33) so...

emm java code also but i hav another method not mentionned here we can use one of the regex tester tools to find the chain https://www.freeformatter.com/regex-tester.html regex : 9[^9]{120,}9 why 120 ? i tested with 50,70,100,110,120 until the msg Found 1 match. Match is highlighted below. 986065706...

java solution using regex :p package hacker.org; import java.util.regex.Pattern; public class Delegates { public static void main(String[] args) { int sum = 0; for(int i=1; i<=2118; i++) { if(Pattern.compile("(.0)$").matcher(Double.toString(Math.sqrt(i))).find()) { System.out.println(i); /...

*** Edited by Moderator ***

http://rumkin.com/tools/cipher/substitution.php

[/img]

I use an app named color detector simple to use & withouy downloading the picture
then converting the hex value to binary

i solved it in this way (C++ recursive..) #include <iostream> using namespace std; int fibonacci(int n) { return (n <= 2 ? 1 : fibonacci(n - 1) + fibonacci(n - 2)); } void main() { int i,som; som = 0; //affichage des nombres de Fibonacci for (i = 10; i < 18; i++) { cout << fibonacci(i) << endl; } //...

Put the eehxhqpmawoewdffplqrturxdjlsaylymgxjsthjpacyuxnpuvqlezhosbnmmjzeeahjllnacofwyxxrelwgadsmolyynahrfvqkqonkgjsazwczwbayptsnsuvyomalyisyroxbivlqvtaltvjwtqbsbnscqmdcwxxdkvwctbynbvokdcovbebokjlmekezpcnoxvzzpaqhusdhgbhtqzeuoegylofircjlxdypcvekkllxjxlynidhgngtpblebyoazqvoccnhauwcsviqlbzsmyrproffqapj...