m4scosta

#include <iostream>
#include <cstring>

#define MAX 101

using namespace std;

int main()
{
    int n, m, x;

m4scosta

#include <iostream>
#include <algorithm>
#include <sstream>

using namespace std;

int main()
{
    string exp;
    int a, b, c;

m4scosta

#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <cstdlib>
 
using namespace std;
 
typedef pair<int, int> jogo;
 

m4scosta

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdlib>


using namespace std;

typedef pair<int, int> jogo;

m4scosta

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdlib>

using namespace std;

int main()
{
   int n, qt, s, ganhador, x;

m4scosta

#include <iostream>
#include <queue>
#include <vector>
#include <climits>
#include <cstring>

#define MAX_V 550
#define ii pair<int, int>

using namespace std;

m4scosta

enum Jogada {
    case PEDRA
    case PAPEL
    case TESOURA
    
    func ganhaDe(outra: Jogada) -> Bool? {
        if self == outra {
            return nil
        }

m4scosta

infix operator ** {}

func ** (n: Int, p: Int) -> Int {
    return Int(pow(Double(n), Double(p)))
}


func splitInt(n: Int) -> [Int] {
    if n < 10 {
        return [n]

m4scosta

// String operations
var test = "Marcos Pinto"

test.insert(" ", atIndex: test.startIndex.advancedBy(6))

test.insertContentsOf("Costa".characters, at: test.startIndex.advancedBy(7))

print(test)

test.removeAtIndex(test.startIndex)

m4scosta

var a = [1, 4, 6, -1, -7, 8]


let ordered = a.sort({(b: Int, c: Int) -> Bool in return b > c })

let reversed = a.sort({b, c in return b > c})

let shortReversed = a.sort({ $0 > $1 })

let veryShortReversed = a.sort(>)