BestCoder Round #51 (div.2) 1001 找规律+判素数

最新推荐文章于 2017-09-12 19:24:45 发布

原创最新推荐文章于 2017-09-12 19:24:45 发布 · 553 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

BestCoder 同时被 3 个专栏收录

25 篇文章

订阅专栏

简单题

25 篇文章

订阅专栏

质数&最值公倍数&质因子等问题求解

6 篇文章

订阅专栏

本文介绍了一个关于Zball增长的问题，通过分析题目要求，给出了一种有效的解决方案。对于特定条件下的数值计算，提供了判断素数的方法，并针对不同情况输出结果。

Zball in Tina Town

Accepts: 356

Submissions: 2463

Time Limit: 3000/1500 MS (Java/Others)

Memory Limit: 262144/262144 K (Java/Others)

Problem Description

Tina Town is a friendly place. People there care about each other.

Tina has a ball called zball. Zball is magic. It grows larger every day. On the first day, it becomes $1$ time as large as its original size. On the second day,it will become $2$ times as large as the size on the first day. On the n-th day,it will become $n$ times as large as the size on the (n-1)-th day. Tina want to know its size on the (n-1)-th day modulo n.

Input

The first line of input contains an integer $T$ , representing the number of cases.

The following $T$ lines, each line contains an integer $n$ , according to the description. $\leq {10}^{5},2 \leq n \leq {10}^{9}$

Output

For each test case, output an integer representing the answer.

Sample Input

2
3
10

Sample Output

2
0

题意：求n-1的阶乘%n
分析：写几个就能找出规律来，n>5,如果n是素数，那么输出n-1，否则输出0

时间紧，代码没优化，AC了,356分之一，嘿嘿

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<algorithm>
#include<cmath>
using namespace std;
bool comp(unsigned long long  num)
{
     if (num <= 2)
     {
         return num == 2;
     }

     if (num % 2 == 0)
     {
         return false;
     }
     unsigned long  n = sqrt(num);

     for (int i = 3; i <= n; i+=2)
     {
         if (num % i == 0)
         {
             return false;
         }
     }
     return true;
}
int main()
{
    int T;
    unsigned long long n;
    cin>>T;
    while(T--){
        scanf("%I64d",&n);
       unsigned long long result = 1;
       if(n<5){
        for( int i = 1; i < n ; ++i )
        {
            result *= i;
        }
        cout<<result%n<<endl;
       }
       else if(comp(n))cout<<n-1<<endl;
       else printf("0\n");
    }
    return 0;
}