Main Languages

Tools & Infrastructure

https://lichess.org/JMfAN6BZ

[Event "casual blitz game"] [Site "https://lichess.org/JMfAN6BZ"] [Date "2026.10.22"] [Round "-"] [White "Anonymous"] [Black "Anonymous"] [Result "1-0"] [GameId "JMfAN6BZ"] [UTCDate "2026.10.22"] [UTCTime "02:23:50"] [WhiteElo "?"] [BlackElo "?"] [Variant "Standard"] [TimeControl "300+0"] [ECO "D02"] [Opening "Queen's Pawn Game: Krause Variation"] [Termination "Normal"] [Annotator "lichess.org"]

1. Nf3 { [%clk 0:05:00] } 1... d5 { [%clk 0:05:00] } 2. d4 { [%clk 0:05:00] } 2... c5 { [%clk 0:04:59] } { D02 Queen's Pawn Game: Krause Variation } 3. Bf4 { [%clk 0:04:59] } 3... cxd4 { [%clk 0:04:58] } 4. Nxd4 { [%clk 0:04:59] } 4... Nc6 { [%clk 0:04:54] } 5. e3 { [%clk 0:04:57] } 5... e5 { [%clk 0:04:53] } 6. Nxc6 { [%clk 0:04:54] } 6... bxc6 { [%clk 0:04:52] } 7. Bxe5 { [%clk 0:04:51] } 7... Nf6 { [%clk 0:04:51] } 8. Bxf6 { [%clk 0:04:50] } 8... Qxf6 { [%clk 0:04:49] } 9. Bd3 { [%clk 0:04:48] } 9... Bc5 { [%clk 0:04:45] } 10. O-O { [%clk 0:04:43] } 10... Qxb2 { [%clk 0:04:38] } 11. Nd2 { [%clk 0:04:40] } 11... Qf6 { [%clk 0:04:34] } 12. e4 { [%clk 0:04:37] } 12... O-O { [%clk 0:04:26] } 13. exd5 { [%clk 0:04:35] } 13... cxd5 { [%clk 0:04:26] } 14. Qf3 { [%clk 0:04:25] } 14... Qxf3 { [%clk 0:04:17] } 15. Nxf3 { [%clk 0:04:25] } 15... Be6 { [%clk 0:04:12] } 16. Ng5 { [%clk 0:04:20] } 16... Rab8 { [%clk 0:04:09] } 17. Bxh7+ { [%clk 0:04:17] } 17... Kh8 { [%clk 0:04:07] } 18. Nxe6 { [%clk 0:04:08] } 18... fxe6 { [%clk 0:04:05] } 19. Bd3 { [%clk 0:04:07] } 19... Rb2 { [%clk 0:03:54] } 20. Kh1 { [%clk 0:04:04] } 20... Rxf2 { [%clk 0:03:50] } 21. Rxf2 { [%clk 0:04:01] } 21... Bxf2 { [%clk 0:03:48] } 22. h3 { [%clk 0:03:58] } 22... Bg3 { [%clk 0:03:46] } 23. c3 { [%clk 0:03:46] } 23... e5 { [%clk 0:03:43] } 24. Rb1 { [%clk 0:03:43] } 24... Rd2 { [%clk 0:03:40] } 25. Rb8# { [%clk 0:03:39] } { White wins by checkmate. } 1-0

https://github.com/1234coco/ZaloCustomTheme

include <bits/stdc++.h>

define ll long long

using namespace std;

int main() { freopen("chess.inp","r",stdin); freopen("chess.out","w",stdout); ll a[100005],b[100005]; ll d=0; ll n; cin>>n; for(ll i=1;i<=n;i++) cin>>a[i]>>b[i]; sort(a+1,a+n+1); sort(b+1,b+n+1); ll l=1,r=n; ll l1=1,r1=n; while(l1<=r1) { if(b[r1]>a[r]) { d+=2; r1--; r--; } else { if(b[l1]>a[l]) { d+=2; l++; l1++; } else { if(b[l1]==a[r]) { d++; } else { if(b[l1]>a[r]) d+=2; } l1++; r--; } } } cout<<d; return 0; }