lordfriend

// Advanced Problem: Checking Whether Any Intersection in a City is Reachable from Any Other
//Task. Compute the number of strongly connected components of a given directed graph with n vertices and m edges.
// Input Format. A graph is given in the standard format.
// Constraints. 1 ≤ n ≤ 10 4 , 0 ≤ m ≤ 10 4 .
// Output Format. Output the number of strongly connected components.
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
import java.util.Stack;

lordfriend

import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Stack;

public class Acyclicity {

    private static int acyclic(ArrayList<Integer>[] adj) {
        //write your code here
        boolean[] visited = new boolean[adj.length];

lordfriend

@media (min-width: 723px) {
  .center-box {
    width: 360px !important;
    margin-left: 10%;
  }

  .center-box-header {
    position: fixed;
    top: 0.8rem;

lordfriend

#Chance is the chance that a mob will be infernal, the lower the number, the higher the chance.
#Enabledworlds are the worlds that infernal mobs can spawn in.
#Enabledmobs are the mobs that can become infernal.
#Loot is the items that are dropped when an infernal mob dies. (You can have up to 64)
#Item is the item, Amount is the amount, Durability is how damaged it will be (0 is undamaged).
chance: 15
#nameTagsLevel is the visibility level of the name tags, 0 = no tag, 
#1 = tag shown when your looking at the mob, 2 = tag always shown.
nameTagsLevel: 2
nameTagsPrefix: "Infernal"

lordfriend

distance: 50.0 #Distance in-Blocks after whichd the level increases

multiplier: 0.3 #Number to input in health algorythm
#Algorythm: MaxHealth + (MaxHealth * (trueDistance * multiplier))

expMultiplier: 0.5 #Number to input in exp algorythm
#Algorythm: BaseDroppedExp + BaseDroppedExp * (expMultiplier * lvl)

damageMultiplier: 0.1 #Number to input in damage algorythm
#Algorythm: BaseDamage + BaseDamage * (damageMultiplier * lvl)

lordfriend

angular.module('myApp').controller('myController', function($scope) {
  $scope.daterangeModel = {
    start: moment().subtract('days', 5),
    end: moment()
  };
});

lordfriend

/**
 * Use to execute task on an QUEUE
 */

var taskQueue = [];
var hasRunningWorker = false;

/**
 * A worker which is used to running a time-consuming job.
 * @param data - the data needed by the executor

lordfriend

#!/bin/sh
# Controls the minecraft server

#####################
#START CONFIGURATION#
#####################

# Replace the location path with the folder containing your CraftBukkit.jar or minecraft_server.jar file
LOCATION="/srv/craftbukkit"

lordfriend

export JAVA_HOME=/usr/jdk1.6_43
export PATH=$JAVA_HOME/bin:$PATH
export CLASSPATH=.:$JAVA_HOME/lib/dt.jar:$JAVA_HOME/lib/tools.jar:$CLASSPATH

lordfriend

.M8jNpf {
  overflow: visible !important;
}

.M8jNpf::before {
  position: absolute;
  content: url('https://lh6.googleusercontent.com/-KK4uX4DzKDs/UcsJhmwGBtI/AAAAAAAASA8/gpFUyCTqV9Q/w219-h360-no/tsukiko_small.gif');
  width: 219px;
  height: 360px;
  top: 0px;