SDKD TeamContest A-E - 1005

SDKD TeamContest A-E - 1005

Description

In order to encourage Hiqivenfin to study math, his mother gave him a sweet candy when the day of the month was a prime number. Hiqivenfin was happy with that. But several days later, his mother modified the rule so that he could get a candy only when the day of the month was a prime number and the month was also a prime number. He felt a bit upset because he could get fewer candies. What's worse, his mother changed the rule again and he had to answer a question before he could get a candy in those days. The question was that how many candies he could get in the given time interval. Hiqivenfin wanted to cry and asked you for help. He promised to give you half of a candy if you could help him to solve this problem.

Input

There are multiple test cases. The first line of input is an integer T (0 < T <= 50), indicating the number of test cases. Then T test cases follow. The i-th line of the next T lines contains two dates, the day interval of the question. The format of the date is "yyyy mm dd". You can assume both dates are valid. Hiqivenfin was born at 1000-01-01 and would not die after 2999-12-31, so the queries are all in this interval.

Hiqivenfin didn't seem to be an earthman, but the calendar was the same as that we usually use. That is to say, you need to identify leap years, where February has 29 days. In the Gregorian calendar, leap years occur in years exactly divisible by four. So, 1993, 1994, and 1995 are not leap years, while 1992 and 1996 are leap years. Additionally, the years ending with 00 are leap years only if they are divisible by 400. So, 1700, 1800, 1900, 2100, and 2200 are not leap years, while 1600, 2000, and 2400 are leap years.

Output

Output the number of candies Hiqivenfin could get in the time interval. Both sides of the interval are inclusive.

Sample Input

2 1000 01 01 1000 01 31 2000 02 01 2000 03 01

Sample Output

0 10

#include#include#includeusing namespace std;const int maxn = 1000000;int a[] = {0,31,29,31,30,31,30,31,31,30, 31, 30, 31};int b[] = {0,31,28,31,30,31,30,31,31,30, 31, 30, 31};int y1,m1,d1,y2,m2,d2;int leap(int y){ if(y%4==0 && y%100!=0|| y%400==0) return 1; return 0;}int prime[maxn];int main(){ for(int i = 0; i < maxn; i++) prime[i] = 1; for(int i = 2; i < maxn ; i+=2) prime[i] = 0; for(int i = 3; i < maxn; ++i) { if(prime[i]) { for(int j = i+i; j < maxn; j+=i) { prime[j] = 0; } } } prime[2] = 1; prime[1] = 0; int T; cin >> T; for(int i = 0 ;i < T; ++i) { int cnt = 0; cin >> y1 >>m1 >> d1 >> y2 >>m2 >> d2; for(int i = y1; i<= y2; i++) { if( i==y1 && i!=y2) { if(leap(i)) { for(int j = m1; j <=12; ++j) { if(j==m1) { for(int k = d1; k <= a[m1]; ++k) { if(prime[k] && prime[m1]) cnt++; } } else { for(int k = 1; k <= a[j]; ++k) { if(prime[k] && prime[j]) cnt++; } } } } else { for(int j = m1; j <=12; ++j) { if(j==m1) { for(int k = d1; k <= b[m1]; ++k) { if(prime[k] && prime[m1]) cnt++; } } else { for(int k = 1; k <= b[j]; ++k) { if(prime[k] && prime[j]) cnt++; } } } } } else if(i==y2 && i!=y1) { if(leap(i)) { for(int j = 1; j <= m2; ++j) { if(j==m2) { for(int k = 1; k <= d2; k++) { if(prime[k] && prime[j]) cnt++; } } else { for(int k = 1; k <= a[j]; ++k) { if(prime[k] && prime[j]) cnt++; } } } } else { for(int j = 1; j <= m2; ++j) { if(j==m2) { for(int k = 1; k <= d2; k++) { if(prime[k] && prime[j]) cnt++; } } else { for(int k = 1; k <= b[j]; ++k) { if(prime[k] && prime[j]) cnt++; } } } } } else if(i==y1&&i==y2) { if(leap(i)) { for(int j = m1; j <=m2; ++j) { if(j==m1 && j !=m2 ) { for(int k = d1; k <= a[m1]; k++) { if(prime[k] && prime[j]) cnt++; } } else if(j==m2&&j!=m1) { for(int k = 1; k <= d2; ++k) { if(prime[k] && prime[j]) cnt++; } } else if(j==m1&&j==m2) { for(int k =d1; k <= d2; k++) { if(prime[k] && prime[j]) cnt++; } } else { for(int k = 1; k <= a[j]; k++) { if(prime[k] && prime[j]) cnt++; } } } } else { for(int j = m1; j <=m2; ++j) { if(j==m1 && j !=m2 ) { for(int k = d1; k <= b[m1]; k++) { if(prime[k] && prime[j]) cnt++; } } else if(j==m2&&j!=m1) { for(int k = 1; k <= d2; ++k) { if(prime[k] && prime[j]) cnt++; } } else if(j==m1&&j==m2) { for(int k =d1; k <= d2; k++) { if(prime[k] && prime[j]) cnt++; } } else { for(int k = 1; k <= b[j]; k++) { if(prime[k] && prime[j]) cnt++; } } } } } else { if(leap(i)) { for(int j = 1; j <= 12; ++j) { for(int k = 1; k <= a[j]; ++k) { if(prime[k] && prime[j]) cnt++; } } } else { for(int j = 1; j <= 12; ++j) { for(int k = 1; k <= b[j]; ++k) { if(prime[k] && prime[j]) cnt++; } } } } } cout << cnt <

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。