zoj 3882 Help Bob

#include<cstdio>#include<cmath>#include<queue>#include<vector>#include<stack>#include<map>#include<string>#include<cstring>#include<algorithm>#include<iostream>using namespace std;typedef long long ll;const ll maxn = 100005;int T, n, m, f[maxn], dp[maxn * 10];int main(){while (scanf("%d", &n) == 1){if (n == 0) printf("failn");else printf("winn");}return 0;}