Bismillahir Rahmanir Rahim
///Author: Tanvir Ahmmad
///CSE,Islamic University,Bangladesh
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<sstream>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<vector>
#include<iterator>
#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array
/*every external angle sum=360 degree
angle find using polygon hand(n) ((n-2)*180)/n*/
///Floor[Log(b) N] + 1 = the number of digits when any number is represented in base b
using namespace std;
typedef long long ll;
int main()
{
ll tst,ca=1;
cin>>tst;
while(tst--)
{
ll year=0,day=0;
string str1,str2,str3;
cin>>str1>>str2>>str3;
for(ll i=0;i<str3.size();i++) year=(year*10)+(str3[i]-'0');
for(ll i=0;str2[i]!=',';i++) day=(day*10)+(str2[i]-'0');
if((str1=="January") || (str1=="February" && day<=29)) year=year-1;
//else year--;
//cout<<year<<endl;
ll pre=((year/4)-(year/100)+(year/400));
cin>>str1>>str2>>str3;
year=day=0;
for(ll i=0;i<str3.size();i++) year=(year*10)+(str3[i]-'0');
for(ll i=0;str2[i]!=',';i++) day=(day*10)+(str2[i]-'0');
if((str1=="January") || (str1=="February" && day<=28)) year--;
//cout<<year<<endl;
ll post=((year/4)-(year/100)+(year/400));
//cout<<pre<<" "<<post<<endl;
cout<<"Case "<<ca++<<": ";
if((post-pre)>=0)cout<<post-pre<<endl;
else cout<<"0"<<endl;
}
return 0;
}
///Alhamdulillah
Problem Link:https://lightoj.com/problem/february-29
Comments
Post a Comment