velicast

#include <bits/stdc++.h>

using namespace std;

char b[28][28];
int dp[28][28], n, m, r;

int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) {

velicast

#include <bits/stdc++.h>

using namespace std;

int l[1024],r[1024],h[1024];

int main() {
  int n,res = 0;
  
  cin >> n;

velicast

n = input("N simbols (N >= 2): ");

cw   =  cell(n, n-1);
prob = zeros(n-1);
add  = zeros(n-1);

for i = 1 : n
  printf("p%d = ", i);
  prob(i) = input("");
end

velicast

// C++ includes used for precompiling -*- C++ -*-

// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.

velicast

// C++ includes used for precompiling -*- C++ -*-

// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
// Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.

velicast

#include <string>
#include <iostream>
#include <cstdlib>
#include <cstdio>

using namespace std;

	// O(d) where d is the length of input_N
int firstIndexOfUnorderedPair(const string &input_N) {