AtCoder Beginner Contest 050 基本上独立做出来了。A - Addition and Subtraction Easy模拟。#include <bits/stdc++.h> using namespace std; using i64 = long long; int main() { ios::sync_with_stdio(false), cin.tie(nullptr); int A, B; char C; cin >> A >> C >> B; if (C == '...
In this contest, there are N problems, numbered1 through N. Joisino knows that it takes her Ti seconds to solve problem i(1≦i≦N). Also, there are M kinds of drinks offered to the contestants, numbered 1 through M. If Joisino takes drink i(1≦i≦M), her brain will be ...
AtCoder Beginner Contest 050(ABCD) A - Addition and Subtraction Easy思路:依题意即可。B - Contest with Drinks Easy思路:简单模拟。C - Lining Up思路:乘法原理,用数组维护下每个数出现次数,注意特判下nnn为奇数,000只有一种,其他是两种.int n;cin>>n; int f=1,jg=n&1; 简单模拟 记忆化搜索 时间...
1、今晚(5月17日)20点在B站开始 AtCoder 初学者竞赛 353 比赛题解直播讲解 2、本周日(5月19日)晚上19点在B站开始 AtCoder Beginner Contest 354的题解直播讲解 3、观看方式: 复制下方链接或直接扫描二维码,PC端建议使用chrome浏览器 https://live.bilibili.com/21371611?live_from=84002 或识别下方二维码查看:...
AtCoder Beginner Contest 057 ABCD题 A - Remaining Time Time limit : 2sec /Memory limit : 256MB Score :100points Problem Statement Dolphin loves programming contests. Today, he will take part in a contest in AtCoder. In this country, 24-hour clock is used. For example,9:00p.m. is ...
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0}; void cb(){ int n,m;cin>>n>>m; vector<vector<char>>a(n+1,vector<char>(m+1)); for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++)cin>>a[i][j]; } vector<vector<pii>>e(n*m+1); auto cal=[&](int x,int y)-...
AtCoder Beginner Contest 402 A-F 简易题解,如果题解中有什么问题可以找我反馈,谢谢! A.CBC直接枚举整个字符串,只输出大写字母即可。 int main(){ string s; cin >> s; for(int i = 0 ; i < s.size(); i++){… 枫落发表于Atcod... AtCoder Beginner Contest 402(A-F详细题解)...
AtCoder Beginner Contest 255 实况 (5题下班) https://www.bilibili.com/video/BV1JB4y1S7Jt/ Aising Programming Contest 2022(AtCoder Beginner Contest 255)实况 https://www.bilibili.com/video/BV1mY411K7PJ/ https://www.bilibili.com/video/BV1W3411g79S/ ...
AtCoder Beginner Contest 359 A~F https://www.bilibili.com/video/BV1G4gveBENB/ AtCoder Beginner Contest 359 | 完成度 [6 / 7] https://www.bilibili.com/video/BV1kS411A7M3/ AtCoder Beginner Contest 359 A 至 G 題讲解 by dreamoon https://www.bilibili.com/video/BV1x1421r7gH/ AtCoder...
This can be done by follows for every b , any Failing Prefix of b-1 will have z=2*(b-1) + K balls , now while adding one more B and W ball to it can B added to any of the z+1 positions and then W can be added to any of the z+2 positions followed by substraction numbe...