vector<int>a;while(x){ a.push_back(x%10); x/=10; }if(a[1]*a[2]==a[0])returntrue;elsereturnfalse; }voidsolve(){intn; cin>>n;for(inti=n;i<=919;i++){if(check(i)){ cout<>t;for(inti=1;i<=t;i++)solve();return0; } C - Peak 题意:有n个礼物在A[i]上,找到一...
AtCoder Beginner Contest 326 B - 326-like Numbers# 难度: ⭐# 题目大意# 如果一个三位数的百位和十位的乘积等于个位, 那么这个数就是合法的; 问大于等于n的最小的合法的数是多少; 解题思路# 因为数据范围很小, 所以可以直接暴力; 神秘代码# #include<bits/stdc++.h> #define int long long #...
B - 326-like Numbers #include<bits/stdc++.h>usingnamespacestd;voidsolve(){intn;cin>>n;autocheck=[&](intx){inta=x/100,b=x/10%10,c=x%10;returna*b==c;};for(inti=n;;i++)if(check(i)){cout<<i<<"\n";return;}}intmain(){ios::sync_with_stdio(false);cin.tie(nullptr);int...
AtCoder Beginner Contest 323 A 至 F 題讲解 by dreamoon https://www.bilibili.com/video/BV1VN411b7Pd/ AtCoder Beginner Contest 323 https://www.bilibili.com/video/BV1m84y1177k/ Xy_top Atcoder Beginner Contest #323 实况 https://www.bilibili.com/video/BV1Rj41147sE/ AtCoder Beginner Conte...
头一次写题解。 A - A Healthy Breakfast r在m前面输出Yes,反之输出No。 统计两个位置比一下就行。 voidsolve(){strings;cin>>s;inta=0,b=0;for(inti=0;i<3;i++)if(s[i]=='R')a=i;elseif(s[i]=='M')b=i;if(a<b)yes;elseno;} ...
AtCoder Beginner Contest ABC-361-B https://www.bilibili.com/video/BV1M7bkeYEh1/ AtCoder Beginner Contest ABC-361-C https://www.bilibili.com/video/BV1KpbkeFEWo/ AtCoder Beginner Contest ABC-361-D https://www.bilibili.com/video/BV1Kg8kewEio/ 【比赛讲评】AtCoder Beginner Contest 361 A...
Generated testcase example for N=8 A 5.6% failure chance per testcase isn't very encouraging, though it's unlikely that all 28 testscases from the AtCoder's set are stressing the worst possible scenario. So I got my AC verdict on the 3rd attempt during the contest. This wouldn't work...
AtCoder Beginner Contest 169(题解) AtCoder Beginner Contest 169(题解)E - Count Median结论题给定nnn个xi∈[ai,bi]x_i\in[a_i,b_i]xi∈[ai,bi],求中位数的个数。定义:k=⌊n2⌋k=\lfloor\dfrac{n}{2}\rfloork=⌊2n⌋,对a,ba,ba,b进行排序后,为ak+1a_{k+1}ak...
AtCoder Beginner Contest 193 部分题解 E - Oversleeping 求是否存在\(t\)满足\(t=t_1(mod (2X+2Y)) and t=t_2(mod (P+Q))\) 注意到\(Q\)和\(Y\)非常小,直接枚举套个\(exCRT\)就行了(虽然赛场上没看出来,\(exCRT\)也忘了记得快速乘...
We will hold AtCoder Beginner Contest 167. Contest URL: https://atcoder.jp/contests/abc167 Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20200510T2100&p1=248 Duration: 100 minutes Number of Tasks: 6 Writer: gazelle, kort0n, kyopro_friends, potetisensei, she...