2017 Multi-University Training Contest - Team 3（补题系列）
2017 Multi-University Training Contest - Team 3
RXD's date
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 208 Accepted Submission(s): 166
Problem Description
As we all know that RXD is a life winner, therefore he always goes out, dating with his female friends.
Nevertheless, it is a pity that his female friends don't like extremely hot temperature. Due to this fact, they would not come out if it is higher than 35 degrees.
RXD is omni-potent, so he could precisely predict the temperature in the next t days, but he is poor in counting.
He wants to know, how many days are there in the next t days, in which he could go out and date with his female friends.
Input
There is only one test case.
The first line consists of one integer t.
The second line consists of t integers ci which means the temperature in the next t days.
1≤ t ≤1000
0≤ ci ≤50
Output
Output an integer which means the answer.
Sample Input
5
Total Submission(s): 208 Accepted Submission(s): 166
Problem Description
As we all know that RXD is a life winner, therefore he always goes out, dating with his female friends.
Nevertheless, it is a pity that his female friends don't like extremely hot temperature. Due to this fact, they would not come out if it is higher than 35 degrees.
RXD is omni-potent, so he could precisely predict the temperature in the next t days, but he is poor in counting.
He wants to know, how many days are there in the next t days, in which he could go out and date with his female friends.
Input
There is only one test case.
The first line consists of one integer t.
The second line consists of t integers ci which means the temperature in the next t days.
1≤ t ≤1000
0≤ ci ≤50
Output
Output an integer which means the answer.
Sample Input
5
33 34 35 36 37
Sample Output
3
RXD and math
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 400 Accepted Submission(s): 203
Input
There are several test cases, please keep reading until EOF.
There are exact 10000 cases.
For each test case, there are 2 numbers n,k.
Output
For each test case, output "Case #x: y", which means the test case number and the answer.
Sample Input
10 10
Sample Output
Case #1: 999999937
There are several test cases, please keep reading until EOF.
There are exact 10000 cases.
For each test case, there are 2 numbers n,k.
Output
For each test case, output "Case #x: y", which means the test case number and the answer.
Sample Input
10 10
Sample Output
Case #1: 999999937
大概题意
题目公式是一个莫比乌斯函数，意思就是每当μ2(i)的i含平方因子时，等于0，其他都等于1，这是后来知道的，具体还是不太懂这数论的东西
在看题时看到数据那么大有点懵比，看到有取模，于是想想直接用快速幂公式试试，因为数据n的范围在10^18，提交wa了4发，后来在前面取模一次就AC了
很水的一道数论题，就是花时间！！！