Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
3626 | 2021-12-22 00:23:27 | azmain_wasif | Binary Prime | C | 2 ms | 1560 kb | Accepted |
Test Cases
# | CPU | Memory | Points | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
1 | 2 ms | 1396 kb | 1 | Accepted | |||||||
2 | 2 ms | 1400 kb | 1 | Accepted | |||||||
3 | 2 ms | 1444 kb | 1 | Accepted | |||||||
4 | 2 ms | 1472 kb | 1 | Accepted | |||||||
5 | 2 ms | 1388 kb | 1 | Accepted | |||||||
6 | 2 ms | 1484 kb | 1 | Accepted | |||||||
7 | 2 ms | 1476 kb | 1 | Accepted | |||||||
8 | 2 ms | 1444 kb | 1 | Accepted | |||||||
9 | 2 ms | 1560 kb | 1 | Accepted | |||||||
10 | 2 ms | 1396 kb | 1 | Accepted | |||||||
11 | 2 ms | 1396 kb | 1 | Accepted | |||||||
Source Code
#include<stdio.h> int main(){ long long int t; while(t--){ for( i=0; n>0; i++ ){ val+=n%2; n=n/2; } for( i=2; i < val; i++ ){ if(val%i==0){ div++; } } else } return 0; }