Skip to content

Sloved problem in c++ #80

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Sloved problem in c++ #80

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
f482f34
Sloved problem in c++
Athting Oct 4, 2025
6cf3f5c
Merge branch 'main' into task1
SjxSubham Oct 8, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 19 additions & 0 deletions Number of People Aware of a Secret.cpp
View file
Open in desktop
Copy link
Owner

@SjxSubham SjxSubham Oct 8, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

add problem No... at the first of the file name ....
nd the PR name should be also same as File name ...
as well as Star the repo ⭐

Copy link
Owner

@SjxSubham SjxSubham Oct 8, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Also modify the PR description...

Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
class Solution {
public:
int peopleAwareOfSecret(int n, int delay, int forget) {
vector<long long> dp(n + 1, 0);
dp[1] = 1;
long long share = 0, MOD = 1000000007;
for (int t = 2; t <= n; t++) {
if (t - delay > 0)
share = (share + dp[t - delay] + MOD) % MOD;
if (t - forget > 0)
share = (share - dp[t - forget] + MOD) % MOD;
dp[t] = share;
}
long long know = 0;
for (int i = n - forget + 1; i <= n; i++)
know = (know + dp[i]) % MOD;
return (int)know;
}
};