博弈
Change_ZHONG
成在坚持
展开
-
tjut 4664
include #include typedef long long ll; #define N 1002 bool vis[N]; int sg[N]; int a[] = {4,8,1,1,2,0,3,1,1,0,3,3,2,2,4,4,5,5,9,3,3,0,1,1,3,0,2,1,1,0,4,5,3,7}; int SG(int x) { if原创 2016-07-30 10:04:06 · 177 阅读 · 0 评论 -
tjut 2516
#includeusing namespace std;int main(){ int n,fib[45]; int i,flag; fib[0]=2; fib[1]=3; for(i=2;i<45;i++) fib[i]=fib[i-1]+fib[i-2]; while(cin>>n&&n) {原创 2016-09-17 09:09:45 · 191 阅读 · 0 评论 -
tjut 1847
#include using namespace std; int main(void) { int n; while(scanf("%d",&n)==1) { if(n%3==0) cout<<"Cici"<<endl; else cout<<"Kiki"<<endl;原创 2016-09-17 09:06:21 · 206 阅读 · 0 评论 -
tjut 1846
#include #include #include using namespace std; int main() { int t,n,m; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); if(n%(m+1))原创 2016-09-17 09:04:33 · 162 阅读 · 0 评论 -
tjut 1564
#include #include #include #include using namespace std;int main(){ int n; while(scanf("%d",&n)==1 &&n) { if(n%2==0)printf("8600\n"); else printf("ailyanlu\n"); }原创 2016-09-17 09:01:56 · 165 阅读 · 0 评论 -
tjut 1079
#include #include using namespace std; int sg[500][20][40]; int day[400]; int mm[15]={0,31,28,31,30,31,30,31,31,30,31,30,31}; int g(int y , int m , int d) { if(sg[y][m][d]!=-1)原创 2016-09-04 11:08:37 · 175 阅读 · 0 评论 -
tjut 3595
#include #include #include #include #define M 1002 using namespace std; int n,sg[M][M],step[M][M]; int find(int a,int b) { if(sg[a][b]>=0) return sg[a][b]; if(a>b) swap(原创 2016-09-14 11:36:22 · 148 阅读 · 0 评论 -
tjut 2999
#include #include #include #include #include #define N 10005 #define LL long long #define inf 1<<29 #define eps 1e-7 using namespace std; int n,a[100],m,k,cnt,sg[1005]; int get_s原创 2016-08-19 08:18:36 · 176 阅读 · 0 评论 -
tjut 5299
#include using namespace std;#define prt(k) cerrtypedef unsigned long long ll;const int N = 20003;struct P{int x, y, r;bool operator{return x }ll d(P b){ll dx = x - b.x, dy原创 2016-06-10 12:57:42 · 185 阅读 · 0 评论 -
tjut 1525
#include #include #include #include using namespace std;int main(){ int a,b; while(scanf("%d%d",&a,&b) == 2) { if( a == 0 && b == 0)break; if( a < b)swap(a,b);原创 2016-09-06 20:59:28 · 171 阅读 · 0 评论