MCPcopy Create free account
hub / github.com/Vishruth-S/CompetitiveCode / main

Function main

Hackerrank_problems/Bitwise_operator/SOLUTION.c:37–44  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

35}
36
37int main() {
38 int n, k;
39
40 scanf("%d %d", &n, &k);
41 calculate_the_maximum(n, k);//function call
42
43 return 0;
44}

Callers

nothing calls this directly

Calls 1

calculate_the_maximumFunction · 0.85

Tested by

no test coverage detected