| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 325578 | 梁睿煊 | [在线测评解答教程] 闰年 | C++ | Wrong Answer | 0 | 1 MS | 248 KB | 300 | 2025-06-07 11:23:41 |
#include<bits/stdc++.h> using namespace std; long long a[1000000],l=1,r,n,m,mid; long long check(long long s){ } int main(){ cin>>n>>m; for(int i=1;i<=n;i++){ cin>>a[i]; r=max(a[i],r); } while(l<=r){ mid=(l+r)/2; if(check(mid)) r=mid-1; else l=mid+1; } return 0; }