# Solution to SGU #167 I-country

The problem description can be found in . It asks to find the connected blocks which meet the requirements and …

Skip to content
# Simple Note

## Full of worms

# Tag: algorithm

# Solution to SGU #167 I-country

# The Solution to MSBOP 2015 Warmup

### March 2015

# Triangle Count in GraphX

# Range Minimum Query

### February 2015

# Extended Euclidean Algorithm

### December 2014

# Alpha–Beta Pruning

### October 2014

# Parallel Implementation of PSO Algorithm

The problem description can be found in . It asks to find the connected blocks which meet the requirements and …

The following includes the solution to the first two problems in MSBoP 2015 Warmup. The third problem seems a maximum …

Triangle Count is very useful in social network analysis. The triangle is a three-node small graph, where every two nodes …

It’s also a solution to SGU 155. The problem can be viewed here. Every node has two values <k, a>, …

It’s well known that, the Euclidean algorithm can compute the greatest common divisor of integers a and b, gcd(a,b). The …

Suppose you win a bet with your enemy [1], and he has to give you something as wager. However, he defines …

Particle Swarm Optimization (PSO) is a wide-used optimization algorithm that can “optimize a problem by iteratively trying to improve a candidate …

Close Drawer
## Simple Note