whatalnk

CXX = clang++-3.9
INCDIR = -I /usr/include/c++/v1 -I /home/linuxbrew/.linuxbrew/opt/boost@1.60/include
CFLAGS = -O2
LIBS = -L /usr/lib -L /home/linuxbrew/.linuxbrew/opt/boost@1.60/lib
OBJS = a.out
STD = c++14
STDLIB = libc++
WARNS = -Werror -Weverything -Wno-c++98-compat -Wno-c++98-compat-pedantic

a.out: hello.cpp

whatalnk

#include <iostream>

using namespace std;

static int n;
int solve();

int solve() {
  int ans = n;
  for (int i = 0; i <= n; i++) {

whatalnk

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>

using namespace std;

static int a, b;
int solve();

whatalnk

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>

using namespace std;

int n;

whatalnk

#include <algorithm>
#include <iostream>
#include <queue>
#include <string>

using namespace std;

const int MAX_H = 1000;
const int MAX_W = 1000;

whatalnk

require 'prime'

n, p_ = gets.chomp.split(" ").map(&:to_i)
x = Prime.prime_division(p_)

ans = 1
x.each do |e, m|
  ans *= e ** (m / n)
end
puts ans

whatalnk

# TLE
H, W = gets.chomp.split(" ").map(&:to_i)

que = []
visited = Array.new(H){Array.new(W, false)}
H.times do |i|
  row = gets.chomp
  W.times do |j|
    if row[j] == "#"
      que << [i, j]

whatalnk

n = gets.chomp.to_i
s = gets.chomp

snow = []
ice = []
cnt = 1
cur = "-"
(n - 1).times do |i|
  if s[i + 1] == "-"
    if cur == "-"

whatalnk

a = []
b = []
s = gets.chomp
n = s.length
n.times do |i|
  if s[i] == "2"
    if b.empty?
      a << 1
    else
      x = b.pop

whatalnk

c, d = gets.chomp.split(" ").map(&:to_i)
l, r = 140, 170
ans = 0

while true
  break if l > d
  ans += [0, [r, d].min - [l, c].max].max
  l *= 2
  r *= 2
end