Arvingers: Infinity War

Example Game

For those Marvel fans familiar with the movie.
Or for those that patiently reads the whole story.
Doctor Strange said that he saw 14000605 possible futures, only in one Thanos loses.
From the sample input we know that Thanos loses when n = 1.
So Thanos must win in the other 14000604 situations!

For those Marvel fans familiar with the movie.
Or for those that patiently reads the whole story.
Doctor Strange said that he saw 14000605 possible futures, only in one Thanos loses.
From the sample input we know that Thanos loses when n = 1.
So Thanos must win in the other 14000604 situations!

if n is even

The chessboard is split into two symmetrical segments now. From now on Thanos can just mirror Arvin's moves.

if n is odd

#include<stdio.h>
int main(){
    int n;
    scanf("%d", &n);
    printf((n == 1) ? "Arvin" : "Thanos");
    return 0;
}

By Howard Yang