随笔分类 -  补题

摘要:牛客 周赛113 20251017 https://ac.nowcoder.com/acm/contest/119225 A: 题目大意:给定正整数计算所有数位之和对 \(9\) 取模的结果 void solve(){ string s; cin >> s; int sum = 0; for (au 阅读全文
posted @ 2025-10-17 15:27 才瓯 阅读(4) 评论(0) 推荐(0)
摘要:牛客 周赛112 20251012 https://ac.nowcoder.com/acm/contest/118247 A: 题目大意: void solve(){ int n, k; cin >> n >> k; int a = ceil(0.1 * n); int sum = 0; sum + 阅读全文
posted @ 2025-10-12 17:11 才瓯 阅读(7) 评论(0) 推荐(0)
摘要:牛客 周赛111 20251009 https://ac.nowcoder.com/acm/contest/117763 A: 题目大意: void solve(){ int a, b, c; cin >> a >> b >> c; if (b != a + 1 || c != b + 1) cou 阅读全文
posted @ 2025-10-08 21:30 才瓯 阅读(33) 评论(0) 推荐(0)
摘要:牛客 周赛110 20251007 https://ac.nowcoder.com/acm/contest/118760 A: 题目大意:给定 \(n\) 个白球,每次可以将 \(2,3\) 个白球染为红色,判断通过无限次操作能否将所有球都变为红色 void solve(){ int n; cin 阅读全文
posted @ 2025-10-06 17:14 才瓯 阅读(11) 评论(0) 推荐(0)
摘要:牛客 周赛109 20250924 https://ac.nowcoder.com/acm/contest/116945 A: 题目大意: 给定两个坐标,判断和原点一起能否构成一个直角三角形 void solve(){ double x, y, u, v; cin >> x >> y >> u >> 阅读全文
posted @ 2025-10-06 14:22 才瓯 阅读(8) 评论(0) 推荐(0)
摘要:牛客2025多校 R7 C: 题目大意: void solve(){ int n; cin>>n; vector<int> a(n+1); for (int i=1;i<=n;i++) cin>>a[i]; vector<int> pre(n+1); vector<int> suf(n+2); fo 阅读全文
posted @ 2025-09-20 21:33 才瓯 阅读(14) 评论(0) 推荐(0)
摘要:牛客 周赛106 20250904 https://ac.nowcoder.com/acm/contest/116002 A: 题目大意: void solve(){ int n; cin >> n; if (n & 1) cout << "NO" << '\n'; else cout << "YE 阅读全文
posted @ 2025-09-15 19:56 才瓯 阅读(9) 评论(0) 推荐(0)
摘要:牛客 周赛105 20250829 https://ac.nowcoder.com/acm/contest/115861 A: 题目大意: void solve(){ int k; cin>>k; cout<<1<<' '<<(1^k)<<endl; } 签到 B: 题目大意: void solve 阅读全文
posted @ 2025-08-29 14:50 才瓯 阅读(7) 评论(0) 推荐(0)
摘要:牛客 周赛104 20250825 https://ac.nowcoder.com/acm/contest/114848 A: 题目大意: void solve(){ int cnt=0; for (int i=1;i<=4;i++){ int x; cin>>x; cnt+=(x==i); } c 阅读全文
posted @ 2025-08-25 17:37 才瓯 阅读(16) 评论(0) 推荐(0)
摘要:牛客2025多校 R6 C: 题目大意: const int mod=998244353; LL prod[500010]; LL k1[500010],k2[500010],k3[500010]; void init(){ prod[0]=1; for (int i=1;i<=500000;i++ 阅读全文
posted @ 2025-08-21 22:29 才瓯 阅读(10) 评论(0) 推荐(0)
摘要:牛客 周赛103 20250821 https://ac.nowcoder.com/acm/contest/114593 A: 题目大意: void solve(){ string s; cin>>s; if (s.back()=='0') cout<<"NO"; else cout<<"YES"; 阅读全文
posted @ 2025-08-21 14:00 才瓯 阅读(12) 评论(0) 推荐(0)
摘要:牛客2025多校 R5 I: 题目大意: void solve(){ LL n; cin>>n; LL s=(n+1)*n/2; LL ans=9e18; for (LL i=1;i*i<=s;i++) if (s%i==0&&(i>=n||s/i>=n)) ans=min(ans,2LL*(i+s 阅读全文
posted @ 2025-08-15 20:09 才瓯 阅读(26) 评论(0) 推荐(0)
摘要:牛客 周赛102 20250806 https://ac.nowcoder.com/acm/contest/114111 A: 题目大意: void solve(){ int n; cin>>n; cout<<2<<endl; } 签到 B: 题目大意: 给定包含三个 \(1\) 的 \(01\) 阅读全文
posted @ 2025-08-08 20:52 才瓯 阅读(6) 评论(0) 推荐(0)
摘要:牛客2025多校 R4 F: 题目大意: void solve(){ LL n,k,c; cin>>n>>k>>c; vector<LL> a(n); for (int i=0;i<n;i++) cin>>a[i]; for (int i=0;i<n;i++) a[i]=a[i]-c*i; sort 阅读全文
posted @ 2025-08-02 16:29 才瓯 阅读(13) 评论(0) 推荐(0)
摘要:牛客2025多校 R3 F: 题目大意: void solve(){ int n,a,b; cin>>n>>a>>b; if (n<=a) cout<<"Sayonara"<<endl; else if (n%(a+b)<=a) cout<<n%(a+b)<<endl; else cout<<0<< 阅读全文
posted @ 2025-07-27 18:46 才瓯 阅读(12) 评论(0) 推荐(0)
摘要:牛客 周赛101 20250726 https://ac.nowcoder.com/acm/contest/113313 A: 题目大意: void solve(){ int a; cin>>a; cout<<fixed<<setprecision(6)<<(double)150*log(a); } 阅读全文
posted @ 2025-07-27 18:44 才瓯 阅读(5) 评论(0) 推荐(0)
摘要:牛客2025多校 R2 I: 题目大意: void solve(){ LL x,y; cin>>x>>y; if (x==1||y==1) cout<<-1<<endl; else cout<<1<<endl; } 当 \(k=1,(x,y)>1\) 时,\(H(x)=H(y)=1\) 显然成立,如 阅读全文
posted @ 2025-07-20 13:56 才瓯 阅读(8) 评论(0) 推荐(0)
摘要:牛客 周赛100 20250720 https://ac.nowcoder.com/acm/contest/112576 A: 题目大意: void solve(){ int n; cin>>n; for (int i=1;i<=n;i++) cout<<i<<' '<<i<<' '; } 签到 B 阅读全文
posted @ 2025-07-19 18:54 才瓯 阅读(13) 评论(0) 推荐(0)
摘要:牛客2025多校 R1 E: 题目大意: void solve(){ LL a,b; cin>>a>>b; LL d=abs(b*b-a*a); if (d<=8){ if (d==3) cout<<1<<endl; else if (d==5) cout<<2<<endl; else if (d= 阅读全文
posted @ 2025-07-19 18:52 才瓯 阅读(3) 评论(0) 推荐(0)
摘要:牛客 周赛99 20250712 https://ac.nowcoder.com/acm/contest/112544 A: void solve(){ string s; cin>>s; for (int i=0;i<s.size()-1;i++){ if (s[i]=='9'&&s[i+1]== 阅读全文
posted @ 2025-07-13 19:33 才瓯 阅读(10) 评论(0) 推荐(0)