Commits

Branch selector

 master

User selector

All users

All time

Commit History

Commits on Sep 19, 2025

• Easy problem for introduction to BFS and DFS algorithms

  xStanler

  committed
  ed734c3

  Copy full SHA for ed734c3

• Updated .gitignore

  xStanler

  committed
  fa36729

  Copy full SHA for fa36729

Commits on Sep 16, 2025

• Added gitignore

  xStanler

  committed
  8cdbe5b

  Copy full SHA for 8cdbe5b

• test

  xStanler

  committed
  1d13dab

  Copy full SHA for 1d13dab

• first commit from Macbook

  xStanler

  committed
  4aba6c7

  Copy full SHA for 4aba6c7

Commits on Jul 16, 2025

• Just trying -s flag with gnu compiler

  xStanler

  committed
  8fb4673

  Copy full SHA for 8fb4673

Commits on Jul 5, 2025

• Fairly easy problem

  xStanler

  committed
  6b15fba

  Copy full SHA for 6b15fba

Commits on Jul 4, 2025

• Solved using Eratostenes' Sieve and SumPrefix

  xStanler

  committed
  f7fb310

  Copy full SHA for f7fb310

Commits on Jul 3, 2025

• Fun problem solved with fibonacii sequence, didn't read right and did it for n form 3 to 2*10^6 instead of from 1 to 2*10^6

  xStanler

  committed
  1acfc87

  Copy full SHA for 1acfc87

Commits on Jun 30, 2025

• Solved first time with O(n^3) time complexity using brute force, second time with O(n).

  xStanler

  committed
  21d91ef

  Copy full SHA for 21d91ef

Commits on Jun 27, 2025

• Solved. I need to rest, 'cause my brain is not braining.

  xStanler

  committed
  95ad81b

  Copy full SHA for 95ad81b

• Not solved :(

  xStanler

  committed
  991c26a

  Copy full SHA for 991c26a

Commits on Jun 26, 2025

• Spoj#631 Not done yet

  xStanler

  committed
  4de279f

  Copy full SHA for 4de279f

Commits on Jun 25, 2025

• I complicated to much, it's only for showcase how to change flaot to hex

  xStanler

  committed
  2a3866f

  Copy full SHA for 2a3866f

• Solved with simplest idea using just arrays.

  xStanler

  committed
  fd04e89

  Copy full SHA for fd04e89

Commits on Jun 24, 2025

• Solved with a little help of Kaden's Algorithm, becouse my Worm Algorithm was to slow.

  xStanler

  committed
  b29630f

  Copy full SHA for b29630f

Commits on Jun 23, 2025

• Apparently I tried to solve it before, but I had poor understanding of math I guess. Just made easy equation, and rounded the answer.

  xStanler

  committed
  842c510

  Copy full SHA for 842c510

• Simple problem that requires only modulo, if-statements and a little bit of brain ;)

  xStanler

  committed
  e0f9c73

  Copy full SHA for e0f9c73

• Solved with vector

  xStanler

  committed
  1df104d

  Copy full SHA for 1df104d

Commits on Jun 22, 2025

• Easy solution with modulo

  xStanler

  committed
  43242a6

  Copy full SHA for 43242a6

• Solved by checking if slopes of the lines are the same

  xStanler

  committed
  9dd16d2

  Copy full SHA for 9dd16d2

• Adding all pre-existing solutions

  xStanler

  committed
  6e2a62c

  Copy full SHA for 6e2a62c

• Initializing git branch

  xStanler

  committed
  76bcc6e

  Copy full SHA for 76bcc6e