HDU 6600 Just Skip The Problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 3489 Accepted Submission(s): 1105
Problem Description
Y_UME has just found a number x in his right pocket. The number is a non-negative integer ranging from 0 to 2n−1 inclusively. You want to know the exact value of this number. Y_UME has super power, and he can answer several questions at the same time. You can ask him as many questions as you want. But you must ask all questions simultaneously. In the i-th question, you give him an integer yi ranging from 0 to 2n−1 inclusively, and he will answer you if x&yi equals to yi or not. Note that each question you ask has a index number. Namely, the questions are ordered in certain aspect. Note that Y_UME answer all questions at the same time, which implies that you could not make any decision on the remaining questions you could ask according to some results of some of the questions.
You want to get the exact value of x and then minimize the number of questions you will ask. How many different methods may you use with only minimum number of questions to get the exact value of x? You should output the number of methods modulo 106+3.
Two methods differ if and only if they have different number of questions or there exsits some i satisfying that the i-th question of the first method is not equal to the i-th of the second one.
Input
There are multiple test cases.
Each case starts with a line containing one positive integer n(n≤109).
Output
For each test case, output one line containing an integer denoting the answer.
Sample Input
2
Sample Output
2
题解:解出该题首先得弄明白按位与“&”的操作,0&0=0;0&1=0;1&0=0;1&1=1,所以我们在n位上每次放置一个1,其他位均置为0,那么每次询问都能确定该位上是1还是0,询问n次后就能确定该答案,之后这个问题就转换为对n个不同数字的全排列。
AC代码如下:
#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int mod=1000003;
int main()
{
int n;
while (~scanf("%d",&n))//输入n,确定数字范围上限
{
ll sum=1;
if(!n||n>=mod)//注意n>=mod这个条件,仔细揣摩一下,没有这个条件就会Wa- -
{
cout<<"0"<<endl;
continue;
}
for(int i=1;i<=n;i++)
{
sum=sum%mod*i%mod;//阶乘
}
cout<<sum<<endl;//结束,庆祝一下我们队A的唯一一道题
}
return 0;
}