Submission #19425053

---

Source Code Expand

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define MAX_N 100001
#define i197 1000000007

using namespace std;
using namespace atcoder;

typedef long long ll;
typedef pair<ll,ll> P1;
typedef pair<int,int> Pi;
typedef pair<ll,int> Pli;
typedef pair<Pi,Pi> Pi2;
typedef pair<P1,ll>P2;
const ll INF=1000000000000000001;
struct edge{int to,cost;};
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
struct Road{double cost;int a,b;};
struct pos{
	// 1 変数を入れる;
	int t,x,y;
};


int main(){

	ll a,b;
	cin>>a>>b;
	ll ans=0;
	if(a%4==0)ans+=(b-a)/4+1;
	else if(a+4-a%4<=b)ans+=(b-(a+4-a%4))/4+1;
	if(a%100==0)ans-=(b-a)/100+1;
	else if(a+100-a%100<=b)ans-=(b-(a+100-a%100))/100+1;
	if(a%400==0)ans+=(b-a)/400+1;
	else if(a+400-a%400<=b)ans+=(b-(a+400-a%400))/400+1;
	cout<<ans<<endl;

	return 0;

}

Submission Info

Judge Result