Skip to content
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

Jump to bottom

Create Prime Triplets #54

Open
akshitagupta15june opened this issue Sep 25, 2020 · 4 comments
Open

Create Prime Triplets #54

akshitagupta15june opened this issue Sep 25, 2020 · 4 comments
Labels
algorithms datastructures DSA good first issue Good for newcomers hacktoberfest hacktoberfest2020 hactoberfest

Comments

@akshitagupta15june
Copy link
Member

Given an array A of n integers , find number of triplets (i,j,k) where i<j<k such that there is atleast one prime digit which is common to each number.
Input Format

The first line contains N integers followed by the number of elements
Constraints

N<=10^5
Ai<=10^18.
Output Format

Output the number of triplets
Sample Input

5
21
22
23
24
25

Sample Output

10
@pranav6670
Copy link

Can you assign me this one?

@akshitagupta15june
Copy link
Member Author

Done

@aryasoni98
Copy link
Contributor

could I work on this?

@akshitagupta15june
Copy link
Member Author

yes

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
algorithms datastructures DSA good first issue Good for newcomers hacktoberfest hacktoberfest2020 hactoberfest
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@aryasoni98 @pranav6670 @akshitagupta15june