OpenGenus/cosmos

Adding NcR(modulo)m using inverse factorial in c++

Open

#1,281 opened on Oct 12, 2017

View on GitHubContributor guide
 (2 comments) (0 reactions) (0 assignees)C++ (3,724 forks)batch import
Hacktoberfestadd codenew algorithm

Repository metrics

Stars
 (13,462 stars)
PR merge metrics
 (No merged PRs in 30d)

Description

m=100000007, m can be set to any prime

Contributor guide

Research direction
Understand the concept of modular inverse using Fermat's little theorem, precompute factorials and inverse factorials up to N, then implement NcR = fact[N] * invfact[R] * invfact[N R] % m.
Tech stack
cpp
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-3 hours
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
GitC++
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
60