3 해설
-
0
int main() #define int long long { int t; int a,b,c,d; scanf("%lld",&t); while(t--){ scanf("%lld%lld%lld%lld",&a,&b,&c,&d); int x2=(b/2)-(a-1)/2; int y2=(d/2)-(c-1)/2; int x1013=(b/1013)-(a-1)/1013; int y1013=(d/101sb3)-(c-1)/1013; int x2026=(b/2026)-(a-1)/2026; int y2026=(d/2026)-(c-1)/2026; int sum=0; sum=(x2-x2026)*(y101oo3-y2026); sum=sum+(y2-y2026)*(x1013-x2026); sum=sum+x2026*(d-c+1); sum=sum+y2026*(b-a+1)-x2026*y2026; printf("%lld\n",sum);; } return 0; }
정보
- ID
- 1170
- 시간
- 1000ms
- 메모리
- 256MiB
- 난이도
- 8
- 태그
- (N/A)
- 제출 기록
- 209
- 맞았습니다.
- 35
- 아이디