maksadbek

## simple_go_daemon.go
package main

import (
	"flag"
	"fmt"
	"io/ioutil"
	"log"
	"net"
	"net/http"
	"os"

## push-mock.go
var FleetTest = struct {
	FleetName string
	Trackers  []string
}{
	"202",
	[]string{"106206", "107749", "107699"},
}
var testFleet Fleet = Fleet{
    Id: "202",
    Update: map[string]Pos{

## reminder.txt
some field on the sql rows scan can be always equal to null or 0 or "" if it is string, due to previes fields that are not mapped to sql NULLABLE types.

## dijkstra.cpp


vector<pair<int, int> > G[N];
int d[N];
bool visited[N];

//read G

for(int i = 1; i <= n; i++){
    d[i] = INF;

## 1st.go
package main

import (
    "fmt"
    "math/rand"
    "runtime"
    "time"
)

func makeBuffer() []byte {

## dfs.cpp
int used[N];
bool cycle;
vector<int> order;
vector<int> comp[N];
vector<int> G[N], G2[N];

void dfs(int v){
    used[v] = 1;
    for(int i = 0; i < (int) G[v].size(); i++){
        int to = G[v][i];

## ws.go
package main

import (
	"flag"
	"log"
	"net/http"
	"time"

	"github.com/gorilla/websocket"
)

## index.mithrill.html
<!DOCTYPE html>
<html lang="en">

<head>

    <meta charset="utf-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1">
    <meta name="description" content="">
    <meta name="author" content="">

## patternmatcher.go
package main

import (
	"strings"
)

func match(pattern, text string) bool {
	patterns := strings.Split(pattern, "")
	words := strings.Split(text, " ")
	// if the length of patterns and words does not the same the mapping is wrong

## gist:6283393
//from int to char
while(n>0){
	ch[i]=(n%10)+'0';
	n=n/10;
	i++;
}
while(i>0){
	putchar(ch[i-1]);
	i--
}
	package main

	import (
	"flag"
	"fmt"
	"io/ioutil"
	"log"
	"net"
	"net/http"
	"os"
	var FleetTest = struct {
	FleetName string
	Trackers []string
	}{
	"202",
	[]string{"106206", "107749", "107699"},
	}
	var testFleet Fleet = Fleet{
	Id: "202",
	Update: map[string]Pos{


	vector<pair<int, int> > G[N];
	int d[N];
	bool visited[N];

	//read G

	for(int i = 1; i <= n; i++){
	d[i] = INF;
	int used[N];
	bool cycle;
	vector<int> order;
	vector<int> comp[N];
	vector<int> G[N], G2[N];

	void dfs(int v){
	used[v] = 1;
	for(int i = 0; i < (int) G[v].size(); i++){
	int to = G[v][i];
	<!DOCTYPE html>
	<html lang="en">

	<head>

	<meta charset="utf-8">
	<meta http-equiv="X-UA-Compatible" content="IE=edge">
	<meta name="viewport" content="width=device-width, initial-scale=1">
	<meta name="description" content="">
	<meta name="author" content="">
	package main

	import (
	"strings"
	)

	func match(pattern, text string) bool {
	patterns := strings.Split(pattern, "")
	words := strings.Split(text, " ")
	// if the length of patterns and words does not the same the mapping is wrong
	//from int to char
	while(n>0){
	ch[i]=(n%10)+'0';
	n=n/10;
	i++;
	}
	while(i>0){
	putchar(ch[i-1]);
	i--
	}