Submission
Status:
[P-SS][PPPPPPPPPPP]
Subtask/Task Score:
{0/30}{70/70}
Score: 70
User: whattt10000
Problemset: ดูวีทูปเบอร์
Language: cpp
Time: 0.004 second
Submitted On: 2026-10-14 11:43:19
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(){
int m[12]={31,28,31,30,31,30,31,31,30,31,30,31},fd,fm,ld,lm,om=0,sum=0;
cin>>fd>>fm>>ld>>lm;
if(fm==lm){
if(ld<fd) cout<<"error"<<endl;
else cout<<ld-fd+1<<endl;
return 0;
}
if(lm<fm||fd>m[fm-1]||ld>m[lm-1]){
cout<<"error"<<endl;
return 0;
}
sum+=m[fm-1]-fd+1;
sum+=ld;
for(int i=fm; i<lm-1; i++){
sum+=m[i];
om++;
}
cout<<sum*3<<endl;
}