コード例 #1
0
/*
 Do combinatorial explosion to convert multi-seat election into single seat
 election where everyone is voting on fully elected slates behind the scenes.

 Based on ratings votes, a preference for a slate is the sum of the preference for the choices in it.
 */
StoredIndexVoteNode* createNChooseKSlateVote( StoredIndexVoteNode* vote, int numChoices, int seats ) {
    StoredIndexVoteNode* out;
    int* slatei;

    out = newStoredIndexVoteNode(NChooseK(numChoices, seats));
    if ( out == NULL ) {
        return NULL;
    }

    slatei = (int*)malloc(sizeof(int) * seats);
    if ( slatei == NULL ) {
        free(out);
        return NULL;
    }

    permuteSlate( vote, numChoices, 0, slatei, 0, seats - 1, 0, out );

    free(slatei);
    return out;
}
コード例 #2
0
ファイル: main.cpp プロジェクト: henry931/RelayProject
int main()
{
	uint64_t EndTarget = 24;

	std::vector<uint64_t> Result(EndTarget);

	Result[0] = 1;

	for (uint64_t i = 0; i < EndTarget - 1; i++)
	{
		uint64_t Summation = 0;

		for (uint64_t j = 0; j <= i; j++) Summation += Result[j] * NChooseK(i, j);

		Result[i + 1] = Result[i] + Summation;
	}

	for (size_t i = 0; i < EndTarget; i++)
	{
		std::cout << Result[i] << std::endl;
	}

	std::cout << std::endl;

	for (size_t i = 0; i < EndTarget; i++)
	{
		std::bitset<64> x(Result[i]);

		std::cout << x << std::endl;
	}

	std::cout << std::endl;

	for (size_t i = 0; i < EndTarget; i++)
	{
		std::cout << float(Result[i]) << std::endl;
	}

}
コード例 #3
0
ファイル: main.cpp プロジェクト: henry931/RelayProject
// From: http://stackoverflow.com/questions/15301885/calculate-value-of-n-choose-k
uint64_t NChooseK(uint64_t n, uint64_t k){

	if (k == 0) return 1;

	return (n * NChooseK(n - 1, k - 1)) / k;
}