1008 RXD and math
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 524288/524288 K (Java/Others)
Problem Description:
RXD is a good mathematician.
One day he wants to calculate:
output the answer module 10^9+7.
1≤n,k≤10^18
p1,p2,p3…pk are different prime numbers
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
#include <stdio.h>
int PowerMod(long long a, long long b){
int ans = 1;
a = a % 1000000007;
while(b>0){
if(b % 2 == 1)
ans = (ans * a) % 1000000007;
b = b/2;
a = (a * a) % 1000000007;
}
return ans;
}
int main (){
long long n, k;
int i;
for(i = 1;scanf("%I64d%I64d", &n, &k)!=EOF;i++){
printf("Case #%d: %d\n", i, PowerMod(n, k));
}
return 0;
}
1011RXD’s date
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 524288/524288 K (Java/Others)
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
#include <stdio.h>
int main (){
int t, c;
while(~scanf("%d", &t)){
int s = 0;
while(t--){
scanf("%d", &c);
if(c <= 35){
s++;
}
}
printf("%d\n", s) ;
}
return 0;
}