题目传送门
Play a game
思路
大佬解法
AC Code
#pragma GCC optimize("-Ofast","-funroll-all-loops")
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<math.h>
using namespace std;
#define endl '\n'
#define INF 0x3f3f3f3f
#define debug(a) cout<<#a<<"="<<a<<endl;
typedef long long ll;
const double PI=acos(-1.0);
const double e=exp(1.0);
const int M=1e9+7;
const int N=2e5+7;
inline int mymax(int x,int y){return x>y?x:y;}
inline int mymin(int x,int y){return x<y?x:y;}
void solve(){
int n;
while(~scanf("%d", &n) && n){
if(n&1) cout<<"ailyanlu"<<endl;
else cout<<"8600"<<endl;
}
return ;
}
signed main(){
solve();
return 0;
}