洛谷P1288 取数游戏 II
代码:
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
int n,a[25];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",a+i);
for(int i=1;i<=n;i++)
if(a[i]==0){
if(i%2==0)return puts("YES"),0;
break;
}
for(int i=n;i>=1;i--)
if(a[i]==0){
if((n-i+1)%2==0)return puts("YES"),0;
break;
}
puts("NO");
return 0;
}
洛谷P2197 【模板】Nim 游戏
代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int T,n,m,x,f[10100],a[10010],sg[100010];
bool vis[100010];
void getSG(int n)
{
memset(sg,0,sizeof(sg));
for (int i=1; i<=n; i++)
{
memset(vis,0,sizeof(vis));
for (int j=0; f[j]<=i; j++)
vis[sg[i-f[j]]]=1;
for (int j=0; j<=n; j++)
if (!vis[j])
{
sg[i]=j; break;
}
}
}
int main()
{
for (int i=1; i<=10001; i++) f[i]=i;
getSG(10000);
scanf("%d",&T);
while (T--)
{
scanf("%d",&n);
int ans=0;
for (int i=1; i<=n; i++)
{
scanf("%d",&a[i]);
ans^=a[i];
}
if (ans) printf("Yes\n");
else printf("No\n");
}
return 0;
}
洛谷P1113 杂务
代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,l,t,ans[10005],maxans;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;++i){
scanf("%d",&i);
scanf("%d",&l);
int tmp=0;
while(scanf("%d",&t)&&t)
tmp=max(ans[t],tmp);
ans[i]=tmp+l;
maxans=max(ans[i],maxans);
}
printf("%d\n",maxans);
return 0;
}
洛谷P1002 [NOIP2002 普及组] 过河卒
代码:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define ll long long
using namespace std;
const int fx[] = {0, -2, -1, 1, 2, 2, 1, -1, -2};
const int fy[] = {0, 1, 2, 2, 1, -1, -2, -2, -1};
int bx, by, mx, my;
ll f[40][40];
bool s[40][40];
int main(){
scanf("%d%d%d%d", &bx, &by, &mx, &my);
bx += 2; by += 2; mx += 2; my += 2;
f[2][1] = 1;
s[mx][my] = 1;
for(int i = 1; i <= 8; i++) s[mx + fx[i]][my + fy[i]] = 1;
for(int i = 2; i <= bx; i++){
for(int j = 2; j <= by; j++){
if(s[i][j]) continue;
f[i][j] = f[i - 1][j] + f[i][j - 1];
}
}
printf("%lld\n", f[bx][by]);
return 0;
}