hdu1848专题

hdu1848

sg函数 #include <iostream>#include <string.h>using namespace std;#define MAXN 1000 + 10int f[MAXN];int sg[MAXN];bool vis[MAXN];void getsg(){sg[0] = 0;for (int i = 1; i <= 1000; i++){memset(vis, fal

hdu1848 Fibonacci again and again

Fibonacci again and again Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3622 Accepted Submission(s): 1500 Problem Description 任何一个大学生对