// Arya vs Sansa // A Sgk101's challenge // at https://www.sololearn.com/Discuss/1956100/?ref=app // Yes, it can be more efficient. But for now this is enough for me. // Improvement for eficiency: changed the starting value of combination to skip all the non-meeting-conditions values // Added execution time visualization #include #include #include unsigned wins(unsigned r, unsigned p) { unsigned combination, combat; unsigned retval = 0; unsigned arya, sansa; if(p>r) p=r; for(combination = ((1<>=1) { // pointer of combat. for ex. if(r=5) 1000, next 0100, next 0010, next 0001 if(combat & combination) // if the combination has a 1 in combat position arya wins ++arya; // 1 point for her else sansa += p; // else sansa wins p points for her if(sansa>arya) // now if sansa is winning the condition of arya is false break; // so we can stop counting combats } if(combat==0) // if all cobats has done ++retval; // that combination satisfies the specifications of Arya } return retval; // Then we return the number of combinatios where Arya crushes Sansa. } int main() { clock_t timer; unsigned victories; unsigned cases; unsigned **combat = malloc(sizeof(unsigned*)); scanf("%u", &cases); for(int i=0; i < cases; ++i) { combat[i] = malloc(sizeof(unsigned[2])); scanf("%u %u", &combat[i][0], &combat[i][1]); } for(int i=0; i < cases; ++i) { timer = clock(); victories = wins(combat[i][0], combat[i][1]); timer = (clock() - timer) * 1000 /CLOCKS_PER_SEC; printf("%u - %u ms\n", victories, timer); free(combat[i]); } free(combat); }

Arya vs Sansa challenge