Grit_ICPC的博客

E - 尤文图斯 Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u Submit Status Practice HDU 2147 Description Recently kiki has nothing to do. While she is bored,

A Multiplication Game Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4369    Accepted Submission(s): 2480 Problem Description Stan and

Public Sale Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5742    Accepted Submission(s): 3354 Problem Description 虽然不想，但是现实总归是现实，Lel

Good Luck in CET-4 Everybody! Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6730    Accepted Submission(s): 4322 Problem Description

迷之博弈 Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^ 题目描述 FF喜欢博弈，今天又开始了一场博弈。 将n个棋子摆成一条直线，编号为1到n。两个人轮流取棋子，每回合取一次且只能按照下述两种方法的一种取。 1，任取一个棋子。 2，任取两个棋子且这两个棋子的编号是连续的。 FF为了彰显高手风范总是让对方先

Being a Good Boy in Spring Festival Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5604    Accepted Submission(s): 3343 Problem Descrip

Game! Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^ 题目描述 One day, zbybr is playing a game with blankcqk, here are the rules of the game: There is a circle of N stones, zbybr and bl

大意：有n堆石子两人轮流取，每次取任意个，谁最后取走谁输。思路：1、当这么多堆都是一个石子那么，n为奇，那么先手为奇异状态，否则，为必胜。 2、否则对所有石子取亦或，若结果为0则先手奇异状态。#include<map> #include<queue> #include<cmath> #include<cstdio> #include<stack> #include<iostream> #inclu