Submission #1259975
Source Code Expand
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mt make_tuple
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef tuple<int,int,int> tp;
typedef vector<tp> vt;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e8;
const ll INF=2e18;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int main(){
int dat[]={0,31,29,31,30,31,30,31,31,30,31,30,31};
rep(i,12)dat[i+1]+=dat[i];
int a,b,c,d;
cin>>a>>b>>c>>d;
int s=dat[a-1]+b;
int t=dat[c-1]+d;
cout<<t-s<<endl;
}
Submission Info
Submission Time |
|
Task |
A - 招待状 |
User |
ixmel_rd |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1190 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
input_0.txt, input_1.txt, input_10.txt, input_11.txt, input_12.txt, input_13.txt, input_14.txt, input_15.txt, input_16.txt, input_17.txt, input_18.txt, input_19.txt, input_2.txt, input_20.txt, input_21.txt, input_22.txt, input_23.txt, input_24.txt, input_25.txt, input_26.txt, input_27.txt, input_28.txt, input_29.txt, input_3.txt, input_30.txt, input_31.txt, input_32.txt, input_4.txt, input_5.txt, input_6.txt, input_7.txt, input_8.txt, input_9.txt |
Case Name |
Status |
Exec Time |
Memory |
input_0.txt |
AC |
1 ms |
256 KB |
input_1.txt |
AC |
1 ms |
256 KB |
input_10.txt |
AC |
1 ms |
256 KB |
input_11.txt |
AC |
1 ms |
256 KB |
input_12.txt |
AC |
1 ms |
256 KB |
input_13.txt |
AC |
1 ms |
256 KB |
input_14.txt |
AC |
1 ms |
256 KB |
input_15.txt |
AC |
1 ms |
256 KB |
input_16.txt |
AC |
1 ms |
256 KB |
input_17.txt |
AC |
1 ms |
256 KB |
input_18.txt |
AC |
1 ms |
256 KB |
input_19.txt |
AC |
1 ms |
256 KB |
input_2.txt |
AC |
1 ms |
256 KB |
input_20.txt |
AC |
1 ms |
256 KB |
input_21.txt |
AC |
1 ms |
256 KB |
input_22.txt |
AC |
1 ms |
256 KB |
input_23.txt |
AC |
1 ms |
256 KB |
input_24.txt |
AC |
1 ms |
256 KB |
input_25.txt |
AC |
1 ms |
256 KB |
input_26.txt |
AC |
1 ms |
256 KB |
input_27.txt |
AC |
1 ms |
256 KB |
input_28.txt |
AC |
1 ms |
256 KB |
input_29.txt |
AC |
1 ms |
256 KB |
input_3.txt |
AC |
1 ms |
256 KB |
input_30.txt |
AC |
1 ms |
256 KB |
input_31.txt |
AC |
1 ms |
256 KB |
input_32.txt |
AC |
1 ms |
256 KB |
input_4.txt |
AC |
1 ms |
256 KB |
input_5.txt |
AC |
1 ms |
256 KB |
input_6.txt |
AC |
1 ms |
256 KB |
input_7.txt |
AC |
1 ms |
256 KB |
input_8.txt |
AC |
1 ms |
256 KB |
input_9.txt |
AC |
1 ms |
256 KB |