henrybear327

Concurrency Patterns in Go

Notes taken from Rob Pike's presentation 'Google I/O 2012 - Go Concurrency Patterns'.

1. Generator: function that returns a channel

The code is as follows:

c := boring("boring!")  // function returning a channel

for i := 0; i < 5; i++ {

henrybear327

#include <bits/stdc++.h>

using namespace std;

void solve(int n)
{
    int dp[1 << n];
    memset(dp, 0, sizeof(dp));

    int w[1 << n];

henrybear327

#include <bits/stdc++.h>

using namespace std;

void solve()
{
    int n, m;
    scanf("%d %d", &n, &m);

    priority_queue<int, vector<int>, greater<int>> pq;

henrybear327

Permutation

1. next_permutation() (sorting!)
2. DFS

class Solution
{
private:
    vector<int> tmp;
 void dfs(vector &amp;nums, bool used[], vector&gt; &amp;ans,

henrybear327

#include <bits/stdc++.h>

using namespace std;

int dp[55][55];
int dfs(int inp[], int n, int l, int r) // (l, r)
{
    if (r - l <= 1)
        return 0;
    if (dp[l][r] != -1)

henrybear327

#include <bits/stdc++.h>

using namespace std;

int solve(int n)
{
    int dp[n][3];

    int inp[n];
    for (int i = 0; i < n; i++) {

henrybear327

#include <bits/stdc++.h>

using namespace std;

void solve()
{
    int n;
    scanf("%d", &n);

    int par[n + 1], w[n + 1], deg[n + 1], cnt[n + 1];

henrybear327

#include <bits/stdc++.h>

using namespace std;

struct Data {
    int p;
    int w;
};

typedef pair<int, int> ii;

henrybear327

#include <stdio.h>

void solve()
{
    long long int x, y, p;
    scanf("%lld %lld %lld", &x, &y, &p);

    long long int ans = 1;
    while (y > 0) {
        if (y & 1) {

henrybear327

#include <stdio.h>
#include <string.h>

void solve(int n)
{
    long long int ans = 0;
    for (int i = 0; i < n; i++) {
        char inp[100];
        scanf("%s", inp);
        int len = strlen(inp);