Submission
Id | When | Author | Problem | Language | CPU | Memory | Verdict |
---|---|---|---|---|---|---|---|
16715 | 2024-04-09 17:22:55 | Sadman_sadi_anik_241 | Binary Prime | C | 0 ms | 1908 kb | Wrong Answer - 10 |
Test Cases
CPU | Memory | Verdict | |||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
1 | 0 ms | 1788 kb | Accepted | ||||||||
2 | 0 ms | 1832 kb | Accepted | ||||||||
3 | 0 ms | 1908 kb | Accepted | ||||||||
4 | 0 ms | 1816 kb | Accepted | ||||||||
5 | 0 ms | 1736 kb | Accepted | ||||||||
6 | 0 ms | 1840 kb | Accepted | ||||||||
7 | 0 ms | 1900 kb | Accepted | ||||||||
8 | 0 ms | 1788 kb | Accepted | ||||||||
9 | 0 ms | 1792 kb | Accepted | ||||||||
10 | 0 ms | 1788 kb | Wrong Answer | ||||||||
11 | - | - | Skipped | ||||||||
Source Code
program.c
#include <stdio.h> #include <math.h> int main() { int A, i, j, B, l, sum; for (i = 1; i <= A; i++) { sum = 0; j = 1; while (1) { l = B % 2; sum = sum + l; B = B / 2; l = 0; if (B == 0) break; j++; } if (sum <= 1) { } else if (sum == 2 || sum == 3) { } else if (sum % 2 == 0) { } else { int isPrime = 1; if (sum % k == 0) { isPrime = 0; break; } } if (isPrime) { } else { } } } return 0; }