https://atcoder.jp/contests/APG4b/tasks/APG4b_a
https://atcoder.jp/contests/APG4b/tasks/APG4b_bw
https://atcoder.jp/contests/APG4b/tasks/APG4b_bx
https://atcoder.jp/contests/APG4b/tasks/APG4b_by
https://atcoder.jp/contests/APG4b/tasks/APG4b_bz
https://atcoder.jp/contests/APG4b/tasks/APG4b_ca
https://atcoder.jp/contests/APG4b/tasks/APG4b_cb
https://atcoder.jp/contests/APG4b/tasks/APG4b_cc
https://atcoder.jp/contests/APG4b/tasks/APG4b_cd
https://atcoder.jp/contests/APG4b/tasks/APG4b_ce
https://atcoder.jp/contests/APG4b/tasks/APG4b_cf
https://atcoder.jp/contests/APG4b/tasks/APG4b_cg
https://atcoder.jp/contests/APG4b/tasks/APG4b_ch
https://atcoder.jp/contests/APG4b/tasks/APG4b_ci
https://atcoder.jp/contests/APG4b/tasks/APG4b_cj
https://atcoder.jp/contests/APG4b/tasks/APG4b_ck
https://atcoder.jp/contests/APG4b/tasks/APG4b_cl
https://atcoder.jp/contests/APG4b/tasks/APG4b_cm
https://atcoder.jp/contests/APG4b/tasks/APG4b_cn
https://atcoder.jp/contests/APG4b/tasks/APG4b_co
https://atcoder.jp/contests/APG4b/tasks/APG4b_cp
https://atcoder.jp/contests/APG4b/tasks/APG4b_cq
https://atcoder.jp/contests/APG4b/tasks/APG4b_cr
https://atcoder.jp/contests/APG4b/tasks/APG4b_cs
https://atcoder.jp/contests/APG4b/tasks/APG4b_ct
https://atcoder.jp/contests/APG4b/tasks/APG4b_cu
https://atcoder.jp/contests/APG4b/tasks/APG4b_cv
https://atcoder.jp/contests/abc001/tasks/abc001_1
输入H1,H2,输出H1-H2
https://atcoder.jp/contests/abc001/tasks/abc001_2
输入N
如果N<100
输出00
否则如果N<=5000
输出N/100
否则如果N<=30000
输出N/1000+50
否则如果N<=70000
输出N/5000+74
否则输出89
输出如果不足两位,需要高位补零补到两位数
https://atcoder.jp/contests/abc001/tasks/abc001_3
输入风向和风力
转化为NEWS
和级别
https://atcoder.jp/contests/abc001/tasks/abc001_4
https://atcoder.jp/contests/abc002/tasks/abc002_1
输入X,Y,输出max(X,Y)
https://atcoder.jp/contests/abc002/tasks/abc002_2
输入一个字符串,删去所有的元音aeoiu
输出
https://atcoder.jp/contests/abc002/tasks/abc002_3
https://atcoder.jp/contests/abc002/tasks/abc002_4
https://atcoder.jp/contests/abc003/tasks/abc003_1
输入n,输出(n+1)*5000
https://atcoder.jp/contests/abc003/tasks/abc003_2
输入两个字符串,可以把@
替换为atcoder
中的任意一个字符
如果两个字符串可以相等,输出You can win
,否则输出You will lose
https://atcoder.jp/contests/abc003/tasks/abc003_3
https://atcoder.jp/contests/abc003/tasks/abc003_4
https://atcoder.jp/contests/abc004/tasks/abc004_1
输入n,输出2*n
https://atcoder.jp/contests/abc004/tasks/abc004_2
输入4x4
的字符矩阵,旋转180度,输出
https://atcoder.jp/contests/abc004/tasks/abc004_3
https://atcoder.jp/contests/abc004/tasks/abc004_4
https://atcoder.jp/contests/abc005/tasks/abc005_1
输入x和y,输出y除以x下取整
https://atcoder.jp/contests/abc005/tasks/abc005_2
输入N和N个数字,输出最小值
https://atcoder.jp/contests/abc005/tasks/abc005_3
https://atcoder.jp/contests/abc005/tasks/abc005_4
https://atcoder.jp/contests/abc006/tasks/abc006_1
输入n,问是不是3的倍数,输出YES或NO
https://atcoder.jp/contests/abc006/tasks/abc006_2
定义数列a
,a[1]=0
,a[2]=0
,a[3]=1
,a[i]=a[i-1]+a[i-2]+a[i-3]
输入n
,输出a[n]%10007
https://atcoder.jp/contests/abc006/tasks/abc006_3
https://atcoder.jp/contests/abc006/tasks/abc006_4
https://atcoder.jp/contests/abc007/tasks/abc007_1
输入n,输出n-1
https://atcoder.jp/contests/abc007/tasks/abc007_2
输入一个字符串,输出一个字典序更小的字符串
如果不存在,输出a
https://atcoder.jp/contests/atc002/tasks/abc007_3
https://atcoder.jp/contests/abc007/tasks/abc007_4
https://atcoder.jp/contests/abc008/tasks/abc008_1
输入S和T
问有多少个整数 在 S 和 T 之间 S<= .. <=T
cout<<T-S+1<<endl;
https://atcoder.jp/contests/abc008/tasks/abc008_2
输入N个人的投票选择,问哪个选择得票最多?
如果有多个得票最多的,输出任意一个?
https://atcoder.jp/contests/abc008/tasks/abc008_3
https://atcoder.jp/contests/abc008/tasks/abc008_4
https://atcoder.jp/contests/abc009/tasks/abc009_1
要双面打印n页,需要多少张纸
cout<<(n+1)/2<<endl;
https://atcoder.jp/contests/abc009/tasks/abc009_2
https://atcoder.jp/contests/abc009/tasks/abc009_3
https://atcoder.jp/contests/abc009/tasks/abc009_4
https://atcoder.jp/contests/abc010/tasks/abc010_1
输入一个字符串S,输出S和两个字母pp
https://atcoder.jp/contests/abc010/tasks/abc010_2
输入n个正整数
我们讨厌 模2余0 或 模3余2 的数字
每次操作可以把某个数减少1,
问至少操作多少次,可以让所有数字都不讨厌
https://atcoder.jp/contests/abc010/tasks/abc010_3
https://atcoder.jp/contests/abc010/tasks/abc010_4
https://atcoder.jp/contests/abc011/tasks/abc011_1
输入n
输出n月的下一个月是什么
https://atcoder.jp/contests/abc011/tasks/abc011_2
输入一个字符串,从0开始下标,偶数位大写,奇数位小写,输出
https://atcoder.jp/contests/abc011/tasks/abc011_3
https://atcoder.jp/contests/abc011/tasks/abc011_4
https://atcoder.jp/contests/abc012/tasks/abc012_1
输入 a, b
输出 b, a
cin >> a >> b;
cout << b << " " << a << endl;
fhttps://atcoder.jp/contests/abc012/tasks/abc012_2
输入秒数,转化为小时分钟秒,输出hh:mm:ss
https://atcoder.jp/contests/abc012/tasks/abc012_3
https://atcoder.jp/contests/abc012/tasks/abc012_4
https://atcoder.jp/contests/abc013/tasks/abc013_1
输入一个大写字母,输出这几个大写字母。A
是1
,Z
是26
。
ASCII
https://atcoder.jp/contests/abc013/tasks/abc013_2
输入两个1位数a和b
每次操作可以加一或者减一
特别的0可以操作成9,9可以操作成0
问从a操作到b至少需要几步?
https://atcoder.jp/contests/abc013/tasks/abc013_3
https://atcoder.jp/contests/abc013/tasks/abc013_4
https://atcoder.jp/contests/abc014/tasks/abc014_1
输入a和b,问在b的基础上至少加多少,可以让b是a的倍数
https://atcoder.jp/contests/abc014/tasks/abc014_2
一共N个物品,第i个物品价格是Ai,打算买X集合的物品
如果X的第i位是1,那么买第i个物品
如果X的第i位是0,那么不买第i个物品
问一共花多少钱
https://atcoder.jp/contests/abc014/tasks/abc014_3
输入n个区间,求出包含次数最多的数字被包含几次?
https://atcoder.jp/contests/abc014/tasks/abc014_4
https://atcoder.jp/contests/abc015/tasks/abc015_1
输入两个字符串,输出其中长度较长的
https://atcoder.jp/contests/abc015/tasks/abc015_2
输入n个数字
求和为s
求正数个数为c
输出s除以c上取整
https://atcoder.jp/contests/abc015/tasks/abc015_3
https://atcoder.jp/contests/abc015/tasks/abc015_4
https://atcoder.jp/contests/abc016/tasks/abc016_1
输入M和D
问 M%D 是否为0
https://atcoder.jp/contests/abc016/tasks/abc016_2
输入A,B,C三个数字,问A和B做加减中的什么运算能得到C?
如果只能加法,输出+
如果只能减法,输出-
如果加减法都可以,输出?
如果加减法都不可以,输出!
https://atcoder.jp/contests/abc016/tasks/abc016_3
https://atcoder.jp/contests/abc016/tasks/abc016_4
https://atcoder.jp/contests/abc017/tasks/abc017_1
输入s1,e1,s2,e2,s3,e3
输出(s1*e1+s2*e2+s3*e3)/10
https://atcoder.jp/contests/abc017/tasks/abc017_2
输入一个字符串,问是不是由 ch o k u 组成,输出YES或NO
https://atcoder.jp/contests/abc017/tasks/abc017_3
https://atcoder.jp/contests/abc017/tasks/abc017_4
https://atcoder.jp/contests/abc018/tasks/abc018_1
输入三个不同的数字,输出他们的排名
https://atcoder.jp/contests/abc018/tasks/abc018_2
输入一个字符串,操作数n和n个操作,每个操作是一个区间,翻转这个区间
输出n个操作之后的结果
https://atcoder.jp/contests/abc018/tasks/abc018_3
https://atcoder.jp/contests/abc018/tasks/abc018_4
https://atcoder.jp/contests/abc019/tasks/abc019_1
输入三个数a, b, c 输出中位数
https://atcoder.jp/contests/abc019/tasks/abc019_2
文字压缩,把连续相同的字母,换成字母和出现次数
比如aabbbaad会变成a2b3a2d1
https://atcoder.jp/contests/abc019/tasks/abc019_3
输入一个数组,每个数字的质因数2都约掉,问剩下多少个不同的数字?
https://atcoder.jp/contests/abc019/tasks/abc019_4
https://atcoder.jp/contests/abc020/tasks/abc020_a
只会输入1或2
输入 1
输出 ABC
输入 2
输出 chokudai
https://atcoder.jp/contests/abc020/tasks/abc020_b
输入两个十进制整数,输出这两个数字连起来的2倍
https://atcoder.jp/contests/abc020/tasks/abc020_c
https://atcoder.jp/contests/abc020/tasks/abc020_d
https://atcoder.jp/contests/abc021/tasks/abc021_a
输入一个N
把N拆成若干个二的次幂的和,输出任意一组解即可
把N拆成N个1就可以了
https://atcoder.jp/contests/abc021/tasks/abc021_b
输入n
输入a,b
输入k
输入k个整数pi
问a,b和k个整数pi是不是两两不同
https://atcoder.jp/contests/abc021/tasks/abc021_c
https://atcoder.jp/contests/abc021/tasks/abc021_d
https://atcoder.jp/contests/abc022/tasks/abc022_a
输入N,S,T
接下来N个数字表示体重
第一个数字表示第一天的体重
除了第一个数字之外,表示当天减前一天体重的差
问有多少天体重在S和T之间
https://atcoder.jp/contests/abc022/tasks/abc022_b
输入n和n个数字,输出n-不同数字的个数。
输入一个无向图,从1出发,走一个环,不经过重复的点重复的边最后回到1,问最小长度是多少?
https://atcoder.jp/contests/abc022/tasks/abc022_d
https://atcoder.jp/contests/abc023/tasks/abc023_a
输入一个两位数(10 ~ 99之间),输出个位+十位
https://atcoder.jp/contests/abc023/tasks/abc023_b
初始一个空字符串
第0次操作添加一个b
第1,4,7,...次操作在左边添加a
,右边添加c
第2,5,8,...次操作在左边添加c
,右边添加a
第3,6,9,...次操作在左边添加b
,右边添加b
第0次操作之后,字符串是b
第1次操作之后,字符串是abc
第2次操作之后,字符串是cabca
第3次操作之后,字符串是bcabcab
输入一个字符串,问是第几次操作之后的,无解输出-1
https://atcoder.jp/contests/abc023/tasks/abc023_c
https://atcoder.jp/contests/abc023/tasks/abc023_d
https://atcoder.jp/contests/abc024/tasks/abc024_a
儿童票A元,成人票B元,团体票C元,保证C<=B<=A
团体票必须大于等于K个人才能用
现在有S个儿童,T个成人,问买票需要多少钱?
https://atcoder.jp/contests/abc024/tasks/abc024_b
输入区间个数n,区间长度T,和n个区间的起点,问这些区间的并集多长
https://atcoder.jp/contests/abc024/tasks/abc024_c
https://atcoder.jp/contests/abc024/tasks/abc024_d
https://atcoder.jp/contests/abc025/tasks/abc025_a
输入5个有序的字母,从中有顺序的选两个(可以重复)可以得到25个单词
问这些单词中第N个是什么
https://atcoder.jp/contests/abc025/tasks/abc025_b
输入n和上下限A和B
接下来n次移动,先是一个单词West和East表示方向,接下来一个距离di
如果di小于A,那么会被改成A
如果di大于B,那么会被改成B
问最后停留的位置是什么?
如果在起点的East方向,那么输出East和距离
如果在起点的West方向,那么输出West和距离
如果在起点,那么输出 0
https://atcoder.jp/contests/abc025/tasks/abc025_c
https://atcoder.jp/contests/abc025/tasks/abc025_d
https://atcoder.jp/contests/abc026/tasks/abc026_a
输入一个正偶数A,把A分成两个正整数的和,让这两个正整数的成绩最大
https://atcoder.jp/contests/abc026/tasks/abc026_b
输入N个同心圆的半径,从最外层开始,红色和白色交替
问红色的总面积是多少?
https://atcoder.jp/contests/abc026/tasks/abc026_c
https://atcoder.jp/contests/abc026/tasks/abc026_d
https://atcoder.jp/contests/abc027/tasks/abc027_a
给定一个矩形三边的长度。 求剩余一边的长度。
https://atcoder.jp/contests/abc027/tasks/abc027_b
输入n座岛的人口,目标让所有的岛人口相同,要在相邻的岛之间造桥
问至少造多少座桥?
https://atcoder.jp/contests/abc027/tasks/abc027_c
https://atcoder.jp/contests/abc027/tasks/abc027_d
https://atcoder.jp/contests/abc028/tasks/abc028_a
输入一个数字N
如果N<=59
输出Bad
如果60<=N<=89
输出Good
如果90<=N<=99
输出Great
如果N==100
输出Perfect
https://atcoder.jp/contests/abc028/tasks/abc028_b
输入一个只包含ABCDEF
的字符串
输出ABCDEF
六个字符出现的次数
https://atcoder.jp/contests/abc028/tasks/abc028_c
https://atcoder.jp/contests/abc028/tasks/abc028_d
https://atcoder.jp/contests/abc029/tasks/abc029_a
输入一个字符串,结尾加s
输出
https://atcoder.jp/contests/abc029/tasks/abc029_b
输入12个字符串,问其中有多少个字符串包含字母r
https://atcoder.jp/contests/abc029/tasks/abc029_c
https://atcoder.jp/contests/abc029/tasks/abc029_d
https://atcoder.jp/contests/abc030/tasks/abc030_a
输入A,B,C,D
如果B/A<D/C
,那么输出AOKI
如果B/A==D/C
,那么输出DRAW
如果B/A>D/C
,那么输出TAKAHASHI
https://atcoder.jp/contests/abc030/tasks/abc030_b
n 时 m 分,时针和分针夹角是多少度?
https://atcoder.jp/contests/abc030/tasks/abc030_c
https://atcoder.jp/contests/abc030/tasks/abc030_d
https://atcoder.jp/contests/abc031/tasks/abc031_a
输入A
和D
可以让A自增1或者D自增1
问最大可以让A*D
变成多大?
https://atcoder.jp/contests/abc031/tasks/abc031_b
https://atcoder.jp/contests/abc031/tasks/abc031_c
https://atcoder.jp/contests/abc031/tasks/abc031_d
https://atcoder.jp/contests/abc032/tasks/abc032_a
输入a,b,n
问大于等于n的数字中,既是a的倍数,又是b的倍数,最小是多少?
https://atcoder.jp/contests/abc032/tasks/abc032_b
输入字符串 s 和长度 k
问字符串 s 的长度为 k 的子串中,有多少个不同的字符串
abcabc 的长度为 2 的子串有 5 个{ab, bc, ca, ab, bc} 但不同的只有三个 {ab, bc, ca}
https://atcoder.jp/contests/abc032/tasks/abc032_c
https://atcoder.jp/contests/abc032/tasks/abc032_d
https://atcoder.jp/contests/abc033/tasks/abc033_a
输入一个四位数N,如果四位都相同,输出SAME
,否则输出DIFFERENT
。
https://atcoder.jp/contests/abc033/tasks/abc033_b
投票取名,输入n个选项对应的人数,问是否有选项大于一半?
如果有,输出对应的字符串,如果没有,输出 atcoder
https://atcoder.jp/contests/abc033/tasks/abc033_c
https://atcoder.jp/contests/abc033/tasks/abc033_d
https://atcoder.jp/contests/abc034/tasks/abc034_a
输入两个不相等的数字,如果第二个更大,输出Better
,如果第一个更大,输出Worse
https://atcoder.jp/contests/abc034/tasks/abc034_b
已知1和2一对,3和4一对,5和6一对……
输入n,问n和谁一对?
https://atcoder.jp/contests/abc034/tasks/abc034_c
https://atcoder.jp/contests/abc034/tasks/abc034_d
https://atcoder.jp/contests/abc035/tasks/abc035_a
输入W和H,问W:H
是4:3
还是16:9
https://atcoder.jp/contests/abc035/tasks/abc035_b
输入LRDU?序列,把?替换成LRDU之一,按照这个序列走,问离起点最远最近是多少?
https://atcoder.jp/contests/abc035/tasks/abc035_c
https://atcoder.jp/contests/abc035/tasks/abc035_d
https://atcoder.jp/contests/abc036/tasks/abc036_a
输入A和B,输出B/A上取整
https://atcoder.jp/contests/abc036/tasks/abc036_b
输入N行N列字符矩阵,输出顺时针旋转90度的结果
https://atcoder.jp/contests/abc036/tasks/abc036_c
https://atcoder.jp/contests/abc036/tasks/abc036_d
https://atcoder.jp/contests/abc037/tasks/abc037_a
白馒头A元一个,绿馒头B元一个,初始有C元,问最多买几个馒头?
https://atcoder.jp/contests/abc037/tasks/abc037_b
长度为N
的数组,Q
次操作,每次操作区间把区间L
到R
都修改成T
问最后数组是多少?
https://atcoder.jp/contests/abc037/tasks/abc037_c
https://atcoder.jp/contests/abc037/tasks/abc037_d
https://atcoder.jp/contests/abc038/tasks/abc038_a
输入一个字符串,问是不是以T
结尾,输出YES
或NO
https://atcoder.jp/contests/abc038/tasks/abc038_b
输入两个矩形的长宽,问能不能把两个矩形按某条边对齐,拼成一个更大的矩形
输出Yes
或No
https://atcoder.jp/contests/abc038/tasks/abc038_c
https://atcoder.jp/contests/abc038/tasks/abc038_d
https://atcoder.jp/contests/abc039/tasks/abc039_a
输入立方体的长A,宽B,高C,问表面积是多少?
https://atcoder.jp/contests/abc039/tasks/abc039_b
输入N,输出N的四次方根,保证四次方根是整数
https://atcoder.jp/contests/abc039/tasks/abc039_c
钢琴键盘是
WBWBWWBWBWBW WBWBWWBWBWBW WBWBWWBWBWBW ...
无限循环,循环节长度是 12
这12个键对应的音阶是
Do,Do,Re,Re,Mi,Fa,Fa,So,So,La,La, Si
输入当前位置和当前位置右边共20个键而定颜色(B或W)
问当前位置的音节是什么
输入格式 一个字符串,W表示白色,B表示黑色
输出格式 音阶中的一个,高桥君所在的键盘颜色与输入的第一个相对应
https://atcoder.jp/contests/abc039/tasks/abc039_d
输入一个字符矩阵,问是否可能由一个字符矩阵扩散得到
扩散:每个#
往8个方向扩散
如果可以,输出possible和方案
如果不可以,输出impossible
https://atcoder.jp/contests/abc040/tasks/abc040_a
一共n个球,第x个球是青色的,其他的球是赤色的
每次操作可以交换两个相邻的球
希望把青色的球换到最左端或最右端
问至少需要几次操作?
https://atcoder.jp/contests/abc040/tasks/abc040_b
https://atcoder.jp/contests/abc040/tasks/abc040_c
从1走到n,从i可以走到i+1或i+2,代价是高度之差的绝对值,问最小待机啊
https://atcoder.jp/contests/abc040/tasks/abc040_d
https://atcoder.jp/contests/abc041/tasks/abc041_a
输入一个字符串s,问第i个字母是什么
https://atcoder.jp/contests/abc041/tasks/abc041_b
输入正方体的长宽高A,B,C
https://atcoder.jp/contests/abc041/tasks/abc041_c
https://atcoder.jp/contests/abc041/tasks/abc041_d
输入一个DAG问有多少种拓扑排序
https://atcoder.jp/contests/abc042/tasks/abc042_a
输入三个数字a, b, c
问重排之后能不能得到5, 7, 5
输出YES或NO
https://atcoder.jp/contests/abc042/tasks/abc042_b
输入N个长度为L的字符串,希望连接起来字典序最小,问如何连接?
https://atcoder.jp/contests/abc043/tasks/abc043_a
输入n,问1+2+3+...+n
是多少?
https://atcoder.jp/contests/abc043/tasks/abc043_b
模拟输入窗口
如果是0,输入0
如果是1,输入1
如果是B,删除最后一个字符,但如果字符串已经被删空了,什么都不会发生
问最终结果是什么
https://atcoder.jp/contests/abc044/tasks/abc044_a
要住N
晚酒店,每晚X
元,如果住够了K
晚,之后每晚Y(Y<X)
元
输入N,K,X,Y
问需要花多少元?
https://atcoder.jp/contests/abc044/tasks/abc044_b
输入一个字符串,问是不是每个字母都出现了偶数次
https://atcoder.jp/contests/abc045/tasks/abc045_a
输入梯形的上底a,下底b,高h
输出面积,保证整数
https://atcoder.jp/contests/abc045/tasks/abc045_b
A B C 三个人打牌,牌有 a b c 三种,必须按顺序从前往后出(不需要决策)
A 先出,上一张出什么字母,下一张就轮到哪个人出牌
如果轮到一个人,这个人无牌可出,那么这个人就赢了
问谁能赢
https://atcoder.jp/contests/abc046/tasks/abc046_a
输入三个数字,问有几种不同的数字?
https://atcoder.jp/contests/abc046/tasks/abc046_b
N 个球染 K 种颜色,要求相邻的球颜色不同,问方案数?
https://atcoder.jp/contests/abc047/tasks/abc047_a
输入三个数字,问其中有没有两个的和是第三个,输出Yes
或No
https://atcoder.jp/contests/abc047/tasks/abc047_b
输入左下角为 (0,0) 右上角为 (W,H) 的矩形,和N个操作
每个操作是xi, yi, ai
如果ai==1
,会把 < xi 的区域涂黑
如果ai==2
,会把 > xi 的区域涂黑
如果ai==3
,会把 < yi 的区域涂黑
如果ai==4
,会把 > yi 的区域涂黑
问最后没被涂黑的面积是多少
https://atcoder.jp/contests/abc048/tasks/abc048_a
输入三个字符串,输出三个字符串各自的第一个字符
https://atcoder.jp/contests/abc048/tasks/abc048_b
输入a, b, x 问 a 到 b 之间有多少个 x 的倍数?
https://atcoder.jp/contests/abc049/tasks/abc049_a
输入一个小写字母,问是不是元音
https://atcoder.jp/contests/abc049/tasks/abc049_b
输入一个H行W列的字符矩阵,把每行重复两遍输出
https://atcoder.jp/contests/abc050/tasks/abc050_a
输入A op B
其中A
和B
是整数,op
是加号或减号
输出计算结果
https://atcoder.jp/contests/abc050/tasks/abc050_b
输入N个数字Ti
有M个询问,第i个询问是问
如果把第Pi个数字改成Xi,那么这N个数字之和是多少?
(注意并不是真的改)
https://atcoder.jp/contests/abc051/tasks/abc051_a
输入一个字符串,把第6位和第14位的字符替换成空格
https://atcoder.jp/contests/abc051/tasks/abc051_b
输入K
和S
问有多少组(X,Y,Z)
满足0<=X,Y,Z<=K
且X+Y+Z==S
https://atcoder.jp/contests/abc051/tasks/abc051_c
https://atcoder.jp/contests/abc051/tasks/abc051_d
https://atcoder.jp/contests/abc052/tasks/abc052_a
输入 A乘B 和 C乘D 的两个矩形,输出其中较大的面积
https://atcoder.jp/contests/abc052/tasks/abc052_b
一个变量初始为0,输入一个操作序列S,I
表示增加一,D
表示减少一
问这个变量的到过的最大值是多少?
https://atcoder.jp/contests/abc053/tasks/abc053_a
输入x,如果x<1200输出ABC,如果x>=1200输出ARC
https://atcoder.jp/contests/abc053/tasks/abc053_b
输入一个字符串,找到最长的一个子串,以A开始,以Z结束
保证有解,输出最长的长度。
https://atcoder.jp/contests/abc054/tasks/abc054_a
输入两个扑克牌数字1到13之间,问哪个大?2最小,1最大。
第一个数字大输出Alice
第二个数字大输出Bob
一样大输出Draw
https://atcoder.jp/contests/abc054/tasks/abc054_b
输入一个N*N
的字符矩阵A,和M*M
的字符矩阵B
问A是否包含B,B不能旋转和对称
https://atcoder.jp/contests/abc054/tasks/abc054_c
https://atcoder.jp/contests/abc054/tasks/abc054_d
https://atcoder.jp/contests/abc055/tasks/abc055_a
800日元一顿饭,每吃15顿可以获得200日元的优惠,问吃n顿花多少钱
https://atcoder.jp/contests/abc055/tasks/abc055_b
输入N,输出N的阶乘,模1000000007
https://atcoder.jp/contests/abc056/tasks/abc056_a
输入两个字母,相同输出H,不同输出D
https://atcoder.jp/contests/abc056/tasks/abc056_b
输入W,a,b
两个区间[a, a+W],[b, b+W]
要向左或向右移动[b, b+W]使得两个区间有交集,问最少移动多少距离?
https://atcoder.jp/contests/abc057/tasks/abc057_a
现在时间是A点整,问B小时之后是几点整,输出一个0到23之间的数字
https://atcoder.jp/contests/abc057/tasks/abc057_b
有N个学生,M个检查站,
第i个学生的坐标是(ai, bi)
第i个检查站的坐标是(ci, di)
对于每个学生,输出曼哈顿距离最近的检查站的下标
如果有多个检查站距离相等,输出下标最小的
第i个学生到第j个检查站的曼哈顿距离是abs(a[i]-c[j])+abs(b[i]-d[j])
https://atcoder.jp/contests/abc057/tasks/abc057_c
https://atcoder.jp/contests/abc057/tasks/abc057_d
输入n个数字,从中至少选A个,至多选B个,问最大平均值
https://atcoder.jp/contests/abc058/tasks/abc058_a
输入三个数字a,b,c
如果b-a==c-b
输出YES
否则输出NO
https://atcoder.jp/contests/abc058/tasks/abc058_b
输入两个字符串O和E
已知O是密码的所有奇数位置(从1开始下标)
已知E是密码的所有偶数位置(从1开始下标)
复原密码
https://atcoder.jp/contests/abc059/tasks/abc059_a
输入三个单词,输出三个单词的首字母大写
https://atcoder.jp/contests/abc059/tasks/abc059_b
输入两个数字A
和B
如果A
大于B
,输出GREATER
如果A
等于B
,输出EQUAL
如果A
小于B
,输出LESS
注意A
和B
的范围!
https://atcoder.jp/contests/abc060/tasks/abc060_a
输入三个字符串A, B, C
问是否A的最后一个字母等于B的第一个字母且B的最后一个字母等于C第一个字母
输出YES或NO
https://atcoder.jp/contests/abc060/tasks/abc060_b
输入A,B,C
问是否存在A的倍数,模B,余数是C,输出YES或NO
https://atcoder.jp/contests/abc061/tasks/abc061_a
输入三个数字A, B, C
问C是否在A和B之间
https://atcoder.jp/contests/abc061/tasks/abc061_b
输入一个图,问每个点的度数是多少
第一行N个点,M条边
接下来M行,每行两个数字,表示一条边
https://atcoder.jp/contests/abc061/tasks/abc061_c
https://atcoder.jp/contests/abc061/tasks/abc061_d
https://atcoder.jp/contests/abc062/tasks/abc062_a
输入x和y,问这两个月份的天数是否一样
https://atcoder.jp/contests/abc062/tasks/abc062_b
输入H行W列的字符数组,输出外面包一圈#
的结果
https://atcoder.jp/contests/abc063/tasks/abc063_a
输入两个数字,输出他们的和,但如果和大于等于10,输出error
https://atcoder.jp/contests/abc063/tasks/abc063_b
输入字符串S,问S中字母是不是互不相同的
输出yes或no
https://atcoder.jp/contests/abc064/tasks/abc064_a
输入r g b
三个一位数,问把这三个连成一个三位数,是否是4的倍数,输出YES
或NO
https://atcoder.jp/contests/abc064/tasks/abc064_b
输入N个点,从中选两个点,选出的两个点之间距离最大是多少?
https://atcoder.jp/contests/abc064/tasks/abc064_c
https://atcoder.jp/contests/abc064/tasks/abc064_d
https://atcoder.jp/contests/abc065/tasks/abc065_a
买了一个保质期A天的食物,B天后吃掉它,问会怎样
如果在保质期之前包括当天(B<=A
)吃掉,输出delicious
如果过期不到X天(B<=A+X
)吃掉,输出safe
如果过期超过X天(B>A+X
)吃掉,输出dangerous
https://atcoder.jp/contests/abc065/tasks/abc065_b
有N个按钮,任何时候都只有一个按钮会亮
如果按钮i是亮的,按一下按钮i,按钮i会灭,然后按钮ai变亮
按一个不亮的按钮,没有任何效果
初始按钮1是亮的,目标让按钮2变亮
问至少操作几次
https://atcoder.jp/contests/abc066/tasks/abc066_a
有三个车铃,价格分别是 a, b, c 买其中便宜的两个需要多少钱
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a >> b >> c; cout << min(a + b, min(b + c, c + a)); }
https://atcoder.jp/contests/abc066/tasks/abc066_b
输入一个字符串,在结尾删掉尽量少的字符,要求留下的字符串长度为偶数并且前一半和后一半相同
问留下的字符串最长多长?
https://atcoder.jp/contests/abc067/tasks/abc067_a
输入A和B,如果A,B,A+B三个数字中有3的倍数,输出Possible
,否则输出Impossible
https://atcoder.jp/contests/abc067/tasks/abc067_b
输入n个数,输出前k大的数的总和
https://atcoder.jp/contests/abc068/tasks/abc068_a
输入一个三位数N,输出三个字母ABC和数字N,比如输入123,输出ABC123
https://atcoder.jp/contests/abc068/tasks/abc068_b
输入N,问小于等于N,最大的2的次幂是多少?
https://atcoder.jp/contests/abc069/tasks/abc069_a
画n条横线,m条竖线,问有多少个方格?(参考样例)
https://atcoder.jp/contests/abc069/tasks/abc069_b
输入一个字符串,输出第一个字母,字符串长度减2,最后一个字母
https://atcoder.jp/contests/abc070/tasks/abc070_a
输入三位数N,问是不是回文数?
https://atcoder.jp/contests/abc070/tasks/abc070_b
甲在时刻A秒按下按钮,时刻B秒松开按钮
乙在时刻C秒按下按钮,时刻D秒松开按钮
问甲乙同时按下按钮多少秒?
https://atcoder.jp/contests/abc070/tasks/abc070_c
https://atcoder.jp/contests/abc070/tasks/abc070_d
https://atcoder.jp/contests/abc071/tasks/abc071_a
输入x, a, b
问x离a近还是离b近,输出A
或B
,保证不一样近
https://atcoder.jp/contests/abc071/tasks/abc071_b
输入一个字符串,问字典序最小没有出现过的字母是什么?
如果a到z都出现过,输出None
https://atcoder.jp/contests/abc073/tasks/abc072_a
输入X和t,一个沙漏,初始X的沙子,每秒漏1的沙子,问t秒后剩多少沙子
https://atcoder.jp/contests/abc072/tasks/abc072_b
https://atcoder.jp/contests/abc073/tasks/abc073_a
输入一个二位数,问是否包含9
https://atcoder.jp/contests/abc073/tasks/abc073_c
输入N个区间,区间之间不重叠,问总共包含多少个数字
区间两端都算包含,比如24到30的区间一共是7个数字
输入N个互不相交的区间,第i个区间是li到ri,包含两个端点
问所有区间内有多少个整数
https://atcoder.jp/contests/abc073/tasks/abc073_c
输入N个数字,问其中有几种数字出现了奇数次?
map练习题
https://atcoder.jp/contests/abc073/tasks/abc073_d
https://atcoder.jp/contests/abc074/tasks/abc074_a
输入N和A,N乘以N的网格,其中A个格子被染色了,问没有被染色的格子有多少个?
https://atcoder.jp/contests/abc074/tasks/abc074_b
N个球,长度为K的区间,两个机器人在0和K的位置上,中间有N个球,位置是Xi
机器人捡球,同时只能捡一个球,问机器人移动距离最小是多少?
https://atcoder.jp/contests/abc075/tasks/abc075_a
输入三个数字A, B, C,其中两个相同,第三个不同
输出不同的那个数字
https://atcoder.jp/contests/abc075/tasks/abc075_b
生成扫雷地图
输入一个H行W列的字符数组,#
表示雷,.
表示空地
把空地替换成周围雷的个数
https://atcoder.jp/contests/abc075/tasks/abc075_c
https://atcoder.jp/contests/abc075/tasks/abc075_d
https://atcoder.jp/contests/abc076/tasks/abc076_a
输入R和G,问什么数字和R的平均值是G?
https://atcoder.jp/contests/abc076/tasks/abc076_b
初始是1
,每次操作可以+K
或者*2
,问N
次操作之后最小是多少?
https://atcoder.jp/contests/abc076/tasks/abc076_c
https://atcoder.jp/contests/abc076/tasks/abc076_d
https://atcoder.jp/contests/abc077/tasks/abc077_a
输入2行3列的字符矩阵,每个字符表示一种颜色,问旋转180度之后和自己是否一样
https://atcoder.jp/contests/abc077/tasks/abc077_b
输入N
,输出小于等于N
最大的完全平方数。
https://atcoder.jp/contests/abc078/tasks/abc078_a
输入两个字符,是ABCEDF
中的一个,问是<=>
三个关系中的哪个关系?
https://atcoder.jp/contests/abc078/tasks/abc078_b
一个长度为X厘米的椅子,每个人坐下需要Y厘米的空间,相邻两个人,人和椅子的端点间隔至少Z厘米。
https://atcoder.jp/contests/abc079/tasks/abc079_a
输入一个长度为4的字符串,如果其中有连续三位一样,那么输出Yes,否则输出No
https://atcoder.jp/contests/abc079/tasks/abc079_b
L[0]=2, L[1]=1, L[i]=L[i-1]+L[i-2]
输入N
,输出L[N]
https://atcoder.jp/contests/abc079/tasks/abc079_c
https://atcoder.jp/contests/abc079/tasks/abc079_d
https://atcoder.jp/contests/abc080/tasks/abc080_a
输入N A B
输出N*A
和B
的较小值
https://atcoder.jp/contests/abc080/tasks/abc080_b
输入N
,设f(N)
是N
各个位之和
问N
是否是f(N)
的倍数,输出Yes
或No
https://atcoder.jp/contests/abc080/tasks/abc080_c
https://atcoder.jp/contests/abc080/tasks/abc080_d
https://atcoder.jp/contests/abc081/tasks/abc081_a
输入长度为3的字符串,问其中有多少个字符1
https://atcoder.jp/contests/abc081/tasks/abc081_b
输入一个数组,如果所有数字都是偶数,每次操作可以让所有数字都除以2
问至多执行几次操作?
https://atcoder.jp/contests/abc082/tasks/abc082_a
输入两个整数,输出他们的平均值,向上取整
输入两个字符串s
和t
,可以重排这两个字符串得到s'
和t'
问有没有可能s'<t'
,输出Yes
或No
https://atcoder.jp/contests/abc083/tasks/abc083_a
天平左边放A和B,右边放C和D,问哪边重?
https://atcoder.jp/contests/abc083/tasks/abc083_b
输入N
,A
,B
问1
到N
之间有多少个数字各个位之和在A
到B
之间
https://atcoder.jp/contests/abc084/tasks/abc084_a
现在是12月30日的M点整,问还有多少小时元旦?
https://atcoder.jp/contests/abc084/tasks/abc084_b
输入两个数字A和B和长度为A+B+1的字符串S
问S是不是由A个数字加一个减号-
加B个数字组成的,输出Yes或No
https://atcoder.jp/contests/abc084/tasks/abc084_c
https://atcoder.jp/contests/abc084/tasks/abc084_d
https://atcoder.jp/contests/abc085/tasks/abc085_a
输入一个日期yyyy/mm/dd
保证是2017年1月的日期,输出2018/01/dd
https://atcoder.jp/contests/abc085/tasks/abc085_b
输入N
个数字,问其中有几种不同的数字
https://atcoder.jp/contests/abc085/tasks/abc085_c
有1000,5000,10000三种面值的纸币
问N张纸币的总面值,是否可能是Y,输出Yes
或No
https://atcoder.jp/contests/abc085/tasks/abc085_d
https://atcoder.jp/contests/abc086/tasks/abc086_a
输入两个整数a和b,问a*b
是奇数还是偶数,输出Odd或Even
https://atcoder.jp/contests/abc086/tasks/abc086_b
输入两个整数a和b,问a和b连接起来是不是完全平方数?
https://atcoder.jp/contests/abc087/tasks/abc087_a
初始有X元,先买一个A元的东西,再尽可能多的买B元的东西
问最后剩下多少钱?
https://atcoder.jp/contests/abc087/tasks/abc087_b
A个500元,B个100元,C个50元,问凑出X元有多少种方法?
https://atcoder.jp/contests/abc088/tasks/abc088_a
有A个1元硬币,无限多个500元硬币,问能否恰好支付N元?
https://atcoder.jp/contests/abc088/tasks/abc088_b
输入长度为N的数组,双方轮流取,每次取剩下的数字中最大的
问 先手取到的数字之和 减去 后手取到的数字之和 是多少?
https://atcoder.jp/contests/abc088/tasks/abc088_c
https://atcoder.jp/contests/abc088/tasks/abc088_d
https://atcoder.jp/contests/abc089/tasks/abc089_a
N个学生分成若干组,使得至少三人的组数最多,问最多可以多少组
https://atcoder.jp/contests/abc089/tasks/abc089_b
输入N和N个字符,问出现了几种字符
保证只会有PWGY
四种字符,且PWG
一定出现(答案是3或4)
https://atcoder.jp/contests/abc089/tasks/abc089_c
https://atcoder.jp/contests/abc089/tasks/abc089_d
https://atcoder.jp/contests/abc090/tasks/abc090_a
输入一个3x3
的字符矩阵
输出左上到右下的三个字符
https://atcoder.jp/contests/abc090/tasks/abc090_b
输入A和B,问A到B之间多少个数字是回文数?
保证A和B都是5位数
https://atcoder.jp/contests/abc091/tasks/abc091_a
有两个硬币,一个面值是A元,一个面值是B元,问能否买价格为C元的的东西
输出Yes
或No
https://atcoder.jp/contests/abc091/tasks/abc091_b
输入n个字符串数组s和m个字符串数组t
找到一个字符串使得s中出现的-t中出现的次数最大。
只需要输出这个最大的差值。
https://atcoder.jp/contests/abc092/tasks/abc092_a
做一件事分两步
做第一步有两种方法,代价分别是A
和B
做第二步有两种方法,代价分别是C
和D
问做这件事最小代价是多少?min(A,B)+min(C,D)
https://atcoder.jp/contests/abc092/tasks/abc092_b
输入N,D,X和N个数字Ai
一共D天,标号从1到D
第i个人会在第1
,第Ai+1
,第2*Ai+1
天,一直到结束,中的每天吃掉一个巧克力
最后会剩下X个巧克力
问开始需要准备多少个巧克力
https://atcoder.jp/contests/abc093/tasks/abc093_a
输入长度为3的字符串,问重排之后能不能得到abc
输出Yes
或No
https://atcoder.jp/contests/abc093/tasks/abc093_b
输入区间A,B和数字K
输出A和B之间所有是最小K个,或最大K个的数字
https://atcoder.jp/contests/abc094/tasks/abc094_a
有A+B
个动物,其中A
个一定是猫,B
个可能是猫可能是狗
问是否可能有恰好X
只猫,输出YES
或NO
https://atcoder.jp/contests/abc094/tasks/abc094_b
输入N,M,X和M个正整数Ai
一共N+1个格子,标号从0到N
从标号为X的格子出发,每次可以向前或向后
其中M个格子收费,标号为Ai,保证0,X,N不收费
问从X出发走到0或N最小代价是多少?
https://atcoder.jp/contests/abc095/tasks/abc095_a
输入一个长度为3的字符串
输出700+(o的个数)*100
https://atcoder.jp/contests/abc095/tasks/abc095_b
输入N种点心,X克原料,第i种点心需要mi的原料
要求每种点心至少做一个,问至多做多少个点心
https://atcoder.jp/contests/abc096/tasks/abc096_a
输入a和b,问从1月1日到a月b日,有多少天,月份和日期相同?
https://atcoder.jp/contests/abc096/tasks/abc096_b
输入A,B,C三个数字,可以执行K次操作,每次选一个数字乘以2,问最后最大的和是多少?
https://atcoder.jp/contests/abc096/tasks/abc096_c
输入一个图案,#
表示涂黑,.
表示空白,问能不能用1*2
的画笔画出
如果有孤立的1*1
的#
就不行
https://atcoder.jp/contests/abc096/tasks/abc096_d
输入n个质数,使得任意5个质数的和都是合数
输入前n个质数,包括2
https://atcoder.jp/contests/abc097/tasks/abc097_a
输入数轴上三个人的位置a, b, c
距离小于等于d
的两个人连通,问三个人是否连通
https://atcoder.jp/contests/abc097/tasks/abc097_b
输入X,输出小于等于X,最大的次幂
次幂是可以表示为正整数A的正整数B次方,B大于等于2
https://atcoder.jp/contests/abc098/tasks/abc098_a
输入A和B
输出A+B A-B A*B
三个数字中较大的
https://atcoder.jp/contests/abc098/tasks/abc098_b
输入一个字符串,分成前后两端,希望让同时出现在前后的字母种类最多,问最多多少种?
https://atcoder.jp/contests/abc099/tasks/abc099_a
输入一个数字N,如果小于1000,输出ABC
否则输出ABD
https://atcoder.jp/contests/abc099/tasks/abc099_b
输入a
和b
,求x
,使得a+x
和b+x
是相邻的三角数,保证有解
三角数是指可以表示为n*(n+1)/2
的数字
https://atcoder.jp/contests/abc099/tasks/abc099_c
用6的次幂和9的次幂凑出N,问至少需要几个数字?
https://atcoder.jp/contests/abc099/tasks/abc099_d
https://atcoder.jp/contests/abc100/tasks/abc100_a
输入两个数字,如果都<=8
,那么输出Yay!
,否则输出:(
https://atcoder.jp/contests/abc100/tasks/abc100_b
输入D和N
输出第N
是100的D次方的倍数
且
不是100的D+1次方的倍数
的数字
https://atcoder.jp/contests/abc100/tasks/abc100_c
https://atcoder.jp/contests/abc100/tasks/abc100_d
https://atcoder.jp/contests/abc101/tasks/abc101_a
输入一个长度为4,由+-
组成的字符串
输入(+的个数) - (-的个数)
https://atcoder.jp/contests/abc101/tasks/abc101_b
设 S(n) 表示 n 各个位之和,比如 S(101) = 2
输入 n 问 S(n) 是不是 n 的约数,输出Yes或No
https://atcoder.jp/contests/abc102/tasks/abc102_a
输入n,输出 lcm(2, n)
lcm表示最小公倍数
https://atcoder.jp/contests/abc102/tasks/abc102_b
输入数组A
,从中选两个数字,差值越大越好
问最大的差值是多少?
https://atcoder.jp/contests/abc103/tasks/abc103_a
一共3个任务
完成第一个任务0的代价
如果上一个完成的是ai,之后完成aj的代价是abs(ai-aj)
问如何完成三个任务代价最小
https://atcoder.jp/contests/abc103/tasks/abc103_b
输入两个字符串S和T,问能否将S循环移位后让S和T相等
循环移位是指把最后若干个字符移到字符串开始
https://atcoder.jp/contests/abc103/tasks/abc103_c
输入n个数字 ai
找一个数字m,使得 最大,问最大多大?
https://atcoder.jp/contests/abc103/tasks/abc103_d
https://atcoder.jp/contests/abc104/tasks/abc104_a
输入一个rating值R
如果R<1200
,那么输出ABC
如果1200<=R<2800
,那么输出ARC
如果2800<=R
,那么输出AGC
https://atcoder.jp/contests/abc104/tasks/abc104_b
输入字符串S,问是否满足以下所有条件,输出Yes或No
第一个字母是大写A
从第三个字符到倒数第二个字符,恰好出现一个大写C
除了上面提到的A和C,所有字母都是小写
https://atcoder.jp/contests/abc104/tasks/abc104_c
https://atcoder.jp/contests/abc104/tasks/abc104_d
https://atcoder.jp/contests/abc105/tasks/abc105_a
N个东西分给K个人,希望拿最多的人和拿最少的人之间的差越少越好,问最少是多少?
https://atcoder.jp/contests/abc105/tasks/abc105_b
蛋糕4元一个,甜甜圈7元一个
输入N元,要求买至少两个蛋糕,至少两个甜甜圈,问能否恰好花N元
https://atcoder.jp/contests/abc105/tasks/abc105_c
https://atcoder.jp/contests/abc105/tasks/abc105_d
https://atcoder.jp/contests/abc106/tasks/abc106_a
A行B列的网格,删掉一行一列,问剩下多少个格子?
https://atcoder.jp/contests/abc106/tasks/abc106_b
问1到n中有几个奇数恰好有8个约数
https://atcoder.jp/contests/abc106/tasks/abc106_c
输入一个数字串S,只包含1
到9
一次操作会把数字x替换为x个x,比如1214
会变成12214444
对数字串S做5e15次操作,问第K个字符是什么?
相当于第一个非1的数字重复无限次,问第K个字符是什么
相当于只需要第一个非1的数字是什么,下标是什么
https://atcoder.jp/contests/abc106/tasks/abc106_d
https://atcoder.jp/contests/abc107/tasks/abc107_a
一共N节车厢,问正数第i节车厢是倒数第几节车厢?
https://atcoder.jp/contests/abc107/tasks/abc107_b
输入H
行W
列,包含.
和#
的字符矩阵
删去全是.
的行和列,输出剩下的字符矩阵
https://atcoder.jp/contests/abc108/tasks/abc108_a
输入K,问从1到K中选一个奇数和一个偶数有多少种方案?
https://atcoder.jp/contests/abc108/tasks/abc108_b
已知(x1,y1),(x2,y2),(x3,y3),(x4,y4)
是一个正方形的四个顶点,按逆时针顺序
已知(x1,y1),(x2,y2)
的坐标
求(x3,y3),(x4,y4)
的坐标
https://atcoder.jp/contests/abc109/tasks/abc109_a
输入两个数字A和B,问乘积是否是奇数,输出Yes
或No
https://atcoder.jp/contests/abc109/tasks/abc109_b
输入n
和n
个字符串,问有没有重复的
如果有重复的,输出No
,否则输出Yes
https://atcoder.jp/contests/abc109/tasks/abc109_c
数轴上有n个点,第i个点的坐标是xi
我们的起点是X,目标是访问所有点
出发之前我们要选一个整数D,之后每次移动,只能是加D或者减D
问D最大是多大?
https://atcoder.jp/contests/abc109/tasks/abc109_d
https://atcoder.jp/contests/abc110/tasks/abc110_a
输入A,B,C三个一位数
输出A+BC
和AB+C
的较大值,
BC
和AB
表示两个数字连起来,不是乘起来
https://atcoder.jp/contests/abc110/tasks/abc110_b
输入N,M,X,Y
输入长度为N的数组x
输入长度为M的数组y
问是否存在Z
满足X<Z<=Y
且Z>
数组x中的最大值且Z<=
数组y中的最小值
https://atcoder.jp/contests/abc110/tasks/abc110_c
https://atcoder.jp/contests/abc110/tasks/abc110_d
输入N和M
把M分成N个数字的乘积,问方案数
隔板法
https://atcoder.jp/contests/abc111/tasks/abc111_a
输入一个三位数,只包含9和1
把9改成1,把1改成9,输出
https://atcoder.jp/contests/abc111/tasks/abc111_b
输入N,输出大于等于N,最小的111的倍数
https://atcoder.jp/contests/abc112/tasks/abc112_a
两种输入,输入1,输出Hello World
输入2,再输入两个整数A和B,输出A+B
https://atcoder.jp/contests/abc112/tasks/abc112_b
输入N对ci和ti,和时间限制T
问满足ti<=T
最大的ci是什么
https://atcoder.jp/contests/abc112/tasks/abc112_c
https://atcoder.jp/contests/abc112/tasks/abc112_d
https://atcoder.jp/contests/abc113/tasks/abc113_a
输入X和Y,输出X+Y/2
https://atcoder.jp/contests/abc113/tasks/abc113_b
在高度为x的地方温度为T-x*0.0006
输入n和T和n个位置的高度,问其中温度最接近A的是第几个位置?
https://atcoder.jp/contests/abc113/tasks/abc113_c
有n个省,m个市
每个市会在yi年加入pi省
给每个市一个12位编号,前6位是省的编号,后6位表示第几个加入这个省的
输出每个城市的编号
https://atcoder.jp/contests/abc113/tasks/abc113_d
https://atcoder.jp/contests/abc114/tasks/abc114_a
输入一位数,问是不是7,5,3
输出YES
或NO
https://atcoder.jp/contests/abc114/tasks/abc114_b
输入一个数字串,从中取连续三个数字,问和754最小的差是多少
https://atcoder.jp/contests/abc114/tasks/abc114_c
问1到N有多少个数字包含3,5,7
各至少一次,且不包含其他数字
https://atcoder.jp/contests/abc114/tasks/abc114_d
输入N,问N有多少个约数满足:恰好有75个约数?
比如 32400 恰好有 75 个约数
https://atcoder.jp/contests/abc115/tasks/abc115_a
输出Christmas
后面加(25-N)
个Eve
https://atcoder.jp/contests/abc115/tasks/abc115_b
输入n个价格,最贵的半价,其他原价,问总价格是多少?
https://atcoder.jp/contests/abc115/tasks/abc115_c
输入n个数字,从中选k个数字,使得最大减最小差最小
https://atcoder.jp/contests/abc115/tasks/abc115_d
https://atcoder.jp/contests/abc116/tasks/abc116_a
输入直角三角形的三条边,求面积。
保证先输入两条直角边,再输入斜边。
#include <bits/stdc++.h> int main() { int a,b; cin>>a>>b; cout<<a*b/2<<endl; }
https://atcoder.jp/contests/abc116/tasks/abc116_b
从s开始
如果s是偶数,就s=s/2
如果s是奇数,就s=s*3+1
问第一次出现重复的数字是第几个(初始的s是第一个
https://atcoder.jp/contests/abc116/tasks/abc116_c
输入一个数组,每次选一个区间减一,问至少操作多少次可以让数组都变为0。
和NOIP题一模一样
https://www.luogu.com.cn/problem/P1969
https://www.luogu.com.cn/problem/P5019
https://atcoder.jp/contests/abc116/tasks/abc116_d
https://atcoder.jp/contests/abc117/tasks/abc117_a
输入T和X,输出T/X,保留至少3位小数
https://atcoder.jp/contests/abc117/tasks/abc117_b
输入n边形的边长,问这样的多边形是否存在?
判断最长边是否小于周长一半,输出Yes或No
https://atcoder.jp/contests/abc117/tasks/abc117_c
https://atcoder.jp/contests/abc117/tasks/abc117_d
输入n个数字,找一个数字x,异或这x个数字中的每个数字
得到n个结果的和最大
https://atcoder.jp/contests/abc118/tasks/abc118_a
输入A和B
如果A是B的约数,输出A+B
否则输出B-A
https://atcoder.jp/contests/abc118/tasks/abc118_b
输入N个集合
问所有集合的交集多大?
https://atcoder.jp/contests/abc118/tasks/abc118_c
https://atcoder.jp/contests/abc118/tasks/abc118_d
https://atcoder.jp/contests/abc119/tasks/abc119_a
输入yyyy/mm/dd
的日期,如果小于等于<=2019/04/30
输出Heisei
,否则输出TBD
https://atcoder.jp/contests/abc119/tasks/abc119_b
输入n笔收入,1BTC=380000JPY
问总收入是多少JPY
https://atcoder.jp/contests/abc119/tasks/abc119_c
https://atcoder.jp/contests/abc119/tasks/abc119_d
https://atcoder.jp/contests/abc120/tasks/abc120_a
买饮料,每个A元,他有B元,他会一直买,直到钱不够,或者已经买C个了
问会买几个
https://atcoder.jp/contests/abc120/tasks/abc120_b
输入A, B, K
输出A
和B
第K
大的公约数,保证存在
https://atcoder.jp/contests/abc120/tasks/abc120_c
输入一个01串,如果0和1相邻,那么会消去(同时左右连接起来)
就这样不断的消去,问最后一共会消去多少字符?
https://atcoder.jp/contests/abc120/tasks/abc120_d
n个点,m条边,边一条一条被删掉
问删掉每条边之后有多少对点之间不再互相连通了。
https://atcoder.jp/contests/abc121/tasks/abc121_a
H行W列的一个网格,其中h行w列被染色,问多少个格子没有被染色
注意没有被染色的格子数目,和选哪些行,哪些列染色无关
https://atcoder.jp/contests/abc121/tasks/abc121_b
输入N,M,C
输入一个长度为M的数组B
输入N个长度为M的数组Ai
问这N个长度为M的数组中有多少个满足Ai1*B1+Ai2*B2+...+Ai*BM+C>0
https://atcoder.jp/contests/abc121/tasks/abc121_c
https://atcoder.jp/contests/abc121/tasks/abc121_d
https://atcoder.jp/contests/abc122/tasks/abc122_a
A和T配对,C和G配对
输入一个字母,输出和他配对的字母
https://atcoder.jp/contests/abc122/tasks/abc122_b
输入字符串S,输出字符串S中只包含ACGT四种字母最长的子串
https://atcoder.jp/contests/abc122/tasks/abc122_c
输入一个长度为N的字符串,有M个询问
每次询问一个区间,问区间内有多少个子串是AC
https://atcoder.jp/contests/abc122/tasks/abc122_d
https://atcoder.jp/contests/abc123/tasks/abc123_a
输入a, b, c, d, e和k
如果a, b, c, d, e五个数字两两之差(一共10个差)都<=k,输出Yay!
,否则输出:(
输入的a, b, c, d, e是有序的
https://atcoder.jp/contests/abc123/tasks/abc123_b
5个任务,分别需要花A,B,C,D,E
的时间完成
但是每个任务开始的时刻必须是10
的倍数,问完成这些任务至少需要多久?
https://atcoder.jp/contests/abc123/tasks/abc123_c
https://atcoder.jp/contests/abc123/tasks/abc123_d
https://atcoder.jp/contests/abc124/tasks/abc124_a
按一个写着X的按钮,会获得X的收益,并且按钮上的X会减少1
有两个按钮,一个写着A,一个写着B,按两次
问最大收益是多少?
https://atcoder.jp/contests/abc124/tasks/abc124_b
输入一个数组,问有多少个数组大于等于自己左边的所有数字
https://atcoder.jp/contests/abc124/tasks/abc124_c
https://atcoder.jp/contests/abc124/tasks/abc124_d
输入一个长度为n的01串,执行至多k次操作
每次操作选一个区间,翻转01(0变成1,1变成0)
问操作之后,连续是1的区间最长多长?
https://atcoder.jp/contests/abc125/tasks/abc125_a
A秒可以制造B个饼干,T秒可以制造多少饼干?
https://atcoder.jp/contests/abc125/tasks/abc125_b
n个宝石,每个宝石买价C[i],卖价V[i]
选一些宝石买了再卖,问最多赚多少钱
https://atcoder.jp/contests/abc125/tasks/abc125_c
输入 n 个数字,删掉其中一个数字,剩下的数字gcd最大是多少
https://atcoder.jp/contests/abc125/tasks/abc125_d
输入一个数组,每次操作可以选择相邻的两个数字同时乘以 可以操作任意次
希望让数组中所有数字之和最大,问和最大是多少?
https://atcoder.jp/contests/abc126/tasks/abc126_a
输入一个全大写的字符串,把第K个字符改成小写,输出
https://atcoder.jp/contests/abc126/tasks/abc126_b
输入4位数字,问是否可能 YYMM, MMYY, AMBIGUOUS or NA
https://atcoder.jp/contests/abc126/tasks/abc126_c
随机一个1
到n
,如果结果>=k
那么直接获胜
如果结果<k
那么继续扔任意次硬币
如果是正面,结果翻倍
如果是正面,结果归零
问获胜的概率是多少?
https://atcoder.jp/contests/abc126/tasks/abc126_d
https://atcoder.jp/contests/abc126/tasks/abc126_e
https://atcoder.jp/contests/abc126/tasks/abc126_f
https://atcoder.jp/contests/abc127/tasks/abc127_a
票价是 A 元( A 是偶数),年龄是 B 岁, B 是整数。
如果年龄大于等于 13 ,要买全票。
如果年龄大于等于 6 且小于等于 12 ,要买半票。
如果年龄小于等于 5 ,不需要买票。
输入 A 和 B ,输出最终的票价。
#include <bits/stdc++.h> using namespace std; int main() { int A,B; cin>>A>>B; cout<<(A<13?(A<6?0:B/2):B); return 0; }
a?b:c 表示如果条件a成立,那么结果是b,如果条件a不成立,那么结果是c。
可以在某些情况替代 if 语句
https://atcoder.jp/contests/abc127/tasks/abc127_b
输入r
和D
和X[2000]
X[i+1]=r*X[i]-D
输出X[2001], ..., X[2010]
https://atcoder.jp/contests/abc127/tasks/abc127_c
输入M个区间,问交集多大?(交集有多少个整数)
https://atcoder.jp/contests/abc127/tasks/abc127_d
https://atcoder.jp/contests/abc127/tasks/abc127_e
https://atcoder.jp/contests/abc127/tasks/abc127_f
https://atcoder.jp/contests/abc128/tasks/abc128_a
有A个苹果,P个苹果块,一个苹果可以切成三个苹果块
两个苹果块可以做一个苹果派,问最多做多少个苹果派
https://atcoder.jp/contests/abc128/tasks/abc128_b
N个商店,每个商店两个属性,城市和分数
把所有商店排序,先按城市名字典,城市名
https://atcoder.jp/contests/abc128/tasks/abc128_c
https://atcoder.jp/contests/abc128/tasks/abc128_d
https://atcoder.jp/contests/abc128/tasks/abc128_e
https://atcoder.jp/contests/abc128/tasks/abc128_f
https://atcoder.jp/contests/abc129/tasks/abc129_a
有三个地方A,B,C
A和B之间的花费是P
B和C之间的花费是Q
C和A之间的花费是R
从其中任意一个地方出发,到任意一个地方结束,问最小花费是多少?
https://atcoder.jp/contests/abc129/tasks/abc129_b
输入N和一个数组Wi
把N分成前后两部分,使得前半部分之和与后半部分之和的差的绝对值最小
问差的绝对值最小是多少
https://atcoder.jp/contests/abc129/tasks/abc129_c
https://atcoder.jp/contests/abc129/tasks/abc129_d
https://atcoder.jp/contests/abc129/tasks/abc129_e
https://atcoder.jp/contests/abc129/tasks/abc129_f
https://atcoder.jp/contests/abc130/tasks/abc130_a
输入X和A,如果X小于A,输出0,如果X大于等于A,输出10
https://atcoder.jp/contests/abc130/tasks/abc130_b
输入X和n个长度Li,初始在0,第i次向前走Li的长度,问有几次所在的位置<=X
在0不走也算一次
https://atcoder.jp/contests/abc130/tasks/abc130_c
输入 和 。
一个矩形的四个顶点是 。
输入点
找一条经过 点 的直线,平分矩形的面积
问矩形的面积平分之后是多少,这样的直线是否唯一?
https://atcoder.jp/contests/abc130/tasks/abc130_d
https://atcoder.jp/contests/abc130/tasks/abc130_e
https://atcoder.jp/contests/abc130/tasks/abc130_f
https://atcoder.jp/contests/abc131/tasks/abc131_a
输入长度为4的数字串,如果有两位相邻的数字相同,输出Bad,否则输出Good
https://atcoder.jp/contests/abc131/tasks/abc131_b
L,L+1,...,L+N-1
共N
个数字,从中删去一个
使得删去之后的和与删去之前的和尽量接近,问删那个?
https://atcoder.jp/contests/abc131/tasks/abc131_c
输入A,B,C,D
问A到B之间,有多少个数字既不是C的倍数,也不是D的倍数
https://atcoder.jp/contests/abc131/tasks/abc131_d
https://atcoder.jp/contests/abc131/tasks/abc131_e
https://atcoder.jp/contests/abc131/tasks/abc131_f
输入n个点,如果其中3个点是平行于坐标轴矩形的3个点,那么可以加入第4个点
尽量加更多的点,问至多加多少个点
https://atcoder.jp/contests/abc132/tasks/abc132_a
输入长度为4的字符串,问这个字符串是不是恰好包含两种字符,每种字符各两个
https://atcoder.jp/contests/abc132/tasks/abc132_b
输入n个数字,问有多少个p[i]
是p[i-1],p[i],p[i+1]
第二小的
https://atcoder.jp/contests/abc132/tasks/abc132_c
输入N个数字,保证N是偶数
选一个K,要求大于K的数字恰好有N/2
个(当然小于等于K的数字也有N/2
个)
K必须是整数,问有多少种选法
https://atcoder.jp/contests/abc132/tasks/abc132_d
https://atcoder.jp/contests/abc132/tasks/abc132_e
https://atcoder.jp/contests/abc132/tasks/abc132_f
https://atcoder.jp/contests/abc133/tasks/abc133_a
n 个人出游,如果坐火车,每人花 a 的钱,如果坐汽车,一共花 b 的钱,问最小花费是多少
参考代码:
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b; cin >> n >> a >> b; cout << min(n * a, b) << endl; return 0; }
min
可以计算两个值的中的较小值是多少
https://atcoder.jp/contests/abc133/tasks/abc133_b
输入D维空间中的N个点,问其中有多少对点之间的欧几里得距离是整数
https://atcoder.jp/contests/abc133/tasks/abc133_c
输入L
和R
,选两个整数i
和j
满足L<=i<j<=R
问i*j%2019
最小是多少?
https://atcoder.jp/contests/abc133/tasks/abc133_d
https://atcoder.jp/contests/abc133/tasks/abc133_e
https://atcoder.jp/contests/abc133/tasks/abc133_f
https://atcoder.jp/contests/abc134/tasks/abc134_a
输入r
,输出3*r*r
https://atcoder.jp/contests/abc134/tasks/abc134_b
一个人如果站在i,可以监视i-d到i+d的所有人,现在1到n共n个人排成一行
问需要几个人才能监视所有人?
https://atcoder.jp/contests/abc134/tasks/abc134_c
输入一个数组,对于每个数字回答,删去这个数字之后数组的最大值是多少?
https://atcoder.jp/contests/abc134/tasks/abc134_d
https://atcoder.jp/contests/abc134/tasks/abc134_e
输入一个序列,分成若干个上升序列,问至少需要几个上升序列?
答案是最长不上升子序列的长度
https://atcoder.jp/contests/abc134/tasks/abc134_f
https://atcoder.jp/contests/abc135/tasks/abc135_a
输入A和B,找到K使得|A-K|==|B-K|
输出K,如果不存在输入IMPOSSIBLE
https://atcoder.jp/contests/abc135/tasks/abc135_b
输入一个1到n的排列,问能不能通过交换至多一次让排列变成升序?
https://atcoder.jp/contests/abc135/tasks/abc135_c
https://atcoder.jp/contests/abc135/tasks/abc135_d
https://atcoder.jp/contests/abc135/tasks/abc135_e
https://atcoder.jp/contests/abc135/tasks/abc135_f
https://atcoder.jp/contests/abc136/tasks/abc136_a
桌子上有 2 个杯子,1号杯子最多可以放 A 升水,现在里面包含 B 升水。
2 号杯子包含 C 升水,现在我们将 2 号杯子尽可能地往 1 号杯子里倒,不溢出,
问最后 2 号杯子里还有多少水。
参考代码
#include <bits/stdc++.h> using namespace std; int main() { int a,b,c; cin>>a>>b>>c; cout<<max(c-a+b,0)<<endl; return 0; }
https://atcoder.jp/contests/abc136/tasks/abc136_b
输入 n,问 1 到 n 中 有多少个数字有奇数位?
https://atcoder.jp/contests/abc136/tasks/abc136_c
输入 n 个数字,每个数字可以选择不变,或者减少1
问能否让这个序列变成不下降的(相等或上升)?
https://atcoder.jp/contests/abc136/tasks/abc136_d
https://atcoder.jp/contests/abc136/tasks/abc136_e
https://atcoder.jp/contests/abc136/tasks/abc136_f
https://atcoder.jp/contests/abc137/tasks/abc137_a
输入A和B
输出A+B A-B A*B
三个数字中较大的
https://atcoder.jp/contests/abc137/tasks/abc137_b
输入k和x
每个整数位置有一个人,已知第x个人确诊了,位置差<k
的为密切接触者,问确诊和密切接触者有哪些?
输入x-k+1
到x+k-1
共2*k-1
个数字
https://atcoder.jp/contests/abc137/tasks/abc137_c
如果字符串 A和B 出现的字母一样(包括次数),但是顺序不一样,那么他们是一对 anagram
输入 n 个字符串,问其中有多少对 anagram
https://atcoder.jp/contests/abc137/tasks/abc137_d
https://atcoder.jp/contests/abc137/tasks/abc137_e
https://atcoder.jp/contests/abc137/tasks/abc137_f
https://atcoder.jp/contests/abc138/tasks/abc138_a
输入数字a和字符串s
如果a小于3200输出red
否则输出字符串s
https://atcoder.jp/contests/abc138/tasks/abc138_b
输入n个数字,问这n个数字倒数之和的倒数是多少
https://atcoder.jp/contests/abc138/tasks/abc138_c
输入N个数字,合并N-1次,合并两个数字会变成这两个数字的平均值
希望结果越大越好,问最大是多少?
https://atcoder.jp/contests/abc138/tasks/abc138_d
https://atcoder.jp/contests/abc138/tasks/abc138_e
https://atcoder.jp/contests/abc138/tasks/abc138_f
https://atcoder.jp/contests/abc139/tasks/abc139_a
输入两个由CSR
三种字母组成的长度为3的字符串
问其中有几个对应的位置相等
https://atcoder.jp/contests/abc139/tasks/abc139_b
刚开始只有1个插口,一个插线板可以让1个插口变成A个插口
问至少多少个插线板,才能有B个插口
https://atcoder.jp/contests/abc139/tasks/abc139_c
https://atcoder.jp/contests/abc139/tasks/abc139_d
输入n,构造一个1到n的排列P[1],P[2],...,P[n]
1到n每个数字出现恰好一次
设M[i]=P[i]%i
问M[1]+M[2]+M[3]+...+M[n]
最大是多少?
https://atcoder.jp/contests/abc139/tasks/abc139_e
https://atcoder.jp/contests/abc139/tasks/abc139_f
https://atcoder.jp/contests/abc140/tasks/abc140_a
输入 n,问只包含1到n的三位数有几个?输出 n * n * n
https://atcoder.jp/contests/abc140/tasks/abc140_b
一个人吃N道菜,第i次吃第Ai盘菜
吃掉第i盘才收益Bi
吃掉第i盘之后立刻吃第i+1盘额外收益Ci
问总收益多少
https://atcoder.jp/contests/abc140/tasks/abc140_c
输入长度为N-1的B
有一个长度为N的A
要求B[i]>=max(A[i],A[i+1])
问A中所有元素之和最大是多少
https://atcoder.jp/contests/abc140/tasks/abc140_d
https://atcoder.jp/contests/abc140/tasks/abc140_e
https://atcoder.jp/contests/abc140/tasks/abc140_f
https://atcoder.jp/contests/abc141/tasks/abc141_a
已知天气按照Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...
输入今天的天气,输出明天的天气
https://atcoder.jp/contests/abc141/tasks/abc141_b
输入字符串,问是否所有奇数位置都是RUD之一,且偶数位置都是LUD之一
奇偶都是从1开始数的
https://atcoder.jp/contests/abc141/tasks/abc141_c
https://atcoder.jp/contests/abc141/tasks/abc141_d
https://atcoder.jp/contests/abc141/tasks/abc141_e
https://atcoder.jp/contests/abc141/tasks/abc141_f
https://atcoder.jp/contests/abc142/tasks/abc142_a
输入n,1到n随机一个整数,问奇数的概率,保留至少6位小数
https://atcoder.jp/contests/abc142/tasks/abc142_b
输入N个数字,问其中有多少个>=K
https://atcoder.jp/contests/abc142/tasks/abc142_c
https://atcoder.jp/contests/abc142/tasks/abc142_d
输入 a 和 b,输出 gcd(a,b) 不同质因数的个数
https://atcoder.jp/contests/abc142/tasks/abc142_e
https://atcoder.jp/contests/abc142/tasks/abc142_f
https://atcoder.jp/contests/abc143/tasks/abc143_a
长度为A的窗户,用两个长度为B的覆盖,问未覆盖的长度是多少
https://atcoder.jp/contests/abc143/tasks/abc143_b
输入n个数字,我们都知道从n个数字中选两个有n*(n+1)/2
个方案
对于这n*(n+1)/2
个方案,选出的2个数字计算乘积
问这n*(n+1)/2
个乘积的和是多少?
https://atcoder.jp/contests/abc143/tasks/abc143_c
输入n个字符,去掉相邻相同的,问结果剩下几个字符
https://atcoder.jp/contests/abc143/tasks/abc143_d
https://atcoder.jp/contests/abc143/tasks/abc143_e
https://atcoder.jp/contests/abc143/tasks/abc143_f
https://atcoder.jp/contests/abc144/tasks/abc144_a
输入两个正整数,如果都小于等于9,输出他们的乘积,否则输出-1
https://atcoder.jp/contests/abc144/tasks/abc144_b
输入一个数字,问是不是两个1~9
的数字的乘积
输出Yes或No
https://atcoder.jp/contests/abc144/tasks/abc144_c
一个无限大的乘法表,第i行第j列的数字是i*j
初始在第一行第一列,每一步可以往右一列或者往下一行
输入n
问至少几步可以走到数字是n
的格子
https://atcoder.jp/contests/abc144/tasks/abc144_d
https://atcoder.jp/contests/abc144/tasks/abc144_e
https://atcoder.jp/contests/abc144/tasks/abc144_f
https://atcoder.jp/contests/abc145/tasks/abc145_a
输入半径,问面积是多少倍的Pi
https://atcoder.jp/contests/abc145/tasks/abc145_b
输入一个字符串,问这个字符串能不能由一个字符串重复两次得到,输出Yes或No
https://atcoder.jp/contests/abc145/tasks/abc145_c
https://atcoder.jp/contests/abc145/tasks/abc145_d
如果当前在(i,j)
,那么下一步可以走到(i+1,j+2)
或(i+2,j+1)
从(0,0)
走到(x,y)
,问有多少种方案?
答案模1000000007
https://atcoder.jp/contests/abc145/tasks/abc145_e
https://atcoder.jp/contests/abc145/tasks/abc145_f
https://atcoder.jp/contests/abc146/tasks/abc146_a
输入星期中的一天,问到下周日还有几天
https://atcoder.jp/contests/abc146/tasks/abc146_b
输入n和大写字母字符串,每个字母往后挪n位,问字符串会变成什么
n<=26
Z往后挪一位会变成A
https://atcoder.jp/contests/abc146/tasks/abc146_c
一个商店卖 至 的整数, 的售价是 元 其中 表示 的位数
已知 和 ,现在有 元,问能买到的最大的整数是多少?
https://atcoder.jp/contests/abc146/tasks/abc146_d
输入一个N个点N-1条边的树,每条边染色,要求有公共端点的边颜色必须不同
问至少需要多少种颜色,并给出一个方案
https://atcoder.jp/contests/abc146/tasks/abc146_e
https://atcoder.jp/contests/abc146/tasks/abc146_f
https://atcoder.jp/contests/abc147/tasks/abc147_a
输入A1,A2,A3,如果和大于等于22,输出bust
,否则输出win
。
https://atcoder.jp/contests/abc147/tasks/abc147_b
输入一个字符串,问最少修改几个字符,可以让这个串变成回文串
https://atcoder.jp/contests/abc147/tasks/abc147_c
输入N个人,每个人可能是真人或者是假人,真人一定说真话,假人可能说真话可能说假话
他们会说其他人是真人还是假人,问其中至多有多少个真人
https://atcoder.jp/contests/abc147/tasks/abc147_d
输入N个数字,从中选两个数字做按位异或,问所有结果和是多少?
按位讨论
https://atcoder.jp/contests/abc147/tasks/abc147_e
https://atcoder.jp/contests/abc147/tasks/abc147_f
https://atcoder.jp/contests/abc148/tasks/abc148_a
三个选项1, 2, 3
输入两个错误选项,问正确的是哪个?
https://atcoder.jp/contests/abc148/tasks/abc148_b
输入两个长度为n的字符串,交替输出两个字符串的内容
https://atcoder.jp/contests/abc148/tasks/abc148_c
https://atcoder.jp/contests/abc148/tasks/abc148_d
输入一个数组,删掉一些数字
使得剩下的数字是1, 2, 3, ...
问至少删多少个数字?
如果必须全删,输出-1
https://atcoder.jp/contests/abc148/tasks/abc148_e
https://atcoder.jp/contests/abc148/tasks/abc148_f
https://atcoder.jp/contests/abc149/tasks/abc149_a
输入两个字符串S和T,输出T和S,中间不加空格
https://atcoder.jp/contests/abc149/tasks/abc149_b
输入A, B, K,执行以下操作K次
如果A大于零,那么自减一;否则如果B大于零,那么B自减一;否则什么都不做
问执行操作后A和B是多少?
https://atcoder.jp/contests/abc149/tasks/abc149_c
输入 x,输出大于等于x最小的质数是多少
https://atcoder.jp/contests/abc149/tasks/abc149_d
https://atcoder.jp/contests/abc149/tasks/abc149_e
https://atcoder.jp/contests/abc149/tasks/abc149_f
https://atcoder.jp/contests/abc150/tasks/abc150_a
如果500*K>=X
,输出Yes
,否则输出No
https://atcoder.jp/contests/abc150/tasks/abc150_b
输入一个字符串,问ABC作为子串出现过多少次?
https://atcoder.jp/contests/abc150/tasks/abc150_c
https://atcoder.jp/contests/abc150/tasks/abc150_d
https://atcoder.jp/contests/abc150/tasks/abc150_e
https://atcoder.jp/contests/abc150/tasks/abc150_f
https://atcoder.jp/contests/abc151/tasks/abc151_a
输入一个小写字母,输出下一个字母,不会输入z
输入一个不是z的字母,输出下一个字母是什么。
ASCII码
https://atcoder.jp/contests/abc151/tasks/abc151_b
一共N门课,每门课的分数是0到K的一个数字
已知前N-1门课的分数,问最后一门课至少多少分,才能使得所有课平均分>=M
如果做不到输出-1
https://atcoder.jp/contests/abc151/tasks/abc151_c
n道题目,输入m次提交的结果
问做对了几道题,有几次罚时?
AC之后再WA不算罚时,多次AC同一道题只算一遍
只有WA提交,最后没有AC的题目不算罚时
https://atcoder.jp/contests/abc151/tasks/abc151_d
https://atcoder.jp/contests/abc151/tasks/abc151_e
https://atcoder.jp/contests/abc151/tasks/abc151_f
https://atcoder.jp/contests/abc152/tasks/abc152_a
输入N和M,如果N==M输出Yes,如果N>M输出No
https://atcoder.jp/contests/abc152/tasks/abc152_b
输入两个数字a
和b
问a个b和b个a哪个字典序更小?
输出字典序较小的
https://atcoder.jp/contests/abc152/tasks/abc152_c
输入一个排列,从左向右看,问有多少个到目前为止的最小值
https://atcoder.jp/contests/abc152/tasks/abc152_d
https://atcoder.jp/contests/abc152/tasks/abc152_e
https://atcoder.jp/contests/abc152/tasks/abc152_f
https://atcoder.jp/contests/abc153/tasks/abc153_a
一个怪物初始生命值H,被攻击一次生命值减少A,如果怪物生命值小于等于零玩家胜利
问需要攻击几次
https://atcoder.jp/contests/abc153/tasks/abc153_b
输入h,n和n个数字,问这n个数字的和是否>=h,输出Yes或No
https://atcoder.jp/contests/abc153/tasks/abc153_c
打怪练级,一共n个怪物,第i个怪物生命值是Hi
攻击一次,生命值减少1。生命值变为0,怪物消失
特殊技能可以直接让一个怪物消失,但只能使用k次
问至少需要攻击多少次,才能消灭所有怪物
https://atcoder.jp/contests/abc153/tasks/abc153_d
打怪练级
如果怪物生命值是1,攻击之后会消失
如果怪物生命值是X,攻击之后会变成两个X/2
下取整的怪物
初始只有一个怪物生命值为H
,问需要攻击多少次让怪物消失
https://atcoder.jp/contests/abc153/tasks/abc153_e
https://atcoder.jp/contests/abc153/tasks/abc153_f
https://atcoder.jp/contests/abc154/tasks/abc154_a
输入A个S色的球,B个T色的球
拿走一个U色的球
问S色的球和T色的球还剩下几个(其中有且只有一种颜色会减少一个)
https://atcoder.jp/contests/abc154/tasks/abc154_b
输入一个字符串S
把每个字符都替换成x
输出
https://atcoder.jp/contests/abc154/tasks/abc154_c
https://atcoder.jp/contests/abc154/tasks/abc154_d
选K个,和最大
https://atcoder.jp/contests/abc154/tasks/abc154_e
https://atcoder.jp/contests/abc154/tasks/abc154_f
https://atcoder.jp/contests/abc155/tasks/abc155_a
输入三个数字A,B,C,如果三个数字中有且只有两个相同,那么输出Yes,如果两两不同或者都相同输出No
https://atcoder.jp/contests/abc155/tasks/abc155_b
输入一个数组,如果所有偶数都是3或5的倍数,输出APPROVED
否则输出DENIED
https://atcoder.jp/contests/abc155/tasks/abc155_c
输入n个字符串,问出现次数最多的字符串有哪些?按字典序输出
https://atcoder.jp/contests/abc155/tasks/abc155_d
选两个数字乘积,问第K大是什么?
二分
https://atcoder.jp/contests/abc155/tasks/abc155_e
https://atcoder.jp/contests/abc155/tasks/abc155_f
https://atcoder.jp/contests/abc156/tasks/abc156_a
输入N和R,输出R+(10-N)*100
https://atcoder.jp/contests/abc156/tasks/abc156_b
输入n和k,问n在k进制下有几位?
#include <iostream> using namespace std; int n,a,ans; int main(){ cin>>n>>a; for(;n;n/=a)ans++; cout<<ans; return 0; }
https://atcoder.jp/contests/abc156/tasks/abc156_c
数轴上N个人要聚会,第i个人初始位置是Xi
如果选择在P聚会,第i个人的代价是(Xi-P)**2
必须在整数位置聚会
问总代价之和最小是多少
https://atcoder.jp/contests/abc156/tasks/abc156_d
https://atcoder.jp/contests/abc156/tasks/abc156_e
https://atcoder.jp/contests/abc156/tasks/abc156_f
https://atcoder.jp/contests/abc157/tasks/abc157_a
输入 n,双面打印一个n页的文件,问需要几张纸?输出 (n+1)/2
https://atcoder.jp/contests/abc157/tasks/abc157_b
输入一个3x3的数组aij,接下来输入n和n个数字bi
如果bi在数组a中出现,就标记上出现的位置
如果被标记的位置形成了一行三个,一列三个,或者对角线三个,输出Yes,否则输出No
保证数组a中数字互不相同,数组b中数字互不相同
https://atcoder.jp/contests/abc157/tasks/abc157_c
https://atcoder.jp/contests/abc157/tasks/abc157_d
https://atcoder.jp/contests/abc157/tasks/abc157_e
https://atcoder.jp/contests/abc157/tasks/abc157_f
https://atcoder.jp/contests/abc158/tasks/abc158_a
输入一个长度为3的字符串,问是不是既有A,又有B
https://atcoder.jp/contests/abc158/tasks/abc158_b
A个蓝色,B个红色,A个蓝色,B个红色,A个蓝色,B个红色……循环
问前n个中,有多少个蓝色
n/(A+B)*A + min(n%(A+B),A)
https://atcoder.jp/contests/abc158/tasks/abc158_c
输入A和B
找到最小的N,使得N*0.08下取整==A
并且N*0.1下取整==B
如果无解输出-1
https://atcoder.jp/contests/abc158/tasks/abc158_d
https://atcoder.jp/contests/abc158/tasks/abc158_e
https://atcoder.jp/contests/abc158/tasks/abc158_f
https://atcoder.jp/contests/abc159/tasks/abc159_a
N个偶数,M个奇数,从中选2个,和是偶数,问方案数
https://atcoder.jp/contests/abc159/tasks/abc159_b
一个长度为奇数N的字符串被称为强回文,当且仅当
本身是回文串,第1到第(N-1)/2个字符是回文,第(N+3)/2到第N个字符是回文
输入字符串S,问是不是强回文
https://atcoder.jp/contests/abc159/tasks/abc159_c
输入L,问长宽高之和为L的立方体,体积最大是多少?
https://atcoder.jp/contests/abc159/tasks/abc159_d
https://atcoder.jp/contests/abc159/tasks/abc159_e
https://atcoder.jp/contests/abc159/tasks/abc159_f
https://atcoder.jp/contests/abc160/tasks/abc160_a
输入一个字符串,判断是否第三个字符等于第四个字符,且第五个字符等于第六个字符,输出Yes或No
https://atcoder.jp/contests/abc160/tasks/abc160_b
现在有X
元,500元可以买1000的幸福值,5元可以买5的幸福值,问最多可以买多少幸福值?
https://atcoder.jp/contests/abc160/tasks/abc160_c
环形池塘上有N个点
从其中任意一个点出发,向左或向右走,到任意一个点结束
要求N个点都到过
问最小距离是多少?
https://atcoder.jp/contests/abc160/tasks/abc160_d
https://atcoder.jp/contests/abc160/tasks/abc160_e
https://atcoder.jp/contests/abc160/tasks/abc160_f
https://atcoder.jp/contests/abc161/tasks/abc161_a
输入三个数字X, Y, Z
交换X和Y,交换X和Z
输出X, Y, Z
https://atcoder.jp/contests/abc161/tasks/abc161_b
n个商品被投票,第i个的票数是Ai
问能不能选出m个商品,使得选出的商品的票数都大于等于 总票数/(4m)
https://atcoder.jp/contests/abc161/tasks/abc161_c
输入N
和K
每次操作可以把N
改为|N-K|
N和K差的绝对值
你可以做任意次操作,也可以不做,希望最终结果越小越好
问最小是多少?
https://atcoder.jp/contests/abc161/tasks/abc161_d
https://atcoder.jp/contests/abc161/tasks/abc161_e
https://atcoder.jp/contests/abc161/tasks/abc161_f
https://atcoder.jp/contests/abc162/tasks/abc162_a
输入一个三位数,问是否包含7,输出Yes或No
https://atcoder.jp/contests/abc162/tasks/abc162_b
输入n,求1到n中既不是3的倍数,也不是5的倍数的所有数字之和
两个做法,直接枚举,容斥原理
https://atcoder.jp/contests/abc162/tasks/abc162_c
输入k
枚举a从1到k
枚举b从1到k
枚举c从1到k
计算gcd(a,b,c)的和
https://atcoder.jp/contests/abc162/tasks/abc162_d
https://atcoder.jp/contests/abc162/tasks/abc162_e
https://atcoder.jp/contests/abc162/tasks/abc162_f
https://atcoder.jp/contests/abc163/tasks/abc163_a
输入圆的半径,输出圆的周长,保留至少两位小数
https://atcoder.jp/contests/abc163/tasks/abc163_b
假期一共有N
天,有M
个作业要做,第i
个作业花费Ai
天完成
问能剩下多少天玩?如果做不完输出-1
,如果恰好做完,没有时间玩,输出0
https://atcoder.jp/contests/abc163/tasks/abc163_c
N个人,第1个人是大老板
除此之外每个人有上司ai
问每个人有几个下属?
https://atcoder.jp/contests/abc163/tasks/abc163_d
https://atcoder.jp/contests/abc163/tasks/abc163_e
https://atcoder.jp/contests/abc163/tasks/abc163_f
https://atcoder.jp/contests/abc164/tasks/abc164_a
输入 S 和 W,如果 W >= S 输出 unsafe
否则输出 safe
#include <bits/stdc++.h> using namespace std; int main() { int s,w; cin>>s>>w; if (w >= s) { cout << "unsafe" << endl; } else { cout << "safe" << endl; } }
https://atcoder.jp/contests/abc164/tasks/abc164_b
Takahashi 的生命值是A,攻击力是B
Aoki 的生命值是C,攻击力是D
双方轮流攻击,Takahashi 先攻击,直到一方的生命值小于等于0,此时生命值大于0的为获胜方
问 Takahashi 能不能赢?输出Yes
或No
https://atcoder.jp/contests/abc164/tasks/abc164_c
输入n个字符串问有多少个不同的字符串
https://atcoder.jp/contests/abc164/tasks/abc164_d
https://atcoder.jp/contests/abc164/tasks/abc164_e
https://atcoder.jp/contests/abc164/tasks/abc164_f
https://atcoder.jp/contests/abc165/tasks/abc165_a
输入K, A, B。问A和B之间有没有K的倍数
https://atcoder.jp/contests/abc165/tasks/abc165_b
刚开始有100日元,每年的利息是1%,不足1日元不发钱,问多少年可以>=X日元?
#include <stdio.h> long long x,a=100,ans; main(){ scanf("%lld",&x);while(a<x) a+=a/100,ans++;printf("%lld\n",ans);return 0; }
https://atcoder.jp/contests/abc165/tasks/abc165_c
https://atcoder.jp/contests/abc165/tasks/abc165_d
https://atcoder.jp/contests/abc165/tasks/abc165_e
https://atcoder.jp/contests/abc165/tasks/abc165_f
https://atcoder.jp/contests/abc166/tasks/abc166_a
输入ABC和ARC之一,输出另一个
https://atcoder.jp/contests/abc166/tasks/abc166_b
第一行N和K,表示N个小朋友,种个玩具
接下来K段,第i段表示哪些小朋友有第i个玩具,包含两行
第一行表示拥有这个玩具的小朋友个数di,第二行di个数字,表示具体是哪些小朋友
输出有几个小朋友没有任何玩具
https://atcoder.jp/contests/abc166/tasks/abc166_c
输入n个数字Hi和m条边第j条无向边连接Aj和Bj
对于一个数字Hi,如果他大于所有他相邻的数字,那么他是好的
问有多少个数字是好的?
https://atcoder.jp/contests/abc166/tasks/abc166_d
https://atcoder.jp/contests/abc166/tasks/abc166_e
https://atcoder.jp/contests/abc166/tasks/abc166_f
https://atcoder.jp/contests/abc167/tasks/abc167_a
输入两个字符串,问第一个是不是第二个的前缀
用substr
https://atcoder.jp/contests/abc167/tasks/abc167_b
有A
个1
,B
个0
,C
个-1
,从中选取K
个数字,问和最大是多少?
https://atcoder.jp/contests/abc167/tasks/abc167_c
https://atcoder.jp/contests/abc167/tasks/abc167_d
https://atcoder.jp/contests/abc167/tasks/abc167_e
https://atcoder.jp/contests/abc167/tasks/abc167_f
https://atcoder.jp/contests/abc168/tasks/abc168_a
输入一个数字
如果个位是 24579 输出 hon
如果个位是 0168 输出 pon
如果个位是 3 输出 bon
https://atcoder.jp/contests/abc168/tasks/abc168_b
输入长度K
和一个字符串
如果字符串的长度小于等于K
,那么直接输出
如果字符串的长度大于K
,那么输出前K
个字符和...
https://atcoder.jp/contests/abc168/tasks/abc168_c
https://atcoder.jp/contests/abc168/tasks/abc168_d
https://atcoder.jp/contests/abc168/tasks/abc168_e
https://atcoder.jp/contests/abc168/tasks/abc168_f
https://atcoder.jp/contests/abc169/tasks/abc169_a
输入A和B,输出A*B
https://atcoder.jp/contests/abc169/tasks/abc169_b
输入N个数字,输出他们的乘积,如果乘积大于1e18
输出-1
https://atcoder.jp/contests/abc169/tasks/abc169_c
输入A和B,输出他们的乘积,取整
其中A是整数,B至多两位小数
https://atcoder.jp/contests/abc169/tasks/abc169_d
https://atcoder.jp/contests/abc169/tasks/abc169_e
https://atcoder.jp/contests/abc169/tasks/abc169_f
输入个数字
设 表示集合 有多少个子集,和为
对于个数字的所有子集 求 之和
https://atcoder.jp/contests/abc170/tasks/abc170_a
输入5个变量
本应该是 1 2 3 4 5,但其中一个被改成0了
问是哪一个
输入 1 2 0 4 5
输出 3
输入 0 2 3 4 5
输出 1
https://atcoder.jp/contests/abc170/tasks/abc170_b
鸡兔同笼问题,x个头,y个脚,问有没有解,只需要输出有没有解,Yes或No
https://atcoder.jp/contests/abc170/tasks/abc170_c
输入X和N个整数Ai
问离X最接近,且没在这N个整数中出现的数字是多少?
如果有多个最接近的,输出最小的
https://atcoder.jp/contests/abc170/tasks/abc170_d
https://atcoder.jp/contests/abc170/tasks/abc170_e
https://atcoder.jp/contests/abc170/tasks/abc170_f
https://atcoder.jp/contests/abc171/tasks/abc171_a
输入一个字母,如果是大写,输出A,如果是小写,输出a
https://atcoder.jp/contests/abc171/tasks/abc171_b
输入n
个数字,问较小的k
个之和是多少?
https://atcoder.jp/contests/abc171/tasks/abc171_c
输入一个数字,转成字符串
https://atcoder.jp/contests/abc171/tasks/abc171_d
维护一个数字,支持把所有的Bi改成Ci,和求数组中所有数字之和
https://atcoder.jp/contests/abc171/tasks/abc171_e
https://atcoder.jp/contests/abc171/tasks/abc171_f
https://atcoder.jp/contests/abc172/tasks/abc172_a
输入 a,输出 a + a * a + a * a * a
https://atcoder.jp/contests/abc172/tasks/abc172_b
输入长度相等的两个字符串S
和T
每次操作选择S
中的一个字母,并替换为另一个不同的字母
问至少多少次操作可以使得S
和T
相等
https://atcoder.jp/contests/abc172/tasks/abc172_c
https://atcoder.jp/contests/abc172/tasks/abc172_d
1到n每个数字i的约数个数,再乘以i,求和
https://atcoder.jp/contests/abc172/tasks/abc172_e
https://atcoder.jp/contests/abc172/tasks/abc172_f
https://atcoder.jp/contests/abc173/tasks/abc173_a
买N元的东西,用1000元的纸币,问最少找多少钱
https://atcoder.jp/contests/abc173/tasks/abc173_b
输入n
个字符串,每个一定是AC,WA,TLE,RE
中的一个
问每种字符串出现多少次?0次也要输出
https://atcoder.jp/contests/abc173/tasks/abc173_c
https://atcoder.jp/contests/abc173/tasks/abc173_d
https://atcoder.jp/contests/abc173/tasks/abc173_e
https://atcoder.jp/contests/abc173/tasks/abc173_f
https://atcoder.jp/contests/abc174/tasks/abc174_a
输入一个温度X,问是否>=30
,输出Yes
或No
https://atcoder.jp/contests/abc174/tasks/abc174_b
输入n
个点的坐标(xi,yi)
,问其中有多少个点到原点的距离<=D
https://atcoder.jp/contests/abc174/tasks/abc174_c
输入K,问最小连续几个7组成的数字,是K的倍数?无解输出-1
https://atcoder.jp/contests/abc174/tasks/abc174_d
输入一个长度为n的WR序列
一次操作可以交换两个字符,或者修改一个字符
不希望出现WR子串(也就是说最后修改的结果,一定是所有R在所有W之前)
问最少几次操作
https://atcoder.jp/contests/abc174/tasks/abc174_e
https://atcoder.jp/contests/abc174/tasks/abc174_f
https://atcoder.jp/contests/abc175/tasks/abc175_a
输入一个长度为3,包含R和S的字符串,问最多连续几个R?分8种情况讨论。
https://atcoder.jp/contests/abc175/tasks/abc175_b
输入N个数字,从中选取三个数字构成一个三角形,问有多少种方案?
https://atcoder.jp/contests/abc175/tasks/abc175_c
初始在X的位置上,每一步走D的距离,可以向前或向后,必须走K步
问K步之后距离原点最近多近?
https://atcoder.jp/contests/abc175/tasks/abc175_d
https://atcoder.jp/contests/abc175/tasks/abc175_e
https://atcoder.jp/contests/abc175/tasks/abc175_f
https://atcoder.jp/contests/abc176/tasks/abc176_a
做一次可以做X个零食,需要T的时间。问做N个零食需要多久?
除法上取整
https://atcoder.jp/contests/abc176/tasks/abc176_b
输入n,问n是不是9的倍数,n最多有200000位。
#include<bits/stdc++.h> using namespace std; int main() { string s; cin>>s; int u=0; for(char c:s)u+=c-'0'; cout<<(u%9?"No":"Yes"); }
https://atcoder.jp/contests/abc176/tasks/abc176_c
输入N个人的高度,每个人都希望通过增加自己的高度,使得自己的高度大于等于自己左边的人的高度
问总共至少增加多少高度,才能满足每个人的愿望
https://atcoder.jp/contests/abc176/tasks/abc176_d
https://atcoder.jp/contests/abc176/tasks/abc176_e
https://atcoder.jp/contests/abc176/tasks/abc176_f
https://atcoder.jp/contests/abc177/tasks/abc177_a
一个人速度是 S 米每秒,问 T 秒能不能走 D 米的距离。
参考错误代码:
#include <bits/stdc++.h> int main() { int D, T, S; cin >> D >> T >> S; if (D / S <= T) // 这里有错,C++中除法默认是下取整,应为 D<=S*T 或 (D+S-1)/S<=T { cout << "Yes" << endl; } else { cout << "No" << endl; } return 0; }
https://atcoder.jp/contests/abc177/tasks/abc177_b
输入两个字符串S和T
问在S中至少修改几个字符,才可以使得T是S的字串
https://atcoder.jp/contests/abc177/tasks/abc177_c
输入N个数字,问其中所有无序对的乘积之和是多少?
https://atcoder.jp/contests/abc177/tasks/abc177_d
有n个人,m个关系,关系有传递性
问n个人至少分成多少个集合
才能让每个集合内的人之间都没有关系
https://atcoder.jp/contests/abc177/tasks/abc177_e
输入一个数组,问是两两互质,还是所有数字gcd为1,还是所有数字gcd大于1
https://atcoder.jp/contests/abc177/tasks/abc177_f
https://atcoder.jp/contests/abc178/tasks/abc178_a
输入 x 保证是0或者1,如果输入0,那么输出1,如果输入1,那么输出0
https://atcoder.jp/contests/abc178/tasks/abc178_b
已知x
和y
的范围是a<=x<=b,c<=y<=d
问x*y
最大是多少?
https://atcoder.jp/contests/abc178/tasks/abc178_c
https://atcoder.jp/contests/abc178/tasks/abc178_d
https://atcoder.jp/contests/abc178/tasks/abc178_e
https://atcoder.jp/contests/abc178/tasks/abc178_f
https://atcoder.jp/contests/abc179/tasks/abc179_a
输入一个字符串,如果以s结尾,结尾加es,否则加s。
https://atcoder.jp/contests/abc179/tasks/abc179_b
每次扔两个骰子,扔n次,输入扔的结果
问是否存在连续三次,每次的两个骰子数字一样(但是这三次不需要一样)
输出Yes
或No
https://atcoder.jp/contests/abc179/tasks/abc179_c
输入N
问有多少组正整数(A,B,C)
满足A*B+C==N
?
https://atcoder.jp/contests/abc179/tasks/abc179_d
https://atcoder.jp/contests/abc179/tasks/abc179_e
https://atcoder.jp/contests/abc179/tasks/abc179_f
https://atcoder.jp/contests/abc180/tasks/abc180_a
盒子里有N个球,从中拿出来A个,放进去B个,问现在有几个球?
https://atcoder.jp/contests/abc180/tasks/abc180_b
输入一个n维空间内的点,输出到原点的
曼哈顿距离,所有维度坐标绝对值之和
欧几里得距离,所有维度平方求和开根号
切比雪夫距离,所有维度坐标绝对值的最大值
https://atcoder.jp/contests/abc180/tasks/abc180_c
输入n,升序输出n的所有约数
https://atcoder.jp/contests/abc180/tasks/abc180_d
https://atcoder.jp/contests/abc180/tasks/abc180_e
https://atcoder.jp/contests/abc180/tasks/abc180_f
https://atcoder.jp/contests/abc181/tasks/abc181_a
输入N,如果N是偶数,输出White,如果N是奇数,输出Black
https://atcoder.jp/contests/abc181/tasks/abc181_b
输入N个等差数列,第i个等差数列,首项是ai,末项是bi,公差是1
问所有等差数列之和是多少?
https://atcoder.jp/contests/abc181/tasks/abc181_c
输入N个点,问是否存在三点共线?输出Yes
或No
https://atcoder.jp/contests/abc181/tasks/abc181_d
https://atcoder.jp/contests/abc181/tasks/abc181_e
https://atcoder.jp/contests/abc181/tasks/abc181_f
https://atcoder.jp/contests/abc182/tasks/abc182_a
在社交网站 twiblr 上,一个人可以关注 2 * 关注这个人的人数+100 个人
现在,有A个人关注你,你关注了B个人,问还能关注几个人?
https://atcoder.jp/contests/abc182/tasks/abc182_b
输入一个长度为N的数组,A1, A2, .., AN
输出一个数字,使得输出的数字是尽可能多个数字的约数,如果多解输出任意一个
#include <bits/stdc++.h> using namespace std; int main() { int n, a[100]; int m = 0, r = -1, c = 0; cin >> n; for(int i = 0; i < n; i++){ cin >> a[i]; } for(int i = 2; i <= 1000; i++){ c = 0; for(int j = 0; j < n; j++){ if(a[j] % i == 0){ c++; } } if(m < c){ m = c; r = i; } } cout << r << endl; return 0; }
https://atcoder.jp/contests/abc182/tasks/abc182_c
输入一个数字,删去其中若干位数字,让结果变成3的倍数,问至少删几位
不能全删,如果无解输出-1
https://atcoder.jp/contests/abc182/tasks/abc182_d
https://atcoder.jp/contests/abc182/tasks/abc182_e
https://atcoder.jp/contests/abc182/tasks/abc182_f
https://atcoder.jp/contests/abc183/tasks/abc183_a
输入x,如果 x >= 0 那么输出 x,如果 x < 0 那么输出 0
https://atcoder.jp/contests/abc183/tasks/abc183_b
输入坐标(sx,sy)
瞄准x轴发射,反弹,击中(gx,gy)
问应该瞄准的位置的x坐标是多少
https://atcoder.jp/contests/abc183/tasks/abc183_c
有N个城市,已知两两之间的距离,
希望从城市1出发,访问每个城市恰好一次,回到城市1
问有多少种排列可以让时间恰好是K?
https://atcoder.jp/contests/abc183/tasks/abc183_d
https://atcoder.jp/contests/abc183/tasks/abc183_e
https://atcoder.jp/contests/abc183/tasks/abc183_f
https://atcoder.jp/contests/abc184/tasks/abc184_a
输入 a, b, c, d 四个整数,输出 a * d - b * c
https://atcoder.jp/contests/abc184/tasks/abc184_b
初始X分,输入一个字符串S,遇到x
减一分,遇到o
加一分,如果已经是0分了就不减分,问最终得分
https://atcoder.jp/contests/abc184/tasks/abc184_c
问需要几步
最多三步
https://atcoder.jp/contests/abc184/tasks/abc184_d
期望DP
https://atcoder.jp/contests/abc184/tasks/abc184_e
https://atcoder.jp/contests/abc184/tasks/abc184_f
https://atcoder.jp/contests/abc185/tasks/abc185_a
输入4个数字,输出其中最小的是多少?
https://atcoder.jp/contests/abc185/tasks/abc185_b
在时间0,手机电量是N,在时间n+0.5
手机电量会增加或减少一
其中有M个区间会增加一,其他时间会减少一
手机电量上限是N
问能不能在T时间还有电
https://atcoder.jp/contests/abc185/tasks/abc185_c
N个相同的球,插入11个隔板,分成12个非空的组,问方案数?
https://atcoder.jp/contests/abc185/tasks/abc185_d
https://atcoder.jp/contests/abc185/tasks/abc185_e
https://atcoder.jp/contests/abc185/tasks/abc185_f
https://atcoder.jp/contests/abc186/tasks/abc186_a
限重N公斤,一块砖W公斤,问能带几块砖
https://atcoder.jp/contests/abc186/tasks/abc186_b
输入H行W列的二维数组,第i行第j列的数组Aij表示这个位置有Aij个砖。
至少删掉多少个砖可以让所有位置的砖的数目相同?
#include <bits/stdc++.h> using namespace std; int main(){ int w,h;cin>>h>>w; int c=w*h; int m=101,s=0; for(int i=0;i<c;i++){ int a;cin>>a; m=min(a,m); s+=a; } cout<<s-m*c<<endl; }
https://atcoder.jp/contests/abc186/tasks/abc186_c
问1到N中有多少个数字,十进制和八进制中都没有7
https://atcoder.jp/contests/abc186/tasks/abc186_d
输入N个数字,问任意两个数字差的绝对值之和
https://atcoder.jp/contests/abc186/tasks/abc186_e
https://atcoder.jp/contests/abc186/tasks/abc186_f
https://atcoder.jp/contests/abc187/tasks/abc187_a
输入两个数字,问各个数位之和较大的和是多少。
https://atcoder.jp/contests/abc187/tasks/abc187_b
输入N个点,从中选两个点i和j(i<j
)
问有多少种选法,使得经过这两个点的斜线的斜率在-1和1之间
https://atcoder.jp/contests/abc187/tasks/abc187_c
https://atcoder.jp/contests/abc187/tasks/abc187_d
https://atcoder.jp/contests/abc187/tasks/abc187_e
https://atcoder.jp/contests/abc187/tasks/abc187_f
https://atcoder.jp/contests/abc188/tasks/abc188_a
输入篮球赛比分,保证不是平局
问落后方+3分能不能反超?输出Yes或No
abs(x) 表示 x 的绝对值
https://atcoder.jp/contests/abc188/tasks/abc188_b
输入两个向量,问是否正交,正交的定义看题目或代码。
#include<stdio.h> int a[100001],b[100001],j,n,c=0; int main() { scanf("%d",&n); for(j=0;j<n;j++) scanf("%d",&b[j]); for(j=0;j<n;j++) {scanf("%d",&a[j]); c=a[j]*b[j]+c;} if(c!=0) printf("No"); else printf("Yes"); return 0; }
https://atcoder.jp/contests/abc188/tasks/abc188_c
输入N,有2的次方个人,每个人有一个能力值Ai,能力值互不相同
N个人打淘汰赛,问谁是第二名
https://atcoder.jp/contests/abc188/tasks/abc188_d
有n个服务需要用,第i个服务需要从第ai天用到第bi天,每天ci元
如果购买Snuke Prime只需要付每天C元,便可以用所有服务(不需要付每个服务的ci)
问至少花多少钱?
https://atcoder.jp/contests/abc188/tasks/abc188_e
https://atcoder.jp/contests/abc188/tasks/abc188_f
https://atcoder.jp/contests/abc189/tasks/abc189_a
输入三个字母,如果都一样,输出Won,否则输出Lost
https://atcoder.jp/contests/abc189/tasks/abc189_b
n杯酒,一杯一杯喝,每一杯有容量V和浓度P,问喝到第几杯,已经喝的酒精>X
https://atcoder.jp/contests/abc189/tasks/abc189_c
输入N,和一个长度为N的数组,选择区间L,R
最大化(R-L+1)*L到R区间的最小值
最优做法是
但是本题 很小,只有 10000 时间复杂度 也可以通过
https://atcoder.jp/contests/abc189/tasks/abc189_d
https://atcoder.jp/contests/abc189/tasks/abc189_e
https://atcoder.jp/contests/abc189/tasks/abc189_f
https://atcoder.jp/contests/abc190/tasks/abc190_a
Takahashi 有 A 个糖
Aoki 有 B 个糖
两个人轮流吃糖
如果 C=0 那么 Takahashi 先吃
如果 C=1 那么 Aoki 先吃
谁先没糖吃,谁就输了
问谁能赢
https://atcoder.jp/contests/abc190/tasks/abc190_b
n个技能,每个技能施法时间Xi,伤害Yi,问有没有施法时间<S
且伤害>D
的技能
#include <bits/stdc++.h> using namespace std; int n, s, d, x, y; int main() { cin >> n >> s >> d; for (int i = 0; i < n; i++) { cin >> x >> y; if (x < s && y > d) { cout << "Yes" << endl; return 0; } } cout << "No" << endl; return 0; }
https://atcoder.jp/contests/abc190/tasks/abc190_c
N个盘子,M个条件,第i个条件是盘子Ai和盘子Bi上都有球
K(K<=16)个人, 第i个人可以往盘子Ci或盘子Di上放一个球,二选一
问至多满足多少个条件?
https://atcoder.jp/contests/abc190/tasks/abc190_d
https://atcoder.jp/contests/abc190/tasks/abc190_e
https://atcoder.jp/contests/abc190/tasks/abc190_f
https://atcoder.jp/contests/abc191/tasks/abc191_a
输入V,T,S,D,V是速度,D是路程,问时间是否在T和S之间,不在输出Yes,在输出No
https://atcoder.jp/contests/abc191/tasks/abc191_b
输入n,x,和一个长度为n的数组A,把A中的x都删掉,输出剩下的数字保持原序。
#include <bits/stdc++.h> using namespace std; int main() {int X, A; for (cin >> X >> X; cin >> A;) if (A - X) cout << A << " ";}
https://atcoder.jp/contests/abc191/tasks/abc191_c
https://atcoder.jp/contests/abc191/tasks/abc191_d
https://atcoder.jp/contests/abc191/tasks/abc191_e
https://atcoder.jp/contests/abc191/tasks/abc191_f
https://atcoder.jp/contests/abc192/tasks/abc192_a
输入x,问至少将x增加多少,才能使得结果是100的倍数,不能不增加。
https://atcoder.jp/contests/abc192/tasks/abc192_b
输入一个字符串,从0开始下标,问是不是所有奇数位的字母都是小写且所有偶数位的字母都是大写
输出Yes
或No
https://atcoder.jp/contests/abc192/tasks/abc192_c
https://atcoder.jp/contests/abc192/tasks/abc192_d
https://atcoder.jp/contests/abc192/tasks/abc192_e
https://atcoder.jp/contests/abc192/tasks/abc192_f
https://atcoder.jp/contests/abc193/tasks/abc193_a
输入原价格A,和现价格B,问折扣了百分之多少?保留至少两位小数
#include <bits/stdc++.h> using namespace std; int main() { double a, b; cin >> a >> b; printf("%.6f\n", (1 - b / a) * 100); return 0; }
https://atcoder.jp/contests/abc193/tasks/abc193_b
n个商店,走到第i个商店需要Ai分钟,价格是Pi,库存是Xi
如果Xi<=Ai这个店会在自己走到之前卖完
需要选一个有存货的商店买一个商品,问至少需要多少钱
如果买不到输出-1
https://atcoder.jp/contests/abc193/tasks/abc193_c
输入N,问1到N中有多少个数字不是能表示为 某个数字的某次幂
某个数字的某次幂 要求指数和底数都至少是2
https://atcoder.jp/contests/abc193/tasks/abc193_d
https://atcoder.jp/contests/abc193/tasks/abc193_e
https://atcoder.jp/contests/abc193/tasks/abc193_f
https://atcoder.jp/contests/abc194/tasks/abc194_a
输入数量为A的 milk solids-not-fat,和数量为B的 milk fat
milk solids的数量是 milk fat 和 milk solids-not-fat 相加
如果 milk solids >= 15 且 milk fat >= 8 输出 1
如果 milk solids >= 10 且 milk fat >= 3 输出 2
如果 milk solids >= 3 输出 3
如果以上都不满足 输出 4
https://atcoder.jp/contests/abc194/tasks/abc194_b
一共A和B两个任务,n个人,每个人完成任务有时间Ai和Bi
可以把这两个任务分给某两个人或者是一个人,希望总完成时间最短
分别找到两个数组的最快和次快
如果两个最快不是同一人,直接输出答案
如果两个最快是同一人,分三种情况讨论
https://atcoder.jp/contests/abc194/tasks/abc194_c
https://atcoder.jp/contests/abc194/tasks/abc194_d
https://atcoder.jp/contests/abc194/tasks/abc194_e
https://atcoder.jp/contests/abc194/tasks/abc194_f
https://atcoder.jp/contests/abc195/tasks/abc195_a
输入M和H,问H是否是M的倍数
https://atcoder.jp/contests/abc195/tasks/abc195_b
输入A,B,W,每个橘子的质量在A克和B克之间,已知若干个橘子重量是W
千克
问至多多少个,至少多少个,如果无解输出UNSATISFIABLE
https://atcoder.jp/contests/abc195/tasks/abc195_c
https://atcoder.jp/contests/abc195/tasks/abc195_d
https://atcoder.jp/contests/abc195/tasks/abc195_e
https://atcoder.jp/contests/abc195/tasks/abc195_f
https://atcoder.jp/contests/abc196/tasks/abc196_a
输入a b c d
已知a<=x<=b
并且c<=y<=d
问x-y
最大是多少?
https://atcoder.jp/contests/abc196/tasks/abc196_b
输入非负实数X,输出X下取整
X的整数部分和小数部分都可能有100位
https://atcoder.jp/contests/abc196/tasks/abc196_c
https://atcoder.jp/contests/abc196/tasks/abc196_d
https://atcoder.jp/contests/abc196/tasks/abc196_e
https://atcoder.jp/contests/abc196/tasks/abc196_f
https://atcoder.jp/contests/abc197/tasks/abc197_a
输入三个字母,把第一个字母挪到最后,输出这三个字母
https://atcoder.jp/contests/abc197/tasks/abc197_b
输入一个二维数组,表示空地还是障碍物,问从起点往上下左右看,能看到多少个格子?
https://atcoder.jp/contests/abc197/tasks/abc197_c
https://atcoder.jp/contests/abc197/tasks/abc197_d
https://atcoder.jp/contests/abc197/tasks/abc197_e
https://atcoder.jp/contests/abc197/tasks/abc197_f
https://atcoder.jp/contests/abc198/tasks/abc198_a
输入一个正整数N,把N分成两个正整数的和,问有多少个方案?
https://atcoder.jp/contests/abc198/tasks/abc198_b
输入数字N,可以在开头加上任意个0,问能不能让这个数字变成回文数?
https://atcoder.jp/contests/abc198/tasks/abc198_c
https://atcoder.jp/contests/abc198/tasks/abc198_d
https://atcoder.jp/contests/abc198/tasks/abc198_e
https://atcoder.jp/contests/abc198/tasks/abc198_f
https://atcoder.jp/contests/abc199/tasks/abc199_a
输入 A,B,C
判断A*A+B*B<C*C
是否成立,输出Yes或No
https://atcoder.jp/contests/abc199/tasks/abc199_b
输入N和两个长度为N的数组A和B
问有多少个x满足x大于等于A中的任意数字且小于等于B中的任意数字
https://atcoder.jp/contests/abc199/tasks/abc199_c
输入一个长度为2N的字符串,两种操作
Ti=1 交换第Ai和第Bi个字符,下标从1开始
Ti=2 交换字符串的前N个和后N个字符
问最终字符串是什么
https://atcoder.jp/contests/abc199/tasks/abc199_d
https://atcoder.jp/contests/abc199/tasks/abc199_e
输入N和M,问有多少个1到N的排列满足M个限制条件
第i个限制条件是在排列的前Xi个数字中至多有Zi个数字<=Yi
https://atcoder.jp/contests/abc199/tasks/abc199_f
https://atcoder.jp/contests/abc200/tasks/abc200_a
输入n,问是哪个世纪?
https://atcoder.jp/contests/abc200/tasks/abc200_b
对n做操作:如果n是200的倍数,/=200,否则在n的数字串末尾加上200三位数字
输入n,和k,输出n做k次操作的结果
#include<bits/stdc++.h> int main(){ long long n,k; scanf("%lld%lld",&n,&k); while(k--){ if(n%200==0)n/=200; else n=n*1000+200; } printf("%lld\n",n); }
https://atcoder.jp/contests/abc200/tasks/abc200_c
https://atcoder.jp/contests/abc200/tasks/abc200_d
https://atcoder.jp/contests/abc200/tasks/abc200_e
https://atcoder.jp/contests/abc200/tasks/abc200_f
https://atcoder.jp/contests/abc201/tasks/abc201_a
输入三个数字,问重新排列之后能不能构成等差数列?
https://atcoder.jp/contests/abc201/tasks/abc201_b
输入N座山的名字和高度,问第二高的山名字是什么?
https://atcoder.jp/contests/abc201/tasks/abc201_c
https://atcoder.jp/contests/abc201/tasks/abc201_d
https://atcoder.jp/contests/abc201/tasks/abc201_e
https://atcoder.jp/contests/abc201/tasks/abc201_f
https://atcoder.jp/contests/abc202/tasks/abc202_a
三个色子,已知任意相对两面和为7,顶面三个色子分别是A, B, C
问底面三个数字之和是多少
https://atcoder.jp/contests/abc202/tasks/abc202_b
输入一个数字,输出旋转180度之后的结果。
https://atcoder.jp/contests/abc202/tasks/abc202_c
https://atcoder.jp/contests/abc202/tasks/abc202_d
https://atcoder.jp/contests/abc202/tasks/abc202_e
https://atcoder.jp/contests/abc202/tasks/abc202_f
https://atcoder.jp/contests/abc203/tasks/abc203_a
输入三个数字,如果其中有2个相同,输出第三个,如果三个两两不同,输出0。
https://atcoder.jp/contests/abc203/tasks/abc203_b
第i层楼,第j个房间的门牌号是i0j,一共n层楼,每层k个房间,问所有门牌号之和。
#include<bits/stdc++.h> using namespace std; int n,m; int main(){ cin>>n>>m; cout<<n*(1+m)*m/2+m*(1+n)*n/2*100; }
https://atcoder.jp/contests/abc203/tasks/abc203_c
https://atcoder.jp/contests/abc203/tasks/abc203_d
https://atcoder.jp/contests/abc203/tasks/abc203_e
https://atcoder.jp/contests/abc203/tasks/abc203_f
https://atcoder.jp/contests/abc204/tasks/abc204_a
你和另外2个人玩石头剪刀布,你知道另外2个人出的是什么,你要让结果变为平局。
https://atcoder.jp/contests/abc204/tasks/abc204_b
有n个树,每个树上有一些坚果,如果坚果的个数大于10,会拿到只剩10个,否则一个都不拿,问一共拿几个?
https://atcoder.jp/contests/abc204/tasks/abc204_c
https://atcoder.jp/contests/abc204/tasks/abc204_d
输入N个数字,分成两组,使得和较大的一组,越小越好
https://atcoder.jp/contests/abc204/tasks/abc204_e
最短路
需要求 x + d / (t + x) 的最小值
https://atcoder.jp/contests/abc204/tasks/abc204_f
问覆盖方案数
状态压缩DP,矩阵乘法
https://atcoder.jp/contests/abc205/tasks/abc205_a
每100毫升饮料包含A卡路里能量,问B毫升饮料包含多少卡路里能量,保留至少6位小数
https://atcoder.jp/contests/abc205/tasks/abc205_b
输入一个长度为n的数组,判断是不是1到n的排列。
是1到n排列的充分必要条件是1到n每个数字出现恰好一次。
https://atcoder.jp/contests/abc205/tasks/abc205_c
https://atcoder.jp/contests/abc205/tasks/abc205_d
https://atcoder.jp/contests/abc205/tasks/abc205_e
https://atcoder.jp/contests/abc205/tasks/abc205_f
https://atcoder.jp/contests/abc206/tasks/abc206_a
输入N,问 1.08 * N下取整 和206的大小关系
如果 1.08 * N下取整 小于 206 输出 Yay!
如果 1.08 * N下取整 等于 206 输出 so-so
如果 1.08 * N下取整 大于 206 输出 :(
https://atcoder.jp/contests/abc206/tasks/abc206_b
第1天存1块钱,第2天存2块钱……第i天存i块钱,
问多少天能存够n的钱。
https://atcoder.jp/contests/abc206/tasks/abc206_c
输入一个数组,从中选两个下标,满足i<j
且a[i]!=a[j]
问有多少种选法?
https://atcoder.jp/contests/abc206/tasks/abc206_d
https://atcoder.jp/contests/abc206/tasks/abc206_e
问满足条件的对数
容斥原理
https://atcoder.jp/contests/abc206/tasks/abc206_f
https://atcoder.jp/contests/abc207/tasks/abc207_a
输入3个数字A, B, C问其中较大的两个的和是多少?
https://atcoder.jp/contests/abc207/tasks/abc207_b
输入正整数A, B, C, D,问是否存在自然数x使得 A + x * B <= x * C * D
如果存在输出最小的x,如果不存在输出-1
A + x * B <= x * C * D
A <= x * (C * D - B)
A是正数
如果 C * D - B <= 0,那么不可能成立
如果 C * D - B > 0
那么最小的 x 是 A / (C * D - B) 上取整
x / y 上取整 等于 (x + y - 1) / y 下取整
https://atcoder.jp/contests/abc207/tasks/abc207_c
https://atcoder.jp/contests/abc207/tasks/abc207_d
https://atcoder.jp/contests/abc207/tasks/abc207_e
https://atcoder.jp/contests/abc207/tasks/abc207_f
https://atcoder.jp/contests/abc208/tasks/abc208_a
问A个1到6的数字之和是否可能是B,输出Yes或No
https://atcoder.jp/contests/abc208/tasks/abc208_b
有10种硬币面值,分别为1!,2!,3!,...,10!,其中N!表示N的阶乘
问凑出P的价格,至少需要多少枚硬币
https://atcoder.jp/contests/abc208/tasks/abc208_c
https://atcoder.jp/contests/abc208/tasks/abc208_d
https://atcoder.jp/contests/abc208/tasks/abc208_e
https://atcoder.jp/contests/abc208/tasks/abc208_f
https://atcoder.jp/contests/abc209/tasks/abc209_a
输入A和B,问有多少个数字大于等于A且小于等于B
https://atcoder.jp/contests/abc209/tasks/abc209_b
当前有X元钱,买N个商品,第偶数个买的商品可以减一元
问钱够不够,输出Yes
或No
。
https://atcoder.jp/contests/abc209/tasks/abc209_c
输入N和长度为N的数组C
选择N个数字,要求选择的第i个数字1<=a[i]<=c[i]
且A中不能有相同的数字
https://atcoder.jp/contests/abc209/tasks/abc209_d
https://atcoder.jp/contests/abc209/tasks/abc209_e
https://atcoder.jp/contests/abc209/tasks/abc209_f
https://atcoder.jp/contests/abc210/tasks/abc210_a
买n个白菜,每个价格是x
如果买够了a个,之后每个价格是y
问需要多少钱?
5 3 20 15
买5个,每个20,但是买第三个以后,每个价格只要15
所以总价格是 20 * 3 + 15 * 2 = 90
10 10 100 1
买10个,每个100,买第10个之后,每个价格只要1
总价格是 100 * 10 = 1000
https://atcoder.jp/contests/abc210/tasks/abc210_b
输入一个01
字符串,问前缀有多少个0
如果有偶数个0
,输出Takahashi
如果有奇数个0
,输出Aoki
https://atcoder.jp/contests/abc210/tasks/abc210_c
输出N,K,和长度为N的数组
选择长度为K的区间,希望去年内不同数字的个数最多,问最多多少?
https://atcoder.jp/contests/abc210/tasks/abc210_d
https://atcoder.jp/contests/abc210/tasks/abc210_e
一个环形,求MST
Kruskal,GCD
https://atcoder.jp/contests/abc210/tasks/abc210_f
https://atcoder.jp/contests/abc211/tasks/abc211_a
输入A和B,输出(A-B)/3+B,保留至少5位小数
https://atcoder.jp/contests/abc211/tasks/abc211_b
输入四个字符串,问是不是3B, HR, 2B, H
四个字符串,输出Yes
或No
。
https://atcoder.jp/contests/abc211/tasks/abc211_c
输入一个字符串S,问有多少个位置不同的子序列是 chokudai 答案模1000000007输出
https://atcoder.jp/contests/abc211/tasks/abc211_d
输入一个无向图,问从1到N的最短路有多少条?
https://atcoder.jp/contests/abc211/tasks/abc211_e
输入一个N * N的地图
从中选取一个四连通大小为K的区域
问有多少种选法
set vector 爆搜
https://atcoder.jp/contests/abc211/tasks/abc211_f
输入 N 个多边形
Q个询问,询问一个格子被覆盖了多少次
离线树状数组
https://atcoder.jp/contests/abc212/tasks/abc212_a
输入A和B
如果A大于0且B等于0,输出Gold
如果B大于0且A等于0,输出Silver
如果A和B都大于0,输出Alloy
https://atcoder.jp/contests/abc212/tasks/abc212_b
输入一个四位数字密码
如果四位一样,或者是正序连续四个整数(9后面接0也算连续)输出Weak
否则输出Strong
https://atcoder.jp/contests/abc212/tasks/abc212_c
https://atcoder.jp/contests/abc212/tasks/abc212_d
https://atcoder.jp/contests/abc212/tasks/abc212_e
https://atcoder.jp/contests/abc212/tasks/abc212_f
https://atcoder.jp/contests/abc212/tasks/abc212_g
https://atcoder.jp/contests/abc212/tasks/abc212_h
https://atcoder.jp/contests/abc213/tasks/abc213_a
输入 A 和 B 输出 A 异或 B (A^B)
https://atcoder.jp/contests/abc213/tasks/abc213_b
输入n个数字,输出第2大数字的下标是什么?从1开始下标
https://atcoder.jp/contests/abc213/tasks/abc213_c
https://atcoder.jp/contests/abc213/tasks/abc213_d
输入一个树,输出欧拉序,先访问标号较小的孩子
https://atcoder.jp/contests/abc213/tasks/abc213_e
https://atcoder.jp/contests/abc213/tasks/abc213_f
https://atcoder.jp/contests/abc213/tasks/abc213_g
https://atcoder.jp/contests/abc213/tasks/abc213_h
https://atcoder.jp/contests/abc214/tasks/abc214_a
输入n
输出4 如果1<=n<=125
输出6 如果126<=n<=211
输出8 如果212<=n<=214
https://atcoder.jp/contests/abc214/tasks/abc214_b
问有多少组非负整数(a,b,c)
满足a+b+c<=S
且a*b*c<=T
https://atcoder.jp/contests/abc214/tasks/abc214_c
https://atcoder.jp/contests/abc214/tasks/abc214_d
输入一个树,有边权
设f(x,y)表示x和y之间路径上边权的最大值
对于所有(x, y)一共有n*(n-1)/2
对,求f(x,y)之和
https://atcoder.jp/contests/abc214/tasks/abc214_e
https://atcoder.jp/contests/abc214/tasks/abc214_f
https://atcoder.jp/contests/abc214/tasks/abc214_g
https://atcoder.jp/contests/abc214/tasks/abc214_h
https://atcoder.jp/contests/abc215/tasks/abc215_a
输入一个字符串,如果恰好是Hello,World!,输出Yes,否则输出No
https://atcoder.jp/contests/abc215/tasks/abc215_b
输入n,找到最大的k,使得2**k<=n
https://atcoder.jp/contests/abc215/tasks/abc215_c
https://atcoder.jp/contests/abc215/tasks/abc215_d
输入n和长度为n的数组,问1到m中哪些数字,和数组中所有数字都互质
https://atcoder.jp/contests/abc215/tasks/abc215_e
https://atcoder.jp/contests/abc215/tasks/abc215_f
https://atcoder.jp/contests/abc215/tasks/abc215_g
https://atcoder.jp/contests/abc215/tasks/abc215_h
https://atcoder.jp/contests/abc216/tasks/abc216_a
输入X.Y,根据Y的范围,输出X-,X,X+三者之一
https://atcoder.jp/contests/abc216/tasks/abc216_b
输入n个人的姓氏和名字,问是否存在两个人姓氏和名字都相同
https://atcoder.jp/contests/abc216/tasks/abc216_c
https://atcoder.jp/contests/abc216/tasks/abc216_d
https://atcoder.jp/contests/abc216/tasks/abc216_e
https://atcoder.jp/contests/abc216/tasks/abc216_f
https://atcoder.jp/contests/abc216/tasks/abc216_g
https://atcoder.jp/contests/abc216/tasks/abc216_h
https://atcoder.jp/contests/abc217/tasks/abc217_a
输入两个字符串S和T,问S<T
是否成立,输出Yes或No,字符串之间可以直接比较
https://atcoder.jp/contests/abc217/tasks/abc217_b
输入 ABC
, ARC
, AGC
, AHC
中的三个字符串,输出没输入的字符串
https://atcoder.jp/contests/abc217/tasks/abc217_c
https://atcoder.jp/contests/abc217/tasks/abc217_d
https://atcoder.jp/contests/abc217/tasks/abc217_e
https://atcoder.jp/contests/abc217/tasks/abc217_f
https://atcoder.jp/contests/abc217/tasks/abc217_g
https://atcoder.jp/contests/abc217/tasks/abc217_h
https://atcoder.jp/contests/abc218/tasks/abc218_a
输入n,输出一个长度为n的字符串,问第n个字符是不是o,注意字符串下标从0开始。
https://atcoder.jp/contests/abc218/tasks/abc218_b
输入26个数字,输出对应的26个字母
https://atcoder.jp/contests/abc218/tasks/abc218_c
https://atcoder.jp/contests/abc218/tasks/abc218_d
https://atcoder.jp/contests/abc218/tasks/abc218_e
https://atcoder.jp/contests/abc218/tasks/abc218_f
https://atcoder.jp/contests/abc218/tasks/abc218_g
https://atcoder.jp/contests/abc218/tasks/abc218_h
https://atcoder.jp/contests/abc219/tasks/abc219_a
输入X
如果X<40
输出还差多少到40
如果X<70
输出还差多少到70
如果X<90
输出还差多少到90
如果X>=90
输出expect
https://atcoder.jp/contests/abc219/tasks/abc219_b
输入三个字符串S1, S2, S3
和一个只包含123
的数字串T
把T
中的1
换成S1
,把T
中的2
换成S2
,把T
中的3
换成S3
,并输出
https://atcoder.jp/contests/abc219/tasks/abc219_c
https://atcoder.jp/contests/abc219/tasks/abc219_d
https://atcoder.jp/contests/abc219/tasks/abc219_e
https://atcoder.jp/contests/abc219/tasks/abc219_f
https://atcoder.jp/contests/abc219/tasks/abc219_g
https://atcoder.jp/contests/abc219/tasks/abc219_h
https://atcoder.jp/contests/abc220/tasks/abc220_a
输入A, B, C。输出一个A和B之间C的倍数,如果没有输出-1
https://atcoder.jp/contests/abc220/tasks/abc220_b
输入两个K进制的数字,用十进制输出他们的乘积
https://atcoder.jp/contests/abc220/tasks/abc220_c
https://atcoder.jp/contests/abc220/tasks/abc220_d
https://atcoder.jp/contests/abc220/tasks/abc220_e
https://atcoder.jp/contests/abc220/tasks/abc220_f
https://atcoder.jp/contests/abc220/tasks/abc220_g
https://atcoder.jp/contests/abc220/tasks/abc220_h
https://atcoder.jp/contests/abc221/tasks/abc221_a
输入A和B,输出32的A-B次方
输出 (1<<(5*(A-B)))
或 32**(A-B)
https://atcoder.jp/contests/abc221/tasks/abc221_b
输入字符串S和T,问能不能通过至多一次交换相邻字符操作,使得S等于T?
https://atcoder.jp/contests/abc221/tasks/abc221_c
https://atcoder.jp/contests/abc221/tasks/abc221_d
https://atcoder.jp/contests/abc221/tasks/abc221_e
https://atcoder.jp/contests/abc221/tasks/abc221_f
https://atcoder.jp/contests/abc221/tasks/abc221_g
https://atcoder.jp/contests/abc221/tasks/abc221_h
有限背包,计数
容斥
https://atcoder.jp/contests/abc222/tasks/abc222_a
输入一个数字,如果不是4位数,在开头补零,补到四位输出
printf("%04d\n", 123); cout << setfill('0') << setw(4) << 123 << endl;
print('%04d' % 123)
https://atcoder.jp/contests/abc222/tasks/abc222_b
输入N个数字,问其中有多少个<P
https://atcoder.jp/contests/abc222/tasks/abc222_c
https://atcoder.jp/contests/abc222/tasks/abc222_d
https://atcoder.jp/contests/abc222/tasks/abc222_e
https://atcoder.jp/contests/abc222/tasks/abc222_f
https://atcoder.jp/contests/abc222/tasks/abc222_g
输入K,问最少连续几个2,是K的倍数
Baby Step Gaint Step
https://atcoder.jp/contests/abc222/tasks/abc222_h
https://atcoder.jp/contests/abc223/tasks/abc223_a
输入N,如果N大于0并且是100的倍数,输出Yes,否则输出No
https://atcoder.jp/contests/abc223/tasks/abc223_b
输入一个字符串,可以循环左移或者循环右移
循环左移:把最左边的字符移到最右边 abcdef -> bcdefa
循环右移:把最右边的字符移到最左边 abcdef -> fabcde
问能得到的字典序最大的字符串,和字典序最小的字符串是什么
s = s.substr(1) + s.substr(0, 1)
https://atcoder.jp/contests/abc223/tasks/abc223_c
https://atcoder.jp/contests/abc223/tasks/abc223_d
https://atcoder.jp/contests/abc223/tasks/abc223_e
https://atcoder.jp/contests/abc223/tasks/abc223_f
https://atcoder.jp/contests/abc223/tasks/abc223_g
https://atcoder.jp/contests/abc223/tasks/abc223_h
https://atcoder.jp/contests/abc224/tasks/abc224_a
输入一个字符串,如果以er结尾,输出er,如果以ist结尾,输出ist。
https://atcoder.jp/contests/abc224/tasks/abc224_b
输入一个二维数组,问对于所有1 <= i1 < i2 <= H, 1 <= j1 < j2 <= W
是否满足A[i1][j1] + A[i2][j2] <= A[i2][j1] + A[i1][j2]
全部都满足输出Yes,存在不满足的输出No
https://atcoder.jp/contests/abc224/tasks/abc224_c
输入n个点,问有多少种选法从中选3个,构成一个面积为正的三角形(不能三点共线)
https://atcoder.jp/contests/abc224/tasks/abc224_d
https://atcoder.jp/contests/abc224/tasks/abc224_e
https://atcoder.jp/contests/abc224/tasks/abc224_f
https://atcoder.jp/contests/abc224/tasks/abc224_g
https://atcoder.jp/contests/abc224/tasks/abc224_h
https://atcoder.jp/contests/abc225/tasks/abc225_a
输入一个长度为3的字符串,问将其中的字符重新排列后,能得到多少个不同的字符串
https://atcoder.jp/contests/abc225/tasks/abc225_b
输入一棵树,问是不是星形,即所有点都和其中某个点直接连接
https://atcoder.jp/contests/abc225/tasks/abc225_c
有一个10000000000行7列的矩阵A,第i
行第j
列是(i-1)*7+j
输入N行M列的矩阵B,问是不是A的子矩阵
https://atcoder.jp/contests/abc225/tasks/abc225_d
链表
https://atcoder.jp/contests/abc225/tasks/abc225_e
https://atcoder.jp/contests/abc225/tasks/abc225_f
https://atcoder.jp/contests/abc225/tasks/abc225_g
https://atcoder.jp/contests/abc225/tasks/abc225_h
https://atcoder.jp/contests/abc226/tasks/abc226_a
输入一个实数,输出四舍五入到整数的结果
int(x+0.5)
https://atcoder.jp/contests/abc226/tasks/abc226_b
输入n个数组
每个数组输入长度和内容
问有多少个互不相同的数组
set<vector<int> > s;
vector之间可以互相比较,可以先排序再去重
vector<vector<int> > s; cin >> n; while (n--) { cin >> m; vector<int> a; while (m--) { cin >> x; a.push_back(x); } s.push_back(a); } sort(s.begin(), s.end()); s.resize(unique(s.begin(), s.end()) - s.begin()); cout << s.size() << endl;
https://atcoder.jp/contests/abc226/tasks/abc226_c
一共n个技能,学第i个技能需要花Ti的时间
想学第i个技能需要先学前置条件 Ki个技能(也就是Ai数组中的技能
问学第n个技能需要多久
做法是倒序考虑所有技能,第n个一定学,前置技能标记上要学
枚举到一个技能,如果不需要学就不学,如果需要学就浪费Ti的时间学
并把所有前置技能都标记上需要学
https://atcoder.jp/contests/abc226/tasks/abc226_d
从(x,y)使用技能(a,b)可以移动到(x+a,y+b)上
a和b你来选
种类越少越好
问至少需要几个技能,才能实现从任意一点,到另一点的移动
(在一次移动中只能使用一种技能)
https://atcoder.jp/contests/abc226/tasks/abc226_e
输入一个无向图,你来给边定方向,让图变成有向图,要求每个点出度恰好为一
(入度无所谓
确认每个连通块边数=点数
答案是2**连通块个数
https://atcoder.jp/contests/abc226/tasks/abc226_f
https://atcoder.jp/contests/abc226/tasks/abc226_g
https://atcoder.jp/contests/abc226/tasks/abc226_h
https://atcoder.jp/contests/abc227/tasks/abc227_a
K张牌,轮流发给N个人,从第A个人开始发,问谁拿到最后一张牌?
https://atcoder.jp/contests/abc227/tasks/abc227_b
输入n个Si
问对于哪些Si,肯定不能表示为4*a*b+3*a+3*b
的形式,其中a
和b
是正整数
输出无解的Si的个数
https://atcoder.jp/contests/abc227/tasks/abc227_c
输入n,问0<A<=B<=C
且A*B*C<=N
有多少组整数解
https://atcoder.jp/contests/abc227/tasks/abc227_d
n个部门,第i个部门有ai个人,做一个项目需要来自k个不同部门的各1个人
问至多可以做多少个项目?
需要二分
https://atcoder.jp/contests/abc227/tasks/abc227_e
https://atcoder.jp/contests/abc227/tasks/abc227_f
https://atcoder.jp/contests/abc227/tasks/abc227_g
https://atcoder.jp/contests/abc227/tasks/abc227_h
https://atcoder.jp/contests/abc228/tasks/abc228_a
输入S,T,X。S点整到T点整开灯,问X点30分是否开灯
https://atcoder.jp/contests/abc228/tasks/abc228_b
输入N和X,和长度为N的数组Ai
X知道了一个秘密
如果i知道了这个秘密,他会告诉Ai
问最后多少人知道了这个秘密
https://atcoder.jp/contests/abc228/tasks/abc228_c
N个学生,4天考试,每天的成绩是0到300的整数,已知前3天的成绩
你来给出第四天的成绩,问对于每个人是否可能在前K名当中
名次 = 比自己成绩高的人数+1
https://atcoder.jp/contests/abc228/tasks/abc228_d
https://atcoder.jp/contests/abc228/tasks/abc228_e
https://atcoder.jp/contests/abc228/tasks/abc228_f
https://atcoder.jp/contests/abc228/tasks/abc228_g
https://atcoder.jp/contests/abc228/tasks/abc228_h
https://atcoder.jp/contests/abc229/tasks/abc229_a
输入一个由.
和#
构成的2行2列的字符矩阵,问所有#
之间是不是四连通的
https://atcoder.jp/contests/abc229/tasks/abc229_b
输入A和B,问计算A+B时是否需要进位
https://atcoder.jp/contests/abc229/tasks/abc229_c
输入n种物质,W克的限制
第i种物质两个属性,美味值Ai每克和上限Bi克
问能达到的最大美味值是多少
https://atcoder.jp/contests/abc229/tasks/abc229_d
https://atcoder.jp/contests/abc229/tasks/abc229_e
https://atcoder.jp/contests/abc229/tasks/abc229_f
https://atcoder.jp/contests/abc229/tasks/abc229_g
https://atcoder.jp/contests/abc229/tasks/abc229_h
https://atcoder.jp/contests/abc230/tasks/abc230_a
如果N>=42,先N++
输入N,输出AGCXXX
,其中XXX
应被替换为N,如果N不足三位补零
https://atcoder.jp/contests/abc230/tasks/abc230_b
输入字符串S,问S是不是oxx
重复无限次的一个子串
https://atcoder.jp/contests/abc230/tasks/abc230_c
问象能攻击到的位置
https://atcoder.jp/contests/abc230/tasks/abc230_d
输入N个区间,[Li, Ri]
给定D
,每次操作你可以选一个数字x
,删去[x,x+D-1]
中的所有数字
问至少需要多少次操作,才能让每个区间内都有数字被删掉
https://atcoder.jp/contests/abc230/tasks/abc230_e
输入N,对于i从1到N,求N/i的和
除法分组,商相同的一起算
https://atcoder.jp/contests/abc230/tasks/abc230_f
https://atcoder.jp/contests/abc230/tasks/abc230_g
https://atcoder.jp/contests/abc230/tasks/abc230_h
https://atcoder.jp/contests/abc231/tasks/abc231_a
输入D,输出D/100。如果答案有小数部分,要输出小数部分。
https://atcoder.jp/contests/abc231/tasks/abc231_b
输入N个字符串,问哪个字符串出现的次数最多?
https://atcoder.jp/contests/abc231/tasks/abc231_c
输入N个数字Ai,Q个询问Xj
对于每个询问,问有多少个Ai大于等于Xj
https://atcoder.jp/contests/abc231/tasks/abc231_d
N个人排队,其中M对人想紧挨着,问有没有可能
不能有度数大于等于3的点,不能有环
https://atcoder.jp/contests/abc231/tasks/abc231_e
有N种面值的硬币,想支付X的钱数,允许找钱
保证硬币的面值之间互为倍数
问支付加找回至少需要几个硬币
https://atcoder.jp/contests/abc231/tasks/abc231_f
https://atcoder.jp/contests/abc231/tasks/abc231_g
https://atcoder.jp/contests/abc231/tasks/abc231_h
https://atcoder.jp/contests/abc232/tasks/abc232_a
输入AxB
输出A*B
https://atcoder.jp/contests/abc232/tasks/abc232_b
输入字符串S和T,你可以shift其中一个字符串
shift:每个字母都变成下一个字母,z变成a
问能否让两个字符串相等
https://atcoder.jp/contests/abc232/tasks/abc232_c
输入两个图,问重新编号之后能否全等
这个题n特别小,需要枚举全排列
next_permutation
输入两个图
cin >> x >> y; a[x][y] = a[y][x] = 1; do { bool f = 1; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (a[i][j] != b[p[i]][p[j]]) { f = 0; } } } if (f == 1) { cout << "Yes" << endl; return 0; } } while (next_permutation(p + 1, p + n + 1)); // p 是一个排列 cout << "No" << endl; return 0;
https://atcoder.jp/contests/abc232/tasks/abc232_d
输入一个H行W列的数组
从左上角出发,每次只能向右或向下,问最多能经过多少个格子
f[i][j] 能否到 (i, j) for (int i = 0; i <n; i+) { for (int j = 0; j < m; ) { if (自己不是障碍物 && (上面能到 || 左边能到)) { 自己能到 z = max(z, i + j + 1); } } } for (int i = 0; i <n; i+) { for (int j = 0; j < m; j++) { if (自己不是障碍物 && 自己能到) { 如果自己有下面 && 右边不是障碍物 下面能到 如果自己有右边 && 右边不是障碍物 右边能到 z = max(z, i + j + 1); } } }
https://atcoder.jp/contests/abc232/tasks/abc232_e
国际象棋棋盘
一个车
从x1 y1 走到x2 y2
走恰好k步,问方案数
最基本的动态规划: f[k][i][j] 走到 (i, j) 恰好k步的方案数 for (k=0 to 步数) for i 每行 for j 每列 f[k][i][j] = 0 for (x, y) 和 (i, j) 在同一行或同一列,但不是 (i, j) f[k][i][j] += f[k-1][x][y] (步数+1,行数,列数) 因为步数从0开始 注意到 f[k] 是 H * W 的数组,数组里只有4种值 (x1, y1) (x1, 非y1) (非x1, y1) (非x1, 非y1) 实际上不需要维护 H * W 的数组,只需要维护这四个值就可以了 0 1 0 0 0 0 1 0 1 0 1 0 1 3 1 2 0 2 6 2 6 3 7 3 未优化: f[3][2][1] = 3 f[3][2][3] = 3 优化后: f[3][非x1 非y1] = 3 H 行 W 列 (x1,y1) = (x1,非y1) * (W-1) + (非x1,y1) * (H-1) (x1,非y1) = (x1,非y1) * (W-2) + (x1,y1) + (非x1,非y1) * (H-1) (非x1,y1) = (非x1,y1) * (H-2) + (x1,y1) + (非x1,非y1) * (W-1) (非x1,非y1) = (非x1,非y1) * (H+W-4) + (非x1,y1) + (x1,非y1) 注意到 H>=2 W>=2 所以没什么特殊情况 最后根据 x2是否等于x1 y2是否等于y1 决定输出四个中的哪个
https://atcoder.jp/contests/abc232/tasks/abc232_f
输入两个数组,A和B
对A进行操作,可以+1或者-1, 花费X的代价
可以交换两个相邻的元素,花费Y的代价
问最小代价是什么
核心是决定A的一个排列(代价:交换次数 * Y)
和B比较,代价是 对应的位置绝对值的差 * X
核心就是用一个数字表示一个集合
f[A中用了哪些数字] 匹配B中前几个数字 for (每个集合i) for (不在集合中的j) f[集合i 并 元素j] = min(f[集合i 并 元素j], f[i] + abs(a[j]-b[该第几个元素了])*Y + 交换次数*X) cout << f[全集] <<endl;
https://atcoder.jp/contests/abc232/tasks/abc232_g
https://atcoder.jp/contests/abc232/tasks/abc232_h
国际象棋的王遍历棋盘,从(1,1)
出发,到(a,b)
结束
构造出方案
每次走一条边?最后2x2
特殊处理?
https://atcoder.jp/contests/abc233/tasks/abc233_a
输入X和Y,问在X的基础上,再加几个10,可以>=Y
https://atcoder.jp/contests/abc233/tasks/abc233_b
输入L和R,和字符串S,翻转第L个字符到第R个字符所组成的区间,输出
字符串从1开始下标,包含第L个和第R个
https://atcoder.jp/contests/abc233/tasks/abc233_c
输入N个数组,和一个整数X,第i个数组长度是Li,内容是aij
每个数组里取一个数字,要求乘积等于X,问方案数
https://atcoder.jp/contests/abc233/tasks/abc233_d
输入一个数组,有正有负,问有多少个区间和为K
Σ[k=0..10^100]floor(X/10^k)
https://atcoder.jp/contests/abc233/tasks/abc233_e
输入一个数字X,问所有前缀和是多少?
比如输入 1225 应该输出 1225 + 122 + 12 + 1 = 1360
https://atcoder.jp/contests/abc233/tasks/abc233_f
给一些交换,问能不能排序输入的数列
直接贪心就可以了
https://atcoder.jp/contests/abc233/tasks/abc233_g
https://atcoder.jp/contests/abc233/tasks/abc233_h
https://atcoder.jp/contests/abc234/tasks/abc234_a
定义f(x)=x*x+2*x+3
输入t
,输出f(f(f(t)+t)+f(f(t)))
保证结果在 int 范围内
https://atcoder.jp/contests/abc234/tasks/abc234_b
输入N个点,从中选两个点,选出的两个点之间距离最大是多少?
https://atcoder.jp/contests/abc234/tasks/abc234_c
问第K小的,只包含0和2的正整数是什么?
https://atcoder.jp/contests/abc234/tasks/abc234_d
输入一个排列,和一个数字K
问对于所有长度大于等于K的前缀,第K大数字是什么?
https://atcoder.jp/contests/abc234/tasks/abc234_e
输入一个数字X,问大于等于X,最小的等差数列数是多少?
等差数列数:单独看每一位,是个等差数列
https://atcoder.jp/contests/abc234/tasks/abc234_f
输入一个字符串,长度至多5000
从字符串中选一个子序列
然后再重排这个子序列,问有多少种可能的结果?
选子序列的时候,重要的是每种字符选了多少个,顺序不重要
所以输入的s不重要,重要的是s中每种字母多少个
f[i][j]
前i种字母,总长度是j,方案有多少种
for i
for j
for k // 第i+1种字母选了多少个?
f[i + 1][j + k] += f[i][j] * c[j + k][k]
https://atcoder.jp/contests/abc234/tasks/abc234_g
https://atcoder.jp/contests/abc234/tasks/abc234_h
https://atcoder.jp/contests/abc235/tasks/abc235_a
输入三位数abc
输出abc+bca+cab
https://atcoder.jp/contests/abc235/tasks/abc235_b
输入一个数组,从左向右看,问第一次不变或减少是什么数字
https://atcoder.jp/contests/abc235/tasks/abc235_c
输入一个数组
询问x和k
问第k次出现x的位置
map<int, vector<int> > g;
https://atcoder.jp/contests/abc235/tasks/abc235_d
输入a和N
从1操作到N
每次可以乘以a
或者是把个位移动到最高位 123 -> 321
问至少需要几步
https://atcoder.jp/contests/abc235/tasks/abc235_e
先求MST题
每次询问一条边,问加入这条边能不能让MST变小 / 问这条边是不是这条路径上最大的
https://atcoder.jp/contests/abc235/tasks/abc235_f
输入N,和M个1位数(没有重复)
问1到N中,包含所有M位的数字,和是多少
(前导0不算包含0)
状态压缩数位动态规划
f[i][j]
i位数字包含j这些位数,的方案数,允许前导0
数位DP
https://atcoder.jp/contests/abc235/tasks/abc235_g
A个A种子
B个B种子
C个C种子
放到N个花园里
花园可区分
种子不可区分
每个花园至少一个种子
每个花园每种种子至多一个
种子不需要用完
反演
https://atcoder.jp/contests/abc235/tasks/abc235_h
https://atcoder.jp/contests/abc236/tasks/abc236_a
输入一个字符串S
,交换第a
个和第b
个字符,输出交换之后的结果
https://atcoder.jp/contests/abc236/tasks/abc236_b
从4个1,4个2……4个n中删去一个数字,输出剩下的4n-1
个数字,问被删去的是什么?
https://atcoder.jp/contests/abc236/tasks/abc236_c
一个铁路上有n个站,输入n个站的名字
但是快车不停所有站,只停其中m个,输入这m个站的名字
对于每个站,问快车停不停?
https://atcoder.jp/contests/abc236/tasks/abc236_d
输入2n个人,要组成n对,已知每两个人组队的亲和力
最终的欢乐值是所有n对亲和力的异或
问欢乐值最大是多少?
https://atcoder.jp/contests/abc236/tasks/abc236_e
输入n个数字,从中选取若干个数字,要求任意连续两个数字,至少选了其中一个
问选取的数字,平均值最大是多少?中位数最大是多少?
https://atcoder.jp/contests/abc236/tasks/abc236_f
有2**n-1
种香料,每种香料有一个价格,只要买了就可以无限的使用
如果有i
香料和j
香料,可以合成出i^j
香料
希望买一些香料,可以合成出所有香料,问最少花多少钱?
https://atcoder.jp/contests/abc236/tasks/abc236_g
https://atcoder.jp/contests/abc236/tasks/abc236_h
https://atcoder.jp/contests/abc237/tasks/abc237_a
输入一个 long long 范围(-2**63 <= N <= 2**63-1)
内的整数 N
问 N
在不在 int 范围内(-2**31 <= N <= 2**31-1)
输出 Yes
或 No
https://atcoder.jp/contests/abc237/tasks/abc237_b
输入一个H行,W列的矩阵,输出他的转置
注意数据范围,不能开一个100000*100000
的数组
保证输入的 行数乘以列数 至多是100000
(行变成列,列变成行)
https://atcoder.jp/contests/abc237/tasks/abc237_c
输入一个字符串,问能不能在开始加若干个(可以是0
个)a
,使得字符串变成回文串
https://atcoder.jp/contests/abc237/tasks/abc237_d
刚开始有一个数字是[0]
(只包含一个0
)
依次进行N
个操作,
如果第i
个操作是L
,那么就把i
插入到i-1
的左边
如果第i
个操作是R
,那么就把i
插入到i-1
的右边
https://atcoder.jp/contests/abc237/tasks/abc237_e
有n个点,m条边,边是双向的,保证图是连通的,第i
个点有高度hi
从点x
到点y
,如果是下降的,幸福值增加hx-hy
从点x
到点y
,如果是上升的,幸福值减少2*(hy-hx)
如果高度相同,那么幸福值不变
从点1
出发,到任意一点结束,问幸福值最大是多少?
https://atcoder.jp/contests/abc237/tasks/abc237_f
https://atcoder.jp/contests/abc237/tasks/abc237_g
https://atcoder.jp/contests/abc237/tasks/abc237_h
https://atcoder.jp/contests/abc238/tasks/abc238_a
输入n,问是否2**n>n**2
,输出Yes
或No
https://atcoder.jp/contests/abc238/tasks/abc238_b
一个Pizza切N+1刀
第0刀在0的位置上,之后切第i刀之前,先顺时针旋转Pizza Ai度,再下刀
问最后最大的一块,圆心角是多少?
https://atcoder.jp/contests/abc238/tasks/abc238_c
设f(x)
是小于等于x
,且位数和x
的位数相同的数字个数
输入n
,求(f(1)+f(2)+...+f(n))%998244353
f(x)=x+1-小于等于x最大的10的次幂
https://atcoder.jp/contests/abc238/tasks/abc238_d
输入非负整数a
和s
,问是否存(x,y)
使得(x&y)==a
且(x+y)==s
&
是按位与
https://atcoder.jp/contests/abc238/tasks/abc238_e
有一个长度为n
的数组,已知其中q
个区间的和,问能不能推断出所有数字的和?
https://atcoder.jp/contests/abc238/tasks/abc238_f
n个人考两次试,每个人有两个排名(没有并列)
从中选去k个人,要求不存在 某个没被选上的人 两场考试都比 某个被选上的人 好
问方案数
一共n个人,选m个人
在第1场考试中的前i个人中,选了j个人,没选的人的人中第2场考试名次最好的是k
初始值
f[0][0][n+1]=1
要决定是否选择第一场考试的第i+1名
不选的话
f[i][j][k] -> f[i+1][j][min(k, 这个人的第2场考试名次)]
选的话,第一场考试的i+1名,在第二场中的名次必须<k
f[i][j][k] -> f[i+1][j+1][k]
(如果>k,就意味着存在一个人,第一场出现在i+1之前,且第2场考的还比i+1好)
最终答案 f[n][m][?] 求和
https://atcoder.jp/contests/abc238/tasks/abc238_g
https://atcoder.jp/contests/abc238/tasks/abc238_h
https://atcoder.jp/contests/abc239/tasks/abc239_a
输入X,输出sqrt(X*(12800000+X))
https://atcoder.jp/contests/abc239/tasks/abc239_b
输入X,输出X除以10下取整的结果。-10**18<=x<=10**10
,X可能是负数
https://atcoder.jp/contests/abc239/tasks/abc239_c
问象棋中马能不能两步从(x1,y1)
跳到(x2,y2)
https://atcoder.jp/contests/abc239/tasks/abc239_d
甲从A到B中选一个数字
乙从C到D中选一个数字
如果两个数字的和是质数,那么乙获胜,否则甲获胜
问谁能赢?
如果甲获胜,输出Takahashi
如果乙获胜,输出Aoki
相当于问A到B中是否存在一个数字i,使得i+C到i+D之间都是合数
如果存在,那么甲获胜
如果不存在,那么乙获胜
https://atcoder.jp/contests/abc239/tasks/abc239_e
https://atcoder.jp/contests/abc239/tasks/abc239_f
https://atcoder.jp/contests/abc239/tasks/abc239_g
https://atcoder.jp/contests/abc239/tasks/abc239_h
https://atcoder.jp/contests/abc240/tasks/abc240_a
1到10连成一个环,输入两个数字,问这两个数字之间有没有边
https://atcoder.jp/contests/abc240/tasks/abc240_b
输入n个数字
问有多少个不同的数字
https://atcoder.jp/contests/abc240/tasks/abc240_c
从位置0出发,第i步前进ai或bi,问能不能恰好走N步,到位置X
f[i][j] 表示 走i步能不能到j
https://atcoder.jp/contests/abc240/tasks/abc240_d
依次加入n个数字,第i次加入ai
连续k个数字k会消失
问加入每个数字之后还剩下多少个数字?
https://atcoder.jp/contests/abc240/tasks/abc240_e
https://atcoder.jp/contests/abc240/tasks/abc240_f
https://atcoder.jp/contests/abc240/tasks/abc240_g
https://atcoder.jp/contests/abc240/tasks/abc240_h
https://atcoder.jp/contests/abc241/tasks/abc241_a
输入一个长度为10的数组a[0], a[1], ..., a[9]
如果当前是x
,那么按一下按钮会变成a[x]
初始是0
,问按3次按钮之后会变成什么数字?
https://atcoder.jp/contests/abc241/tasks/abc241_b
https://atcoder.jp/contests/abc241/tasks/abc241_c
输入n
,和n*n
的棋盘,其中.
表示空,#
表示棋子
六子棋,问再下至多两个子,能不能连成连续6个?
https://atcoder.jp/contests/abc241/tasks/abc241_d
维护一个集合,支持三种操作
1 x
插入x,可能有重复的x
2 x k
询问小于等于x的数字中,第k大的
3 x k
询问大于等于x的数字中,第k小的
k至多是5
https://atcoder.jp/contests/abc241/tasks/abc241_e
输入长度为N的数字A,下标从0开始
初始X=0
每次操作X+=A[X%n]
问K次操作之后X是多少?
找循环节,一旦X%n的余数出现过,说明出现了循环节
https://atcoder.jp/contests/abc241/tasks/abc241_f
https://atcoder.jp/contests/abc241/tasks/abc241_g
https://atcoder.jp/contests/abc241/tasks/abc241_h
https://atcoder.jp/contests/abc242/tasks/abc242_a
第1名到第A名之间一定能拿到T-shirt
第A+1名到第B名之间随机抽C个T-shirt
一个人是第X的名,问拿到T-shirt概率是多少?
https://atcoder.jp/contests/abc242/tasks/abc242_b
输入一个字符串S,重排S中的字母,使得结果字典序最小
https://atcoder.jp/contests/abc242/tasks/abc242_c
输入N,问有多少个N位数字,每一位是1~9
,并且相邻两位的差至多是1
答案模 998244353 输出
https://atcoder.jp/contests/abc242/tasks/abc242_d
输入一个只包含字母ABC的字符串S,一次操作会把所有的A变成BC,B变成CA,C变成AB
有Q个询问,第i个询问问,操作ti次之后,第si个字符是什么?
变化过程
A
BC
CAAB
ABBCBCCA
A->0 B->1 C->2
0
12
2334
34454556
0
01
0112
01121223
这个数列就是数字i(从0开始)的二进制中有几个1
所以 34454556 .. 的第t行的第k个是
(t + (k-1)的二进制中有几个1) % 3 + 初始的字符,就是答案
https://atcoder.jp/contests/abc242/tasks/abc242_e
T组数据,每次数据输入一个字符串S
问有多少个字符串和S长度相同,且字典序小于等于S
答案模 998244353 输出
https://atcoder.jp/contests/abc242/tasks/abc242_f
n行m列的网格,放b个黑车,w个白车
要求放置的车不能互相攻击
(同一行不能同时有黑车和白车,同一列不能同时有黑车和白车)
答案模 998244353 输出
https://atcoder.jp/contests/abc242/tasks/abc242_g
https://atcoder.jp/contests/abc242/tasks/abc242_h
https://atcoder.jp/contests/abc243/tasks/abc243_a
初始有V毫升,三个人轮流取A,B,C毫升
问是谁先取不够自己想取的容量
如果是第一个人,输出F
如果是第二个人,输出M
如果是第三个人,输出T
https://atcoder.jp/contests/abc243/tasks/abc243_b
输入两个长度相等的序列A和B,保证A中的数字互不相同,B中的数字互不相同
问有多少个i
使得A[i]==B[i]
问有多少对i,j
使得i!=j&&A[i]==B[j]
https://atcoder.jp/contests/abc243/tasks/abc243_c
平面上有n个点,每个点的移动方向一定是左或右
问所有点按照自己的移动方向前进,是否会发生碰撞?
https://atcoder.jp/contests/abc243/tasks/abc243_d
一个二叉树,i
节点的左孩子是2i
,右孩子是2i+1
有三种操作,
U
跳到当前点的父亲节点
L
跳到当前点的左孩子节点
R
跳到当前点的右孩子节点
输入起点X
和跳的过程S
问最终所在的点的标号是多少?
保证最终答案至多10**18
但是中间可能超过10**18
https://atcoder.jp/contests/abc243/tasks/abc243_e
输入一个n个点,m条边的连通,无向图
问至多可以删多少条边,使得任意两点间的最短距离不变
https://atcoder.jp/contests/abc243/tasks/abc243_f
抽奖,一共有N种不同的奖,第i种抽中的概率是Wi/所有W之和
问抽K次,恰好抽到了M个不同的奖,概率是多少?取模输出
M<=N<=50,K<=50
https://atcoder.jp/contests/abc243/tasks/abc243_g
输入X,问有多少个
长度100
第一项是X
之后每一项的平方都小于等于前一项
的正整数数列
多组测试数据,不需要取模
https://atcoder.jp/contests/abc243/tasks/abc243_h
https://atcoder.jp/contests/abc244/tasks/abc244_a
输入字符串,输出最后一个字符
https://atcoder.jp/contests/abc244/tasks/abc244_b
在平面上,初始x轴正方向,S字符表示向前一步,R字符表示右转90度
问最终坐标是什么
https://atcoder.jp/contests/abc244/tasks/abc244_c
输入一个数字N,你和对方轮流说出一个1到2*N+1
的数字
说过的数字不能再说
谁没有数字说,谁就输了
对方输入0,说明你赢了
fflush(stdout)
https://atcoder.jp/contests/abc244/tasks/abc244_d
输入两个RGB的排列
一次操作就是交换两个字符
问能不能操作恰好10**18
次
把第一个排列变成第二个排列
https://atcoder.jp/contests/abc244/tasks/abc244_e
输入一个N个点,M个边的无向图
问有多少条路径,起点是S,终点是T,经过K条边
有一个点X特殊(X不等于S和T),要求必须出现偶数次,其他点没有要求
https://atcoder.jp/contests/abc244/tasks/abc244_f
输入一个图,n个点,m条边
有2**n
个询问
每个询问是一个长度为n的01串,问最短路径
如果s[i]==0
那么要求第i个点必须在路径中出现偶数次
如果s[i]==1
那么要求第i个点必须在路径中出现奇数次
问这2**n
个询问的最短路径长度之和是多少?
https://atcoder.jp/contests/abc244/tasks/abc244_g
https://atcoder.jp/contests/abc244/tasks/abc244_h
https://atcoder.jp/contests/abc245/tasks/abc245_a
Takahashi于 A时B分0秒起床
Aoki于 C时D分1秒起床
问谁起的早
https://atcoder.jp/contests/abc245/tasks/abc245_b
输入一个数组,问最小的,不在这个数组里的非负整数是什么?
https://atcoder.jp/contests/abc245/tasks/abc245_c
输入两个长度为N
数组A
和B
问能否生成一个新的长度为N
的数组X
X[i]
是A[i]
或者B[i]
并且X
中任意相邻两项的差<=K
https://atcoder.jp/contests/abc245/tasks/abc245_d
多项式除法
输入一个N
次多项式A
输入一个N+M
次多项式C
找到一个次数是M
的多项式B
使得多项式A
乘以多项式B
等于多项式C
不需要取模,可能有负数,保证有解
https://atcoder.jp/contests/abc245/tasks/abc245_e
n个巧克力,第i个巧克力宽A[i]
长B[i]
m个盒子,第i个盒子宽C[i]
长D[i]
每个盒子至多装1个巧克力
如果A[i]<=C[j]&&B[i]<=D[j]
那么第i个巧克力可以被装进第j个盒子中
问能不能把所有巧克力都装进盒子
https://atcoder.jp/contests/abc245/tasks/abc245_f
输入一个有向图,N
个点M
条边
问有多少个点,作为起点,可以找到无限长的路径?
https://atcoder.jp/contests/abc245/tasks/abc245_g
https://atcoder.jp/contests/abc245/tasks/abc245_h
https://atcoder.jp/contests/abc246/tasks/abc246_a
输入矩形的四个顶点中的三个,问最后一个顶点是什么?
https://atcoder.jp/contests/abc246/tasks/abc246_b
从点(0,0)
向点(A,B)
的方向走1的距离,问会到哪个点,输出小数
保证点(0,0)
到点(A,B)
之间的距离大于等于1
要找到两个数字(X,Y)
满足X*X+Y*Y=1
且X/Y=A/B
https://atcoder.jp/contests/abc246/tasks/abc246_c
买n个商品,第i个商品价格是ai,有k个优惠券,每个优惠券可以优惠X元
优惠券可以在同一个商品上叠加,但是价格不能为负数
问最优情况下买这n个商品需要多少钱?
https://atcoder.jp/contests/abc246/tasks/abc246_d
输入N,找到一个数字X,使得X>=N
且存在非负整数a和b使得X=a*a*a+a*a*b+a*b*b+b*b*b
问最小的X是多少?
https://atcoder.jp/contests/abc246/tasks/abc246_e
国际象棋棋盘,有障碍物,问象从起点到终点最少需要几步?
先输入N,表示行数和列数
然后输入起点的坐标Ax和Ay
然后输入终点的坐标Bx和By
然后输入N行,表示棋盘的初始状态,其中.
表示空,#
表示障碍物
https://atcoder.jp/contests/abc246/tasks/abc246_f
有一个打字机,打字机有N行,第i行有Si这些字母(不同行可能有相同的字母)
打字的过程是选一行(之后不能在变了)只能用这行的字母,生成一个长度为L的字符串
问一共有多少种可能字符串(可能选不同行能生成同一个字符串,只算一次)
https://atcoder.jp/contests/abc246/tasks/abc246_g
https://atcoder.jp/contests/abc246/tasks/abc246_h
https://atcoder.jp/contests/abc247/tasks/abc247_a
输入一个长度为4的01串,右移一位,移出界的就没了,最左边补0
https://atcoder.jp/contests/abc247/tasks/abc247_b
输入n个人的姓氏和名字,每个人要给自己取一个昵称
昵称必须是自己的姓氏或名字
昵称不能是别人的姓氏,不能是别人的名字
问能不能每个人都取一个符合要求的昵称
https://atcoder.jp/contests/abc247/tasks/abc247_c
S[1] = [1]
S[2] = S[1] + [2] + S[1]
...
S[i] = S[i-1] + [i] + S[i-1]
输入n
,输出S[n]
https://atcoder.jp/contests/abc247/tasks/abc247_d
维护一个队列,支持两个操作
1 x c
在队尾加入c
个x
2 c
队首出队c
个数字,输出所有出队的数字之和
https://atcoder.jp/contests/abc247/tasks/abc247_e
输入一个长度为n个数字,和最大值X,和最小是Y
问数组中有几个区间最大值是X且最小值是Y
所有数字分为>Y
,==Y
,<X
,==X
,X<..<Y
五种情况
>Y
和<X
的位置一定不能选
选一个区间,包含至少一个==Y
,包含至少一个==X
,问有多少种方案
问以每个位置作为结尾,有多少个方案
对于每个位置,找自己之前的最近的X是多少,最近的Y是多少,至多选多少个数字没有>Y
和<X
的情况
https://atcoder.jp/contests/abc247/tasks/abc247_f
有n张牌,第i张牌正面是Pi,反面是Qi。保证Pi和Qi是1到n的排列
从所有的牌中选一个子集,使得从1到n的每个数字,都出现过(正面或反面)
把每张牌看做是连接Pi和Qi的一条边
因为Pi和Qi都是排列,所以整个图一定是由若干环组成的
对于每个环来说,选取一个子集,不能有连续的两条边不选
这是一个经典问题,答案是Lucas Number,是以2 1 3 4 7 ...
开始的Fibonacci数列
不同环之间不会互相影响,把不同环的答案乘起来就可以了
https://atcoder.jp/contests/abc247/tasks/abc247_g
https://atcoder.jp/contests/abc247/tasks/abc247_h
https://atcoder.jp/contests/abc248/tasks/abc248_a
输入一个长度为9的字符串,0到9共十个字符其中出现了9个,输出没出现的字符
https://atcoder.jp/contests/abc248/tasks/abc248_b
输入A,B和K,问A乘以几次K,可以>=B
https://atcoder.jp/contests/abc248/tasks/abc248_c
输入N,M,K
N个数字,每个数字的范围是1到M,N个数字的总和<=K
问方案数有多少种?
https://atcoder.jp/contests/abc248/tasks/abc248_d
输入长度为N个数字,Q个询问
每次询问一个区间[L, R]
内有多少个数字X
出现
https://atcoder.jp/contests/abc248/tasks/abc248_e
输入N个点的坐标和一个整数K,问有多少条直线通过其中恰好K个点,如果无穷多个输出Infinity
https://atcoder.jp/contests/abc248/tasks/abc248_f
输入N,一个2行N列的网格,有3N-2
条边
问删掉其中i(1<=i<=N-1)
条边,保持图联通,有多少个方案?
方案数模质数P输出
https://atcoder.jp/contests/abc248/tasks/abc248_g
https://atcoder.jp/contests/abc248/tasks/abc248_h
https://atcoder.jp/contests/abc249/tasks/abc249_a
Takahashi 以B米每秒的速度 走A秒,歇C秒,循环
Aoki 以E米每秒的速度 走D秒,歇F秒,循环
问X秒,之后,谁领先
位置一样的话,输出 Draw
https://atcoder.jp/contests/abc249/tasks/abc249_b
输入一个由大小写字母组成的字符串
如果这个字符串满足以下三个条件,输出Yes,否则输出No
包含大写字母
包含小写字母
不包含重复字符
https://atcoder.jp/contests/abc249/tasks/abc249_c
输入N个字符串,从中选一个子集,使得恰好出现K次的字母最多
保证一个字母在一个字符串中至多出现一次(所以出现K次的字母,意味着出现在K个字符串)
只需要输出 在选取最优的子集情况下 恰好出现K次的字母的个数
https://atcoder.jp/contests/abc249/tasks/abc249_d
输入一个长度为N的数字,问有多少个有序对(i,j,k)
满足
A[i]=A[j]*A[k]
for (int j = 1; j <= n; j++)
{
for (int k = 1; j * k <= n; k++)
{
cnt++;
}
}
cnt 约等于 n log n
https://atcoder.jp/contests/abc249/tasks/abc249_e
有一种缩写字符串的方法,比如 aaabbcccc
可以写成 a3b2c4
问有多少个长度为n的字符串,缩写之后长度比n小,方案数模P输出
f[i][j] 表示压缩之前的长度i,压缩之后的长度是j的方案数
假设下一组字母重复k次,那么
f[i + k][j + 1 + k的位数] += f[i][j] * (25或26,如果是第一个字母,那么有26种选择,否则只有25种)
最后把
f[n][i] (i<n)
求和就可以了
https://atcoder.jp/contests/abc249/tasks/abc249_f
https://atcoder.jp/contests/abc249/tasks/abc249_g
https://atcoder.jp/contests/abc249/tasks/abc249_h
https://atcoder.jp/contests/abc250/tasks/abc250_a
https://atcoder.jp/contests/abc250/tasks/abc250_b
https://atcoder.jp/contests/abc250/tasks/abc250_c
https://atcoder.jp/contests/abc250/tasks/abc250_d
https://atcoder.jp/contests/abc250/tasks/abc250_e
https://atcoder.jp/contests/abc250/tasks/abc250_f
https://atcoder.jp/contests/abc250/tasks/abc250_g
https://atcoder.jp/contests/abc250/tasks/abc250_h
https://atcoder.jp/contests/abc251/tasks/abc251_a
https://atcoder.jp/contests/abc252/tasks/abc251_b
https://atcoder.jp/contests/abc252/tasks/abc251_c
https://atcoder.jp/contests/abc252/tasks/abc251_d
https://atcoder.jp/contests/abc252/tasks/abc251_e
https://atcoder.jp/contests/abc252/tasks/abc251_f
https://atcoder.jp/contests/abc251/tasks/abc251_g
https://atcoder.jp/contests/abc251/tasks/abc251_h
https://atcoder.jp/contests/abc252/tasks/abc252_a
输入一个数字
输出对应的ASCII字符
https://atcoder.jp/contests/abc252/tasks/abc252_a
输入N和K
输入长度为N的数组A
输入长度为K的数组B
问是否存在一个B[i]使得A[B[i]] 是 A数组中的最大值?
如果有,输出Yes,如果没有,输出No
https://atcoder.jp/contests/abc252/tasks/abc252_c
输入n个 0到9 10个数字构成的排列
如果在第i秒按下停止按钮,那么他会显示第i%10个字符(0秒最左的字符,9秒最右的字符)
同一秒只能按下一个停止按钮
目标是让这n个排列显示相同的字母
问最优情况下需要几秒
https://atcoder.jp/contests/abc252/tasks/abc252_d
输入一个长度为N的数组,从中选三个下标 i < j < k
,且 a[i] a[j] a[k]
互不相同
问有多少种选法
https://atcoder.jp/contests/abc252/tasks/abc252_e
输入一个图,起点是1,图是无向边
问哪些边在最短路树上
https://atcoder.jp/contests/abc252/tasks/abc252_f
https://www.luogu.com.cn/problem/P1334
初始有长度为L的木棒
需要砍成N段,我们需要的长度A[i]
最后可能有剩余
把长度为K的砍成X和K-X需要K的代价
https://atcoder.jp/contests/abc252/tasks/abc252_g
输入一个排列
问有多少个有根树(1是根)的前序遍历是输入的排列
如果一个点有多个孩子,那么必须从最小的孩子开始DFS
https://atcoder.jp/contests/abc252/tasks/abc252_h
https://atcoder.jp/contests/abc253/tasks/abc253_a
输入3个数字a, b, c判断b是不是中位数
https://atcoder.jp/contests/abc253/tasks/abc253_b
输入字符矩阵,输出2个o之间的距离
https://atcoder.jp/contests/abc253/tasks/abc253_c
维护 multiset
支持加入一个值
删去一个值x至多c次
输出最大值减去最小值的差
https://atcoder.jp/contests/abc253/tasks/abc253_d
输入n和a和b
问1到n之间所有既不是a的倍数,也不是b的倍数的数字之和是多少?
https://atcoder.jp/contests/abc253/tasks/abc253_e
输入n, m, k
问有多少个长度为n的数列
每一项在1到m之间
相邻两项差的绝对值大于等于k
https://atcoder.jp/contests/abc253/tasks/abc253_f
维护一个n行m列的矩阵,初始都是0,支持三种操作
第l到r列加上x
第i行加上x
询问第i行第j列的值
https://atcoder.jp/contests/abc253/tasks/abc253_g
输入一个n,把所有1<=i<=j<=n
的(i,j)
列出来,排序
选择第L对到第R对
对于每对(x,y)
交换a[x]
和a[y]
问最后排列是什么?
https://atcoder.jp/contests/abc253/tasks/abc253_h
https://atcoder.jp/contests/abc254/tasks/abc254_a
输入一个3位数,输出最后两位(十位和个位)
https://atcoder.jp/contests/abc254/tasks/abc254_b
输出杨辉三角
https://atcoder.jp/contests/abc254/tasks/abc254_c
输入一个数组,只有下标之差恰好是k的两个位置才能交换
可以交换任意多次
问能不能让数组变成升序
https://atcoder.jp/contests/abc254/tasks/abc254_d
输入n,问有多少对正整数(i,j),i和j都小于等于n,并且i*j
是完全平方数
https://atcoder.jp/contests/abc254/tasks/abc254_e
输入一个图,每个点度数至多是3
Q个询问,每次问到点x的距离小于等于k的点,所有点的标号之和
k至多是3
https://atcoder.jp/contests/abc254/tasks/abc254_f
一个n行n列的数组,第i行第j列是a[i]+b[j]
a和b是两个长度为n的数组
每次询问一个矩形区域的GCD,每个矩形区域是h1 h2 w1 w2
问
a[h1]+b[w1] a[h1]+b[w1+1] .. a[h1]+b[w2]
a[h1+1]+b[w1] a[h1+1]+b[w1+1] .. a[h1+1]+b[w2]
...
a[h2]+b[w1] a[h2]+b[w1+1] .. a[h2]+b[w2]
的最大公约数
https://atcoder.jp/contests/abc254/tasks/abc254_g
https://atcoder.jp/contests/abc254/tasks/abc254_h
https://atcoder.jp/contests/abc255/tasks/abc255_a
输入r和c和2x2的矩阵 输出第r行第c列的内容
https://atcoder.jp/contests/abc255/tasks/abc255_b
输入n个人的坐标xi yi
其中k个人a1, a2, .. ak 有灯
每个灯可以照亮距离小于等于r的所有人(所有灯都一样)
问r至少是多少,才能保证每个人都被照亮
https://atcoder.jp/contests/abc255/tasks/abc255_c
每次操作可以让x加一或者减一
输入一个等差数列,首项a,公差d,项数n
问至少操作多少次,才可以让x成为等差数列中的某个数字
https://atcoder.jp/contests/abc255/tasks/abc255_d
输入一个数组,每次可以选数组中某个数字加一或者减一
q个询问,每次询问xi
问至少多少次操作可以让数组中所有数字都等于xi
https://atcoder.jp/contests/abc255/tasks/abc255_e
输入数组a的长度n和m个幸运数字xi
已知数组a中a[i]+a[i+1]的和是s[i]
问数组a中至多有多少个幸运数字xi
xi ai si都可正可负
m至多是10
https://atcoder.jp/contests/abc255/tasks/abc255_f
输入二叉树的 前序遍历 和 中序遍历
输出二叉树每个点的两个孩子是什么
https://atcoder.jp/contests/abc255/tasks/abc255_g
取石子游戏,但是有m种不允许的操作
如果一堆石子恰好有xi个,不能从中取yi个
https://atcoder.jp/contests/abc255/tasks/abc255_h
https://atcoder.jp/contests/abc256/tasks/abc256_a
输入n,输出2的n次方
https://atcoder.jp/contests/abc256/tasks/abc256_b
做n次操作
每次往集合中加入0
集合中所有数字+=a[i]
最后问有多少个数字 >= 4
https://atcoder.jp/contests/abc256/tasks/abc256_c
一个3行3列的正整数矩阵
已知第i行的和是hi
已知第j列的和是wj
问有多少组合法的解
hi和wj的范围只有30
https://atcoder.jp/contests/abc256/tasks/abc256_d
输入n个区间,求并集
区间是左闭右开的 [1, 2)
和 [3, 4)
不能化简为 [1, 4)
https://atcoder.jp/contests/abc256/tasks/abc256_e
有n个人,第i个人有一个不喜欢的人xi和一个不满值ci
找一个n个人的排列,如果xi排在了i之前,那么会有ci的不满值
希望所有人不满值之和越小越好
https://atcoder.jp/contests/abc256/tasks/abc256_f
洛谷题目加强版
https://www.luogu.com.cn/problem/P4868
3次前缀和
https://atcoder.jp/contests/abc256/tasks/abc256_g
n边形,每条边长度是d
每隔1的距离放一枚黑色石子或者白色石子
一共会放n*d个石子
每条边上会有d+1个石子(两个端点都算)
要求每条边上的白色石子个数相等,问方案数
https://atcoder.jp/contests/abc256/tasks/abc256_h
https://atcoder.jp/contests/abc257/tasks/abc257_a
输入n和x
n个A,n个B…… n个Z
问第x个字符是什么?
https://atcoder.jp/contests/abc257/tasks/abc257_b
一维的棋盘,长度是N
初始已知K个兵的位置Ai
保证兵的位置是升序,不会重合
Q个操作,第i次操作第Li个兵
如果兵已经在最右,或者右边的格子被其他兵占据了
就不动
否则就向右移动一步
最后输出每个兵的位置(显然,最终兵的顺序还是升序)
https://atcoder.jp/contests/abc257/tasks/abc257_c
n个人,每个人是成人Si=1或者小孩Si=0,还有体重Wi
选择一个整数X
体重小于X的人,猜他是小孩,
体重大于等于X的人,猜他是成人
你来决定X,问最多猜对多少个人?
https://atcoder.jp/contests/abc257/tasks/abc257_d
n个点
如果想从点i移动到点j需要满足
Pi * S >= abs(Xi - Xj) + abs(Yi - Yj)
其中S是自己的能力
你来选择起点,目标是能通过若干次跳跃到达每个终点(能跳过去即可,不需要跳回来)
问能力值最小需要多少?
https://atcoder.jp/contests/abc257/tasks/abc257_e
1到9共9个数字,第i个数字的价格是ci元
你有n元,你希望买一些数字,使得最后拼成的结果越大越好
(显而易见,首先要位数多,然后最大化最高位,最大化次高位……)
问最大的结果是什么?
https://atcoder.jp/contests/abc257/tasks/abc257_f
一共有n个点,m条边
有一些边的一段未确定(为0)
对于每个点i回答:
如果所有一段未确定的边都连接i,那么1到n的最短路是什么?
https://atcoder.jp/contests/abc257/tasks/abc257_g
输入S和T问最小从S中选取几个前缀
使得这些前缀的连接是T
选取的前缀长度为1到S的长度
选取的前缀长度不需要单调
KMP 定义题
https://atcoder.jp/contests/abc257/tasks/abc257_h
https://atcoder.jp/contests/abc258/tasks/abc258_a
问 21:00 之后 k 分钟是几点?必须24小时制,分钟必须加前导0
https://atcoder.jp/contests/abc258/tasks/abc258_b
输入一个 n * n 的数字矩阵,选一个位置作为起点,
在八个方向(上下左右,斜向)中选一个方向走n-1步,
使得经过的位置连起来的数字(一共n位)最大
如果在第一行往上走,会走到最后一行
如果在最后一行往下走,会走到第一行
如果在第一列往左走,会走到最后一列
如果在最后一列往右走,会走到第一列
https://atcoder.jp/contests/abc258/tasks/abc258_c
输入长度为n的字符串s,和q的操作
操作分为两种
1 x 把字符串最后x个字符移动到字符串的开始
2 x 询问第x个(从1开始下标)字符是什么?
https://atcoder.jp/contests/abc258/tasks/abc258_d
一共有n关游戏,每关游戏有2个时间ai和bi
刚开始只能玩第1关
通关第i关之后,可以玩第i+1关
第一次通关第i关,需要ai+bi的时间
之后每次通关第i关,只需要bi的时间
问通关x次(关任选,同一关可以多次通关)至少需要多少时间?
https://atcoder.jp/contests/abc258/tasks/abc258_e
有无限多个土豆,重量是w[0], w[1], ..., w[n-1]循环
要把土豆装进盒子,每个盒子至少装X重量土豆
过程是,如果当前盒子重量小于X,那么装当前土豆
如果重量大于等于X,那么这个盒子打包结束,开始装下一个空盒子
q个询问,问第k个盒子中装了多少个土豆?
https://atcoder.jp/contests/abc258/tasks/abc258_f
T组数据,在二维平面上,上下左右走一步需要K的时间
特别的,对于直线 x = iK 和 y = iK (K的倍数的行或列)有主干道
沿着主干道走只需要1的时间(不需要K的时间)
输入起点和终点
问最小时间
https://atcoder.jp/contests/abc258/tasks/abc258_g
输入一个 n * n 的邻接矩阵
问有多少个三元组 i < j < k 两两相邻
https://atcoder.jp/contests/abc258/tasks/abc258_h
https://atcoder.jp/contests/abc259/tasks/abc259_a
一个人在X岁的时候高度是T
X岁之后身高不变
X岁之前每年长高D厘米
问他在M岁是身高是多少?
https://atcoder.jp/contests/abc259/tasks/abc259_b
输入一个点(a, b)
逆时针转动 d 度
问转动之后的点的坐标是什么?
https://atcoder.jp/contests/abc259/tasks/abc259_c
输入字符串s和t
问能不能通过若干次操作使得s变成t
操作:选择s中相邻相同的两个字母,在这两个字母之间再加入一个相同的字母
https://atcoder.jp/contests/abc259/tasks/abc259_d
平面上输入n个圆
输入起点(sx, sy) 和终点(tx, ty),保证起点和终点在圆周上
问能否从起点走到终点,只经过圆上的点(圆周上,不是圆内)
https://atcoder.jp/contests/abc259/tasks/abc259_e
输入n个数字,从中删去一个,问能得到多少种LCM
(提示:删去不同数字,如果LCM发生改变,不可能得到相同的LCM)
https://atcoder.jp/contests/abc259/tasks/abc259_f
输入一个n个点的树,每个边有权值,保留一些边(其他的删掉)
保留的边中,至多di条边与i相连,问保留的边权值之和最大是多少?
https://atcoder.jp/contests/abc259/tasks/abc259_g
https://atcoder.jp/contests/abc259/tasks/abc259_h
https://atcoder.jp/contests/abc260/tasks/abc260_a
输入长度为3的字符串
输出其中只出现1次的字母
如果有多个满足条件输出任意一个
如果没有满足条件的,输出-1
https://atcoder.jp/contests/abc260/tasks/abc260_b
输入n个人的成绩Ai和Bi
先按Ai从大到小排序,如果一样,i小的在前,选前X个人
先按Bi从大到小排序,如果一样,i小的在前,选前Y个人
先按Ai+Bi从大到小排序,如果一样,i小的在前,选前Z个人
同一个人不会被选2次(被选择的机会顺延)
被选的人的标号
https://atcoder.jp/contests/abc260/tasks/abc260_c
1个n级红色 可以换成 1个n-1级红色 和 X 个 n级蓝色
1个n级蓝色 可以换成 1个n-1级红色 和 Y 个 n-1级蓝色
只有n>=2的时候可以换
问1个n红色可以换到多少个1级蓝色(注意1级红色不能换成0级红色和1级蓝色)
r n级的红色能换成 first个1级的红色 second个1级的蓝色
b n级的蓝色能换成 first个1级的红色 second个1级的蓝色
r[n] = r[n-1] + b[n]
b[n] = r[n-1] + b[n-1]
https://atcoder.jp/contests/abc260/tasks/abc260_d
依次摸n个卡片,第i个卡片上写的pi,pi是1到n的一个排列
维护一些牌堆
如果pi大于所有堆顶的牌,那么新开一堆只有pi
否则在所有堆顶的牌,找到大于pi最小的一张,把pi放到这个堆的堆顶
如果这一堆有恰好K张牌,把这K个牌的数字都标记上当前的时间i,并把这堆删掉
最后输出每个数字被标记的时间,如果没有被标记过就是-1
3 2 1 这堆满了 所以 3 2 1 的答案是 9
14 9 6 这堆满了 所以 6 9 14 的答案是 6
15 5 4 这堆满了 所以 15 5 4 的答案是 15
13 7
10 8
11
12
https://atcoder.jp/contests/abc260/tasks/abc260_e
输入n对数字ai,bi
对于每个长度k,回答有多少个起点L满足
对于每个i,都满足L<=ai<L+k或L<=bi<L+k
(对于每个i,要么ai在区间中,要么bi在区间中)
对于每个起点L,k至少是多少,才能满足上述条件
https://atcoder.jp/contests/abc260/tasks/abc260_f
输入一个二分图
二分图一边S个点,另一边T个点
问有没有长度为4的环
没用bitset
时间复杂度是 T^2
https://atcoder.jp/contests/abc260/tasks/abc260_g
https://atcoder.jp/contests/abc260/tasks/abc260_h
https://atcoder.jp/contests/abc261/tasks/abc261_a
数轴上
L1到R1涂红色
L2到R2涂蓝色
问既红又蓝的长度
https://atcoder.jp/contests/abc261/tasks/abc261_b
输入n乘n的对战表,问是否一致
第i行第j列的结果和第j行第i列的结果是否匹配
如果i输了j,那么j必须赢i
如果i赢了j,那么j必须输i
如果i平了j,那么j必须平i
https://atcoder.jp/contests/abc261/tasks/abc261_c
文件夹不能有重名
如果有重名,在后面加上 (数字)
https://atcoder.jp/contests/abc261/tasks/abc261_d
投n次硬币,你可以控制正反
第i次如果正面就获得Xi的钱
还有额外M种连击奖励,如果恰好连续正面Cj次,可以获得Yj的钱
同一种连击奖励可以多次领取
问最多获得多少钱
https://atcoder.jp/contests/abc261/tasks/abc261_e
输入n个操作,有 与 或 异或
初始是X=C
执行操作1,输出X
(不重置X为C)
执行操作1和操作2输出X
执行操作1和操作2和操作3输出X
……
执行操作1操作2……操作n输出X
https://atcoder.jp/contests/abc261/tasks/abc261_f
输入n个球,第i个求有2个属性xi和ci,把xi排序
能做的操作只有交换相邻2个球
如果相邻两个数字的ci一样,那么不需要代价,否则需要1的代价
问排序需要多少代价?
https://atcoder.jp/contests/abc261/tasks/abc261_g
https://atcoder.jp/contests/abc261/tasks/abc261_h
https://atcoder.jp/contests/abc262/tasks/abc262_a
输入Y
问>=Y最小的 %4==2的数什么
https://atcoder.jp/contests/abc262/tasks/abc262_b
输入无向图问有多少个三角形 (a, b, c)
a < b < c
a和b有边
b和c有边
c和a有边
https://atcoder.jp/contests/abc262/tasks/abc262_c
输入一个数组(可以不是排列),问有多少对 (i, j)
满足 1 <= i < j <= n
min(ai, aj) == i
max(ai, aj) == j
注意是2个数字的min/max
不是区间的
要么 ai == i && aj == j
要么 ai == j && aj == i
https://atcoder.jp/contests/abc262/tasks/abc262_d
输入一个数组,问有多少个非空子集平均值是整数
数组长度n只有100
https://atcoder.jp/contests/abc262/tasks/abc262_e
输入一个图n个点,m个边
n个点中选k个点染成红色,其余n-k蓝色
要求有偶数个边连接不同颜色的点
问有多少个方案
(选择的k个点中,度数为奇数的点必须有偶数个)
https://atcoder.jp/contests/abc262/tasks/abc262_f
输入一个排列,执行至多k次操作,每次操作可以
删除其中任意一项 或 把最后一项移到开始
问能得到的字典序最小的排列是什么?
https://atcoder.jp/contests/abc262/tasks/abc262_g
https://atcoder.jp/contests/abc262/tasks/abc262_h
https://atcoder.jp/contests/abc263/tasks/abc263_a
https://atcoder.jp/contests/abc263/tasks/abc263_b
https://atcoder.jp/contests/abc263/tasks/abc263_c
https://atcoder.jp/contests/abc263/tasks/abc263_d
https://atcoder.jp/contests/abc263/tasks/abc263_e
https://atcoder.jp/contests/abc263/tasks/abc263_f
https://atcoder.jp/contests/abc263/tasks/abc263_g
https://atcoder.jp/contests/abc263/tasks/abc263_h
https://atcoder.jp/contests/abc264/tasks/abc264_a
https://atcoder.jp/contests/abc264/tasks/abc264_b
https://atcoder.jp/contests/abc264/tasks/abc264_c
https://atcoder.jp/contests/abc264/tasks/abc264_d
https://atcoder.jp/contests/abc264/tasks/abc264_e
https://atcoder.jp/contests/abc264/tasks/abc264_f
https://atcoder.jp/contests/abc264/tasks/abc264_g
https://atcoder.jp/contests/abc264/tasks/abc264_h
https://atcoder.jp/contests/abc265/tasks/abc265_a
https://atcoder.jp/contests/abc265/tasks/abc265_b
https://atcoder.jp/contests/abc265/tasks/abc265_c
https://atcoder.jp/contests/abc265/tasks/abc265_d
https://atcoder.jp/contests/abc265/tasks/abc265_e
https://atcoder.jp/contests/abc265/tasks/abc265_f
https://atcoder.jp/contests/abc265/tasks/abc265_g
https://atcoder.jp/contests/abc265/tasks/abc265_h
https://atcoder.jp/contests/abc266/tasks/abc266_a
https://atcoder.jp/contests/abc266/tasks/abc266_b
https://atcoder.jp/contests/abc266/tasks/abc266_c
https://atcoder.jp/contests/abc266/tasks/abc266_d
https://atcoder.jp/contests/abc266/tasks/abc266_e
https://atcoder.jp/contests/abc266/tasks/abc266_f
https://atcoder.jp/contests/abc266/tasks/abc266_g
https://atcoder.jp/contests/abc266/tasks/abc266_h
https://atcoder.jp/contests/abl/tasks/abl_a
输入K,输出K次ACL
https://atcoder.jp/contests/abl/tasks/abl_b
输入A,B,C,D
问是否有整数x
满足
A<=x<=B
且C<=x<=D
输出Yes或No
https://atcoder.jp/contests/abl/tasks/abl_c
输入N个点,M条边,问连通块个数
https://atcoder.jp/contests/abl/tasks/abl_d
https://atcoder.jp/contests/abl/tasks/abl_e
https://atcoder.jp/contests/abl/tasks/abl_f
https://atcoder.jp/contests/acl1/tasks/acl1_a
https://atcoder.jp/contests/acl1/tasks/acl1_b
https://atcoder.jp/contests/acl1/tasks/acl1_c
https://atcoder.jp/contests/acl1/tasks/acl1_d
https://atcoder.jp/contests/acl1/tasks/acl1_e
https://atcoder.jp/contests/acl1/tasks/acl1_f
https://atcoder.jp/contests/agc001/tasks/agc001_a
https://atcoder.jp/contests/agc001/tasks/agc001_b
https://atcoder.jp/contests/agc001/tasks/agc001_c
https://atcoder.jp/contests/agc001/tasks/agc001_d
https://atcoder.jp/contests/agc001/tasks/agc001_e
https://atcoder.jp/contests/agc001/tasks/agc001_f
https://atcoder.jp/contests/agc002/tasks/agc002_a
https://atcoder.jp/contests/agc002/tasks/agc002_b
https://atcoder.jp/contests/agc002/tasks/agc002_c
https://atcoder.jp/contests/agc002/tasks/agc002_d
https://atcoder.jp/contests/agc002/tasks/agc002_e
https://atcoder.jp/contests/agc002/tasks/agc002_f
https://atcoder.jp/contests/agc003/tasks/agc003_a
https://atcoder.jp/contests/agc003/tasks/agc003_b
https://atcoder.jp/contests/agc003/tasks/agc003_c
https://atcoder.jp/contests/agc003/tasks/agc003_d
https://atcoder.jp/contests/agc003/tasks/agc003_e
https://atcoder.jp/contests/agc003/tasks/agc003_f
https://atcoder.jp/contests/agc004/tasks/agc004_a
https://atcoder.jp/contests/agc004/tasks/agc004_b
https://atcoder.jp/contests/agc004/tasks/agc004_c
https://atcoder.jp/contests/agc004/tasks/agc004_d
https://atcoder.jp/contests/agc004/tasks/agc004_e
https://atcoder.jp/contests/agc004/tasks/agc004_f
https://atcoder.jp/contests/agc005/tasks/agc005_a
https://atcoder.jp/contests/agc005/tasks/agc005_b
https://atcoder.jp/contests/agc005/tasks/agc005_c
https://atcoder.jp/contests/agc005/tasks/agc005_d
https://atcoder.jp/contests/agc005/tasks/agc005_e
https://atcoder.jp/contests/agc005/tasks/agc005_f
https://atcoder.jp/contests/agc006/tasks/agc006_a
https://atcoder.jp/contests/agc006/tasks/agc006_b
https://atcoder.jp/contests/agc006/tasks/agc006_c
https://atcoder.jp/contests/agc006/tasks/agc006_d
https://atcoder.jp/contests/agc006/tasks/agc006_e
https://atcoder.jp/contests/agc006/tasks/agc006_f
https://atcoder.jp/contests/agc007/tasks/agc007_a
https://atcoder.jp/contests/agc007/tasks/agc007_b
https://atcoder.jp/contests/agc007/tasks/agc007_c
https://atcoder.jp/contests/agc007/tasks/agc007_d
https://atcoder.jp/contests/agc007/tasks/agc007_e
https://atcoder.jp/contests/agc007/tasks/agc007_f
https://atcoder.jp/contests/agc008/tasks/agc008_a
https://atcoder.jp/contests/agc008/tasks/agc008_b
https://atcoder.jp/contests/agc008/tasks/agc008_c
https://atcoder.jp/contests/agc008/tasks/agc008_d
https://atcoder.jp/contests/agc008/tasks/agc008_e
https://atcoder.jp/contests/agc008/tasks/agc008_f
https://atcoder.jp/contests/agc009/tasks/agc009_a
https://atcoder.jp/contests/agc009/tasks/agc009_b
https://atcoder.jp/contests/agc009/tasks/agc009_c
https://atcoder.jp/contests/agc009/tasks/agc009_d
https://atcoder.jp/contests/agc009/tasks/agc009_e
https://atcoder.jp/contests/agc010/tasks/agc010_a
输入n个数字,每次可以合并两个同奇偶的数字,变成他们的和
问能不能最终剩下一个数字?
如果奇数的个数是偶数就可以
https://atcoder.jp/contests/agc010/tasks/agc010_b
https://atcoder.jp/contests/agc010/tasks/agc010_c
https://atcoder.jp/contests/agc010/tasks/agc010_d
https://atcoder.jp/contests/agc010/tasks/agc010_e
https://atcoder.jp/contests/agc010/tasks/agc010_f
https://atcoder.jp/contests/agc011/tasks/agc011_a
https://atcoder.jp/contests/agc011/tasks/agc011_b
https://atcoder.jp/contests/agc011/tasks/agc011_c
https://atcoder.jp/contests/agc011/tasks/agc011_d
https://atcoder.jp/contests/agc011/tasks/agc011_e
https://atcoder.jp/contests/agc011/tasks/agc011_f
https://atcoder.jp/contests/agc012/tasks/agc012_a
https://atcoder.jp/contests/agc012/tasks/agc012_b
https://atcoder.jp/contests/agc012/tasks/agc012_c
https://atcoder.jp/contests/agc012/tasks/agc012_d
https://atcoder.jp/contests/agc012/tasks/agc012_e
https://atcoder.jp/contests/agc012/tasks/agc012_f
https://atcoder.jp/contests/agc013/tasks/agc013_a
输入一个长度为N的数组,分成连续的若干段,使每段有序
有序可以是不上升,或者不下降
问至少分成几段
https://atcoder.jp/contests/agc013/tasks/agc013_b
https://atcoder.jp/contests/agc013/tasks/agc013_c
https://atcoder.jp/contests/agc013/tasks/agc013_d
https://atcoder.jp/contests/agc013/tasks/agc013_e
https://atcoder.jp/contests/agc013/tasks/agc013_f
https://atcoder.jp/contests/agc014/tasks/agc014_a
https://atcoder.jp/contests/agc014/tasks/agc014_b
https://atcoder.jp/contests/agc014/tasks/agc014_c
https://atcoder.jp/contests/agc014/tasks/agc014_d
https://atcoder.jp/contests/agc014/tasks/agc014_e
https://atcoder.jp/contests/agc014/tasks/agc014_f
https://atcoder.jp/contests/agc015/tasks/agc015_a
https://atcoder.jp/contests/agc015/tasks/agc015_b
https://atcoder.jp/contests/agc015/tasks/agc015_c
https://atcoder.jp/contests/agc015/tasks/agc015_d
https://atcoder.jp/contests/agc015/tasks/agc015_e
https://atcoder.jp/contests/agc015/tasks/agc015_f
https://atcoder.jp/contests/agc016/tasks/agc016_a
https://atcoder.jp/contests/agc016/tasks/agc016_b
https://atcoder.jp/contests/agc016/tasks/agc016_c
https://atcoder.jp/contests/agc016/tasks/agc016_d
https://atcoder.jp/contests/agc016/tasks/agc016_e
https://atcoder.jp/contests/agc016/tasks/agc016_f
https://atcoder.jp/contests/agc017/tasks/agc017_a
https://atcoder.jp/contests/agc017/tasks/agc017_b
https://atcoder.jp/contests/agc017/tasks/agc017_c
https://atcoder.jp/contests/agc017/tasks/agc017_d
https://atcoder.jp/contests/agc017/tasks/agc017_e
https://atcoder.jp/contests/agc017/tasks/agc017_f
https://atcoder.jp/contests/agc018/tasks/agc018_a
https://atcoder.jp/contests/agc018/tasks/agc018_b
https://atcoder.jp/contests/agc018/tasks/agc018_c
https://atcoder.jp/contests/agc018/tasks/agc018_d
https://atcoder.jp/contests/agc018/tasks/agc018_e
https://atcoder.jp/contests/agc018/tasks/agc018_f
https://atcoder.jp/contests/agc019/tasks/agc019_a
https://atcoder.jp/contests/agc019/tasks/agc019_b
https://atcoder.jp/contests/agc019/tasks/agc019_c
https://atcoder.jp/contests/agc019/tasks/agc019_d
https://atcoder.jp/contests/agc019/tasks/agc019_e
https://atcoder.jp/contests/agc019/tasks/agc019_f
https://atcoder.jp/contests/agc020/tasks/agc020_a
https://atcoder.jp/contests/agc020/tasks/agc020_b
https://atcoder.jp/contests/agc020/tasks/agc020_c
https://atcoder.jp/contests/agc020/tasks/agc020_d
https://atcoder.jp/contests/agc020/tasks/agc020_e
https://atcoder.jp/contests/agc020/tasks/agc020_f
https://atcoder.jp/contests/agc021/tasks/agc021_a
https://atcoder.jp/contests/agc021/tasks/agc021_b
https://atcoder.jp/contests/agc021/tasks/agc021_c
https://atcoder.jp/contests/agc021/tasks/agc021_d
https://atcoder.jp/contests/agc021/tasks/agc021_e
https://atcoder.jp/contests/agc021/tasks/agc021_f
https://atcoder.jp/contests/agc022/tasks/agc022_a
https://atcoder.jp/contests/agc022/tasks/agc022_b
https://atcoder.jp/contests/agc022/tasks/agc022_c
https://atcoder.jp/contests/agc022/tasks/agc022_d
https://atcoder.jp/contests/agc022/tasks/agc022_e
https://atcoder.jp/contests/agc022/tasks/agc022_f
https://atcoder.jp/contests/agc023/tasks/agc023_a
https://atcoder.jp/contests/agc023/tasks/agc023_b
https://atcoder.jp/contests/agc023/tasks/agc023_c
https://atcoder.jp/contests/agc023/tasks/agc023_d
https://atcoder.jp/contests/agc023/tasks/agc023_e
https://atcoder.jp/contests/agc023/tasks/agc023_f
https://atcoder.jp/contests/agc024/tasks/agc024_a
https://atcoder.jp/contests/agc024/tasks/agc024_b
https://atcoder.jp/contests/agc024/tasks/agc024_c
https://atcoder.jp/contests/agc024/tasks/agc024_d
https://atcoder.jp/contests/agc024/tasks/agc024_e
https://atcoder.jp/contests/agc024/tasks/agc024_f
https://atcoder.jp/contests/agc025/tasks/agc025_a
https://atcoder.jp/contests/agc025/tasks/agc025_b
https://atcoder.jp/contests/agc025/tasks/agc025_c
https://atcoder.jp/contests/agc025/tasks/agc025_d
https://atcoder.jp/contests/agc025/tasks/agc025_e
https://atcoder.jp/contests/agc025/tasks/agc025_f
https://atcoder.jp/contests/agc026/tasks/agc026_a
https://atcoder.jp/contests/agc026/tasks/agc026_b
https://atcoder.jp/contests/agc026/tasks/agc026_c
https://atcoder.jp/contests/agc026/tasks/agc026_d
https://atcoder.jp/contests/agc026/tasks/agc026_e
https://atcoder.jp/contests/agc026/tasks/agc026_f
https://atcoder.jp/contests/agc027/tasks/agc027_a
https://atcoder.jp/contests/agc027/tasks/agc027_b
https://atcoder.jp/contests/agc027/tasks/agc027_c
https://atcoder.jp/contests/agc027/tasks/agc027_d
https://atcoder.jp/contests/agc027/tasks/agc027_e
https://atcoder.jp/contests/agc027/tasks/agc027_f
https://atcoder.jp/contests/agc028/tasks/agc028_a
https://atcoder.jp/contests/agc028/tasks/agc028_b
https://atcoder.jp/contests/agc028/tasks/agc028_c
https://atcoder.jp/contests/agc028/tasks/agc028_d
https://atcoder.jp/contests/agc028/tasks/agc028_e
https://atcoder.jp/contests/agc028/tasks/agc028_f
https://atcoder.jp/contests/agc028/tasks/agc028_f2
https://atcoder.jp/contests/agc029/tasks/agc029_a
https://atcoder.jp/contests/agc029/tasks/agc029_b
https://atcoder.jp/contests/agc029/tasks/agc029_c
https://atcoder.jp/contests/agc029/tasks/agc029_d
https://atcoder.jp/contests/agc029/tasks/agc029_e
https://atcoder.jp/contests/agc029/tasks/agc029_f
https://atcoder.jp/contests/agc030/tasks/agc030_a
https://atcoder.jp/contests/agc030/tasks/agc030_b
https://atcoder.jp/contests/agc030/tasks/agc030_c
https://atcoder.jp/contests/agc030/tasks/agc030_d
https://atcoder.jp/contests/agc030/tasks/agc030_e
https://atcoder.jp/contests/agc030/tasks/agc030_f
https://atcoder.jp/contests/agc031/tasks/agc031_a
https://atcoder.jp/contests/agc031/tasks/agc031_b
https://atcoder.jp/contests/agc031/tasks/agc031_c
https://atcoder.jp/contests/agc031/tasks/agc031_d
https://atcoder.jp/contests/agc031/tasks/agc031_e
https://atcoder.jp/contests/agc031/tasks/agc031_f
https://atcoder.jp/contests/agc032/tasks/agc032_a
https://atcoder.jp/contests/agc032/tasks/agc032_b
https://atcoder.jp/contests/agc032/tasks/agc032_c
https://atcoder.jp/contests/agc032/tasks/agc032_d
https://atcoder.jp/contests/agc032/tasks/agc032_e
https://atcoder.jp/contests/agc032/tasks/agc032_f
https://atcoder.jp/contests/agc033/tasks/agc033_a
https://atcoder.jp/contests/agc033/tasks/agc033_b
https://atcoder.jp/contests/agc033/tasks/agc033_c
https://atcoder.jp/contests/agc033/tasks/agc033_d
https://atcoder.jp/contests/agc033/tasks/agc033_e
https://atcoder.jp/contests/agc033/tasks/agc033_f
https://atcoder.jp/contests/agc034/tasks/agc034_a
https://atcoder.jp/contests/agc034/tasks/agc034_b
https://atcoder.jp/contests/agc034/tasks/agc034_c
https://atcoder.jp/contests/agc034/tasks/agc034_d
https://atcoder.jp/contests/agc034/tasks/agc034_e
https://atcoder.jp/contests/agc034/tasks/agc034_f
https://atcoder.jp/contests/agc035/tasks/agc035_a
https://atcoder.jp/contests/agc035/tasks/agc035_b
https://atcoder.jp/contests/agc035/tasks/agc035_c
https://atcoder.jp/contests/agc035/tasks/agc035_d
https://atcoder.jp/contests/agc035/tasks/agc035_e
https://atcoder.jp/contests/agc035/tasks/agc035_f
https://atcoder.jp/contests/agc036/tasks/agc036_a
https://atcoder.jp/contests/agc036/tasks/agc036_b
https://atcoder.jp/contests/agc036/tasks/agc036_c
https://atcoder.jp/contests/agc036/tasks/agc036_d
https://atcoder.jp/contests/agc036/tasks/agc036_e
https://atcoder.jp/contests/agc036/tasks/agc036_f
https://atcoder.jp/contests/agc037/tasks/agc037_a
https://atcoder.jp/contests/agc037/tasks/agc037_b
https://atcoder.jp/contests/agc037/tasks/agc037_c
https://atcoder.jp/contests/agc037/tasks/agc037_d
https://atcoder.jp/contests/agc037/tasks/agc037_e
https://atcoder.jp/contests/agc037/tasks/agc037_f
https://atcoder.jp/contests/agc038/tasks/agc038_a
https://atcoder.jp/contests/agc038/tasks/agc038_b
https://atcoder.jp/contests/agc038/tasks/agc038_c
https://atcoder.jp/contests/agc038/tasks/agc038_d
https://atcoder.jp/contests/agc038/tasks/agc038_e
https://atcoder.jp/contests/agc038/tasks/agc038_f
https://atcoder.jp/contests/agc039/tasks/agc039_a
https://atcoder.jp/contests/agc039/tasks/agc039_b
https://atcoder.jp/contests/agc039/tasks/agc039_c
https://atcoder.jp/contests/agc039/tasks/agc039_d
https://atcoder.jp/contests/agc039/tasks/agc039_e
https://atcoder.jp/contests/agc039/tasks/agc039_f
https://atcoder.jp/contests/agc040/tasks/agc040_a
输入一个长度n-1,只包含><
的字符串,求一个长度为n的数列
使得数列中相邻两项的大小关系符合字符串的要求
问这个数列所有数字之和最小是多少
< > > > < < > < < < < < > > > <
0 1 0 0 0 1 2 0 1 2 3 4 5 0 0 0 1
0 3 2 1 0 0 1 0 0 0 0 0 3 2 1 0 0
0 3 2 1 0 1 2 0 1 2 3 4 5 2 1 0 1
https://atcoder.jp/contests/agc040/tasks/agc040_b
https://atcoder.jp/contests/agc040/tasks/agc040_c
https://atcoder.jp/contests/agc040/tasks/agc040_d
https://atcoder.jp/contests/agc040/tasks/agc040_e
https://atcoder.jp/contests/agc040/tasks/agc040_f
https://atcoder.jp/contests/agc041/tasks/agc041_a
输入N,A,B问至少多少次操作可以让A和B相等
一次操作可以让 A增加或减少一 并且 B增加或减少一,不能只操作一个
如果A或B等于1或N,那么可以选择不变
https://atcoder.jp/contests/agc041/tasks/agc041_b
https://atcoder.jp/contests/agc041/tasks/agc041_c
https://atcoder.jp/contests/agc041/tasks/agc041_d
https://atcoder.jp/contests/agc041/tasks/agc041_e
https://atcoder.jp/contests/agc041/tasks/agc041_f
https://atcoder.jp/contests/agc043/tasks/agc043_a
https://atcoder.jp/contests/agc043/tasks/agc043_b
https://atcoder.jp/contests/agc043/tasks/agc043_c
https://atcoder.jp/contests/agc043/tasks/agc043_d
https://atcoder.jp/contests/agc043/tasks/agc043_e
https://atcoder.jp/contests/agc043/tasks/agc043_f
https://atcoder.jp/contests/agc044/tasks/agc044_a
https://atcoder.jp/contests/agc044/tasks/agc044_b
https://atcoder.jp/contests/agc044/tasks/agc044_c
https://atcoder.jp/contests/agc044/tasks/agc044_d
https://atcoder.jp/contests/agc044/tasks/agc044_e
https://atcoder.jp/contests/agc044/tasks/agc044_f
https://atcoder.jp/contests/agc045/tasks/agc045_a
https://atcoder.jp/contests/agc045/tasks/agc045_b
https://atcoder.jp/contests/agc045/tasks/agc045_c
https://atcoder.jp/contests/agc045/tasks/agc045_d
https://atcoder.jp/contests/agc045/tasks/agc045_e
https://atcoder.jp/contests/agc045/tasks/agc045_f
https://atcoder.jp/contests/agc046/tasks/agc046_a
https://atcoder.jp/contests/agc046/tasks/agc046_b
https://atcoder.jp/contests/agc046/tasks/agc046_c
https://atcoder.jp/contests/agc046/tasks/agc046_d
https://atcoder.jp/contests/agc046/tasks/agc046_e
https://atcoder.jp/contests/agc046/tasks/agc046_f
https://atcoder.jp/contests/agc047/tasks/agc047_a
https://atcoder.jp/contests/agc047/tasks/agc047_b
https://atcoder.jp/contests/agc047/tasks/agc047_c
https://atcoder.jp/contests/agc047/tasks/agc047_d
https://atcoder.jp/contests/agc047/tasks/agc047_e
https://atcoder.jp/contests/agc047/tasks/agc047_f
https://atcoder.jp/contests/agc048/tasks/agc048_a
https://atcoder.jp/contests/agc048/tasks/agc048_b
https://atcoder.jp/contests/agc048/tasks/agc048_c
https://atcoder.jp/contests/agc048/tasks/agc048_d
https://atcoder.jp/contests/agc048/tasks/agc048_e
https://atcoder.jp/contests/agc048/tasks/agc048_f
https://atcoder.jp/contests/agc049/tasks/agc049_a
https://atcoder.jp/contests/agc049/tasks/agc049_b
https://atcoder.jp/contests/agc049/tasks/agc049_c
https://atcoder.jp/contests/agc049/tasks/agc049_d
https://atcoder.jp/contests/agc049/tasks/agc049_e
https://atcoder.jp/contests/agc049/tasks/agc049_f
https://atcoder.jp/contests/agc050/tasks/agc050_a
https://atcoder.jp/contests/agc050/tasks/agc050_b
https://atcoder.jp/contests/agc050/tasks/agc050_c
https://atcoder.jp/contests/agc050/tasks/agc050_d
https://atcoder.jp/contests/agc050/tasks/agc050_e
https://atcoder.jp/contests/agc050/tasks/agc050_f
https://atcoder.jp/contests/agc051/tasks/agc051_a
https://atcoder.jp/contests/agc051/tasks/agc051_b
https://atcoder.jp/contests/agc051/tasks/agc051_c
https://atcoder.jp/contests/agc051/tasks/agc051_d
https://atcoder.jp/contests/agc051/tasks/agc051_e
https://atcoder.jp/contests/agc051/tasks/agc051_f
https://atcoder.jp/contests/agc052/tasks/agc052_a
https://atcoder.jp/contests/agc052/tasks/agc052_b
https://atcoder.jp/contests/agc052/tasks/agc052_c
https://atcoder.jp/contests/agc052/tasks/agc052_d
https://atcoder.jp/contests/agc052/tasks/agc052_e
https://atcoder.jp/contests/agc052/tasks/agc052_f
https://atcoder.jp/contests/agc053/tasks/agc053_a
https://atcoder.jp/contests/agc053/tasks/agc053_b
https://atcoder.jp/contests/agc053/tasks/agc053_c
https://atcoder.jp/contests/agc053/tasks/agc053_d
https://atcoder.jp/contests/agc053/tasks/agc053_e
https://atcoder.jp/contests/agc053/tasks/agc053_f
https://atcoder.jp/contests/agc054/tasks/agc054_a
输入一个字符串,每次可以删去一个首位不相同的子串,问能否把字符串删空
https://atcoder.jp/contests/agc054/tasks/agc054_b
https://atcoder.jp/contests/agc054/tasks/agc054_c
https://atcoder.jp/contests/agc054/tasks/agc054_d
https://atcoder.jp/contests/agc054/tasks/agc054_e
https://atcoder.jp/contests/agc054/tasks/agc054_f
https://atcoder.jp/contests/agc055/tasks/agc055_a
https://atcoder.jp/contests/agc055/tasks/agc055_b
https://atcoder.jp/contests/agc055/tasks/agc055_c
https://atcoder.jp/contests/agc055/tasks/agc055_d
https://atcoder.jp/contests/agc055/tasks/agc055_e
https://atcoder.jp/contests/agc055/tasks/agc055_f
https://atcoder.jp/contests/agc056/tasks/agc056_a
https://atcoder.jp/contests/agc056/tasks/agc056_b
https://atcoder.jp/contests/agc056/tasks/agc056_c
https://atcoder.jp/contests/agc056/tasks/agc056_d
https://atcoder.jp/contests/agc056/tasks/agc056_e
https://atcoder.jp/contests/agc056/tasks/agc056_f
https://atcoder.jp/contests/agc057/tasks/agc057_a
https://atcoder.jp/contests/agc057/tasks/agc057_b
https://atcoder.jp/contests/agc057/tasks/agc057_c
https://atcoder.jp/contests/agc057/tasks/agc057_d
https://atcoder.jp/contests/agc057/tasks/agc057_e
https://atcoder.jp/contests/agc057/tasks/agc057_f
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/agc058_a_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/agc058_b_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/agc058_c_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/agc058_d_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/agc058_e_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/agc058_f_t.md'
https://atcoder.jp/contests/ahc001/tasks/ahc001_a
https://atcoder.jp/contests/ahc002/tasks/ahc002_a
https://atcoder.jp/contests/ahc003/tasks/ahc003_a
https://atcoder.jp/contests/ahc004/tasks/ahc004_a
https://atcoder.jp/contests/ahc005/tasks/ahc005_a
https://atcoder.jp/contests/ahc006/tasks/ahc006_a
https://atcoder.jp/contests/ahc007/tasks/ahc007_a
https://atcoder.jp/contests/ahc008/tasks/ahc008_a
https://atcoder.jp/contests/ahc009/tasks/ahc009_a
https://atcoder.jp/contests/ahc010/tasks/ahc010_a
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/ahc011_a_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/ahc012_a_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/ahc013_a_t.md'
https://atcoder.jp/contests/aising2019/tasks/aising2019_a
问在N行N列的棋盘中,放一个H行W列的棋盘有多少种方案?
https://atcoder.jp/contests/aising2019/tasks/aising2019_b
输入N个题目,第i个题目分数是Pi,一场比赛需要三个题
第一题<=A
A<
第二题<=B
B<
第三题
问最多组多少场比赛
https://atcoder.jp/contests/aising2019/tasks/aising2019_c
https://atcoder.jp/contests/aising2019/tasks/aising2019_d
https://atcoder.jp/contests/aising2019/tasks/aising2019_e
https://atcoder.jp/contests/aising2020/tasks/aising2020_a
https://atcoder.jp/contests/aising2020/tasks/aising2020_b
https://atcoder.jp/contests/aising2020/tasks/aising2020_c
https://atcoder.jp/contests/aising2020/tasks/aising2020_d
https://atcoder.jp/contests/aising2020/tasks/aising2020_e
https://atcoder.jp/contests/aising2020/tasks/aising2020_f
https://atcoder.jp/contests/apc001/tasks/apc001_a
https://atcoder.jp/contests/apc001/tasks/apc001_b
https://atcoder.jp/contests/apc001/tasks/apc001_c
https://atcoder.jp/contests/apc001/tasks/apc001_d
https://atcoder.jp/contests/apc001/tasks/apc001_e
https://atcoder.jp/contests/apc001/tasks/apc001_f
https://atcoder.jp/contests/apc001/tasks/apc001_g
https://atcoder.jp/contests/apc001/tasks/apc001_h
https://atcoder.jp/contests/apc001/tasks/apc001_i
https://atcoder.jp/contests/apc001/tasks/apc001_j
https://atcoder.jp/contests/joiopen2012c/tasks/apio_code
https://atcoder.jp/contests/joiopen2012c/tasks/apio_jumps
https://atcoder.jp/contests/joiopen2012c/tasks/apio_mansion
https://atcoder.jp/contests/arc001/tasks/arc001_1
https://atcoder.jp/contests/arc001/tasks/arc001_2
https://atcoder.jp/contests/arc001/tasks/arc001_3
https://atcoder.jp/contests/arc001/tasks/arc001_4
https://atcoder.jp/contests/arc002/tasks/arc002_1
https://atcoder.jp/contests/arc002/tasks/arc002_2
https://atcoder.jp/contests/arc002/tasks/arc002_3
https://atcoder.jp/contests/arc002/tasks/arc002_4
https://atcoder.jp/contests/arc003/tasks/arc003_1
https://atcoder.jp/contests/arc003/tasks/arc003_2
https://atcoder.jp/contests/arc003/tasks/arc003_3
https://atcoder.jp/contests/arc003/tasks/arc003_4
https://atcoder.jp/contests/arc004/tasks/arc004_1
https://atcoder.jp/contests/arc004/tasks/arc004_2
https://atcoder.jp/contests/arc004/tasks/arc004_3
https://atcoder.jp/contests/arc004/tasks/arc004_4
https://atcoder.jp/contests/arc005/tasks/arc005_1
https://atcoder.jp/contests/arc005/tasks/arc005_2
https://atcoder.jp/contests/arc005/tasks/arc005_3
https://atcoder.jp/contests/arc005/tasks/arc005_4
https://atcoder.jp/contests/arc006/tasks/arc006_1
https://atcoder.jp/contests/arc006/tasks/arc006_2
https://atcoder.jp/contests/arc006/tasks/arc006_3
https://atcoder.jp/contests/arc006/tasks/arc006_4
https://atcoder.jp/contests/arc007/tasks/arc007_1
https://atcoder.jp/contests/arc007/tasks/arc007_2
https://atcoder.jp/contests/arc007/tasks/arc007_3
https://atcoder.jp/contests/arc007/tasks/arc007_4
https://atcoder.jp/contests/arc008/tasks/arc008_1
https://atcoder.jp/contests/arc008/tasks/arc008_2
https://atcoder.jp/contests/arc008/tasks/arc008_3
https://atcoder.jp/contests/arc008/tasks/arc008_4
https://atcoder.jp/contests/arc009/tasks/arc009_1
https://atcoder.jp/contests/arc009/tasks/arc009_2
https://atcoder.jp/contests/arc009/tasks/arc009_3
https://atcoder.jp/contests/arc009/tasks/arc009_4
https://atcoder.jp/contests/arc010/tasks/arc010_1
https://atcoder.jp/contests/arc010/tasks/arc010_2
https://atcoder.jp/contests/arc010/tasks/arc010_3
https://atcoder.jp/contests/arc010/tasks/arc010_4
https://atcoder.jp/contests/arc011/tasks/arc011_1
https://atcoder.jp/contests/arc011/tasks/arc011_2
https://atcoder.jp/contests/arc011/tasks/arc011_3
https://atcoder.jp/contests/arc011/tasks/arc011_4
https://atcoder.jp/contests/arc012/tasks/arc012_1
https://atcoder.jp/contests/arc012/tasks/arc012_2
https://atcoder.jp/contests/arc012/tasks/arc012_3
https://atcoder.jp/contests/arc012/tasks/arc012_4
https://atcoder.jp/contests/arc013/tasks/arc013_1
https://atcoder.jp/contests/arc013/tasks/arc013_2
https://atcoder.jp/contests/arc013/tasks/arc013_3
https://atcoder.jp/contests/arc013/tasks/arc013_4
https://atcoder.jp/contests/arc014/tasks/arc014_1
https://atcoder.jp/contests/arc014/tasks/arc014_2
https://atcoder.jp/contests/arc014/tasks/arc014_3
https://atcoder.jp/contests/arc014/tasks/arc014_4
https://atcoder.jp/contests/arc015/tasks/arc015_1
https://atcoder.jp/contests/arc015/tasks/arc015_2
https://atcoder.jp/contests/arc015/tasks/arc015_3
https://atcoder.jp/contests/arc015/tasks/arc015_4
https://atcoder.jp/contests/arc016/tasks/arc016_1
https://atcoder.jp/contests/arc016/tasks/arc016_2
https://atcoder.jp/contests/arc016/tasks/arc016_3
https://atcoder.jp/contests/arc016/tasks/arc016_4
https://atcoder.jp/contests/arc017/tasks/arc017_1
https://atcoder.jp/contests/arc017/tasks/arc017_2
https://atcoder.jp/contests/arc017/tasks/arc017_3
https://atcoder.jp/contests/arc017/tasks/arc017_4
https://atcoder.jp/contests/arc018/tasks/arc018_1
https://atcoder.jp/contests/arc018/tasks/arc018_2
https://atcoder.jp/contests/arc018/tasks/arc018_3
https://atcoder.jp/contests/arc018/tasks/arc018_4
https://atcoder.jp/contests/arc019/tasks/arc019_1
https://atcoder.jp/contests/arc019/tasks/arc019_2
https://atcoder.jp/contests/arc019/tasks/arc019_3
https://atcoder.jp/contests/arc019/tasks/arc019_4
https://atcoder.jp/contests/arc020/tasks/arc020_1
https://atcoder.jp/contests/arc020/tasks/arc020_2
https://atcoder.jp/contests/arc020/tasks/arc020_3
https://atcoder.jp/contests/arc020/tasks/arc020_4
https://atcoder.jp/contests/arc021/tasks/arc021_1
https://atcoder.jp/contests/arc021/tasks/arc021_2
https://atcoder.jp/contests/arc021/tasks/arc021_3
https://atcoder.jp/contests/arc021/tasks/arc021_4
https://atcoder.jp/contests/arc022/tasks/arc022_1
https://atcoder.jp/contests/arc022/tasks/arc022_2
https://atcoder.jp/contests/arc022/tasks/arc022_3
https://atcoder.jp/contests/arc022/tasks/arc022_4
https://atcoder.jp/contests/arc023/tasks/arc023_1
https://atcoder.jp/contests/arc023/tasks/arc023_2
https://atcoder.jp/contests/arc023/tasks/arc023_3
https://atcoder.jp/contests/arc023/tasks/arc023_4
https://atcoder.jp/contests/arc024/tasks/arc024_1
https://atcoder.jp/contests/arc024/tasks/arc024_2
https://atcoder.jp/contests/arc024/tasks/arc024_3
https://atcoder.jp/contests/arc024/tasks/arc024_4
https://atcoder.jp/contests/arc025/tasks/arc025_1
https://atcoder.jp/contests/arc025/tasks/arc025_2
https://atcoder.jp/contests/arc025/tasks/arc025_3
https://atcoder.jp/contests/arc025/tasks/arc025_4
https://atcoder.jp/contests/arc026/tasks/arc026_1
https://atcoder.jp/contests/arc026/tasks/arc026_2
https://atcoder.jp/contests/arc026/tasks/arc026_3
https://atcoder.jp/contests/arc026/tasks/arc026_4
https://atcoder.jp/contests/arc027/tasks/arc027_1
https://atcoder.jp/contests/arc027/tasks/arc027_2
https://atcoder.jp/contests/arc027/tasks/arc027_3
https://atcoder.jp/contests/arc027/tasks/arc027_4
https://atcoder.jp/contests/arc028/tasks/arc028_1
https://atcoder.jp/contests/arc028/tasks/arc028_2
https://atcoder.jp/contests/arc028/tasks/arc028_3
https://atcoder.jp/contests/arc028/tasks/arc028_4
https://atcoder.jp/contests/arc029/tasks/arc029_1
https://atcoder.jp/contests/arc029/tasks/arc029_2
https://atcoder.jp/contests/arc029/tasks/arc029_3
https://atcoder.jp/contests/arc029/tasks/arc029_4
https://atcoder.jp/contests/arc030/tasks/arc030_1
https://atcoder.jp/contests/arc030/tasks/arc030_2
https://atcoder.jp/contests/arc030/tasks/arc030_3
https://atcoder.jp/contests/arc030/tasks/arc030_4
https://atcoder.jp/contests/arc031/tasks/arc031_1
https://atcoder.jp/contests/arc031/tasks/arc031_2
https://atcoder.jp/contests/arc031/tasks/arc031_3
https://atcoder.jp/contests/arc031/tasks/arc031_4
https://atcoder.jp/contests/arc032/tasks/arc032_1
https://atcoder.jp/contests/arc032/tasks/arc032_2
https://atcoder.jp/contests/arc032/tasks/arc032_3
https://atcoder.jp/contests/arc032/tasks/arc032_4
https://atcoder.jp/contests/arc033/tasks/arc033_1
https://atcoder.jp/contests/arc033/tasks/arc033_2
https://atcoder.jp/contests/arc033/tasks/arc033_3
https://atcoder.jp/contests/arc033/tasks/arc033_4
https://atcoder.jp/contests/arc034/tasks/arc034_1
https://atcoder.jp/contests/arc034/tasks/arc034_2
https://atcoder.jp/contests/arc034/tasks/arc034_3
https://atcoder.jp/contests/arc034/tasks/arc034_4
https://atcoder.jp/contests/arc035/tasks/arc035_a
https://atcoder.jp/contests/arc035/tasks/arc035_b
https://atcoder.jp/contests/arc035/tasks/arc035_c
https://atcoder.jp/contests/arc035/tasks/arc035_d
https://atcoder.jp/contests/arc036/tasks/arc036_a
https://atcoder.jp/contests/arc036/tasks/arc036_b
https://atcoder.jp/contests/arc036/tasks/arc036_c
https://atcoder.jp/contests/arc036/tasks/arc036_d
https://atcoder.jp/contests/arc037/tasks/arc037_a
https://atcoder.jp/contests/arc037/tasks/arc037_b
https://atcoder.jp/contests/arc037/tasks/arc037_c
https://atcoder.jp/contests/arc037/tasks/arc037_d
https://atcoder.jp/contests/arc038/tasks/arc038_a
https://atcoder.jp/contests/arc038/tasks/arc038_b
https://atcoder.jp/contests/arc038/tasks/arc038_c
https://atcoder.jp/contests/arc038/tasks/arc038_d
https://atcoder.jp/contests/arc039/tasks/arc039_a
https://atcoder.jp/contests/arc039/tasks/arc039_b
https://atcoder.jp/contests/arc039/tasks/arc039_c
https://atcoder.jp/contests/arc039/tasks/arc039_d
https://atcoder.jp/contests/arc040/tasks/arc040_a
https://atcoder.jp/contests/arc040/tasks/arc040_b
https://atcoder.jp/contests/arc040/tasks/arc040_c
https://atcoder.jp/contests/arc040/tasks/arc040_d
https://atcoder.jp/contests/arc041/tasks/arc041_a
https://atcoder.jp/contests/arc041/tasks/arc041_b
https://atcoder.jp/contests/arc041/tasks/arc041_c
https://atcoder.jp/contests/arc041/tasks/arc041_d
https://atcoder.jp/contests/arc042/tasks/arc042_a
https://atcoder.jp/contests/arc042/tasks/arc042_b
https://atcoder.jp/contests/arc042/tasks/arc042_c
https://atcoder.jp/contests/arc042/tasks/arc042_d
https://atcoder.jp/contests/arc043/tasks/arc043_a
https://atcoder.jp/contests/arc043/tasks/arc043_b
https://atcoder.jp/contests/arc043/tasks/arc043_c
https://atcoder.jp/contests/arc043/tasks/arc043_d
https://atcoder.jp/contests/arc044/tasks/arc044_a
https://atcoder.jp/contests/arc044/tasks/arc044_b
https://atcoder.jp/contests/arc044/tasks/arc044_c
https://atcoder.jp/contests/arc044/tasks/arc044_d
https://atcoder.jp/contests/arc045/tasks/arc045_a
https://atcoder.jp/contests/arc045/tasks/arc045_b
https://atcoder.jp/contests/arc045/tasks/arc045_c
https://atcoder.jp/contests/arc045/tasks/arc045_d
https://atcoder.jp/contests/arc046/tasks/arc046_a
https://atcoder.jp/contests/arc046/tasks/arc046_b
https://atcoder.jp/contests/arc046/tasks/arc046_c
https://atcoder.jp/contests/arc046/tasks/arc046_d
https://atcoder.jp/contests/arc047/tasks/arc047_a
https://atcoder.jp/contests/arc047/tasks/arc047_b
https://atcoder.jp/contests/arc047/tasks/arc047_c
https://atcoder.jp/contests/arc047/tasks/arc047_d
https://atcoder.jp/contests/arc048/tasks/arc048_a
https://atcoder.jp/contests/arc048/tasks/arc048_b
https://atcoder.jp/contests/arc048/tasks/arc048_c
https://atcoder.jp/contests/arc048/tasks/arc048_d
https://atcoder.jp/contests/arc049/tasks/arc049_a
https://atcoder.jp/contests/arc049/tasks/arc049_b
https://atcoder.jp/contests/arc049/tasks/arc049_c
https://atcoder.jp/contests/arc049/tasks/arc049_d
https://atcoder.jp/contests/arc050/tasks/arc050_a
https://atcoder.jp/contests/arc050/tasks/arc050_b
https://atcoder.jp/contests/arc050/tasks/arc050_c
https://atcoder.jp/contests/arc050/tasks/arc050_d
https://atcoder.jp/contests/arc051/tasks/arc051_a
https://atcoder.jp/contests/arc051/tasks/arc051_b
https://atcoder.jp/contests/arc051/tasks/arc051_c
https://atcoder.jp/contests/arc051/tasks/arc051_d
https://atcoder.jp/contests/arc052/tasks/arc052_a
https://atcoder.jp/contests/arc052/tasks/arc052_b
https://atcoder.jp/contests/arc052/tasks/arc052_c
https://atcoder.jp/contests/arc052/tasks/arc052_d
https://atcoder.jp/contests/arc053/tasks/arc053_a
https://atcoder.jp/contests/arc053/tasks/arc053_b
https://atcoder.jp/contests/arc053/tasks/arc053_c
https://atcoder.jp/contests/arc053/tasks/arc053_d
https://atcoder.jp/contests/arc054/tasks/arc054_a
https://atcoder.jp/contests/arc054/tasks/arc054_b
https://atcoder.jp/contests/arc054/tasks/arc054_c
https://atcoder.jp/contests/arc054/tasks/arc054_d
https://atcoder.jp/contests/arc055/tasks/arc055_a
https://atcoder.jp/contests/arc055/tasks/arc055_b
https://atcoder.jp/contests/arc055/tasks/arc055_c
https://atcoder.jp/contests/arc055/tasks/arc055_d
https://atcoder.jp/contests/arc056/tasks/arc056_a
https://atcoder.jp/contests/arc056/tasks/arc056_b
https://atcoder.jp/contests/arc056/tasks/arc056_c
https://atcoder.jp/contests/arc056/tasks/arc056_d
https://atcoder.jp/contests/arc057/tasks/arc057_a
https://atcoder.jp/contests/arc057/tasks/arc057_b
https://atcoder.jp/contests/arc057/tasks/arc057_c
https://atcoder.jp/contests/arc057/tasks/arc057_d
https://atcoder.jp/contests/arc058/tasks/arc058_a
https://atcoder.jp/contests/arc058/tasks/arc058_b
https://atcoder.jp/contests/arc058/tasks/arc058_c
https://atcoder.jp/contests/arc058/tasks/arc058_d
https://atcoder.jp/contests/arc059/tasks/arc059_a
https://atcoder.jp/contests/arc059/tasks/arc059_b
https://atcoder.jp/contests/arc059/tasks/arc059_c
https://atcoder.jp/contests/arc059/tasks/arc059_d
https://atcoder.jp/contests/abc044/tasks/arc060_a
https://atcoder.jp/contests/abc044/tasks/arc060_b
https://atcoder.jp/contests/arc060/tasks/arc060_c
https://atcoder.jp/contests/arc060/tasks/arc060_d
https://atcoder.jp/contests/abc045/tasks/arc061_a
https://atcoder.jp/contests/abc045/tasks/arc061_b
https://atcoder.jp/contests/arc061/tasks/arc061_c
https://atcoder.jp/contests/arc061/tasks/arc061_d
https://atcoder.jp/contests/abc046/tasks/arc062_a
https://atcoder.jp/contests/abc046/tasks/arc062_b
https://atcoder.jp/contests/arc062/tasks/arc062_c
https://atcoder.jp/contests/arc062/tasks/arc062_d
https://atcoder.jp/contests/abc047/tasks/arc063_a
https://atcoder.jp/contests/abc047/tasks/arc063_b
https://atcoder.jp/contests/arc063/tasks/arc063_c
https://atcoder.jp/contests/arc063/tasks/arc063_d
https://atcoder.jp/contests/abc048/tasks/arc064_a
https://atcoder.jp/contests/abc048/tasks/arc064_b
https://atcoder.jp/contests/arc064/tasks/arc064_c
https://atcoder.jp/contests/arc064/tasks/arc064_d
https://atcoder.jp/contests/abc049/tasks/arc065_a
https://atcoder.jp/contests/arc065/tasks/arc065_b
n个点,k条公路,l条铁路
对于每个点,问有多少个点和他
既可以通过公路连接,也可以通过铁路连接
https://atcoder.jp/contests/arc065/tasks/arc065_c
https://atcoder.jp/contests/arc065/tasks/arc065_d
https://atcoder.jp/contests/abc050/tasks/arc066_a
https://atcoder.jp/contests/abc050/tasks/arc066_b
https://atcoder.jp/contests/arc066/tasks/arc066_c
https://atcoder.jp/contests/arc066/tasks/arc066_d
https://atcoder.jp/contests/abc052/tasks/arc067_a
输入 n,输出 n! 的约数个数,模 1000000007
https://atcoder.jp/contests/abc052/tasks/arc067_b
https://atcoder.jp/contests/arc067/tasks/arc067_c
https://atcoder.jp/contests/arc067/tasks/arc067_d
https://atcoder.jp/contests/abc053/tasks/arc068_a
https://atcoder.jp/contests/abc053/tasks/arc068_b
https://atcoder.jp/contests/arc068/tasks/arc068_c
https://atcoder.jp/contests/arc068/tasks/arc068_d
https://atcoder.jp/contests/abc055/tasks/arc069_a
https://atcoder.jp/contests/abc055/tasks/arc069_b
https://atcoder.jp/contests/arc069/tasks/arc069_c
https://atcoder.jp/contests/arc069/tasks/arc069_d
https://atcoder.jp/contests/abc056/tasks/arc070_a
https://atcoder.jp/contests/abc056/tasks/arc070_b
https://atcoder.jp/contests/arc070/tasks/arc070_c
https://atcoder.jp/contests/arc070/tasks/arc070_d
https://atcoder.jp/contests/abc058/tasks/arc071_a
https://atcoder.jp/contests/abc058/tasks/arc071_b
https://atcoder.jp/contests/arc071/tasks/arc071_c
https://atcoder.jp/contests/arc071/tasks/arc071_d
https://atcoder.jp/contests/abc059/tasks/arc072_a
https://atcoder.jp/contests/abc059/tasks/arc072_b
https://atcoder.jp/contests/arc072/tasks/arc072_c
https://atcoder.jp/contests/arc072/tasks/arc072_d
https://atcoder.jp/contests/abc060/tasks/arc073_a
https://atcoder.jp/contests/abc060/tasks/arc073_b
https://atcoder.jp/contests/arc073/tasks/arc073_c
https://atcoder.jp/contests/arc073/tasks/arc073_d
https://atcoder.jp/contests/abc062/tasks/arc074_a
https://atcoder.jp/contests/abc062/tasks/arc074_b
https://atcoder.jp/contests/arc074/tasks/arc074_c
https://atcoder.jp/contests/arc074/tasks/arc074_d
https://atcoder.jp/contests/abc063/tasks/arc075_a
https://atcoder.jp/contests/abc063/tasks/arc075_b
https://atcoder.jp/contests/arc075/tasks/arc075_c
https://atcoder.jp/contests/arc075/tasks/arc075_d
https://atcoder.jp/contests/abc065/tasks/arc076_a
https://atcoder.jp/contests/abc065/tasks/arc076_b
https://atcoder.jp/contests/arc076/tasks/arc076_c
https://atcoder.jp/contests/arc076/tasks/arc076_d
https://atcoder.jp/contests/abc066/tasks/arc077_a
输入一个长度为n的数组a,对空数组b做n次操作
每次在b的末尾插入a[i]并且前后翻转b
问最后b是什么
https://atcoder.jp/contests/abc066/tasks/arc077_b
输入一个长度为n+1的数列,保证1到n每个数字出现一次,其中一个出现2次
问有多少个不同的长度为k的子序列(对于每个k都回答)
值一样,位置不一样,算作相同的子序列
https://atcoder.jp/contests/arc077/tasks/arc077_c
https://atcoder.jp/contests/arc077/tasks/arc077_d
https://atcoder.jp/contests/abc067/tasks/arc078_a
输入一个数组,分成一个前缀和后缀(不能为空)
要求 前缀之和 和 后缀之和 差的绝对值越小越好
https://atcoder.jp/contests/abc067/tasks/arc078_b
https://atcoder.jp/contests/arc078/tasks/arc078_c
https://atcoder.jp/contests/arc078/tasks/arc078_d
https://atcoder.jp/contests/abc068/tasks/arc079_a
输入一个 n个点 m个边 的无向图
保证没有从1到n的边
问能否恰好使用两条边从点1到点n
https://atcoder.jp/contests/abc068/tasks/arc079_b
https://atcoder.jp/contests/arc079/tasks/arc079_c
https://atcoder.jp/contests/arc079/tasks/arc079_d
https://atcoder.jp/contests/abc069/tasks/arc080_a
https://atcoder.jp/contests/abc069/tasks/arc080_b
https://atcoder.jp/contests/arc080/tasks/arc080_c
https://atcoder.jp/contests/arc080/tasks/arc080_d
https://atcoder.jp/contests/abc071/tasks/arc081_a
https://atcoder.jp/contests/abc071/tasks/arc081_b
https://atcoder.jp/contests/arc081/tasks/arc081_c
https://atcoder.jp/contests/arc081/tasks/arc081_d
https://atcoder.jp/contests/abc072/tasks/arc082_a
https://atcoder.jp/contests/abc072/tasks/arc082_b
https://atcoder.jp/contests/arc082/tasks/arc082_c
https://atcoder.jp/contests/arc082/tasks/arc082_d
https://atcoder.jp/contests/abc074/tasks/arc083_a
https://atcoder.jp/contests/abc074/tasks/arc083_b
https://atcoder.jp/contests/arc083/tasks/arc083_c
https://atcoder.jp/contests/arc083/tasks/arc083_d
https://atcoder.jp/contests/abc077/tasks/arc084_a
https://atcoder.jp/contests/abc077/tasks/arc084_b
https://atcoder.jp/contests/arc084/tasks/arc084_c
https://atcoder.jp/contests/arc084/tasks/arc084_d
https://atcoder.jp/contests/arc085/tasks/arc085_a
提交做题,一共有N组数据
其中M组,每一组正确的概率是1/2
另外N-M组,正确概率是1
提交一次消耗M*1900+(N-M)*100
的时间
消耗的时间是固定的,和自己对几个,错几个没有关系
问期望需要多少时间通过所有N个测试点?
因为消耗的时间和对几个错几个没关系,所以答案就是 期望提交次数 乘以 每次提交的时间
如果提交一次,有1/2的概率正确,那么期望交2次
如果提交一次,有1/4的概率正确,那么期望交4次
如果提交一次,有1/8的概率正确,那么期望交8次
如果提交一次,有1/2**m
的概率正确,那么期望交2**m
次
https://atcoder.jp/contests/abc078/tasks/arc085_b
https://atcoder.jp/contests/arc085/tasks/arc085_c
https://atcoder.jp/contests/arc085/tasks/arc085_d
https://atcoder.jp/contests/abc081/tasks/arc086_a
https://atcoder.jp/contests/abc081/tasks/arc086_b
https://atcoder.jp/contests/arc086/tasks/arc086_c
https://atcoder.jp/contests/arc086/tasks/arc086_d
https://atcoder.jp/contests/abc082/tasks/arc087_a
https://atcoder.jp/contests/abc082/tasks/arc087_b
https://atcoder.jp/contests/arc087/tasks/arc087_c
https://atcoder.jp/contests/arc087/tasks/arc087_d
https://atcoder.jp/contests/abc083/tasks/arc088_a
https://atcoder.jp/contests/abc083/tasks/arc088_b
https://atcoder.jp/contests/arc088/tasks/arc088_c
https://atcoder.jp/contests/arc088/tasks/arc088_d
https://atcoder.jp/contests/abc086/tasks/arc089_a
https://atcoder.jp/contests/abc086/tasks/arc089_b
https://atcoder.jp/contests/arc089/tasks/arc089_c
https://atcoder.jp/contests/arc089/tasks/arc089_d
https://atcoder.jp/contests/abc087/tasks/arc090_a
https://atcoder.jp/contests/abc087/tasks/arc090_b
https://atcoder.jp/contests/arc090/tasks/arc090_c
https://atcoder.jp/contests/arc090/tasks/arc090_d
https://atcoder.jp/contests/abc090/tasks/arc091_a
https://atcoder.jp/contests/abc090/tasks/arc091_b
https://atcoder.jp/contests/arc091/tasks/arc091_c
https://atcoder.jp/contests/arc091/tasks/arc091_d
https://atcoder.jp/contests/abc091/tasks/arc092_a
https://atcoder.jp/contests/abc091/tasks/arc092_b
https://atcoder.jp/contests/arc092/tasks/arc092_c
https://atcoder.jp/contests/arc092/tasks/arc092_d
https://atcoder.jp/contests/abc092/tasks/arc093_a
https://atcoder.jp/contests/abc092/tasks/arc093_b
https://atcoder.jp/contests/arc093/tasks/arc093_c
https://atcoder.jp/contests/arc093/tasks/arc093_d
https://atcoder.jp/contests/abc093/tasks/arc094_a
https://atcoder.jp/contests/abc093/tasks/arc094_b
https://atcoder.jp/contests/arc094/tasks/arc094_c
https://atcoder.jp/contests/arc094/tasks/arc094_d
https://atcoder.jp/contests/abc094/tasks/arc095_a
https://atcoder.jp/contests/abc094/tasks/arc095_b
https://atcoder.jp/contests/arc095/tasks/arc095_c
https://atcoder.jp/contests/arc095/tasks/arc095_d
https://atcoder.jp/contests/abc095/tasks/arc096_a
https://atcoder.jp/contests/abc095/tasks/arc096_b
https://atcoder.jp/contests/arc096/tasks/arc096_c
https://atcoder.jp/contests/arc096/tasks/arc096_d
https://atcoder.jp/contests/abc097/tasks/arc097_a
https://atcoder.jp/contests/abc097/tasks/arc097_b
https://atcoder.jp/contests/arc097/tasks/arc097_c
https://atcoder.jp/contests/arc097/tasks/arc097_d
https://atcoder.jp/contests/abc098/tasks/arc098_a
https://atcoder.jp/contests/abc098/tasks/arc098_b
https://atcoder.jp/contests/arc098/tasks/arc098_c
https://atcoder.jp/contests/arc098/tasks/arc098_d
https://atcoder.jp/contests/abc101/tasks/arc099_a
https://atcoder.jp/contests/abc101/tasks/arc099_b
https://atcoder.jp/contests/arc099/tasks/arc099_c
https://atcoder.jp/contests/arc099/tasks/arc099_d
https://atcoder.jp/contests/abc102/tasks/arc100_a
https://atcoder.jp/contests/abc102/tasks/arc100_b
https://atcoder.jp/contests/arc100/tasks/arc100_c
https://atcoder.jp/contests/arc100/tasks/arc100_d
https://atcoder.jp/contests/abc107/tasks/arc101_a
https://atcoder.jp/contests/abc107/tasks/arc101_b
https://atcoder.jp/contests/arc101/tasks/arc101_c
https://atcoder.jp/contests/arc101/tasks/arc101_d
https://atcoder.jp/contests/abc108/tasks/arc102_a
https://atcoder.jp/contests/abc108/tasks/arc102_b
https://atcoder.jp/contests/arc102/tasks/arc102_c
https://atcoder.jp/contests/arc102/tasks/arc102_d
https://atcoder.jp/contests/abc111/tasks/arc103_a
https://atcoder.jp/contests/abc111/tasks/arc103_b
https://atcoder.jp/contests/arc103/tasks/arc103_c
https://atcoder.jp/contests/arc103/tasks/arc103_d
https://atcoder.jp/contests/arc104/tasks/arc104_a
https://atcoder.jp/contests/arc104/tasks/arc104_b
https://atcoder.jp/contests/arc104/tasks/arc104_c
https://atcoder.jp/contests/arc104/tasks/arc104_d
https://atcoder.jp/contests/arc104/tasks/arc104_e
https://atcoder.jp/contests/arc104/tasks/arc104_f
https://atcoder.jp/contests/arc105/tasks/arc105_a
https://atcoder.jp/contests/arc105/tasks/arc105_b
https://atcoder.jp/contests/arc105/tasks/arc105_c
https://atcoder.jp/contests/arc105/tasks/arc105_d
https://atcoder.jp/contests/arc105/tasks/arc105_e
https://atcoder.jp/contests/arc105/tasks/arc105_f
https://atcoder.jp/contests/arc106/tasks/arc106_a
输入N
,找到3**A+5**B==N
的一组解,无解输出-1
https://atcoder.jp/contests/arc106/tasks/arc106_b
https://atcoder.jp/contests/arc106/tasks/arc106_c
https://atcoder.jp/contests/arc106/tasks/arc106_d
https://atcoder.jp/contests/arc106/tasks/arc106_e
https://atcoder.jp/contests/arc106/tasks/arc106_f
https://atcoder.jp/contests/arc107/tasks/arc107_a
https://atcoder.jp/contests/arc107/tasks/arc107_b
https://atcoder.jp/contests/arc107/tasks/arc107_c
https://atcoder.jp/contests/arc107/tasks/arc107_d
https://atcoder.jp/contests/arc107/tasks/arc107_e
https://atcoder.jp/contests/arc107/tasks/arc107_f
https://atcoder.jp/contests/arc108/tasks/arc108_a
输入S和P,问是否存在两个数字和是S,乘积是P。
https://atcoder.jp/contests/arc108/tasks/arc108_b
https://atcoder.jp/contests/arc108/tasks/arc108_c
https://atcoder.jp/contests/arc108/tasks/arc108_d
https://atcoder.jp/contests/arc108/tasks/arc108_e
https://atcoder.jp/contests/arc108/tasks/arc108_f
https://atcoder.jp/contests/arc109/tasks/arc109_a
https://atcoder.jp/contests/arc109/tasks/arc109_b
https://atcoder.jp/contests/arc109/tasks/arc109_c
https://atcoder.jp/contests/arc109/tasks/arc109_d
https://atcoder.jp/contests/arc109/tasks/arc109_e
https://atcoder.jp/contests/arc109/tasks/arc109_f
https://atcoder.jp/contests/arc110/tasks/arc110_a
输入n,输出1到n的lcm再加1
https://atcoder.jp/contests/arc110/tasks/arc110_b
https://atcoder.jp/contests/arc110/tasks/arc110_c
https://atcoder.jp/contests/arc110/tasks/arc110_d
https://atcoder.jp/contests/arc110/tasks/arc110_e
https://atcoder.jp/contests/arc110/tasks/arc110_f
https://atcoder.jp/contests/arc111/tasks/arc111_a
https://atcoder.jp/contests/arc111/tasks/arc111_b
https://atcoder.jp/contests/arc111/tasks/arc111_c
https://atcoder.jp/contests/arc111/tasks/arc111_d
https://atcoder.jp/contests/arc111/tasks/arc111_e
https://atcoder.jp/contests/arc111/tasks/arc111_f
https://atcoder.jp/contests/arc112/tasks/arc112_a
https://atcoder.jp/contests/arc112/tasks/arc112_b
https://atcoder.jp/contests/arc112/tasks/arc112_c
https://atcoder.jp/contests/arc112/tasks/arc112_d
https://atcoder.jp/contests/arc112/tasks/arc112_e
https://atcoder.jp/contests/arc112/tasks/arc112_f
A*B*C
https://atcoder.jp/contests/arc113/tasks/arc113_a
输入K(K<=2e5)
,问有多少组正整数(A,B,C)
满足A*B*C<=K
https://atcoder.jp/contests/arc113/tasks/arc113_b
https://atcoder.jp/contests/arc113/tasks/arc113_c
https://atcoder.jp/contests/arc113/tasks/arc113_d
https://atcoder.jp/contests/arc113/tasks/arc113_e
https://atcoder.jp/contests/arc113/tasks/arc113_f
https://atcoder.jp/contests/arc114/tasks/arc114_a
https://atcoder.jp/contests/arc114/tasks/arc114_b
https://atcoder.jp/contests/arc114/tasks/arc114_c
https://atcoder.jp/contests/arc114/tasks/arc114_d
https://atcoder.jp/contests/arc114/tasks/arc114_e
https://atcoder.jp/contests/arc114/tasks/arc114_f
https://atcoder.jp/contests/arc115/tasks/arc115_a
https://atcoder.jp/contests/arc115/tasks/arc115_b
https://atcoder.jp/contests/arc115/tasks/arc115_c
https://atcoder.jp/contests/arc115/tasks/arc115_d
https://atcoder.jp/contests/arc115/tasks/arc115_e
https://atcoder.jp/contests/arc115/tasks/arc115_f
https://atcoder.jp/contests/arc116/tasks/arc116_a
https://atcoder.jp/contests/arc116/tasks/arc116_b
https://atcoder.jp/contests/arc116/tasks/arc116_c
https://atcoder.jp/contests/arc116/tasks/arc116_d
https://atcoder.jp/contests/arc116/tasks/arc116_e
https://atcoder.jp/contests/arc116/tasks/arc116_f
https://atcoder.jp/contests/arc117/tasks/arc117_a
https://atcoder.jp/contests/arc117/tasks/arc117_b
https://atcoder.jp/contests/arc117/tasks/arc117_c
https://atcoder.jp/contests/arc117/tasks/arc117_d
https://atcoder.jp/contests/arc117/tasks/arc117_e
https://atcoder.jp/contests/arc117/tasks/arc117_f
https://atcoder.jp/contests/arc118/tasks/arc118_a
https://atcoder.jp/contests/arc118/tasks/arc118_b
https://atcoder.jp/contests/arc118/tasks/arc118_c
https://atcoder.jp/contests/arc118/tasks/arc118_d
https://atcoder.jp/contests/arc118/tasks/arc118_e
https://atcoder.jp/contests/arc118/tasks/arc118_f
https://atcoder.jp/contests/arc119/tasks/arc119_a
https://atcoder.jp/contests/arc119/tasks/arc119_b
https://atcoder.jp/contests/arc119/tasks/arc119_c
https://atcoder.jp/contests/arc119/tasks/arc119_d
https://atcoder.jp/contests/arc119/tasks/arc119_e
https://atcoder.jp/contests/arc119/tasks/arc119_f
https://atcoder.jp/contests/arc120/tasks/arc120_a
https://atcoder.jp/contests/arc120/tasks/arc120_b
https://atcoder.jp/contests/arc120/tasks/arc120_c
https://atcoder.jp/contests/arc120/tasks/arc120_d
https://atcoder.jp/contests/arc120/tasks/arc120_e
https://atcoder.jp/contests/arc120/tasks/arc120_f
https://atcoder.jp/contests/arc120/tasks/arc120_f2
https://atcoder.jp/contests/arc121/tasks/arc121_a
https://atcoder.jp/contests/arc121/tasks/arc121_b
https://atcoder.jp/contests/arc121/tasks/arc121_c
https://atcoder.jp/contests/arc121/tasks/arc121_d
https://atcoder.jp/contests/arc121/tasks/arc121_e
https://atcoder.jp/contests/arc121/tasks/arc121_f
https://atcoder.jp/contests/arc122/tasks/arc122_a
https://atcoder.jp/contests/arc122/tasks/arc122_b
https://atcoder.jp/contests/arc122/tasks/arc122_c
https://atcoder.jp/contests/arc122/tasks/arc122_d
https://atcoder.jp/contests/arc122/tasks/arc122_e
https://atcoder.jp/contests/arc122/tasks/arc122_f
https://atcoder.jp/contests/arc123/tasks/arc123_a
https://atcoder.jp/contests/arc123/tasks/arc123_b
https://atcoder.jp/contests/arc123/tasks/arc123_c
https://atcoder.jp/contests/arc123/tasks/arc123_d
https://atcoder.jp/contests/arc123/tasks/arc123_e
https://atcoder.jp/contests/arc123/tasks/arc123_f
https://atcoder.jp/contests/arc124/tasks/arc124_a
https://atcoder.jp/contests/arc124/tasks/arc124_b
https://atcoder.jp/contests/arc124/tasks/arc124_c
https://atcoder.jp/contests/arc124/tasks/arc124_d
https://atcoder.jp/contests/arc124/tasks/arc124_e
https://atcoder.jp/contests/arc124/tasks/arc124_f
https://atcoder.jp/contests/arc125/tasks/arc125_a
https://atcoder.jp/contests/arc125/tasks/arc125_b
https://atcoder.jp/contests/arc125/tasks/arc125_c
https://atcoder.jp/contests/arc125/tasks/arc125_d
https://atcoder.jp/contests/arc125/tasks/arc125_e
https://atcoder.jp/contests/arc125/tasks/arc125_f
https://atcoder.jp/contests/arc126/tasks/arc126_a
用N2个2,N3个3,N4个4,问最多能凑出多少个10?
https://atcoder.jp/contests/arc126/tasks/arc126_b
https://atcoder.jp/contests/arc126/tasks/arc126_c
https://atcoder.jp/contests/arc126/tasks/arc126_d
https://atcoder.jp/contests/arc126/tasks/arc126_e
https://atcoder.jp/contests/arc126/tasks/arc126_f
https://atcoder.jp/contests/arc127/tasks/arc127_a
f(x) 表示 x 有多少个前导1
输入 n
输出 f(1) + f(2) + ... + f(n)
https://atcoder.jp/contests/arc127/tasks/arc127_b
https://atcoder.jp/contests/arc127/tasks/arc127_c
https://atcoder.jp/contests/arc127/tasks/arc127_d
https://atcoder.jp/contests/arc127/tasks/arc127_e
https://atcoder.jp/contests/arc127/tasks/arc127_f
https://atcoder.jp/contests/arc128/tasks/arc128_a
初始1克金,0克银
第i天,1克金=Ai克银
每一天结束可以选择持有金或银
第n天结束希望持有最多的金
问如何操作,每一天可以选择交易,或不交易
https://atcoder.jp/contests/arc128/tasks/arc128_b
https://atcoder.jp/contests/arc128/tasks/arc128_c
https://atcoder.jp/contests/arc128/tasks/arc128_d
https://atcoder.jp/contests/arc128/tasks/arc128_e
https://atcoder.jp/contests/arc128/tasks/arc128_f
https://atcoder.jp/contests/arc129/tasks/arc129_a
https://atcoder.jp/contests/arc129/tasks/arc129_b
https://atcoder.jp/contests/arc129/tasks/arc129_c
https://atcoder.jp/contests/arc129/tasks/arc129_d
https://atcoder.jp/contests/arc129/tasks/arc129_e
https://atcoder.jp/contests/arc129/tasks/arc129_f
https://atcoder.jp/contests/arc130/tasks/arc130_a
字符串删掉一个字母,问结果有多少种可能
https://atcoder.jp/contests/arc130/tasks/arc130_b
输入H, W, C, Q
表示H行W列的矩阵,C种颜色,Q个操作
操作有两种,染一行,染一列,染色时颜色会覆盖之前的颜色
问最终每种颜色剩下多少个
不妨认为第i次染色是i,问每次染色最后剩下几个
倒序考虑,最后一次染一定全剩下了
倒数第二次染,除了最后一次染的位置,都剩下了
记录每一行/每一列是否染过颜色,需要用map #include <bits/stdc++.h> using namespace std; int n, m, l, q; set<int> r, c; int main() { cin >> n >> m >> l >> q; for (int i = 0; i < q; i++) { cin >> o[i] >> x[i] >> y[i]; } for (int i = q - 1; i >= 0; i--) { if (o[i] == 1) { if (r.find(x[i]) == r.end()) { r.insert(x[i]); n -= 1; z[y[i]] += m; } } else { if (c.find(x[i]) == c.end()) { c.insert(x[i]); m -= 1; z[y[i]] += n; } } } for (int i = 1; i <= l; i++) { cout << z[i] << " "; } }
https://atcoder.jp/contests/arc130/tasks/arc130_c
https://atcoder.jp/contests/arc130/tasks/arc130_d
https://atcoder.jp/contests/arc130/tasks/arc130_e
https://atcoder.jp/contests/arc130/tasks/arc130_f
https://atcoder.jp/contests/arc131/tasks/arc131_a
输入A和B
输入一个数字x,使得x的十进制包含A,且2x的十进制包含B
用第18位凑A,第9位空着预备进位,用第1017位凑B
答案是 A + B * 500000000
https://atcoder.jp/contests/arc131/tasks/arc131_b
输入一个H行W列的字符数组
每个位置可能已经染色12345之一,也可能还未染色
你要给未染色的格子染色,使得上下左右4个方向相邻的格子颜色必须不同
https://atcoder.jp/contests/arc131/tasks/arc131_c
输入n个互不相同的数字,双方轮流删数字,如果删之后剩下的数字xor是0,那么就赢了
问先手必胜还是后手必胜
除非一步就赢,否则一定会把所有数字取完
https://atcoder.jp/contests/arc131/tasks/arc131_d
https://atcoder.jp/contests/arc131/tasks/arc131_e
https://atcoder.jp/contests/arc131/tasks/arc131_f
https://atcoder.jp/contests/arc132/tasks/arc132_a
https://atcoder.jp/contests/arc132/tasks/arc132_b
https://atcoder.jp/contests/arc132/tasks/arc132_c
https://atcoder.jp/contests/arc132/tasks/arc132_d
https://atcoder.jp/contests/arc132/tasks/arc132_e
https://atcoder.jp/contests/arc132/tasks/arc132_f
https://atcoder.jp/contests/arc133/tasks/arc133_a
https://atcoder.jp/contests/arc133/tasks/arc133_b
https://atcoder.jp/contests/arc133/tasks/arc133_c
https://atcoder.jp/contests/arc133/tasks/arc133_d
https://atcoder.jp/contests/arc133/tasks/arc133_e
https://atcoder.jp/contests/arc133/tasks/arc133_f
https://atcoder.jp/contests/arc134/tasks/arc134_a
https://atcoder.jp/contests/arc134/tasks/arc134_b
https://atcoder.jp/contests/arc134/tasks/arc134_c
https://atcoder.jp/contests/arc134/tasks/arc134_d
https://atcoder.jp/contests/arc134/tasks/arc134_e
https://atcoder.jp/contests/arc134/tasks/arc134_f
https://atcoder.jp/contests/arc135/tasks/arc135_a
https://atcoder.jp/contests/arc135/tasks/arc135_b
https://atcoder.jp/contests/arc135/tasks/arc135_c
https://atcoder.jp/contests/arc135/tasks/arc135_d
https://atcoder.jp/contests/arc135/tasks/arc135_e
https://atcoder.jp/contests/arc135/tasks/arc135_f
https://atcoder.jp/contests/arc136/tasks/arc136_a
输入一个字符串S,可以把A替换成BB,也可以把BB替换成A
问经过替换后字典序最小的字符串是什么?
https://atcoder.jp/contests/arc136/tasks/arc136_b
https://atcoder.jp/contests/arc136/tasks/arc136_c
https://atcoder.jp/contests/arc136/tasks/arc136_d
https://atcoder.jp/contests/arc136/tasks/arc136_e
https://atcoder.jp/contests/arc136/tasks/arc136_f
https://atcoder.jp/contests/arc137/tasks/arc137_a
输入L和R找到(x,y),满足L<=x<y<=R
并且x和y互质
问y-x最大
https://atcoder.jp/contests/arc137/tasks/arc137_b
输入一个01数组,选一个区间,0改成1,1改成0
问修改之后的数组,1的个数有多少种可能
n个非负整数,初始互不相同
双方轮流操作
每次把最大的数字改成一个较小且没有出现过的数字
谁无法操作谁就输了,问先手赢还是后手赢?
https://atcoder.jp/contests/arc137/tasks/arc137_d
https://atcoder.jp/contests/arc137/tasks/arc137_e
https://atcoder.jp/contests/arc137/tasks/arc137_f
https://atcoder.jp/contests/arc138/tasks/arc138_a
输入N个数字
目标让前K个数字之和变大
执行一次操作可以交换相邻两个数字
问至少执行几次操作
https://atcoder.jp/contests/arc138/tasks/arc138_b
输入一个长度为n的01序列,问能不能通过以下两种操作生成
序列中0变成1,1变成0,并且在开始加一个0
序列结尾加一个0
如果只做第一个操作,只能得到 0 1 0 1 0 1 ...
这样的序列
序列必须以0
开始,0 1
交替若干次
https://atcoder.jp/contests/arc138/tasks/arc138_c
https://atcoder.jp/contests/arc138/tasks/arc138_d
https://atcoder.jp/contests/arc138/tasks/arc138_e
https://atcoder.jp/contests/arc138/tasks/arc138_f
https://atcoder.jp/contests/arc139/tasks/arc139_a
https://atcoder.jp/contests/arc139/tasks/arc139_b
https://atcoder.jp/contests/arc139/tasks/arc139_c
https://atcoder.jp/contests/arc139/tasks/arc139_d
https://atcoder.jp/contests/arc139/tasks/arc139_e
https://atcoder.jp/contests/arc139/tasks/arc139_f
https://atcoder.jp/contests/arc140/tasks/arc140_a
https://atcoder.jp/contests/arc140/tasks/arc140_b
https://atcoder.jp/contests/arc140/tasks/arc140_c
https://atcoder.jp/contests/arc140/tasks/arc140_d
https://atcoder.jp/contests/arc140/tasks/arc140_e
https://atcoder.jp/contests/arc140/tasks/arc140_f
https://atcoder.jp/contests/arc141/tasks/arc141_a
https://atcoder.jp/contests/arc141/tasks/arc141_b
https://atcoder.jp/contests/arc141/tasks/arc141_c
https://atcoder.jp/contests/arc141/tasks/arc141_d
https://atcoder.jp/contests/arc141/tasks/arc141_e
https://atcoder.jp/contests/arc141/tasks/arc141_f
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc142_a_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc142_b_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc142_c_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc142_d_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc142_e_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc142_f_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc143_a_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc143_b_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc143_c_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc143_d_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc143_e_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc143_f_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc144_a_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc144_b_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc144_c_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc144_d_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc144_e_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc144_f_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc145_a_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc145_b_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc145_c_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc145_d_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc145_e_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc145_f_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc146_a_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc146_b_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc146_c_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc146_d_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc146_e_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/arc146_f_t.md'
https://atcoder.jp/contests/cf17-tournament-round2-open/tasks/asaporo2_a
https://atcoder.jp/contests/cf17-tournament-round2-open/tasks/asaporo2_b
https://atcoder.jp/contests/cf17-tournament-round1-open/tasks/asaporo2_c
https://atcoder.jp/contests/cf17-tournament-round1-open/tasks/asaporo2_d
https://atcoder.jp/contests/cf17-tournament-round3-open/tasks/asaporo2_e
https://atcoder.jp/contests/cf17-tournament-round3-open/tasks/asaporo2_f
https://atcoder.jp/contests/cf16-tournament-round2-open/tasks/asaporo_a
https://atcoder.jp/contests/cf16-tournament-round3-open/tasks/asaporo_b
https://atcoder.jp/contests/cf16-tournament-round1-open/tasks/asaporo_c
https://atcoder.jp/contests/cf16-tournament-round3-open/tasks/asaporo_d
https://atcoder.jp/contests/cf16-tournament-round2-open/tasks/asaporo_e
https://atcoder.jp/contests/cf16-tournament-round1-open/tasks/asaporo_f
https://atcoder.jp/contests/asprocon7/tasks/asprocon7_a
https://atcoder.jp/contests/asprocon8/tasks/asprocon8_a
https://atcoder.jp/contests/atc002/tasks/atc002_b
https://atcoder.jp/contests/atc002/tasks/atc002_c
https://atcoder.jp/contests/autumn_fest/tasks/autumn_fest_01
https://atcoder.jp/contests/autumn_fest/tasks/autumn_fest_02
https://atcoder.jp/contests/autumn_fest/tasks/autumn_fest_03
https://atcoder.jp/contests/autumn_fest/tasks/autumn_fest_04
https://atcoder.jp/contests/autumn_fest/tasks/autumn_fest_05
https://atcoder.jp/contests/autumn_fest/tasks/autumn_fest_06
https://atcoder.jp/contests/autumn_fest/tasks/autumn_fest_07
https://atcoder.jp/contests/autumn_fest/tasks/autumn_fest_08
https://atcoder.jp/contests/autumn_fest/tasks/autumn_fest_09
https://atcoder.jp/contests/autumn_fest/tasks/autumn_fest_10
https://atcoder.jp/contests/autumn_fest/tasks/autumn_fest_11
https://atcoder.jp/contests/bcu30-2018/tasks/bcu30_2018_a
https://atcoder.jp/contests/bcu30-2018/tasks/bcu30_2018_b
https://atcoder.jp/contests/bcu30-2018-qual/tasks/bcu30_2018_qual_a
https://atcoder.jp/contests/bcu30-2019/tasks/bcu30_2019_a
https://atcoder.jp/contests/bcu30-2019/tasks/bcu30_2019_b
https://atcoder.jp/contests/bcu30-2019-qual/tasks/bcu30_2019_qual_a
https://atcoder.jp/contests/bcu30/tasks/bcu30_a
https://atcoder.jp/contests/bcu30/tasks/bcu30_b
https://atcoder.jp/contests/bcu30/tasks/bcu30_c
https://atcoder.jp/contests/bcu30/tasks/bcu30_d
https://atcoder.jp/contests/bcu30/tasks/bcu30_e
https://atcoder.jp/contests/bcu30/tasks/bcu30_f
https://atcoder.jp/contests/birthday0410/tasks/birthday0410_a
https://atcoder.jp/contests/birthday0410/tasks/birthday0410_b
https://atcoder.jp/contests/birthday0410/tasks/birthday0410_c
https://atcoder.jp/contests/birthday0410/tasks/birthday0410_d
https://atcoder.jp/contests/birthday0410/tasks/birthday0410_e
https://atcoder.jp/contests/birthday0410/tasks/birthday0410_f
https://atcoder.jp/contests/birthday0410/tasks/birthday0410_x
https://atcoder.jp/contests/bitflyer2018-final/tasks/bitflyer2018_final_a
https://atcoder.jp/contests/bitflyer2018-final/tasks/bitflyer2018_final_b
https://atcoder.jp/contests/bitflyer2018-final/tasks/bitflyer2018_final_c
https://atcoder.jp/contests/bitflyer2018-final/tasks/bitflyer2018_final_d
https://atcoder.jp/contests/bitflyer2018-final/tasks/bitflyer2018_final_e
https://atcoder.jp/contests/bitflyer2018-final/tasks/bitflyer2018_final_f
https://atcoder.jp/contests/bitflyer2018-final/tasks/bitflyer2018_final_g
https://atcoder.jp/contests/bitflyer2018-final/tasks/bitflyer2018_final_h
https://atcoder.jp/contests/bitflyer2018-qual/tasks/bitflyer2018_qual_a
https://atcoder.jp/contests/bitflyer2018-qual/tasks/bitflyer2018_qual_b
https://atcoder.jp/contests/bitflyer2018-qual/tasks/bitflyer2018_qual_c
https://atcoder.jp/contests/bitflyer2018-qual/tasks/bitflyer2018_qual_d
https://atcoder.jp/contests/bitflyer2018-qual/tasks/bitflyer2018_qual_e
https://atcoder.jp/contests/caddi2018b/tasks/caddi2018_a
https://atcoder.jp/contests/caddi2018b/tasks/caddi2018_b
https://atcoder.jp/contests/caddi2018/tasks/caddi2018_c
https://atcoder.jp/contests/caddi2018/tasks/caddi2018_d
https://atcoder.jp/contests/caddi2018b/tasks/caddi2018b_a
https://atcoder.jp/contests/caddi2018b/tasks/caddi2018b_b
https://atcoder.jp/contests/caddi2019/tasks/caddi2019_a
https://atcoder.jp/contests/cf16-exhibition-final/tasks/cf16_exhibition_final_a
https://atcoder.jp/contests/cf16-exhibition-final/tasks/cf16_exhibition_final_b
https://atcoder.jp/contests/cf16-exhibition-final/tasks/cf16_exhibition_final_c
https://atcoder.jp/contests/cf16-exhibition-final/tasks/cf16_exhibition_final_d
https://atcoder.jp/contests/cf16-exhibition-final/tasks/cf16_exhibition_final_e
https://atcoder.jp/contests/cf16-exhibition-final/tasks/cf16_exhibition_final_f
https://atcoder.jp/contests/cf16-exhibition-final/tasks/cf16_exhibition_final_g
https://atcoder.jp/contests/cf16-exhibition-final/tasks/cf16_exhibition_final_h
https://atcoder.jp/contests/cf16-exhibition-final/tasks/cf16_exhibition_final_i
https://atcoder.jp/contests/cf16-exhibition-final/tasks/cf16_exhibition_final_j
https://atcoder.jp/contests/cf17-exhibition-open/tasks/cf17_exhibition_a
https://atcoder.jp/contests/cf17-exhibition-open/tasks/cf17_exhibition_b
https://atcoder.jp/contests/cf17-final/tasks/cf17_final_a
https://atcoder.jp/contests/cf17-final/tasks/cf17_final_b
https://atcoder.jp/contests/cf17-final/tasks/cf17_final_c
https://atcoder.jp/contests/cf17-final/tasks/cf17_final_d
https://atcoder.jp/contests/cf17-final/tasks/cf17_final_e
https://atcoder.jp/contests/cf17-final/tasks/cf17_final_f
https://atcoder.jp/contests/cf17-final/tasks/cf17_final_g
https://atcoder.jp/contests/cf17-final/tasks/cf17_final_h
https://atcoder.jp/contests/cf17-final/tasks/cf17_final_i
https://atcoder.jp/contests/cf17-final/tasks/cf17_final_j
https://atcoder.jp/contests/code-festival-2015-morning-easy/tasks/cf_2015_morning_easy_a
https://atcoder.jp/contests/code-festival-2015-morning-easy/tasks/cf_2015_morning_easy_b
https://atcoder.jp/contests/code-festival-2015-morning-easy/tasks/cf_2015_morning_easy_c
https://atcoder.jp/contests/code-festival-2015-morning-easy/tasks/cf_2015_morning_easy_d
https://atcoder.jp/contests/code-festival-2015-morning-middle/tasks/cf_2015_morning_hard_a
https://atcoder.jp/contests/code-festival-2015-morning-middle/tasks/cf_2015_morning_hard_b
https://atcoder.jp/contests/code-festival-2015-morning-hard/tasks/cf_2015_morning_hard_c
https://atcoder.jp/contests/code-festival-2015-morning-hard/tasks/cf_2015_morning_hard_h
https://atcoder.jp/contests/code-festival-2015-relay/tasks/cf_2015_relay_a
https://atcoder.jp/contests/code-festival-2015-relay/tasks/cf_2015_relay_b
https://atcoder.jp/contests/code-festival-2015-relay/tasks/cf_2015_relay_c
https://atcoder.jp/contests/code-festival-2015-relay/tasks/cf_2015_relay_d
https://atcoder.jp/contests/code-festival-2015-relay/tasks/cf_2015_relay_e
https://atcoder.jp/contests/code-festival-2015-relay/tasks/cf_2015_relay_f
https://atcoder.jp/contests/code-festival-2015-relay/tasks/cf_2015_relay_g
https://atcoder.jp/contests/code-festival-2015-relay/tasks/cf_2015_relay_h
https://atcoder.jp/contests/code-festival-2015-relay/tasks/cf_2015_relay_i
https://atcoder.jp/contests/code-festival-2015-relay/tasks/cf_2015_relay_j
https://atcoder.jp/contests/chokudai002/tasks/chokudai002_a
https://atcoder.jp/contests/chokudai003/tasks/chokudai003_a
https://atcoder.jp/contests/chokudai004/tasks/chokudai004_a
https://atcoder.jp/contests/chokudai005/tasks/chokudai005_a
https://atcoder.jp/contests/chokudai001/tasks/chokudai_001_a
https://atcoder.jp/contests/chokudai_S001/tasks/chokudai_S001_a
https://atcoder.jp/contests/chokudai_S001/tasks/chokudai_S001_b
https://atcoder.jp/contests/chokudai_S001/tasks/chokudai_S001_c
https://atcoder.jp/contests/chokudai_S001/tasks/chokudai_S001_d
https://atcoder.jp/contests/chokudai_S001/tasks/chokudai_S001_e
https://atcoder.jp/contests/chokudai_S001/tasks/chokudai_S001_f
https://atcoder.jp/contests/chokudai_S001/tasks/chokudai_S001_g
https://atcoder.jp/contests/chokudai_S001/tasks/chokudai_S001_h
https://atcoder.jp/contests/chokudai_S001/tasks/chokudai_S001_i
https://atcoder.jp/contests/chokudai_S001/tasks/chokudai_S001_j
https://atcoder.jp/contests/chokudai_S001/tasks/chokudai_S001_k
https://atcoder.jp/contests/chokudai_S001/tasks/chokudai_S001_l
https://atcoder.jp/contests/chokudai_S002/tasks/chokudai_S002_a
https://atcoder.jp/contests/chokudai_S002/tasks/chokudai_S002_b
https://atcoder.jp/contests/chokudai_S002/tasks/chokudai_S002_c
https://atcoder.jp/contests/chokudai_S002/tasks/chokudai_S002_d
https://atcoder.jp/contests/chokudai_S002/tasks/chokudai_S002_e
https://atcoder.jp/contests/chokudai_S002/tasks/chokudai_S002_f
https://atcoder.jp/contests/chokudai_S002/tasks/chokudai_S002_g
https://atcoder.jp/contests/chokudai_S002/tasks/chokudai_S002_h
https://atcoder.jp/contests/chokudai_S002/tasks/chokudai_S002_i
https://atcoder.jp/contests/chokudai_S002/tasks/chokudai_S002_j
https://atcoder.jp/contests/chokudai_S002/tasks/chokudai_S002_k
https://atcoder.jp/contests/chokudai_S002/tasks/chokudai_S002_l
https://atcoder.jp/contests/code-festival-2015-okinawa-open/tasks/code_festival_2015_okinawa_a
https://atcoder.jp/contests/code-festival-2015-okinawa-open/tasks/code_festival_2015_okinawa_b
https://atcoder.jp/contests/code-festival-2015-okinawa-open/tasks/code_festival_2015_okinawa_c
https://atcoder.jp/contests/code-festival-2015-okinawa-open/tasks/code_festival_2015_okinawa_d
https://atcoder.jp/contests/code-festival-2015-okinawa-open/tasks/code_festival_2015_okinawa_e
https://atcoder.jp/contests/code-festival-2015-okinawa-open/tasks/code_festival_2015_okinawa_f
https://atcoder.jp/contests/code-festival-2015-okinawa-open/tasks/code_festival_2015_okinawa_g
https://atcoder.jp/contests/code-festival-2015-okinawa-open/tasks/code_festival_2015_okinawa_h
https://atcoder.jp/contests/code-festival-2015-okinawa-open/tasks/code_festival_2015_okinawa_i
https://atcoder.jp/contests/code-festival-2015-okinawa-open/tasks/code_festival_2015_okinawa_j
https://atcoder.jp/contests/code-festival-2017-quala/tasks/code_festival_2017_quala_a
https://atcoder.jp/contests/code-festival-2017-quala/tasks/code_festival_2017_quala_b
n行m列的白色网格
每次操作可以翻转一行或一列的颜色,翻转就是黑变白,白变黑
问能不能通过若干次操作,使得恰好有k个黑色
https://atcoder.jp/contests/code-festival-2017-quala/tasks/code_festival_2017_quala_c
https://atcoder.jp/contests/code-festival-2017-quala/tasks/code_festival_2017_quala_d
https://atcoder.jp/contests/code-festival-2017-quala/tasks/code_festival_2017_quala_e
https://atcoder.jp/contests/code-festival-2017-quala/tasks/code_festival_2017_quala_f
https://atcoder.jp/contests/code-festival-2017-qualb/tasks/code_festival_2017_qualb_a
https://atcoder.jp/contests/code-festival-2017-qualb/tasks/code_festival_2017_qualb_b
https://atcoder.jp/contests/code-festival-2017-qualb/tasks/code_festival_2017_qualb_c
https://atcoder.jp/contests/code-festival-2017-qualb/tasks/code_festival_2017_qualb_d
https://atcoder.jp/contests/code-festival-2017-qualb/tasks/code_festival_2017_qualb_e
https://atcoder.jp/contests/code-festival-2017-qualb/tasks/code_festival_2017_qualb_f
https://atcoder.jp/contests/code-festival-2017-qualc/tasks/code_festival_2017_qualc_a
https://atcoder.jp/contests/code-festival-2017-qualc/tasks/code_festival_2017_qualc_b
https://atcoder.jp/contests/code-festival-2017-qualc/tasks/code_festival_2017_qualc_c
https://atcoder.jp/contests/code-festival-2017-qualc/tasks/code_festival_2017_qualc_d
https://atcoder.jp/contests/code-festival-2017-qualc/tasks/code_festival_2017_qualc_e
https://atcoder.jp/contests/code-festival-2017-qualc/tasks/code_festival_2017_qualc_f
https://atcoder.jp/contests/code-festival-2018-final-open/tasks/code_festival_2018_final_a
https://atcoder.jp/contests/code-festival-2018-final-open/tasks/code_festival_2018_final_b
https://atcoder.jp/contests/code-festival-2018-final-open/tasks/code_festival_2018_final_c
https://atcoder.jp/contests/code-festival-2018-final-open/tasks/code_festival_2018_final_d
https://atcoder.jp/contests/code-festival-2018-final-open/tasks/code_festival_2018_final_e
https://atcoder.jp/contests/code-festival-2018-final-open/tasks/code_festival_2018_final_f
https://atcoder.jp/contests/code-festival-2018-final-open/tasks/code_festival_2018_final_g
https://atcoder.jp/contests/code-festival-2018-final-open/tasks/code_festival_2018_final_h
https://atcoder.jp/contests/code-festival-2018-final-open/tasks/code_festival_2018_final_i
https://atcoder.jp/contests/code-festival-2018-final-open/tasks/code_festival_2018_final_j
https://atcoder.jp/contests/code-festival-2018-quala/tasks/code_festival_2018_quala_a
https://atcoder.jp/contests/code-festival-2018-quala/tasks/code_festival_2018_quala_b
https://atcoder.jp/contests/code-festival-2018-quala/tasks/code_festival_2018_quala_c
https://atcoder.jp/contests/code-festival-2018-quala/tasks/code_festival_2018_quala_d
https://atcoder.jp/contests/code-festival-2018-quala/tasks/code_festival_2018_quala_e
https://atcoder.jp/contests/code-festival-2018-qualb/tasks/code_festival_2018_qualb_a
https://atcoder.jp/contests/code-festival-2018-qualb/tasks/code_festival_2018_qualb_b
https://atcoder.jp/contests/code-festival-2018-qualb/tasks/code_festival_2018_qualb_c
https://atcoder.jp/contests/code-festival-2018-qualb/tasks/code_festival_2018_qualb_d
https://atcoder.jp/contests/code-festival-2018-qualb/tasks/code_festival_2018_qualb_e
https://atcoder.jp/contests/code-festival-2014-china-open/tasks/code_festival_china_a
https://atcoder.jp/contests/code-festival-2014-china-open/tasks/code_festival_china_b
https://atcoder.jp/contests/code-festival-2014-china-open/tasks/code_festival_china_c
https://atcoder.jp/contests/code-festival-2014-china-open/tasks/code_festival_china_d
https://atcoder.jp/contests/code-festival-2014-china-open/tasks/code_festival_china_e
https://atcoder.jp/contests/code-festival-2014-china-open/tasks/code_festival_china_f
https://atcoder.jp/contests/code-festival-2014-china-open/tasks/code_festival_china_g
https://atcoder.jp/contests/code-festival-2014-china-open/tasks/code_festival_china_h
https://atcoder.jp/contests/code-festival-2014-china-open/tasks/code_festival_china_i
https://atcoder.jp/contests/code-festival-2014-china-open/tasks/code_festival_china_j
https://atcoder.jp/contests/code-festival-2014-exhibition/tasks/code_festival_exhibition_a
https://atcoder.jp/contests/code-festival-2014-exhibition/tasks/code_festival_exhibition_b
https://atcoder.jp/contests/code-festival-2014-final/tasks/code_festival_final_a
https://atcoder.jp/contests/code-festival-2014-final/tasks/code_festival_final_b
https://atcoder.jp/contests/code-festival-2014-final/tasks/code_festival_final_c
https://atcoder.jp/contests/code-festival-2014-final/tasks/code_festival_final_d
https://atcoder.jp/contests/code-festival-2014-final/tasks/code_festival_final_e
https://atcoder.jp/contests/code-festival-2014-final/tasks/code_festival_final_f
https://atcoder.jp/contests/code-festival-2014-final/tasks/code_festival_final_g
https://atcoder.jp/contests/code-festival-2014-final/tasks/code_festival_final_h
https://atcoder.jp/contests/code-festival-2014-final/tasks/code_festival_final_i
https://atcoder.jp/contests/code-festival-2014-final/tasks/code_festival_final_j
https://atcoder.jp/contests/code-festival-2014-morning-easy/tasks/code_festival_morning_easy_a
https://atcoder.jp/contests/code-festival-2014-morning-easy/tasks/code_festival_morning_easy_b
https://atcoder.jp/contests/code-festival-2014-morning-easy/tasks/code_festival_morning_easy_c
https://atcoder.jp/contests/code-festival-2014-morning-easy/tasks/code_festival_morning_easy_d
https://atcoder.jp/contests/code-festival-2014-morning-hard/tasks/code_festival_morning_hard_c
https://atcoder.jp/contests/code-festival-2014-morning-hard/tasks/code_festival_morning_hard_d
https://atcoder.jp/contests/code-festival-2014-morning-middle/tasks/code_festival_morning_med_c
https://atcoder.jp/contests/code-festival-2014-morning-middle/tasks/code_festival_morning_med_d
https://atcoder.jp/contests/code-festival-2014-quala/tasks/code_festival_qualA_a
https://atcoder.jp/contests/code-festival-2014-quala/tasks/code_festival_qualA_b
https://atcoder.jp/contests/code-festival-2014-quala/tasks/code_festival_qualA_c
https://atcoder.jp/contests/code-festival-2014-quala/tasks/code_festival_qualA_d
https://atcoder.jp/contests/code-festival-2014-qualb/tasks/code_festival_qualB_a
https://atcoder.jp/contests/code-festival-2014-qualb/tasks/code_festival_qualB_b
https://atcoder.jp/contests/code-festival-2014-qualb/tasks/code_festival_qualB_c
https://atcoder.jp/contests/code-festival-2014-qualb/tasks/code_festival_qualB_d
https://atcoder.jp/contests/code-festival-2014-relay/tasks/code_festival_relay_a
https://atcoder.jp/contests/code-festival-2014-relay/tasks/code_festival_relay_b
https://atcoder.jp/contests/code-festival-2014-relay/tasks/code_festival_relay_c
https://atcoder.jp/contests/code-festival-2014-relay/tasks/code_festival_relay_d
https://atcoder.jp/contests/code-festival-2014-relay/tasks/code_festival_relay_e
https://atcoder.jp/contests/code-festival-2014-relay/tasks/code_festival_relay_f
https://atcoder.jp/contests/code-festival-2014-relay/tasks/code_festival_relay_g
https://atcoder.jp/contests/code-festival-2014-relay/tasks/code_festival_relay_h
https://atcoder.jp/contests/code-festival-2014-relay/tasks/code_festival_relay_i
https://atcoder.jp/contests/code-festival-2014-relay/tasks/code_festival_relay_j
https://atcoder.jp/contests/code-formula-2014-final/tasks/code_formula_2014_final_a
https://atcoder.jp/contests/code-formula-2014-final/tasks/code_formula_2014_final_b
https://atcoder.jp/contests/code-formula-2014-final/tasks/code_formula_2014_final_c
https://atcoder.jp/contests/code-formula-2014-final/tasks/code_formula_2014_final_d
https://atcoder.jp/contests/code-formula-2014-final/tasks/code_formula_2014_final_e
https://atcoder.jp/contests/code-formula-2014-final/tasks/code_formula_2014_final_f
https://atcoder.jp/contests/code-formula-2014-final/tasks/code_formula_2014_final_g
https://atcoder.jp/contests/code-formula-2014-final/tasks/code_formula_2014_final_h
https://atcoder.jp/contests/code-formula-2014-quala/tasks/code_formula_2014_qualA_a
https://atcoder.jp/contests/code-formula-2014-quala/tasks/code_formula_2014_qualA_b
https://atcoder.jp/contests/code-formula-2014-quala/tasks/code_formula_2014_qualA_c
https://atcoder.jp/contests/code-formula-2014-quala/tasks/code_formula_2014_qualA_d
https://atcoder.jp/contests/code-formula-2014-qualb/tasks/code_formula_2014_qualB_a
https://atcoder.jp/contests/code-formula-2014-qualb/tasks/code_formula_2014_qualB_b
https://atcoder.jp/contests/code-formula-2014-qualb/tasks/code_formula_2014_qualB_c
https://atcoder.jp/contests/code-formula-2014-qualb/tasks/code_formula_2014_qualB_d
https://atcoder.jp/contests/code-thanks-festival-2014-a-open/tasks/code_thanks_festival_14_quala_a
https://atcoder.jp/contests/code-thanks-festival-2014-a-open/tasks/code_thanks_festival_14_quala_b
https://atcoder.jp/contests/code-thanks-festival-2014-a-open/tasks/code_thanks_festival_14_quala_c
https://atcoder.jp/contests/code-thanks-festival-2014-a-open/tasks/code_thanks_festival_14_quala_d
https://atcoder.jp/contests/code-thanks-festival-2014-a-open/tasks/code_thanks_festival_14_quala_e
https://atcoder.jp/contests/code-thanks-festival-2014-a-open/tasks/code_thanks_festival_14_quala_f
https://atcoder.jp/contests/code-thanks-festival-2014-a-open/tasks/code_thanks_festival_14_quala_g
https://atcoder.jp/contests/code-thanks-festival-2014-a-open/tasks/code_thanks_festival_14_quala_h
https://atcoder.jp/contests/code-thanks-festival-2014-b-open/tasks/code_thanks_festival_14_qualb_a
https://atcoder.jp/contests/code-thanks-festival-2014-b-open/tasks/code_thanks_festival_14_qualb_b
https://atcoder.jp/contests/code-thanks-festival-2014-b-open/tasks/code_thanks_festival_14_qualb_c
https://atcoder.jp/contests/code-thanks-festival-2014-b-open/tasks/code_thanks_festival_14_qualb_d
https://atcoder.jp/contests/code-thanks-festival-2014-b-open/tasks/code_thanks_festival_14_qualb_e
https://atcoder.jp/contests/code-thanks-festival-2014-b-open/tasks/code_thanks_festival_14_qualb_f
https://atcoder.jp/contests/code-thanks-festival-2014-b-open/tasks/code_thanks_festival_14_qualb_g
https://atcoder.jp/contests/code-thanks-festival-2014-b-open/tasks/code_thanks_festival_14_qualb_h
https://atcoder.jp/contests/code-thanks-festival-2015-open/tasks/code_thanks_festival_2015_a
https://atcoder.jp/contests/code-thanks-festival-2015-open/tasks/code_thanks_festival_2015_b
https://atcoder.jp/contests/code-thanks-festival-2015-open/tasks/code_thanks_festival_2015_c
https://atcoder.jp/contests/code-thanks-festival-2015-open/tasks/code_thanks_festival_2015_d
https://atcoder.jp/contests/code-thanks-festival-2015-open/tasks/code_thanks_festival_2015_e
https://atcoder.jp/contests/code-thanks-festival-2015-open/tasks/code_thanks_festival_2015_f
https://atcoder.jp/contests/code-thanks-festival-2015-open/tasks/code_thanks_festival_2015_g
https://atcoder.jp/contests/code-thanks-festival-2015-open/tasks/code_thanks_festival_2015_h
https://atcoder.jp/contests/code-thanks-festival-2017/tasks/code_thanks_festival_2017_a
https://atcoder.jp/contests/code-thanks-festival-2017/tasks/code_thanks_festival_2017_b
https://atcoder.jp/contests/code-thanks-festival-2017/tasks/code_thanks_festival_2017_c
https://atcoder.jp/contests/code-thanks-festival-2017/tasks/code_thanks_festival_2017_d
https://atcoder.jp/contests/code-thanks-festival-2017/tasks/code_thanks_festival_2017_e
https://atcoder.jp/contests/code-thanks-festival-2017/tasks/code_thanks_festival_2017_f
https://atcoder.jp/contests/code-thanks-festival-2017/tasks/code_thanks_festival_2017_g
https://atcoder.jp/contests/code-thanks-festival-2017/tasks/code_thanks_festival_2017_h
https://atcoder.jp/contests/code-thanks-festival-2018/tasks/code_thanks_festival_2018_a
https://atcoder.jp/contests/code-thanks-festival-2018/tasks/code_thanks_festival_2018_b
https://atcoder.jp/contests/code-thanks-festival-2018/tasks/code_thanks_festival_2018_c
https://atcoder.jp/contests/code-thanks-festival-2018/tasks/code_thanks_festival_2018_d
https://atcoder.jp/contests/code-thanks-festival-2018/tasks/code_thanks_festival_2018_e
https://atcoder.jp/contests/code-thanks-festival-2018/tasks/code_thanks_festival_2018_f
https://atcoder.jp/contests/code-thanks-festival-2018/tasks/code_thanks_festival_2018_g
https://atcoder.jp/contests/code-thanks-festival-2018/tasks/code_thanks_festival_2018_h
https://atcoder.jp/contests/code-festival-2015-exhibition/tasks/codefestival_2015_ex_a
https://atcoder.jp/contests/code-festival-2015-exhibition/tasks/codefestival_2015_ex_b
https://atcoder.jp/contests/code-festival-2015-final-open/tasks/codefestival_2015_final_a
https://atcoder.jp/contests/code-festival-2015-final-open/tasks/codefestival_2015_final_b
https://atcoder.jp/contests/code-festival-2015-final-open/tasks/codefestival_2015_final_c
https://atcoder.jp/contests/code-festival-2015-final-open/tasks/codefestival_2015_final_d
https://atcoder.jp/contests/code-festival-2015-final-open/tasks/codefestival_2015_final_e
https://atcoder.jp/contests/code-festival-2015-final-open/tasks/codefestival_2015_final_f
https://atcoder.jp/contests/code-festival-2015-final-open/tasks/codefestival_2015_final_g
https://atcoder.jp/contests/code-festival-2015-final-open/tasks/codefestival_2015_final_h
https://atcoder.jp/contests/code-festival-2015-final-open/tasks/codefestival_2015_final_i
https://atcoder.jp/contests/code-festival-2015-final-open/tasks/codefestival_2015_final_j
https://atcoder.jp/contests/code-festival-2015-quala/tasks/codefestival_2015_qualA_a
https://atcoder.jp/contests/code-festival-2015-quala/tasks/codefestival_2015_qualA_b
https://atcoder.jp/contests/code-festival-2015-quala/tasks/codefestival_2015_qualA_c
https://atcoder.jp/contests/code-festival-2015-quala/tasks/codefestival_2015_qualA_d
https://atcoder.jp/contests/code-festival-2015-qualb/tasks/codefestival_2015_qualB_a
https://atcoder.jp/contests/code-festival-2015-qualb/tasks/codefestival_2015_qualB_b
https://atcoder.jp/contests/code-festival-2015-qualb/tasks/codefestival_2015_qualB_c
https://atcoder.jp/contests/code-festival-2015-qualb/tasks/codefestival_2015_qualB_d
https://atcoder.jp/contests/cf16-exhibition/tasks/codefestival_2016_ex_a
https://atcoder.jp/contests/cf16-exhibition/tasks/codefestival_2016_ex_b
https://atcoder.jp/contests/cf16-final/tasks/codefestival_2016_final_a
https://atcoder.jp/contests/cf16-final/tasks/codefestival_2016_final_b
https://atcoder.jp/contests/cf16-final/tasks/codefestival_2016_final_c
https://atcoder.jp/contests/cf16-final/tasks/codefestival_2016_final_d
https://atcoder.jp/contests/cf16-final/tasks/codefestival_2016_final_e
https://atcoder.jp/contests/cf16-final/tasks/codefestival_2016_final_f
https://atcoder.jp/contests/cf16-final/tasks/codefestival_2016_final_g
https://atcoder.jp/contests/cf16-final/tasks/codefestival_2016_final_h
https://atcoder.jp/contests/cf16-final/tasks/codefestival_2016_final_i
https://atcoder.jp/contests/cf16-final/tasks/codefestival_2016_final_j
https://atcoder.jp/contests/code-festival-2016-quala/tasks/codefestival_2016_qualA_a
https://atcoder.jp/contests/code-festival-2016-quala/tasks/codefestival_2016_qualA_b
https://atcoder.jp/contests/code-festival-2016-quala/tasks/codefestival_2016_qualA_c
https://atcoder.jp/contests/code-festival-2016-quala/tasks/codefestival_2016_qualA_d
https://atcoder.jp/contests/code-festival-2016-quala/tasks/codefestival_2016_qualA_e
https://atcoder.jp/contests/code-festival-2016-qualb/tasks/codefestival_2016_qualB_a
https://atcoder.jp/contests/code-festival-2016-qualb/tasks/codefestival_2016_qualB_b
https://atcoder.jp/contests/code-festival-2016-qualb/tasks/codefestival_2016_qualB_c
https://atcoder.jp/contests/code-festival-2016-qualb/tasks/codefestival_2016_qualB_d
https://atcoder.jp/contests/code-festival-2016-qualb/tasks/codefestival_2016_qualB_e
https://atcoder.jp/contests/code-festival-2016-qualc/tasks/codefestival_2016_qualC_a
https://atcoder.jp/contests/code-festival-2016-qualc/tasks/codefestival_2016_qualC_b
https://atcoder.jp/contests/code-festival-2016-qualc/tasks/codefestival_2016_qualC_c
https://atcoder.jp/contests/code-festival-2016-qualc/tasks/codefestival_2016_qualC_d
https://atcoder.jp/contests/code-festival-2016-qualc/tasks/codefestival_2016_qualC_e
https://atcoder.jp/contests/colopl2018-final/tasks/colopl2018_final_a
https://atcoder.jp/contests/colopl2018-final/tasks/colopl2018_final_b
https://atcoder.jp/contests/colopl2018-final/tasks/colopl2018_final_c
https://atcoder.jp/contests/colopl2018-final/tasks/colopl2018_final_d
https://atcoder.jp/contests/colopl2018-final/tasks/colopl2018_final_e
https://atcoder.jp/contests/colopl2018-final/tasks/colopl2018_final_f
https://atcoder.jp/contests/colopl2018-qual/tasks/colopl2018_qual_a
https://atcoder.jp/contests/colopl2018-qual/tasks/colopl2018_qual_b
https://atcoder.jp/contests/colopl2018-qual/tasks/colopl2018_qual_c
https://atcoder.jp/contests/colopl2018-qual/tasks/colopl2018_qual_d
https://atcoder.jp/contests/colopl2018-qual/tasks/colopl2018_qual_e
https://atcoder.jp/contests/cpsco2019-s1/tasks/cpsco2019_s1_a
https://atcoder.jp/contests/cpsco2019-s1/tasks/cpsco2019_s1_b
https://atcoder.jp/contests/cpsco2019-s1/tasks/cpsco2019_s1_c
https://atcoder.jp/contests/cpsco2019-s1/tasks/cpsco2019_s1_d
https://atcoder.jp/contests/cpsco2019-s1/tasks/cpsco2019_s1_e
https://atcoder.jp/contests/cpsco2019-s1/tasks/cpsco2019_s1_f
https://atcoder.jp/contests/cpsco2019-s1/tasks/cpsco2019_s1_g
https://atcoder.jp/contests/cpsco2019-s1/tasks/cpsco2019_s1_h
https://atcoder.jp/contests/cpsco2019-s2/tasks/cpsco2019_s2_a
https://atcoder.jp/contests/cpsco2019-s2/tasks/cpsco2019_s2_b
https://atcoder.jp/contests/cpsco2019-s2/tasks/cpsco2019_s2_c
https://atcoder.jp/contests/cpsco2019-s2/tasks/cpsco2019_s2_d
https://atcoder.jp/contests/cpsco2019-s2/tasks/cpsco2019_s2_e
https://atcoder.jp/contests/cpsco2019-s2/tasks/cpsco2019_s2_f
https://atcoder.jp/contests/cpsco2019-s2/tasks/cpsco2019_s2_g
https://atcoder.jp/contests/cpsco2019-s3/tasks/cpsco2019_s3_a
https://atcoder.jp/contests/cpsco2019-s3/tasks/cpsco2019_s3_b
https://atcoder.jp/contests/cpsco2019-s3/tasks/cpsco2019_s3_c
https://atcoder.jp/contests/cpsco2019-s3/tasks/cpsco2019_s3_d
https://atcoder.jp/contests/cpsco2019-s3/tasks/cpsco2019_s3_e
https://atcoder.jp/contests/cpsco2019-s3/tasks/cpsco2019_s3_f
https://atcoder.jp/contests/cpsco2019-s3/tasks/cpsco2019_s3_g
https://atcoder.jp/contests/cpsco2019-s4/tasks/cpsco2019_s4_a
https://atcoder.jp/contests/cpsco2019-s4/tasks/cpsco2019_s4_b
https://atcoder.jp/contests/cpsco2019-s4/tasks/cpsco2019_s4_c
https://atcoder.jp/contests/cpsco2019-s4/tasks/cpsco2019_s4_d
https://atcoder.jp/contests/cpsco2019-s4/tasks/cpsco2019_s4_e
https://atcoder.jp/contests/cpsco2019-s4/tasks/cpsco2019_s4_f
https://atcoder.jp/contests/ddcc2017-final/tasks/ddcc2017_final_a
https://atcoder.jp/contests/ddcc2017-final/tasks/ddcc2017_final_b
https://atcoder.jp/contests/ddcc2017-final/tasks/ddcc2017_final_c
https://atcoder.jp/contests/ddcc2017-final/tasks/ddcc2017_final_d
https://atcoder.jp/contests/ddcc2017-final/tasks/ddcc2017_final_e
https://atcoder.jp/contests/ddcc2017-qual/tasks/ddcc2017_qual_a
https://atcoder.jp/contests/ddcc2017-qual/tasks/ddcc2017_qual_b
https://atcoder.jp/contests/ddcc2017-qual/tasks/ddcc2017_qual_c
https://atcoder.jp/contests/ddcc2017-qual/tasks/ddcc2017_qual_d
https://atcoder.jp/contests/ddcc2019-qual/tasks/ddcc2018_qual_a
https://atcoder.jp/contests/ddcc2019-qual/tasks/ddcc2018_qual_b
https://atcoder.jp/contests/ddcc2019-qual/tasks/ddcc2018_qual_c
https://atcoder.jp/contests/ddcc2019-qual/tasks/ddcc2018_qual_d
https://atcoder.jp/contests/ddcc2019-final/tasks/ddcc2019_final_a
https://atcoder.jp/contests/ddcc2019-final/tasks/ddcc2019_final_b
https://atcoder.jp/contests/ddcc2019-final/tasks/ddcc2019_final_c
https://atcoder.jp/contests/ddcc2019-final/tasks/ddcc2019_final_d
https://atcoder.jp/contests/ddcc2019-final/tasks/ddcc2019_final_e
https://atcoder.jp/contests/ddcc2019-machine/tasks/ddcc2019_machine_a
https://atcoder.jp/contests/ddcc2019-machine/tasks/ddcc2019_machine_b
https://atcoder.jp/contests/ddcc2020-final/tasks/ddcc2020_final_a
https://atcoder.jp/contests/ddcc2020-final/tasks/ddcc2020_final_b
https://atcoder.jp/contests/ddcc2020-final/tasks/ddcc2020_final_c
https://atcoder.jp/contests/ddcc2020-final/tasks/ddcc2020_final_d
https://atcoder.jp/contests/ddcc2020-qual/tasks/ddcc2020_qual_a
输入两个名次
第1名300000元奖金
第2名200000元奖金
第3名100000元奖金
特别的如果两个名次都是第一,会获得额外400000元奖金
输入两个名次,输出总奖金额度
https://atcoder.jp/contests/ddcc2020-qual/tasks/ddcc2020_qual_b
输入一个数组,从某个位置切开,分成前后两部分
问两部分之和的差最小是多少
https://atcoder.jp/contests/ddcc2020-qual/tasks/ddcc2020_qual_c
https://atcoder.jp/contests/ddcc2020-qual/tasks/ddcc2020_qual_d
https://atcoder.jp/contests/ddcc2020-qual/tasks/ddcc2020_qual_e
https://atcoder.jp/contests/ddcc2020-qual/tasks/ddcc2020_qual_f
https://atcoder.jp/contests/ddcc2016-final/tasks/ddcc_2016_final_a
https://atcoder.jp/contests/ddcc2016-final/tasks/ddcc_2016_final_b
https://atcoder.jp/contests/ddcc2016-final/tasks/ddcc_2016_final_c
https://atcoder.jp/contests/ddcc2016-final/tasks/ddcc_2016_final_d
https://atcoder.jp/contests/ddcc2016-final/tasks/ddcc_2016_final_e
https://atcoder.jp/contests/ddcc2016-qual/tasks/ddcc_2016_qual_a
https://atcoder.jp/contests/ddcc2016-qual/tasks/ddcc_2016_qual_b
https://atcoder.jp/contests/ddcc2016-qual/tasks/ddcc_2016_qual_c
https://atcoder.jp/contests/ddcc2016-qual/tasks/ddcc_2016_qual_d
https://atcoder.jp/contests/atc001/tasks/dfs_a
https://atcoder.jp/contests/digitalarts2012/tasks/digitalarts_1
https://atcoder.jp/contests/digitalarts2012/tasks/digitalarts_2
https://atcoder.jp/contests/digitalarts2012/tasks/digitalarts_3
https://atcoder.jp/contests/discovery2016-final/tasks/discovery_2016_final_a
https://atcoder.jp/contests/discovery2016-final/tasks/discovery_2016_final_b
https://atcoder.jp/contests/discovery2016-final/tasks/discovery_2016_final_c
https://atcoder.jp/contests/discovery2016-final/tasks/discovery_2016_final_d
https://atcoder.jp/contests/discovery2016-final/tasks/discovery_2016_final_e
https://atcoder.jp/contests/discovery2016-qual/tasks/discovery_2016_qual_a
https://atcoder.jp/contests/discovery2016-qual/tasks/discovery_2016_qual_b
https://atcoder.jp/contests/discovery2016-qual/tasks/discovery_2016_qual_c
https://atcoder.jp/contests/discovery2016-qual/tasks/discovery_2016_qual_d
https://atcoder.jp/contests/diverta2019-2/tasks/diverta2019_2_a
N个球分给K个人,问拿到球最多的和最少的能差多少个球?
N个球分给K个人,每人至少一个球,问拿球最多的减去拿球最少的差值,最大是多少?
https://atcoder.jp/contests/diverta2019-2/tasks/diverta2019_2_b
https://atcoder.jp/contests/diverta2019-2/tasks/diverta2019_2_c
https://atcoder.jp/contests/diverta2019-2/tasks/diverta2019_2_d
https://atcoder.jp/contests/diverta2019-2/tasks/diverta2019_2_e
https://atcoder.jp/contests/diverta2019-2/tasks/diverta2019_2_f
https://atcoder.jp/contests/diverta2019/tasks/diverta2019_a
问从1到N中连续选K个数字有多少种方案?
输入N和K,从1到N中选K个连续的数字,问有多少种选法?
https://atcoder.jp/contests/diverta2019/tasks/diverta2019_b
https://atcoder.jp/contests/diverta2019/tasks/diverta2019_c
https://atcoder.jp/contests/diverta2019/tasks/diverta2019_d
https://atcoder.jp/contests/diverta2019/tasks/diverta2019_e
https://atcoder.jp/contests/diverta2019/tasks/diverta2019_f
https://atcoder.jp/contests/donuts-2015/tasks/donuts_2015_1
https://atcoder.jp/contests/donuts-2015/tasks/donuts_2015_2
https://atcoder.jp/contests/donuts-2015/tasks/donuts_2015_3
https://atcoder.jp/contests/donuts-2015/tasks/donuts_2015_4
https://atcoder.jp/contests/donuts-live2014/tasks/donuts_live2014_1
https://atcoder.jp/contests/donuts-live2014/tasks/donuts_live2014_2
https://atcoder.jp/contests/donuts-live2014/tasks/donuts_live2014_3
https://atcoder.jp/contests/donuts-live2014/tasks/donuts_live2014_4
https://atcoder.jp/contests/donuts-live2014/tasks/donuts_live2014_5
https://atcoder.jp/contests/dp/tasks/dp_a
https://atcoder.jp/contests/dp/tasks/dp_b
https://atcoder.jp/contests/dp/tasks/dp_c
https://atcoder.jp/contests/dp/tasks/dp_d
https://atcoder.jp/contests/dp/tasks/dp_e
https://atcoder.jp/contests/dp/tasks/dp_f
https://atcoder.jp/contests/dp/tasks/dp_g
https://atcoder.jp/contests/dp/tasks/dp_h
https://atcoder.jp/contests/dp/tasks/dp_i
https://atcoder.jp/contests/dp/tasks/dp_j
https://atcoder.jp/contests/dp/tasks/dp_k
https://atcoder.jp/contests/dp/tasks/dp_l
https://atcoder.jp/contests/dp/tasks/dp_m
https://atcoder.jp/contests/dp/tasks/dp_n
https://atcoder.jp/contests/dp/tasks/dp_o
https://atcoder.jp/contests/dp/tasks/dp_p
https://atcoder.jp/contests/dp/tasks/dp_q
https://atcoder.jp/contests/dp/tasks/dp_r
https://atcoder.jp/contests/dp/tasks/dp_s
https://atcoder.jp/contests/dp/tasks/dp_t
https://atcoder.jp/contests/dp/tasks/dp_u
https://atcoder.jp/contests/dp/tasks/dp_v
https://atcoder.jp/contests/dp/tasks/dp_w
https://atcoder.jp/contests/dp/tasks/dp_x
https://atcoder.jp/contests/dp/tasks/dp_y
https://atcoder.jp/contests/dp/tasks/dp_z
https://atcoder.jp/contests/dwacon2018-final-open/tasks/dwacon2018_final_a
https://atcoder.jp/contests/dwacon2018-final-open/tasks/dwacon2018_final_b
https://atcoder.jp/contests/dwacon2018-final-open/tasks/dwacon2018_final_c
https://atcoder.jp/contests/dwacon2018-final-open/tasks/dwacon2018_final_d
https://atcoder.jp/contests/dwacon2018-prelims/tasks/dwacon2018_prelims_a
https://atcoder.jp/contests/dwacon2018-prelims/tasks/dwacon2018_prelims_b
https://atcoder.jp/contests/dwacon2018-prelims/tasks/dwacon2018_prelims_c
https://atcoder.jp/contests/dwacon2018-prelims/tasks/dwacon2018_prelims_d
https://atcoder.jp/contests/dwacon2018-prelims/tasks/dwacon2018_prelims_e
https://atcoder.jp/contests/dwacon5th-final-open/tasks/dwacon5th_final_a
https://atcoder.jp/contests/dwacon5th-final-open/tasks/dwacon5th_final_b
https://atcoder.jp/contests/dwacon5th-final-open/tasks/dwacon5th_final_c
https://atcoder.jp/contests/dwacon5th-final-open/tasks/dwacon5th_final_d
https://atcoder.jp/contests/dwacon5th-prelims/tasks/dwacon5th_prelims_a
输入n个数字,输出最接近平均数的数字的下标,下标从0开始,如果有多个最接近的,输出最小的下标
https://atcoder.jp/contests/dwacon5th-prelims/tasks/dwacon5th_prelims_b
https://atcoder.jp/contests/dwacon5th-prelims/tasks/dwacon5th_prelims_c
https://atcoder.jp/contests/dwacon5th-prelims/tasks/dwacon5th_prelims_d
https://atcoder.jp/contests/dwacon5th-prelims/tasks/dwacon5th_prelims_e
https://atcoder.jp/contests/dwacon6th-final-open/tasks/dwacon6th_final_a
https://atcoder.jp/contests/dwacon6th-final-open/tasks/dwacon6th_final_b
https://atcoder.jp/contests/dwacon6th-final-open/tasks/dwacon6th_final_c
https://atcoder.jp/contests/dwacon6th-final-open/tasks/dwacon6th_final_d
https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_a
输入N首歌和时间,第i首歌名字Si,时间Ti
问歌曲X之后(不包括X)所有歌的时间之和是多少
https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_b
https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_c
https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_d
https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_e
https://atcoder.jp/contests/dwango2015-honsen/tasks/dwango2015_finals_1
https://atcoder.jp/contests/dwango2015-honsen/tasks/dwango2015_finals_2
https://atcoder.jp/contests/dwango2015-honsen/tasks/dwango2015_finals_3
https://atcoder.jp/contests/dwango2015-honsen/tasks/dwango2015_finals_4
https://atcoder.jp/contests/dwango2015-prelims/tasks/dwango2015_prelims_1
https://atcoder.jp/contests/dwango2015-prelims/tasks/dwango2015_prelims_2
https://atcoder.jp/contests/dwango2015-prelims/tasks/dwango2015_prelims_3
https://atcoder.jp/contests/dwango2015-prelims/tasks/dwango2015_prelims_4
https://atcoder.jp/contests/dwango2015-prelims/tasks/dwango2015_prelims_5
https://atcoder.jp/contests/dwango2016-honsen/tasks/dwango2016final_a
https://atcoder.jp/contests/dwango2016-honsen/tasks/dwango2016final_b
https://atcoder.jp/contests/dwango2016-honsen/tasks/dwango2016final_c
https://atcoder.jp/contests/dwango2016-honsen/tasks/dwango2016final_d
https://atcoder.jp/contests/dwango2016-prelims/tasks/dwango2016qual_a
https://atcoder.jp/contests/dwango2016-prelims/tasks/dwango2016qual_b
https://atcoder.jp/contests/dwango2016-prelims/tasks/dwango2016qual_c
https://atcoder.jp/contests/dwango2016-prelims/tasks/dwango2016qual_d
https://atcoder.jp/contests/dwango2016-prelims/tasks/dwango2016qual_e
https://atcoder.jp/contests/dwacon2017-honsen/tasks/dwango2017final_a
https://atcoder.jp/contests/dwacon2017-honsen/tasks/dwango2017final_b
https://atcoder.jp/contests/dwacon2017-honsen/tasks/dwango2017final_c
https://atcoder.jp/contests/dwacon2017-honsen/tasks/dwango2017final_d
https://atcoder.jp/contests/dwacon2017-prelims/tasks/dwango2017qual_a
https://atcoder.jp/contests/dwacon2017-prelims/tasks/dwango2017qual_b
https://atcoder.jp/contests/dwacon2017-prelims/tasks/dwango2017qual_c
https://atcoder.jp/contests/dwacon2017-prelims/tasks/dwango2017qual_d
https://atcoder.jp/contests/dwacon2017-prelims/tasks/dwango2017qual_e
https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_a
输入三条边的长度,问是不是等边三角形
https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_a
输入三角形的三条边,如果是等边三角形,输出Yes,否则输出No
https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_b
输入一个字符串,问是不是R比B多,输出Yes或No
输入一个字符串,问R的个数是否大于B的个数,输出Yes或No
https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_c
https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_d
https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_e
https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_f
https://atcoder.jp/contests/atc001/tasks/fft_c
https://atcoder.jp/contests/fuka5/tasks/fuka_bintree
https://atcoder.jp/contests/fuka5/tasks/fuka_credit
https://atcoder.jp/contests/fuka5/tasks/fuka_graphcut
https://atcoder.jp/contests/fuka5/tasks/fuka_insider
https://atcoder.jp/contests/fuka5/tasks/fuka_iru
https://atcoder.jp/contests/fuka5/tasks/fuka_liquid
https://atcoder.jp/contests/fuka5/tasks/fuka_sugoroku
https://atcoder.jp/contests/future-meets-you-contest-2018-open/tasks/future2018career_a
https://atcoder.jp/contests/future-contest-2018-final/tasks/future_contest_2018_final_a
https://atcoder.jp/contests/future-contest-2018-qual/tasks/future_contest_2018_qual_a
https://atcoder.jp/contests/future-contest-2019-final/tasks/future_contest_2019_final_a
https://atcoder.jp/contests/future-contest-2019-qual/tasks/future_contest_2019_qual_a
https://atcoder.jp/contests/future-contest-2020-final-2/tasks/future_contest_2020_final_2_a
https://atcoder.jp/contests/future-contest-2020-final/tasks/future_contest_2020_final_a
https://atcoder.jp/contests/future-contest-2020-qual/tasks/future_contest_2020_qual_a
https://atcoder.jp/contests/future-contest-2021-final-open/tasks/future_contest_2021_final_a
https://atcoder.jp/contests/future-contest-2021-qual/tasks/future_contest_2021_qual_a
https://atcoder.jp/contests/future-contest-2022-final-open/tasks/future_contest_2022_final_a
https://atcoder.jp/contests/future-contest-2022-qual/tasks/future_contest_2022_qual_a
https://atcoder.jp/contests/future-fif-digital-days/tasks/future_fif_digital_days_a
https://atcoder.jp/contests/future-fif-digital-days/tasks/future_fif_digital_days_b
https://atcoder.jp/contests/future-fif-digital-days/tasks/future_fif_digital_days_c
https://atcoder.jp/contests/future-fif-digital-days-open/tasks/future_fif_digital_days_open_a
https://atcoder.jp/contests/future-fif-digital-days-open/tasks/future_fif_digital_days_open_b
https://atcoder.jp/contests/future-fif-digital-days-open/tasks/future_fif_digital_days_open_c
https://atcoder.jp/contests/genocon2021/tasks/genocon2021_a
https://atcoder.jp/contests/genocon2021/tasks/genocon2021_b
https://atcoder.jp/contests/genocon2021/tasks/genocon2021_c
https://atcoder.jp/contests/genocon2021/tasks/genocon2021_d
https://atcoder.jp/contests/geocon2013/tasks/geocon2013_a
https://atcoder.jp/contests/geocon2013/tasks/geocon2013_b
https://atcoder.jp/contests/geocon2013/tasks/geocon2013_c
https://atcoder.jp/contests/geocon2013/tasks/geocon2013_d
https://atcoder.jp/contests/gigacode-2019/tasks/gigacode_2019_a
https://atcoder.jp/contests/gigacode-2019/tasks/gigacode_2019_b
https://atcoder.jp/contests/gigacode-2019/tasks/gigacode_2019_c
https://atcoder.jp/contests/gigacode-2019/tasks/gigacode_2019_d
https://atcoder.jp/contests/gigacode-2019/tasks/gigacode_2019_e
https://atcoder.jp/contests/gigacode-2019/tasks/gigacode_2019_f
https://atcoder.jp/contests/gigacode-2019/tasks/gigacode_2019_g
https://atcoder.jp/contests/gigacode-2019/tasks/gigacode_2019_h
https://atcoder.jp/contests/gwcontest2015/tasks/gw2015_a
https://atcoder.jp/contests/gwcontest2015/tasks/gw2015_b
https://atcoder.jp/contests/gwcontest2015/tasks/gw2015_c
https://atcoder.jp/contests/gwcontest2015/tasks/gw2015_d
https://atcoder.jp/contests/gwcontest2015/tasks/gw2015_e
https://atcoder.jp/contests/gwcontest2015/tasks/gw2015_f
https://atcoder.jp/contests/gwcontest2015/tasks/gw2015_g
https://atcoder.jp/contests/gwcontest2015/tasks/gw2015_h
https://atcoder.jp/contests/gwcontest2015/tasks/gw2015_i
https://atcoder.jp/contests/gwcontest2015/tasks/gw2015_j
https://atcoder.jp/contests/hbpc2012/tasks/hbpc_1
https://atcoder.jp/contests/hbpc2012/tasks/hbpc_2
https://atcoder.jp/contests/hbpc2012/tasks/hbpc_3
https://atcoder.jp/contests/hbpc2012/tasks/hbpc_4
https://atcoder.jp/contests/hhkb2020/tasks/hhkb2020_a
输入Y或N,和a,b,c字母之一,如果是Y,输出大写,否则原封不动输出
https://atcoder.jp/contests/hhkb2020/tasks/hhkb2020_b
输入H行W列的字符数组,问有多少对上下或左右相邻的.
https://atcoder.jp/contests/hhkb2020/tasks/hhkb2020_c
输入N个数字,对于每个前缀回答,最小的没有出现过的非负整数是什么?
https://atcoder.jp/contests/hhkb2020/tasks/hhkb2020_d
https://atcoder.jp/contests/hhkb2020/tasks/hhkb2020_e
https://atcoder.jp/contests/hhkb2020/tasks/hhkb2020_f
https://atcoder.jp/contests/hokudai-hitachi2017-1/tasks/hitachi2017_1_a
https://atcoder.jp/contests/hokudai-hitachi2017-2/tasks/hitachi2017_2_a
https://atcoder.jp/contests/hitachi2020/tasks/hitachi2020_a
输入一个字符串问是不是由hi重复若干次得到?
https://atcoder.jp/contests/hitachi2020/tasks/hitachi2020_b
输入A种冰箱和B种微波炉的价格
输入M个优惠券吗,每个优惠券包含3个数字x y c
如果同时购买第x个冰箱和第y个微波炉,可以优惠c元
同时只能使用一张优惠券
目标买一个冰箱一个微波炉问最少多少钱?
https://atcoder.jp/contests/hitachi2020/tasks/hitachi2020_c
https://atcoder.jp/contests/hitachi2020/tasks/hitachi2020_d
https://atcoder.jp/contests/hitachi2020/tasks/hitachi2020_e
https://atcoder.jp/contests/hitachi2020/tasks/hitachi2020_f
https://atcoder.jp/contests/hokudai-hitachi2018/tasks/hokudai_hitachi2018_a
https://atcoder.jp/contests/hokudai-hitachi2018/tasks/hokudai_hitachi2018_b
https://atcoder.jp/contests/hokudai-hitachi2018/tasks/hokudai_hitachi2018_c
https://atcoder.jp/contests/hokudai-hitachi2019-1/tasks/hokudai_hitachi2019_1_a
https://atcoder.jp/contests/hokudai-hitachi2019-1/tasks/hokudai_hitachi2019_1_b
https://atcoder.jp/contests/hokudai-hitachi2019-2/tasks/hokudai_hitachi2019_2_a
https://atcoder.jp/contests/hokudai-hitachi2020/tasks/hokudai_hitachi2020_a
https://atcoder.jp/contests/hokudai-hitachi2020/tasks/hokudai_hitachi2020_b
https://atcoder.jp/contests/hokudai-hitachi2021/tasks/hokudai_hitachi2021_a
https://atcoder.jp/contests/hokudai-hitachi2021/tasks/hokudai_hitachi2021_b
https://atcoder.jp/contests/jag2012autumn/tasks/icpc2012autumn_a
https://atcoder.jp/contests/jag2012autumn/tasks/icpc2012autumn_b
https://atcoder.jp/contests/jag2012autumn/tasks/icpc2012autumn_c
https://atcoder.jp/contests/jag2012autumn/tasks/icpc2012autumn_d
https://atcoder.jp/contests/jag2012autumn/tasks/icpc2012autumn_e
https://atcoder.jp/contests/jag2012autumn/tasks/icpc2012autumn_f
https://atcoder.jp/contests/jag2012autumn/tasks/icpc2012autumn_g
https://atcoder.jp/contests/jag2012autumn/tasks/icpc2012autumn_h
https://atcoder.jp/contests/jag2012autumn/tasks/icpc2012autumn_j
https://atcoder.jp/contests/jag2012autumn/tasks/icpc2012autumn_k
https://atcoder.jp/contests/jag2013autumn/tasks/icpc2013autumn_a
https://atcoder.jp/contests/jag2013autumn/tasks/icpc2013autumn_b
https://atcoder.jp/contests/jag2013autumn/tasks/icpc2013autumn_c
https://atcoder.jp/contests/jag2013autumn/tasks/icpc2013autumn_d
https://atcoder.jp/contests/jag2013autumn/tasks/icpc2013autumn_e
https://atcoder.jp/contests/jag2013autumn/tasks/icpc2013autumn_f
https://atcoder.jp/contests/jag2013autumn/tasks/icpc2013autumn_g
https://atcoder.jp/contests/jag2013autumn/tasks/icpc2013autumn_h
https://atcoder.jp/contests/jag2013autumn/tasks/icpc2013autumn_i
https://atcoder.jp/contests/jag2013autumn/tasks/icpc2013autumn_j
https://atcoder.jp/contests/JAG2013Spring/tasks/icpc2013spring_a
https://atcoder.jp/contests/JAG2013Spring/tasks/icpc2013spring_b
https://atcoder.jp/contests/JAG2013Spring/tasks/icpc2013spring_c
https://atcoder.jp/contests/JAG2013Spring/tasks/icpc2013spring_d
https://atcoder.jp/contests/JAG2013Spring/tasks/icpc2013spring_e
https://atcoder.jp/contests/JAG2013Spring/tasks/icpc2013spring_f
https://atcoder.jp/contests/JAG2013Spring/tasks/icpc2013spring_g
https://atcoder.jp/contests/JAG2013Spring/tasks/icpc2013spring_h
https://atcoder.jp/contests/JAG2013Spring/tasks/icpc2013spring_i
https://atcoder.jp/contests/JAG2013Spring/tasks/icpc2013spring_j
https://atcoder.jp/contests/jag2013summer-day2/tasks/icpc2013summer_day2_a
https://atcoder.jp/contests/jag2013summer-day2/tasks/icpc2013summer_day2_b
https://atcoder.jp/contests/jag2013summer-day2/tasks/icpc2013summer_day2_c
https://atcoder.jp/contests/jag2013summer-day2/tasks/icpc2013summer_day2_d
https://atcoder.jp/contests/jag2013summer-day2/tasks/icpc2013summer_day2_e
https://atcoder.jp/contests/jag2013summer-day2/tasks/icpc2013summer_day2_f
https://atcoder.jp/contests/jag2013summer-day2/tasks/icpc2013summer_day2_g
https://atcoder.jp/contests/jag2013summer-day3/tasks/icpc2013summer_day3_a
https://atcoder.jp/contests/jag2013summer-day3/tasks/icpc2013summer_day3_b
https://atcoder.jp/contests/jag2013summer-day3/tasks/icpc2013summer_day3_c
https://atcoder.jp/contests/jag2013summer-day3/tasks/icpc2013summer_day3_d
https://atcoder.jp/contests/jag2013summer-day3/tasks/icpc2013summer_day3_e
https://atcoder.jp/contests/jag2013summer-day3/tasks/icpc2013summer_day3_f
https://atcoder.jp/contests/jag2013summer-day3/tasks/icpc2013summer_day3_g
https://atcoder.jp/contests/jag2013summer-day3/tasks/icpc2013summer_day3_h
https://atcoder.jp/contests/jag2013summer-day3/tasks/icpc2013summer_day3_i
https://atcoder.jp/contests/jag2013summer-day3/tasks/icpc2013summer_day3_j
https://atcoder.jp/contests/jag2013summer-day3/tasks/icpc2013summer_day3_k
https://atcoder.jp/contests/jag2013summer-day3/tasks/icpc2013summer_day3_l
https://atcoder.jp/contests/jag2013summer-day4/tasks/icpc2013summer_day4_a
https://atcoder.jp/contests/jag2013summer-day4/tasks/icpc2013summer_day4_b
https://atcoder.jp/contests/jag2013summer-day4/tasks/icpc2013summer_day4_c
https://atcoder.jp/contests/jag2013summer-day4/tasks/icpc2013summer_day4_d
https://atcoder.jp/contests/jag2013summer-day4/tasks/icpc2013summer_day4_e
https://atcoder.jp/contests/jag2013summer-day4/tasks/icpc2013summer_day4_f
https://atcoder.jp/contests/jag2013summer-day4/tasks/icpc2013summer_day4_g
https://atcoder.jp/contests/jag2013summer-day4/tasks/icpc2013summer_day4_h
https://atcoder.jp/contests/jag2013summer-day4/tasks/icpc2013summer_day4_i
https://atcoder.jp/contests/jag2013summer-day4/tasks/icpc2013summer_day4_j
https://atcoder.jp/contests/jag2013summer-warmingup/tasks/icpc2013summer_warmingUp_a
https://atcoder.jp/contests/jag2013summer-warmingup/tasks/icpc2013summer_warmingUp_b
https://atcoder.jp/contests/jag2013summer-warmingup/tasks/icpc2013summer_warmingUp_c
https://atcoder.jp/contests/jag2013summer-warmingup/tasks/icpc2013summer_warmingUp_d
https://atcoder.jp/contests/jag2013summer-warmingup/tasks/icpc2013summer_warmingUp_e
https://atcoder.jp/contests/jag2013summer-warmingup/tasks/icpc2013summer_warmingUp_f
https://atcoder.jp/contests/jag2013summer-warmingup/tasks/icpc2013summer_warmingUp_g
https://atcoder.jp/contests/jag2013summer-warmingup/tasks/icpc2013summer_warmingUp_h
https://atcoder.jp/contests/jag2013summer-warmingup/tasks/icpc2013summer_warmingUp_i
https://atcoder.jp/contests/jag2013summer-warmingup/tasks/icpc2013summer_warmingUp_j
https://atcoder.jp/contests/jag2014autumn/tasks/icpc2014autumn_a
https://atcoder.jp/contests/jag2014autumn/tasks/icpc2014autumn_b
https://atcoder.jp/contests/jag2014autumn/tasks/icpc2014autumn_c
https://atcoder.jp/contests/jag2014autumn/tasks/icpc2014autumn_d
https://atcoder.jp/contests/jag2014autumn/tasks/icpc2014autumn_e
https://atcoder.jp/contests/jag2014autumn/tasks/icpc2014autumn_f
https://atcoder.jp/contests/jag2014autumn/tasks/icpc2014autumn_g
https://atcoder.jp/contests/jag2014autumn/tasks/icpc2014autumn_h
https://atcoder.jp/contests/jag2014autumn/tasks/icpc2014autumn_i
https://atcoder.jp/contests/jag2014autumn/tasks/icpc2014autumn_j
https://atcoder.jp/contests/jag2014autumn/tasks/icpc2014autumn_k
https://atcoder.jp/contests/JAG2014Spring/tasks/icpc2014spring_a
https://atcoder.jp/contests/JAG2014Spring/tasks/icpc2014spring_b
https://atcoder.jp/contests/JAG2014Spring/tasks/icpc2014spring_c
https://atcoder.jp/contests/JAG2014Spring/tasks/icpc2014spring_d
https://atcoder.jp/contests/JAG2014Spring/tasks/icpc2014spring_e
https://atcoder.jp/contests/JAG2014Spring/tasks/icpc2014spring_f
https://atcoder.jp/contests/JAG2014Spring/tasks/icpc2014spring_g
https://atcoder.jp/contests/JAG2014Spring/tasks/icpc2014spring_h
https://atcoder.jp/contests/JAG2014Spring/tasks/icpc2014spring_i
https://atcoder.jp/contests/JAG2014Spring/tasks/icpc2014spring_j
https://atcoder.jp/contests/jag2014summer-day2/tasks/icpc2014summer_day2_a
https://atcoder.jp/contests/jag2014summer-day2/tasks/icpc2014summer_day2_b
https://atcoder.jp/contests/jag2014summer-day2/tasks/icpc2014summer_day2_c
https://atcoder.jp/contests/jag2014summer-day2/tasks/icpc2014summer_day2_d
https://atcoder.jp/contests/jag2014summer-day2/tasks/icpc2014summer_day2_e
https://atcoder.jp/contests/jag2014summer-day2/tasks/icpc2014summer_day2_f
https://atcoder.jp/contests/jag2014summer-day2/tasks/icpc2014summer_day2_g
https://atcoder.jp/contests/jag2014summer-day2/tasks/icpc2014summer_day2_h
https://atcoder.jp/contests/jag2014summer-day2/tasks/icpc2014summer_day2_i
https://atcoder.jp/contests/jag2014summer-day2/tasks/icpc2014summer_day2_j
https://atcoder.jp/contests/jag2014summer-day4/tasks/icpc2014summer_day4_a
https://atcoder.jp/contests/jag2014summer-day4/tasks/icpc2014summer_day4_b
https://atcoder.jp/contests/jag2014summer-day4/tasks/icpc2014summer_day4_c
https://atcoder.jp/contests/jag2014summer-day4/tasks/icpc2014summer_day4_d
https://atcoder.jp/contests/jag2014summer-day4/tasks/icpc2014summer_day4_e
https://atcoder.jp/contests/jag2014summer-day4/tasks/icpc2014summer_day4_f
https://atcoder.jp/contests/jag2014summer-day4/tasks/icpc2014summer_day4_g
https://atcoder.jp/contests/jag2014summer-day4/tasks/icpc2014summer_day4_h
https://atcoder.jp/contests/jag2014summer-day4/tasks/icpc2014summer_day4_i
https://atcoder.jp/contests/jag2014summer-day4/tasks/icpc2014summer_day4_j
https://atcoder.jp/contests/jag2015autumn/tasks/icpc2015autumn_a
https://atcoder.jp/contests/jag2015autumn/tasks/icpc2015autumn_b
https://atcoder.jp/contests/jag2015autumn/tasks/icpc2015autumn_c
https://atcoder.jp/contests/jag2015autumn/tasks/icpc2015autumn_d
https://atcoder.jp/contests/jag2015autumn/tasks/icpc2015autumn_e
https://atcoder.jp/contests/jag2015autumn/tasks/icpc2015autumn_f
https://atcoder.jp/contests/jag2015autumn/tasks/icpc2015autumn_g
https://atcoder.jp/contests/jag2015autumn/tasks/icpc2015autumn_h
https://atcoder.jp/contests/jag2015autumn/tasks/icpc2015autumn_i
https://atcoder.jp/contests/jag2015autumn/tasks/icpc2015autumn_j
https://atcoder.jp/contests/jag2015autumn/tasks/icpc2015autumn_k
https://atcoder.jp/contests/jag2015spring/tasks/icpc2015spring_a
https://atcoder.jp/contests/jag2015spring/tasks/icpc2015spring_b
https://atcoder.jp/contests/jag2015spring/tasks/icpc2015spring_c
https://atcoder.jp/contests/jag2015spring/tasks/icpc2015spring_d
https://atcoder.jp/contests/jag2015spring/tasks/icpc2015spring_e
https://atcoder.jp/contests/jag2015spring/tasks/icpc2015spring_f
https://atcoder.jp/contests/jag2015spring/tasks/icpc2015spring_g
https://atcoder.jp/contests/jag2015spring/tasks/icpc2015spring_h
https://atcoder.jp/contests/jag2015spring/tasks/icpc2015spring_i
https://atcoder.jp/contests/jag2015spring/tasks/icpc2015spring_j
https://atcoder.jp/contests/jag2015spring/tasks/icpc2015spring_k
https://atcoder.jp/contests/jag2015spring/tasks/icpc2015spring_l
https://atcoder.jp/contests/jag2015summer-day2/tasks/icpc2015summer_day2_a
https://atcoder.jp/contests/jag2015summer-day2/tasks/icpc2015summer_day2_b
https://atcoder.jp/contests/jag2015summer-day2/tasks/icpc2015summer_day2_c
https://atcoder.jp/contests/jag2015summer-day2/tasks/icpc2015summer_day2_d
https://atcoder.jp/contests/jag2015summer-day2/tasks/icpc2015summer_day2_e
https://atcoder.jp/contests/jag2015summer-day2/tasks/icpc2015summer_day2_f
https://atcoder.jp/contests/jag2015summer-day2/tasks/icpc2015summer_day2_g
https://atcoder.jp/contests/jag2015summer-day2/tasks/icpc2015summer_day2_h
https://atcoder.jp/contests/jag2015summer-day2/tasks/icpc2015summer_day2_i
https://atcoder.jp/contests/jag2015summer-day2/tasks/icpc2015summer_day2_j
https://atcoder.jp/contests/jag2015summer-day2/tasks/icpc2015summer_day2_k
https://atcoder.jp/contests/jag2015summer-day3/tasks/icpc2015summer_day3_a
https://atcoder.jp/contests/jag2015summer-day3/tasks/icpc2015summer_day3_b
https://atcoder.jp/contests/jag2015summer-day3/tasks/icpc2015summer_day3_c
https://atcoder.jp/contests/jag2015summer-day3/tasks/icpc2015summer_day3_d
https://atcoder.jp/contests/jag2015summer-day3/tasks/icpc2015summer_day3_e
https://atcoder.jp/contests/jag2015summer-day3/tasks/icpc2015summer_day3_f
https://atcoder.jp/contests/jag2015summer-day3/tasks/icpc2015summer_day3_g
https://atcoder.jp/contests/jag2015summer-day3/tasks/icpc2015summer_day3_h
https://atcoder.jp/contests/jag2015summer-day3/tasks/icpc2015summer_day3_i
https://atcoder.jp/contests/jag2015summer-day3/tasks/icpc2015summer_day3_j
https://atcoder.jp/contests/jag2015summer-day4/tasks/icpc2015summer_day4_a
https://atcoder.jp/contests/jag2015summer-day4/tasks/icpc2015summer_day4_b
https://atcoder.jp/contests/jag2015summer-day4/tasks/icpc2015summer_day4_c
https://atcoder.jp/contests/jag2015summer-day4/tasks/icpc2015summer_day4_d
https://atcoder.jp/contests/jag2015summer-day4/tasks/icpc2015summer_day4_e
https://atcoder.jp/contests/jag2015summer-day4/tasks/icpc2015summer_day4_f
https://atcoder.jp/contests/jag2015summer-day4/tasks/icpc2015summer_day4_g
https://atcoder.jp/contests/jag2015summer-day4/tasks/icpc2015summer_day4_h
https://atcoder.jp/contests/jag2015summer-day4/tasks/icpc2015summer_day4_i
https://atcoder.jp/contests/jag2015summer-day4/tasks/icpc2015summer_day4_j
https://atcoder.jp/contests/jag2016autumn/tasks/icpc2016autumn_a
https://atcoder.jp/contests/jag2016autumn/tasks/icpc2016autumn_b
https://atcoder.jp/contests/jag2016autumn/tasks/icpc2016autumn_c
https://atcoder.jp/contests/jag2016autumn/tasks/icpc2016autumn_d
https://atcoder.jp/contests/jag2016autumn/tasks/icpc2016autumn_e
https://atcoder.jp/contests/jag2016autumn/tasks/icpc2016autumn_f
https://atcoder.jp/contests/jag2016autumn/tasks/icpc2016autumn_g
https://atcoder.jp/contests/jag2016autumn/tasks/icpc2016autumn_h
https://atcoder.jp/contests/jag2016autumn/tasks/icpc2016autumn_i
https://atcoder.jp/contests/jag2016autumn/tasks/icpc2016autumn_j
https://atcoder.jp/contests/jag2016autumn/tasks/icpc2016autumn_k
https://atcoder.jp/contests/ijpc2015/tasks/ijpc2015_a
https://atcoder.jp/contests/ijpc2015-2/tasks/ijpc2015_b
https://atcoder.jp/contests/ijpc2015/tasks/ijpc2015_c
https://atcoder.jp/contests/ijpc2015/tasks/ijpc2015_d
https://atcoder.jp/contests/ijpc2015-2/tasks/ijpc2015_e
https://atcoder.jp/contests/ijpc2015-2/tasks/ijpc2015_f
https://atcoder.jp/contests/ijpc2015/tasks/ijpc2015_g
https://atcoder.jp/contests/ijpc2015-2/tasks/ijpc2015_h
https://atcoder.jp/contests/ijpc2015-2/tasks/ijpc2015_i
https://atcoder.jp/contests/ijpc2015/tasks/ijpc2015_j
https://atcoder.jp/contests/ijpc2012-1/tasks/ijpc_animals
https://atcoder.jp/contests/ijpc2012-3/tasks/ijpc_animals2
https://atcoder.jp/contests/ijpc2012-3/tasks/ijpc_ghost
https://atcoder.jp/contests/ijpc2012-3/tasks/ijpc_honest
https://atcoder.jp/contests/ijpc2012pr/tasks/ijpc_ijpc
https://atcoder.jp/contests/ijpc2012-2/tasks/ijpc_imo
https://atcoder.jp/contests/ijpc2012-2/tasks/ijpc_maze
https://atcoder.jp/contests/ijpc2012-2/tasks/ijpc_porter
https://atcoder.jp/contests/ijpc2012pr/tasks/ijpc_primehazard
https://atcoder.jp/contests/ijpc2012-1/tasks/ijpc_silver
https://atcoder.jp/contests/ijpc2012pr/tasks/ijpc_submission
https://atcoder.jp/contests/ijpc2012-1/tasks/ijpc_training
https://atcoder.jp/contests/ijpc2012pr/tasks/ijpc_variance
https://atcoder.jp/contests/indeednow-finala-open/tasks/indeednow_2015_finala_a
https://atcoder.jp/contests/indeednow-finala-open/tasks/indeednow_2015_finala_b
https://atcoder.jp/contests/indeednow-finala-open/tasks/indeednow_2015_finala_c
https://atcoder.jp/contests/indeednow-finala-open/tasks/indeednow_2015_finala_d
https://atcoder.jp/contests/indeednow-finala-open/tasks/indeednow_2015_finala_e
https://atcoder.jp/contests/indeednow-finala-open/tasks/indeednow_2015_finala_f
https://atcoder.jp/contests/indeednow-finalb-open/tasks/indeednow_2015_finalb_a
https://atcoder.jp/contests/indeednow-finalb-open/tasks/indeednow_2015_finalb_b
https://atcoder.jp/contests/indeednow-finalb-open/tasks/indeednow_2015_finalb_c
https://atcoder.jp/contests/indeednow-finalb-open/tasks/indeednow_2015_finalb_d
https://atcoder.jp/contests/indeednow-finalb-open/tasks/indeednow_2015_finalb_e
https://atcoder.jp/contests/indeednow-quala/tasks/indeednow_2015_quala_1
https://atcoder.jp/contests/indeednow-quala/tasks/indeednow_2015_quala_2
https://atcoder.jp/contests/indeednow-quala/tasks/indeednow_2015_quala_3
https://atcoder.jp/contests/indeednow-quala/tasks/indeednow_2015_quala_4
https://atcoder.jp/contests/indeednow-qualb/tasks/indeednow_2015_qualb_1
https://atcoder.jp/contests/indeednow-qualb/tasks/indeednow_2015_qualb_2
https://atcoder.jp/contests/indeednow-qualb/tasks/indeednow_2015_qualb_4
https://atcoder.jp/contests/indeednow-qualb/tasks/indeednow_2015_qualc_3
https://atcoder.jp/contests/intro-heuristics/tasks/intro_heuristics_a
https://atcoder.jp/contests/intro-heuristics/tasks/intro_heuristics_b
https://atcoder.jp/contests/intro-heuristics/tasks/intro_heuristics_c
https://atcoder.jp/contests/iroha2019-day1/tasks/iroha2019_day1_a
https://atcoder.jp/contests/iroha2019-day1/tasks/iroha2019_day1_b
https://atcoder.jp/contests/iroha2019-day1/tasks/iroha2019_day1_c
https://atcoder.jp/contests/iroha2019-day1/tasks/iroha2019_day1_d
https://atcoder.jp/contests/iroha2019-day1/tasks/iroha2019_day1_e
https://atcoder.jp/contests/iroha2019-day1/tasks/iroha2019_day1_f
https://atcoder.jp/contests/iroha2019-day1/tasks/iroha2019_day1_g
https://atcoder.jp/contests/iroha2019-day1/tasks/iroha2019_day1_h
https://atcoder.jp/contests/iroha2019-day1/tasks/iroha2019_day1_i
https://atcoder.jp/contests/iroha2019-day1/tasks/iroha2019_day1_j
https://atcoder.jp/contests/iroha2019-day1/tasks/iroha2019_day1_k
https://atcoder.jp/contests/iroha2019-day1/tasks/iroha2019_day1_l
https://atcoder.jp/contests/iroha2019-day2/tasks/iroha2019_day2_a
https://atcoder.jp/contests/iroha2019-day2/tasks/iroha2019_day2_b
https://atcoder.jp/contests/iroha2019-day2/tasks/iroha2019_day2_c
https://atcoder.jp/contests/iroha2019-day2/tasks/iroha2019_day2_d
https://atcoder.jp/contests/iroha2019-day2/tasks/iroha2019_day2_e
https://atcoder.jp/contests/iroha2019-day2/tasks/iroha2019_day2_f
https://atcoder.jp/contests/iroha2019-day2/tasks/iroha2019_day2_g
https://atcoder.jp/contests/iroha2019-day2/tasks/iroha2019_day2_h
https://atcoder.jp/contests/iroha2019-day2/tasks/iroha2019_day2_i
https://atcoder.jp/contests/iroha2019-day2/tasks/iroha2019_day2_j
https://atcoder.jp/contests/iroha2019-day2/tasks/iroha2019_day2_k
https://atcoder.jp/contests/iroha2019-day3/tasks/iroha2019_day3_a
https://atcoder.jp/contests/iroha2019-day3/tasks/iroha2019_day3_b
https://atcoder.jp/contests/iroha2019-day3/tasks/iroha2019_day3_c
https://atcoder.jp/contests/iroha2019-day3/tasks/iroha2019_day3_d
https://atcoder.jp/contests/iroha2019-day3/tasks/iroha2019_day3_e
https://atcoder.jp/contests/iroha2019-day3/tasks/iroha2019_day3_f
https://atcoder.jp/contests/iroha2019-day3/tasks/iroha2019_day3_g
https://atcoder.jp/contests/iroha2019-day3/tasks/iroha2019_day3_h
https://atcoder.jp/contests/iroha2019-day3/tasks/iroha2019_day3_i
https://atcoder.jp/contests/iroha2019-day3/tasks/iroha2019_day3_j
https://atcoder.jp/contests/iroha2019-day3/tasks/iroha2019_day3_k
https://atcoder.jp/contests/iroha2019-day3/tasks/iroha2019_day3_l
https://atcoder.jp/contests/iroha2019-day4/tasks/iroha2019_day4_a
https://atcoder.jp/contests/iroha2019-day4/tasks/iroha2019_day4_b
https://atcoder.jp/contests/iroha2019-day4/tasks/iroha2019_day4_c
https://atcoder.jp/contests/iroha2019-day4/tasks/iroha2019_day4_d
https://atcoder.jp/contests/iroha2019-day4/tasks/iroha2019_day4_e
https://atcoder.jp/contests/iroha2019-day4/tasks/iroha2019_day4_f
https://atcoder.jp/contests/iroha2019-day4/tasks/iroha2019_day4_g
https://atcoder.jp/contests/iroha2019-day4/tasks/iroha2019_day4_h
https://atcoder.jp/contests/iroha2019-day4/tasks/iroha2019_day4_i
https://atcoder.jp/contests/iroha2019-day4/tasks/iroha2019_day4_j
https://atcoder.jp/contests/iroha2019-day4/tasks/iroha2019_day4_k
https://atcoder.jp/contests/iroha2019-day4/tasks/iroha2019_day4_l
https://atcoder.jp/contests/jag2016-domestic/tasks/jag2016secretspring_a
https://atcoder.jp/contests/jag2016-domestic/tasks/jag2016secretspring_b
https://atcoder.jp/contests/jag2016-domestic/tasks/jag2016secretspring_c
https://atcoder.jp/contests/jag2016-domestic/tasks/jag2016secretspring_d
https://atcoder.jp/contests/jag2016-domestic/tasks/jag2016secretspring_e
https://atcoder.jp/contests/jag2016-domestic/tasks/jag2016secretspring_f
https://atcoder.jp/contests/jag2016-domestic/tasks/jag2016secretspring_g
https://atcoder.jp/contests/jag2017autumn/tasks/jag2017autumn_a
https://atcoder.jp/contests/jag2017autumn/tasks/jag2017autumn_b
https://atcoder.jp/contests/jag2017autumn/tasks/jag2017autumn_c
https://atcoder.jp/contests/jag2017autumn/tasks/jag2017autumn_d
https://atcoder.jp/contests/jag2017autumn/tasks/jag2017autumn_e
https://atcoder.jp/contests/jag2017autumn/tasks/jag2017autumn_f
https://atcoder.jp/contests/jag2017autumn/tasks/jag2017autumn_g
https://atcoder.jp/contests/jag2017autumn/tasks/jag2017autumn_h
https://atcoder.jp/contests/jag2017autumn/tasks/jag2017autumn_i
https://atcoder.jp/contests/jag2017autumn/tasks/jag2017autumn_j
https://atcoder.jp/contests/jag2017autumn/tasks/jag2017autumn_k
https://atcoder.jp/contests/jag2017summer-day1/tasks/jag2017summer_day1_a
https://atcoder.jp/contests/jag2017summer-day1/tasks/jag2017summer_day1_b
https://atcoder.jp/contests/jag2017summer-day1/tasks/jag2017summer_day1_c
https://atcoder.jp/contests/jag2017summer-day1/tasks/jag2017summer_day1_d
https://atcoder.jp/contests/jag2017summer-day1/tasks/jag2017summer_day1_e
https://atcoder.jp/contests/jag2017summer-day1/tasks/jag2017summer_day1_f
https://atcoder.jp/contests/jag2017summer-day1/tasks/jag2017summer_day1_g
https://atcoder.jp/contests/jag2017summer-day1/tasks/jag2017summer_day1_h
https://atcoder.jp/contests/jag2017summer-day1/tasks/jag2017summer_day1_i
https://atcoder.jp/contests/jag2017summer-day1/tasks/jag2017summer_day1_j
https://atcoder.jp/contests/jag2017summer-day1/tasks/jag2017summer_day1_k
https://atcoder.jp/contests/jag2017summer-day3/tasks/jag2017summer_day3_a
https://atcoder.jp/contests/jag2017summer-day3/tasks/jag2017summer_day3_b
https://atcoder.jp/contests/jag2017summer-day3/tasks/jag2017summer_day3_c
https://atcoder.jp/contests/jag2017summer-day3/tasks/jag2017summer_day3_d
https://atcoder.jp/contests/jag2017summer-day3/tasks/jag2017summer_day3_e
https://atcoder.jp/contests/jag2017summer-day3/tasks/jag2017summer_day3_f
https://atcoder.jp/contests/jag2017summer-day3/tasks/jag2017summer_day3_g
https://atcoder.jp/contests/jag2017summer-day3/tasks/jag2017summer_day3_h
https://atcoder.jp/contests/jag2017summer-day3/tasks/jag2017summer_day3_i
https://atcoder.jp/contests/jag2017summer-day3/tasks/jag2017summer_day3_j
https://atcoder.jp/contests/jag2017summer-day3/tasks/jag2017summer_day3_k
https://atcoder.jp/contests/jag2018summer-day2/tasks/jag2018summer_day2_a
https://atcoder.jp/contests/jag2018summer-day2/tasks/jag2018summer_day2_b
https://atcoder.jp/contests/jag2018summer-day2/tasks/jag2018summer_day2_c
https://atcoder.jp/contests/jag2018summer-day2/tasks/jag2018summer_day2_d
https://atcoder.jp/contests/jag2018summer-day2/tasks/jag2018summer_day2_e
https://atcoder.jp/contests/jag2018summer-day2/tasks/jag2018summer_day2_f
https://atcoder.jp/contests/jag2018summer-day2/tasks/jag2018summer_day2_g
https://atcoder.jp/contests/jag2018summer-day2/tasks/jag2018summer_day2_h
https://atcoder.jp/contests/jag2018summer-day2/tasks/jag2018summer_day2_i
https://atcoder.jp/contests/jag2018summer-day2/tasks/jag2018summer_day2_j
https://atcoder.jp/contests/jag2018summer-day2/tasks/jag2018summer_day2_k
https://atcoder.jp/contests/joi2006ho/tasks/joi2006ho_a
https://atcoder.jp/contests/joi2006ho/tasks/joi2006ho_b
https://atcoder.jp/contests/joi2006ho/tasks/joi2006ho_c
https://atcoder.jp/contests/joi2006ho/tasks/joi2006ho_d
https://atcoder.jp/contests/joi2006ho/tasks/joi2006ho_e
https://atcoder.jp/contests/joi2006yo/tasks/joi2006yo_a
https://atcoder.jp/contests/joi2006yo/tasks/joi2006yo_b
https://atcoder.jp/contests/joi2006yo/tasks/joi2006yo_c
https://atcoder.jp/contests/joi2006yo/tasks/joi2006yo_d
https://atcoder.jp/contests/joi2006yo/tasks/joi2006yo_e
https://atcoder.jp/contests/joi2007ho/tasks/joi2007ho_a
https://atcoder.jp/contests/joi2007ho/tasks/joi2007ho_b
https://atcoder.jp/contests/joi2007ho/tasks/joi2007ho_c
https://atcoder.jp/contests/joi2007ho/tasks/joi2007ho_d
https://atcoder.jp/contests/joi2007ho/tasks/joi2007ho_e
https://atcoder.jp/contests/joi2007yo/tasks/joi2007yo_a
https://atcoder.jp/contests/joi2007yo/tasks/joi2007yo_b
https://atcoder.jp/contests/joi2007yo/tasks/joi2007yo_c
https://atcoder.jp/contests/joi2007yo/tasks/joi2007yo_d
https://atcoder.jp/contests/joi2007yo/tasks/joi2007yo_e
https://atcoder.jp/contests/joi2007yo/tasks/joi2007yo_f
https://atcoder.jp/contests/joi2008ho/tasks/joi2008ho_a
https://atcoder.jp/contests/joi2008ho/tasks/joi2008ho_b
https://atcoder.jp/contests/joi2008ho/tasks/joi2008ho_c
https://atcoder.jp/contests/joi2008ho/tasks/joi2008ho_d
https://atcoder.jp/contests/joi2008ho/tasks/joi2008ho_e
https://atcoder.jp/contests/joi2008yo/tasks/joi2008yo_a
https://atcoder.jp/contests/joi2008yo/tasks/joi2008yo_b
https://atcoder.jp/contests/joi2008yo/tasks/joi2008yo_c
https://atcoder.jp/contests/joi2008yo/tasks/joi2008yo_d
https://atcoder.jp/contests/joi2008yo/tasks/joi2008yo_e
https://atcoder.jp/contests/joi2008yo/tasks/joi2008yo_f
https://atcoder.jp/contests/joi2009ho/tasks/joi2009ho_a
https://atcoder.jp/contests/joi2009ho/tasks/joi2009ho_b
https://atcoder.jp/contests/joi2009ho/tasks/joi2009ho_c
https://atcoder.jp/contests/joi2009ho/tasks/joi2009ho_d
https://atcoder.jp/contests/joi2009ho/tasks/joi2009ho_e
https://atcoder.jp/contests/joi2009yo/tasks/joi2009yo_a
https://atcoder.jp/contests/joi2009yo/tasks/joi2009yo_b
https://atcoder.jp/contests/joi2009yo/tasks/joi2009yo_c
https://atcoder.jp/contests/joi2009yo/tasks/joi2009yo_d
https://atcoder.jp/contests/joi2009yo/tasks/joi2009yo_e
https://atcoder.jp/contests/joi2009yo/tasks/joi2009yo_f
https://atcoder.jp/contests/joi2010ho/tasks/joi2010ho_a
https://atcoder.jp/contests/joi2010ho/tasks/joi2010ho_b
https://atcoder.jp/contests/joi2010ho/tasks/joi2010ho_c
https://atcoder.jp/contests/joi2010ho/tasks/joi2010ho_d
https://atcoder.jp/contests/joi2010ho/tasks/joi2010ho_e
https://atcoder.jp/contests/joi2010yo/tasks/joi2010yo_a
https://atcoder.jp/contests/joi2010yo/tasks/joi2010yo_b
https://atcoder.jp/contests/joi2010yo/tasks/joi2010yo_c
https://atcoder.jp/contests/joi2010yo/tasks/joi2010yo_d
https://atcoder.jp/contests/joi2010yo/tasks/joi2010yo_e
https://atcoder.jp/contests/joi2010yo/tasks/joi2010yo_f
https://atcoder.jp/contests/joi2011ho/tasks/joi2011ho1
https://atcoder.jp/contests/joi2011ho/tasks/joi2011ho2
https://atcoder.jp/contests/joi2011ho/tasks/joi2011ho3
https://atcoder.jp/contests/joi2011ho/tasks/joi2011ho4
https://atcoder.jp/contests/joi2011ho/tasks/joi2011ho5
https://atcoder.jp/contests/joi2011yo/tasks/joi2011yo_a
https://atcoder.jp/contests/joi2011yo/tasks/joi2011yo_b
https://atcoder.jp/contests/joi2011yo/tasks/joi2011yo_c
https://atcoder.jp/contests/joi2011yo/tasks/joi2011yo_d
https://atcoder.jp/contests/joi2011yo/tasks/joi2011yo_e
https://atcoder.jp/contests/joi2011yo/tasks/joi2011yo_f
https://atcoder.jp/contests/joi2012ho/tasks/joi2012ho1
https://atcoder.jp/contests/joi2012ho/tasks/joi2012ho2
https://atcoder.jp/contests/joi2012ho/tasks/joi2012ho3
https://atcoder.jp/contests/joi2012ho/tasks/joi2012ho4
https://atcoder.jp/contests/joi2012ho/tasks/joi2012ho5
https://atcoder.jp/contests/joi2012yo/tasks/joi2012yo_a
https://atcoder.jp/contests/joi2012yo/tasks/joi2012yo_b
https://atcoder.jp/contests/joi2012yo/tasks/joi2012yo_c
https://atcoder.jp/contests/joi2012yo/tasks/joi2012yo_d
https://atcoder.jp/contests/joi2012yo/tasks/joi2012yo_e
https://atcoder.jp/contests/joi2012yo/tasks/joi2012yo_f
https://atcoder.jp/contests/joi2013ho/tasks/joi2013ho1
https://atcoder.jp/contests/joi2013ho/tasks/joi2013ho2
https://atcoder.jp/contests/joi2013ho/tasks/joi2013ho3
https://atcoder.jp/contests/joi2013ho/tasks/joi2013ho4
https://atcoder.jp/contests/joi2013ho/tasks/joi2013ho5
https://atcoder.jp/contests/joi2013yo/tasks/joi2013yo_a
https://atcoder.jp/contests/joi2013yo/tasks/joi2013yo_b
https://atcoder.jp/contests/joi2013yo/tasks/joi2013yo_c
https://atcoder.jp/contests/joi2013yo/tasks/joi2013yo_d
https://atcoder.jp/contests/joi2013yo/tasks/joi2013yo_e
https://atcoder.jp/contests/joi2013yo/tasks/joi2013yo_f
https://atcoder.jp/contests/joi2014ho/tasks/joi2014ho1
https://atcoder.jp/contests/joi2014ho/tasks/joi2014ho2
https://atcoder.jp/contests/joi2014ho/tasks/joi2014ho3
https://atcoder.jp/contests/joi2014ho/tasks/joi2014ho4
https://atcoder.jp/contests/joi2014ho/tasks/joi2014ho5
https://atcoder.jp/contests/joi2014yo/tasks/joi2014yo_a
https://atcoder.jp/contests/joi2014yo/tasks/joi2014yo_b
https://atcoder.jp/contests/joi2014yo/tasks/joi2014yo_c
https://atcoder.jp/contests/joi2014yo/tasks/joi2014yo_d
https://atcoder.jp/contests/joi2014yo/tasks/joi2014yo_e
https://atcoder.jp/contests/joi2014yo/tasks/joi2014yo_f
https://atcoder.jp/contests/joi2015ho/tasks/joi2015ho_a
https://atcoder.jp/contests/joi2015ho/tasks/joi2015ho_b
https://atcoder.jp/contests/joi2015ho/tasks/joi2015ho_c
https://atcoder.jp/contests/joi2015ho/tasks/joi2015ho_d
https://atcoder.jp/contests/joi2015ho/tasks/joi2015ho_e
https://atcoder.jp/contests/joi2015yo/tasks/joi2015yo_a
https://atcoder.jp/contests/joi2015yo/tasks/joi2015yo_b
https://atcoder.jp/contests/joi2015yo/tasks/joi2015yo_c
https://atcoder.jp/contests/joi2015yo/tasks/joi2015yo_d
https://atcoder.jp/contests/joi2015yo/tasks/joi2015yo_e
https://atcoder.jp/contests/joi2015yo/tasks/joi2015yo_f
https://atcoder.jp/contests/joi2016ho/tasks/joi2016ho_a
https://atcoder.jp/contests/joi2016ho/tasks/joi2016ho_b
https://atcoder.jp/contests/joi2016ho/tasks/joi2016ho_c
https://atcoder.jp/contests/joi2016ho/tasks/joi2016ho_d
https://atcoder.jp/contests/joi2016ho/tasks/joi2016ho_e
https://atcoder.jp/contests/joi2016yo/tasks/joi2016yo_a
https://atcoder.jp/contests/joi2016yo/tasks/joi2016yo_b
https://atcoder.jp/contests/joi2016yo/tasks/joi2016yo_c
https://atcoder.jp/contests/joi2016yo/tasks/joi2016yo_d
https://atcoder.jp/contests/joi2016yo/tasks/joi2016yo_e
https://atcoder.jp/contests/joi2016yo/tasks/joi2016yo_f
https://atcoder.jp/contests/joi2017ho/tasks/joi2017ho_a
https://atcoder.jp/contests/joi2017ho/tasks/joi2017ho_b
https://atcoder.jp/contests/joi2017ho/tasks/joi2017ho_c
https://atcoder.jp/contests/joi2017ho/tasks/joi2017ho_d
https://atcoder.jp/contests/joi2017ho/tasks/joi2017ho_e
https://atcoder.jp/contests/joi2017yo/tasks/joi2017yo_a
https://atcoder.jp/contests/joi2017yo/tasks/joi2017yo_b
https://atcoder.jp/contests/joi2017yo/tasks/joi2017yo_c
https://atcoder.jp/contests/joi2017yo/tasks/joi2017yo_d
https://atcoder.jp/contests/joi2017yo/tasks/joi2017yo_e
https://atcoder.jp/contests/joi2017yo/tasks/joi2017yo_f
https://atcoder.jp/contests/joi2018yo/tasks/joi2018_yo_a
https://atcoder.jp/contests/joi2018yo/tasks/joi2018_yo_b
https://atcoder.jp/contests/joi2018yo/tasks/joi2018_yo_c
https://atcoder.jp/contests/joi2018yo/tasks/joi2018_yo_d
https://atcoder.jp/contests/joi2018yo/tasks/joi2018_yo_e
https://atcoder.jp/contests/joi2018yo/tasks/joi2018_yo_f
https://atcoder.jp/contests/joi2018ho/tasks/joi2018ho_a
https://atcoder.jp/contests/joi2018ho/tasks/joi2018ho_b
https://atcoder.jp/contests/joi2018ho/tasks/joi2018ho_c
https://atcoder.jp/contests/joi2018ho/tasks/joi2018ho_d
https://atcoder.jp/contests/joi2018ho/tasks/joi2018ho_e
https://atcoder.jp/contests/joi2019yo/tasks/joi2019_yo_a
https://atcoder.jp/contests/joi2019yo/tasks/joi2019_yo_b
https://atcoder.jp/contests/joi2019yo/tasks/joi2019_yo_c
https://atcoder.jp/contests/joi2019yo/tasks/joi2019_yo_d
https://atcoder.jp/contests/joi2019yo/tasks/joi2019_yo_e
https://atcoder.jp/contests/joi2019yo/tasks/joi2019_yo_f
https://atcoder.jp/contests/joi2019ho/tasks/joi2019ho_a
https://atcoder.jp/contests/joi2019ho/tasks/joi2019ho_b
https://atcoder.jp/contests/joi2019ho/tasks/joi2019ho_c
https://atcoder.jp/contests/joi2019ho/tasks/joi2019ho_d
https://atcoder.jp/contests/joi2019ho/tasks/joi2019ho_e
https://atcoder.jp/contests/joi2020yo1a/tasks/joi2020_yo1a_a
https://atcoder.jp/contests/joi2020yo1a/tasks/joi2020_yo1a_b
https://atcoder.jp/contests/joi2020yo1a/tasks/joi2020_yo1a_c
https://atcoder.jp/contests/joi2020yo1b/tasks/joi2020_yo1b_a
https://atcoder.jp/contests/joi2020yo1b/tasks/joi2020_yo1b_b
https://atcoder.jp/contests/joi2020yo1b/tasks/joi2020_yo1b_c
https://atcoder.jp/contests/joi2020yo1c/tasks/joi2020_yo1c_a
https://atcoder.jp/contests/joi2020yo1c/tasks/joi2020_yo1c_b
https://atcoder.jp/contests/joi2020yo1c/tasks/joi2020_yo1c_c
https://atcoder.jp/contests/joi2020yo2/tasks/joi2020_yo2_a
https://atcoder.jp/contests/joi2020yo2/tasks/joi2020_yo2_b
https://atcoder.jp/contests/joi2020yo2/tasks/joi2020_yo2_c
https://atcoder.jp/contests/joi2020yo2/tasks/joi2020_yo2_d
https://atcoder.jp/contests/joi2020yo2/tasks/joi2020_yo2_e
https://atcoder.jp/contests/joi2020ho/tasks/joi2020ho_a
https://atcoder.jp/contests/joi2020ho/tasks/joi2020ho_b
https://atcoder.jp/contests/joi2020ho/tasks/joi2020ho_c
https://atcoder.jp/contests/joi2020ho/tasks/joi2020ho_d
https://atcoder.jp/contests/joi2020ho/tasks/joi2020ho_e
https://atcoder.jp/contests/joi2021yo1a/tasks/joi2021_yo1a_a
https://atcoder.jp/contests/joi2021yo1a/tasks/joi2021_yo1a_b
https://atcoder.jp/contests/joi2021yo1a/tasks/joi2021_yo1a_c
https://atcoder.jp/contests/joi2021yo1b/tasks/joi2021_yo1b_a
https://atcoder.jp/contests/joi2021yo1b/tasks/joi2021_yo1b_b
https://atcoder.jp/contests/joi2021yo1b/tasks/joi2021_yo1b_c
https://atcoder.jp/contests/joi2021yo1c/tasks/joi2021_yo1c_a
https://atcoder.jp/contests/joi2021yo1c/tasks/joi2021_yo1c_b
https://atcoder.jp/contests/joi2021yo1c/tasks/joi2021_yo1c_c
https://atcoder.jp/contests/joi2021yo2/tasks/joi2021_yo2_a
https://atcoder.jp/contests/joi2021yo2/tasks/joi2021_yo2_b
https://atcoder.jp/contests/joi2021yo2/tasks/joi2021_yo2_c
https://atcoder.jp/contests/joi2021yo2/tasks/joi2021_yo2_d
https://atcoder.jp/contests/joi2021yo2/tasks/joi2021_yo2_e
https://atcoder.jp/contests/joi2021ho/tasks/joi2021ho_a
https://atcoder.jp/contests/joi2021ho/tasks/joi2021ho_b
https://atcoder.jp/contests/joi2021ho/tasks/joi2021ho_c
https://atcoder.jp/contests/joi2021ho/tasks/joi2021ho_d
https://atcoder.jp/contests/joi2021ho/tasks/joi2021ho_e
https://atcoder.jp/contests/joi2022yo1a/tasks/joi2022_yo1a_a
https://atcoder.jp/contests/joi2022yo1a/tasks/joi2022_yo1a_b
https://atcoder.jp/contests/joi2022yo1a/tasks/joi2022_yo1a_c
https://atcoder.jp/contests/joi2022yo1a/tasks/joi2022_yo1a_d
https://atcoder.jp/contests/joi2022yo1b/tasks/joi2022_yo1b_a
https://atcoder.jp/contests/joi2022yo1b/tasks/joi2022_yo1b_b
https://atcoder.jp/contests/joi2022yo1b/tasks/joi2022_yo1b_c
https://atcoder.jp/contests/joi2022yo1b/tasks/joi2022_yo1b_d
https://atcoder.jp/contests/joi2022yo1c/tasks/joi2022_yo1c_a
https://atcoder.jp/contests/joi2022yo1c/tasks/joi2022_yo1c_b
https://atcoder.jp/contests/joi2022yo1c/tasks/joi2022_yo1c_c
https://atcoder.jp/contests/joi2022yo1c/tasks/joi2022_yo1c_d
https://atcoder.jp/contests/joi2022yo2/tasks/joi2022_yo2_a
https://atcoder.jp/contests/joi2022yo2/tasks/joi2022_yo2_b
https://atcoder.jp/contests/joi2022yo2/tasks/joi2022_yo2_c
https://atcoder.jp/contests/joi2022yo2/tasks/joi2022_yo2_d
https://atcoder.jp/contests/joi2022yo2/tasks/joi2022_yo2_e
https://atcoder.jp/contests/joi2022ho/tasks/joi2022ho_a
https://atcoder.jp/contests/joi2022ho/tasks/joi2022ho_b
https://atcoder.jp/contests/joi2022ho/tasks/joi2022ho_c
https://atcoder.jp/contests/joi2022ho/tasks/joi2022ho_d
https://atcoder.jp/contests/joi2022ho/tasks/joi2022ho_e
https://atcoder.jp/contests/joig2021-open/tasks/joig2021_a
https://atcoder.jp/contests/joig2021-open/tasks/joig2021_b
https://atcoder.jp/contests/joig2021-open/tasks/joig2021_c
https://atcoder.jp/contests/joig2021-open/tasks/joig2021_d
https://atcoder.jp/contests/joig2021-open/tasks/joig2021_e
https://atcoder.jp/contests/joig2021-open/tasks/joig2021_f
https://atcoder.jp/contests/joig2022-open/tasks/joig2022_a
https://atcoder.jp/contests/joig2022-open/tasks/joig2022_b
https://atcoder.jp/contests/joig2022-open/tasks/joig2022_c
https://atcoder.jp/contests/joig2022-open/tasks/joig2022_d
https://atcoder.jp/contests/joig2022-open/tasks/joig2022_e
https://atcoder.jp/contests/joig2022-open/tasks/joig2022_f
https://atcoder.jp/contests/joigsc2022/tasks/joigsc2022_a
https://atcoder.jp/contests/joigsc2022/tasks/joigsc2022_b
https://atcoder.jp/contests/joigsc2022/tasks/joigsc2022_c
https://atcoder.jp/contests/joigsc2022/tasks/joigsc2022_d
https://atcoder.jp/contests/joigsc2022/tasks/joigsc2022_e
https://atcoder.jp/contests/joigsc2022/tasks/joigsc2022_f
https://atcoder.jp/contests/joigsc2022/tasks/joigsc2022_g
https://atcoder.jp/contests/joigsc2022/tasks/joigsc2022_h
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_anagra
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_buildi
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_circui
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_factor
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_fermat
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_fiber
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_lines
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_mall
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_packin
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_packing2
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_packing3
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_packing4
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_packing5
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_route
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_salt
https://atcoder.jp/contests/joisc2007/tasks/joisc2007_score
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_belt
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_cheating
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_committee
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_election1
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_election2
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_election3
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_election4
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_election5
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_flu
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_fraction
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_nightman
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_nile
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_origami
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_ruins
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_sheet
https://atcoder.jp/contests/joisc2008/tasks/joisc2008_typhoon
https://atcoder.jp/contests/joisc2009/tasks/joisc2009_abduction
https://atcoder.jp/contests/joisc2009/tasks/joisc2009_advertisement
https://atcoder.jp/contests/joisc2009/tasks/joisc2009_chopsticks
https://atcoder.jp/contests/joisc2009/tasks/joisc2009_contest
https://atcoder.jp/contests/joisc2009/tasks/joisc2009_distribution
https://atcoder.jp/contests/joisc2009/tasks/joisc2009_logo
https://atcoder.jp/contests/joisc2009/tasks/joisc2009_pyramid
https://atcoder.jp/contests/joisc2009/tasks/joisc2009_sequence
https://atcoder.jp/contests/joisc2009/tasks/joisc2009_ski
https://atcoder.jp/contests/joisc2009/tasks/joisc2009_stamps
https://atcoder.jp/contests/joisc2009/tasks/joisc2009_starry_sky
https://atcoder.jp/contests/joisc2009/tasks/joisc2009_territory
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_aplusb
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_contest
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_dna
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_finals
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_hideseek
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_highway
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_lake
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_plugs
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_poster
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_regions
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_sengoku
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_simroad1
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_simroad2
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_simroad3
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_simroad4
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_simroad5
https://atcoder.jp/contests/joisc2010/tasks/joisc2010_stairs
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_apples
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_banner
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_bookshelf
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_deciphering
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_dragon
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_guess
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_ioi
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_joitter
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_keycards
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_orienteering
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_report
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_shiritori
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_ufo1
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_ufo2
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_ufo3
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_ufo4
https://atcoder.jp/contests/joisc2011/tasks/joisc2011_ufo5
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_broadcasting1
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_broadcasting2
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_broadcasting3
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_broadcasting4
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_broadcasting5
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_building2
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_chinese
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_constellation
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_copypaste
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_fish
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_fortune_telling
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_invitation
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_joi_flag
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_kangaroo
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_rotate
https://atcoder.jp/contests/joisc2012/tasks/joisc2012_sokoban
https://atcoder.jp/contests/joisc2013-day1/tasks/joisc2013_bustour
https://atcoder.jp/contests/joisc2013-day3/tasks/joisc2013_cake
https://atcoder.jp/contests/joisc2013-day1/tasks/joisc2013_collecting
https://atcoder.jp/contests/joisc2013-day1/tasks/joisc2013_communication
https://atcoder.jp/contests/joisc2013-day2/tasks/joisc2013_construction
https://atcoder.jp/contests/joisc2013-day1/tasks/joisc2013_joi_poster
https://atcoder.jp/contests/joisc2013-day3/tasks/joisc2013_koala
https://atcoder.jp/contests/joisc2013-day2/tasks/joisc2013_mascots
https://atcoder.jp/contests/joisc2013-day4/tasks/joisc2013_messenger
https://atcoder.jp/contests/joisc2013-day3/tasks/joisc2013_mountain
https://atcoder.jp/contests/joisc2013-day4/tasks/joisc2013_presents
https://atcoder.jp/contests/joisc2013-day4/tasks/joisc2013_spaceships
https://atcoder.jp/contests/joisc2013-day2/tasks/joisc2013_spy
https://atcoder.jp/contests/joisc2014/tasks/joisc2014_a
https://atcoder.jp/contests/joisc2014/tasks/joisc2014_b
https://atcoder.jp/contests/joisc2014/tasks/joisc2014_c
https://atcoder.jp/contests/joisc2014/tasks/joisc2014_d
https://atcoder.jp/contests/joisc2014/tasks/joisc2014_e
https://atcoder.jp/contests/joisc2014/tasks/joisc2014_f
https://atcoder.jp/contests/joisc2014/tasks/joisc2014_g
https://atcoder.jp/contests/joisc2014/tasks/joisc2014_h
https://atcoder.jp/contests/joisc2014/tasks/joisc2014_i
https://atcoder.jp/contests/joisc2014/tasks/joisc2014_j
https://atcoder.jp/contests/joisc2014/tasks/joisc2014_k
https://atcoder.jp/contests/joisc2014/tasks/joisc2014_l
https://atcoder.jp/contests/joisc2014/tasks/joisc2014_m
https://atcoder.jp/contests/joisc2015/tasks/joisc2015_a
https://atcoder.jp/contests/joisc2015/tasks/joisc2015_b
https://atcoder.jp/contests/joisc2015/tasks/joisc2015_c
https://atcoder.jp/contests/joisc2015/tasks/joisc2015_d
https://atcoder.jp/contests/joisc2015/tasks/joisc2015_e
https://atcoder.jp/contests/joisc2015/tasks/joisc2015_f
https://atcoder.jp/contests/joisc2015/tasks/joisc2015_g
https://atcoder.jp/contests/joisc2015/tasks/joisc2015_h
https://atcoder.jp/contests/joisc2015/tasks/joisc2015_i
https://atcoder.jp/contests/joisc2015/tasks/joisc2015_j
https://atcoder.jp/contests/joisc2015/tasks/joisc2015_k
https://atcoder.jp/contests/joisc2015/tasks/joisc2015_l
https://atcoder.jp/contests/joisc2015/tasks/joisc2015_m
https://atcoder.jp/contests/joisc2016/tasks/joisc2016_a
https://atcoder.jp/contests/joisc2016/tasks/joisc2016_b
https://atcoder.jp/contests/joisc2016/tasks/joisc2016_c
https://atcoder.jp/contests/joisc2016/tasks/joisc2016_d
https://atcoder.jp/contests/joisc2016/tasks/joisc2016_e
https://atcoder.jp/contests/joisc2016/tasks/joisc2016_f
https://atcoder.jp/contests/joisc2016/tasks/joisc2016_g
https://atcoder.jp/contests/joisc2016/tasks/joisc2016_h
https://atcoder.jp/contests/joisc2016/tasks/joisc2016_i
https://atcoder.jp/contests/joisc2016/tasks/joisc2016_j
https://atcoder.jp/contests/joisc2016/tasks/joisc2016_k
https://atcoder.jp/contests/joisc2016/tasks/joisc2016_l
https://atcoder.jp/contests/joisc2017/tasks/joisc2017_a
https://atcoder.jp/contests/joisc2017/tasks/joisc2017_b
https://atcoder.jp/contests/joisc2017/tasks/joisc2017_c
https://atcoder.jp/contests/joisc2017/tasks/joisc2017_d
https://atcoder.jp/contests/joisc2017/tasks/joisc2017_e
https://atcoder.jp/contests/joisc2017/tasks/joisc2017_f
https://atcoder.jp/contests/joisc2017/tasks/joisc2017_g
https://atcoder.jp/contests/joisc2017/tasks/joisc2017_h
https://atcoder.jp/contests/joisc2017/tasks/joisc2017_i
https://atcoder.jp/contests/joisc2017/tasks/joisc2017_j
https://atcoder.jp/contests/joisc2017/tasks/joisc2017_k
https://atcoder.jp/contests/joisc2017/tasks/joisc2017_l
https://atcoder.jp/contests/joisc2018/tasks/joisc2018_a
https://atcoder.jp/contests/joisc2018/tasks/joisc2018_b
https://atcoder.jp/contests/joisc2018/tasks/joisc2018_c
https://atcoder.jp/contests/joisc2018/tasks/joisc2018_d
https://atcoder.jp/contests/joisc2018/tasks/joisc2018_e
https://atcoder.jp/contests/joisc2018/tasks/joisc2018_f
https://atcoder.jp/contests/joisc2018/tasks/joisc2018_g
https://atcoder.jp/contests/joisc2018/tasks/joisc2018_h
https://atcoder.jp/contests/joisc2018/tasks/joisc2018_i
https://atcoder.jp/contests/joisc2018/tasks/joisc2018_j
https://atcoder.jp/contests/joisc2018/tasks/joisc2018_k
https://atcoder.jp/contests/joisc2018/tasks/joisc2018_l
https://atcoder.jp/contests/joisc2019/tasks/joisc2019_a
https://atcoder.jp/contests/joisc2019/tasks/joisc2019_b
https://atcoder.jp/contests/joisc2019/tasks/joisc2019_c
https://atcoder.jp/contests/joisc2019/tasks/joisc2019_d
https://atcoder.jp/contests/joisc2019/tasks/joisc2019_e
https://atcoder.jp/contests/joisc2019/tasks/joisc2019_f
https://atcoder.jp/contests/joisc2019/tasks/joisc2019_g
https://atcoder.jp/contests/joisc2019/tasks/joisc2019_h
https://atcoder.jp/contests/joisc2019/tasks/joisc2019_i
https://atcoder.jp/contests/joisc2019/tasks/joisc2019_j
https://atcoder.jp/contests/joisc2019/tasks/joisc2019_k
https://atcoder.jp/contests/joisc2019/tasks/joisc2019_l
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_a
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_b
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_c
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_d
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_e
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_f
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_g
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_h
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_i
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_j
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_k
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_l
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_m
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_n
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_o
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_p
https://atcoder.jp/contests/joisc2020/tasks/joisc2020_q
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_a1
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_a2
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_a3
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_a4
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_a5
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_a6
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_b
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_c
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_d
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_e
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_g
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_h
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_i
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_j
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_k
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_l
https://atcoder.jp/contests/joisc2021/tasks/joisc2021_m
https://atcoder.jp/contests/joisc2022/tasks/joisc2022_a
https://atcoder.jp/contests/joisc2022/tasks/joisc2022_b
https://atcoder.jp/contests/joisc2022/tasks/joisc2022_c
https://atcoder.jp/contests/joisc2022/tasks/joisc2022_d
https://atcoder.jp/contests/joisc2022/tasks/joisc2022_e
https://atcoder.jp/contests/joisc2022/tasks/joisc2022_f
https://atcoder.jp/contests/joisc2022/tasks/joisc2022_g
https://atcoder.jp/contests/joisc2022/tasks/joisc2022_h
https://atcoder.jp/contests/joisc2022/tasks/joisc2022_i
https://atcoder.jp/contests/joisc2022/tasks/joisc2022_j
https://atcoder.jp/contests/joisc2022/tasks/joisc2022_k
https://atcoder.jp/contests/joisc2022/tasks/joisc2022_l
https://atcoder.jp/contests/jsc2019-final/tasks/jsc2019_final_a
https://atcoder.jp/contests/jsc2019-final/tasks/jsc2019_final_b
https://atcoder.jp/contests/jsc2019-final/tasks/jsc2019_final_c
https://atcoder.jp/contests/jsc2019-final/tasks/jsc2019_final_d
https://atcoder.jp/contests/jsc2019-final/tasks/jsc2019_final_e
https://atcoder.jp/contests/jsc2019-final/tasks/jsc2019_final_f
https://atcoder.jp/contests/jsc2019-final/tasks/jsc2019_final_g
https://atcoder.jp/contests/jsc2019-final/tasks/jsc2019_final_h
https://atcoder.jp/contests/jsc2019-qual/tasks/jsc2019_qual_a
m月d日 被称为乘积日,当且仅当
d的个位和十位都>=2
d的个位乘以十位是m
如果日历中一共有M个月,每个月有D天,问一年有多少个乘积日
https://atcoder.jp/contests/jsc2019-qual/tasks/jsc2019_qual_b
https://atcoder.jp/contests/jsc2019-qual/tasks/jsc2019_qual_c
https://atcoder.jp/contests/jsc2019-qual/tasks/jsc2019_qual_d
https://atcoder.jp/contests/jsc2019-qual/tasks/jsc2019_qual_e
https://atcoder.jp/contests/jsc2019-qual/tasks/jsc2019_qual_f
https://atcoder.jp/contests/jsc2021/tasks/jsc2021_a
https://atcoder.jp/contests/jsc2021/tasks/jsc2021_b
https://atcoder.jp/contests/jsc2021/tasks/jsc2021_c
https://atcoder.jp/contests/jsc2021/tasks/jsc2021_d
https://atcoder.jp/contests/jsc2021/tasks/jsc2021_e
https://atcoder.jp/contests/jsc2021/tasks/jsc2021_f
https://atcoder.jp/contests/jsc2021/tasks/jsc2021_g
https://atcoder.jp/contests/jsc2021/tasks/jsc2021_h
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/jsc2022_final_a_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/jsc2022_final_b_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/jsc2022_final_c_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/jsc2022_final_d_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/jsc2022_final_e_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/jsc2022_final_f_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/jsc2022_final_g_t.md'
https://atcoder.jp/contests/judge-update-202004/tasks/judge_update_202004_a
https://atcoder.jp/contests/judge-update-202004/tasks/judge_update_202004_b
https://atcoder.jp/contests/judge-update-202004/tasks/judge_update_202004_c
https://atcoder.jp/contests/judge-update-202004/tasks/judge_update_202004_d
https://atcoder.jp/contests/k2pc-easy/tasks/k2pc001_e1
https://atcoder.jp/contests/k2pc-easy/tasks/k2pc001_e2
https://atcoder.jp/contests/k2pc-easy/tasks/k2pc001_e3
https://atcoder.jp/contests/k2pc-easy/tasks/k2pc001_e4
https://atcoder.jp/contests/k2pc-easy/tasks/k2pc001_e5
https://atcoder.jp/contests/k2pc-hard/tasks/k2pc001_h1
https://atcoder.jp/contests/k2pc-hard/tasks/k2pc001_h2
https://atcoder.jp/contests/k2pc-hard/tasks/k2pc001_h3
https://atcoder.jp/contests/k2pc-hard/tasks/k2pc001_h4
https://atcoder.jp/contests/k2pc-hard/tasks/k2pc001_h5
https://atcoder.jp/contests/k4pc/tasks/k4pc_a
https://atcoder.jp/contests/k4pc/tasks/k4pc_b
https://atcoder.jp/contests/k4pc/tasks/k4pc_c
https://atcoder.jp/contests/k4pc/tasks/k4pc_d
https://atcoder.jp/contests/k4pc/tasks/k4pc_e
https://atcoder.jp/contests/k4pc/tasks/k4pc_f
https://atcoder.jp/contests/k4pc/tasks/k4pc_g
https://atcoder.jp/contests/keyence2019/tasks/keyence2019_a
输入四个一位数,问重排之后能不能变成1974,输出Yes或No
https://atcoder.jp/contests/keyence2019/tasks/keyence2019_b
https://atcoder.jp/contests/keyence2019/tasks/keyence2019_c
https://atcoder.jp/contests/keyence2019/tasks/keyence2019_d
https://atcoder.jp/contests/keyence2019/tasks/keyence2019_e
https://atcoder.jp/contests/keyence2019/tasks/keyence2019_f
https://atcoder.jp/contests/keyence2020/tasks/keyence2020_a
H行,W列的矩阵,每次操作可以染黑一整行或一整列,问至少操作多少次,可以染黑至少N个格子
https://atcoder.jp/contests/keyence2020/tasks/keyence2020_b
https://atcoder.jp/contests/keyence2020/tasks/keyence2020_c
https://atcoder.jp/contests/keyence2020/tasks/keyence2020_d
https://atcoder.jp/contests/keyence2020/tasks/keyence2020_e
https://atcoder.jp/contests/keyence2020/tasks/keyence2020_f
https://atcoder.jp/contests/keyence2021/tasks/keyence2021_a
输入两个数组,对于每个n
,找到i<j<=n
使得a[i]*b[j]
最大
https://atcoder.jp/contests/keyence2021/tasks/keyence2021_b
https://atcoder.jp/contests/keyence2021/tasks/keyence2021_c
https://atcoder.jp/contests/keyence2021/tasks/keyence2021_d
https://atcoder.jp/contests/keyence2021/tasks/keyence2021_e
https://atcoder.jp/contests/keyence2021/tasks/keyence2021_f
https://atcoder.jp/contests/kupc2012/tasks/kupc2012_1
https://atcoder.jp/contests/kupc2012/tasks/kupc2012_10
https://atcoder.jp/contests/kupc2012/tasks/kupc2012_11
https://atcoder.jp/contests/kupc2012/tasks/kupc2012_2
https://atcoder.jp/contests/kupc2012/tasks/kupc2012_3
https://atcoder.jp/contests/kupc2012/tasks/kupc2012_4
https://atcoder.jp/contests/kupc2012/tasks/kupc2012_5
https://atcoder.jp/contests/kupc2012/tasks/kupc2012_6
https://atcoder.jp/contests/kupc2012/tasks/kupc2012_7
https://atcoder.jp/contests/kupc2012/tasks/kupc2012_8
https://atcoder.jp/contests/kupc2012/tasks/kupc2012_9
https://atcoder.jp/contests/kupc2012pr/tasks/kupc2012pr_1
https://atcoder.jp/contests/kupc2012pr/tasks/kupc2012pr_2
https://atcoder.jp/contests/kupc2012pr/tasks/kupc2012pr_3
https://atcoder.jp/contests/kupc2012pr/tasks/kupc2012pr_4
https://atcoder.jp/contests/kupc2013/tasks/kupc2013_a
https://atcoder.jp/contests/kupc2013/tasks/kupc2013_b
https://atcoder.jp/contests/kupc2013/tasks/kupc2013_c
https://atcoder.jp/contests/kupc2013/tasks/kupc2013_d
https://atcoder.jp/contests/kupc2013/tasks/kupc2013_e
https://atcoder.jp/contests/kupc2013/tasks/kupc2013_f
https://atcoder.jp/contests/kupc2013/tasks/kupc2013_g
https://atcoder.jp/contests/kupc2013/tasks/kupc2013_h
https://atcoder.jp/contests/kupc2013/tasks/kupc2013_i
https://atcoder.jp/contests/kupc2013/tasks/kupc2013_j
https://atcoder.jp/contests/kupc2013/tasks/kupc2013_k
https://atcoder.jp/contests/kupc2014/tasks/kupc2014_a
https://atcoder.jp/contests/kupc2014/tasks/kupc2014_b
https://atcoder.jp/contests/kupc2014/tasks/kupc2014_c
https://atcoder.jp/contests/kupc2014/tasks/kupc2014_d
https://atcoder.jp/contests/kupc2014/tasks/kupc2014_e
https://atcoder.jp/contests/kupc2014/tasks/kupc2014_f
https://atcoder.jp/contests/kupc2014/tasks/kupc2014_g
https://atcoder.jp/contests/kupc2014/tasks/kupc2014_h
https://atcoder.jp/contests/kupc2014/tasks/kupc2014_i
https://atcoder.jp/contests/kupc2014/tasks/kupc2014_j
https://atcoder.jp/contests/kupc2014/tasks/kupc2014_k
https://atcoder.jp/contests/kupc2014/tasks/kupc2014_l
https://atcoder.jp/contests/kupc2015/tasks/kupc2015_a
https://atcoder.jp/contests/kupc2015/tasks/kupc2015_b
https://atcoder.jp/contests/kupc2015/tasks/kupc2015_c
https://atcoder.jp/contests/kupc2015/tasks/kupc2015_d
https://atcoder.jp/contests/kupc2015/tasks/kupc2015_e
https://atcoder.jp/contests/kupc2015/tasks/kupc2015_f
https://atcoder.jp/contests/kupc2015/tasks/kupc2015_g
https://atcoder.jp/contests/kupc2015/tasks/kupc2015_h
https://atcoder.jp/contests/kupc2015/tasks/kupc2015_i
https://atcoder.jp/contests/kupc2015/tasks/kupc2015_j
https://atcoder.jp/contests/kupc2015/tasks/kupc2015_k
https://atcoder.jp/contests/kupc2015/tasks/kupc2015_l
https://atcoder.jp/contests/kupc2016/tasks/kupc2016_a
https://atcoder.jp/contests/kupc2016/tasks/kupc2016_b
https://atcoder.jp/contests/kupc2016/tasks/kupc2016_c
https://atcoder.jp/contests/kupc2016/tasks/kupc2016_d
https://atcoder.jp/contests/kupc2016/tasks/kupc2016_e
https://atcoder.jp/contests/kupc2016/tasks/kupc2016_f
https://atcoder.jp/contests/kupc2016/tasks/kupc2016_g
https://atcoder.jp/contests/kupc2016/tasks/kupc2016_h
https://atcoder.jp/contests/kupc2016/tasks/kupc2016_i
https://atcoder.jp/contests/kupc2016/tasks/kupc2016_j
https://atcoder.jp/contests/kupc2016/tasks/kupc2016_k
https://atcoder.jp/contests/kupc2017/tasks/kupc2017_a
https://atcoder.jp/contests/kupc2017/tasks/kupc2017_b
https://atcoder.jp/contests/kupc2017/tasks/kupc2017_c
https://atcoder.jp/contests/kupc2017/tasks/kupc2017_d
https://atcoder.jp/contests/kupc2017/tasks/kupc2017_e
https://atcoder.jp/contests/kupc2017/tasks/kupc2017_f
https://atcoder.jp/contests/kupc2017/tasks/kupc2017_g
https://atcoder.jp/contests/kupc2017/tasks/kupc2017_h
https://atcoder.jp/contests/kupc2017/tasks/kupc2017_i
https://atcoder.jp/contests/kupc2017/tasks/kupc2017_j
https://atcoder.jp/contests/kupc2017/tasks/kupc2017_k
https://atcoder.jp/contests/kupc2017/tasks/kupc2017_l
https://atcoder.jp/contests/kupc2018/tasks/kupc2018_a
https://atcoder.jp/contests/kupc2018/tasks/kupc2018_b
https://atcoder.jp/contests/kupc2018/tasks/kupc2018_c
https://atcoder.jp/contests/kupc2018/tasks/kupc2018_d
https://atcoder.jp/contests/kupc2018/tasks/kupc2018_e
https://atcoder.jp/contests/kupc2018/tasks/kupc2018_f
https://atcoder.jp/contests/kupc2018/tasks/kupc2018_g
https://atcoder.jp/contests/kupc2018/tasks/kupc2018_h
https://atcoder.jp/contests/kupc2018/tasks/kupc2018_i
https://atcoder.jp/contests/kupc2018/tasks/kupc2018_j
https://atcoder.jp/contests/kupc2018/tasks/kupc2018_k
https://atcoder.jp/contests/kupc2018/tasks/kupc2018_l
https://atcoder.jp/contests/kupc2018/tasks/kupc2018_m
https://atcoder.jp/contests/kupc2019/tasks/kupc2019_a
https://atcoder.jp/contests/kupc2019/tasks/kupc2019_b
https://atcoder.jp/contests/kupc2019/tasks/kupc2019_c
https://atcoder.jp/contests/kupc2019/tasks/kupc2019_d
https://atcoder.jp/contests/kupc2019/tasks/kupc2019_e
https://atcoder.jp/contests/kupc2019/tasks/kupc2019_f
https://atcoder.jp/contests/kupc2019/tasks/kupc2019_g
https://atcoder.jp/contests/kupc2019/tasks/kupc2019_h
https://atcoder.jp/contests/kupc2019/tasks/kupc2019_i
https://atcoder.jp/contests/kupc2019/tasks/kupc2019_j
https://atcoder.jp/contests/kupc2019/tasks/kupc2019_k
https://atcoder.jp/contests/kupc2019/tasks/kupc2019_l
https://atcoder.jp/contests/kupc2020/tasks/kupc2020_a
https://atcoder.jp/contests/kupc2020/tasks/kupc2020_b
https://atcoder.jp/contests/kupc2020/tasks/kupc2020_c
https://atcoder.jp/contests/kupc2020/tasks/kupc2020_d
https://atcoder.jp/contests/kupc2020/tasks/kupc2020_e
https://atcoder.jp/contests/kupc2020/tasks/kupc2020_f
https://atcoder.jp/contests/kupc2020/tasks/kupc2020_g
https://atcoder.jp/contests/kupc2020/tasks/kupc2020_h
https://atcoder.jp/contests/kupc2020/tasks/kupc2020_i
https://atcoder.jp/contests/kupc2020/tasks/kupc2020_j
https://atcoder.jp/contests/kupc2020/tasks/kupc2020_k
https://atcoder.jp/contests/kupc2020/tasks/kupc2020_l
https://atcoder.jp/contests/kupc2020/tasks/kupc2020_m
https://atcoder.jp/contests/kupc2021/tasks/kupc2021_a
https://atcoder.jp/contests/kupc2021/tasks/kupc2021_b
https://atcoder.jp/contests/kupc2021/tasks/kupc2021_c
https://atcoder.jp/contests/kupc2021/tasks/kupc2021_d
https://atcoder.jp/contests/kupc2021/tasks/kupc2021_e
https://atcoder.jp/contests/kupc2021/tasks/kupc2021_f
https://atcoder.jp/contests/kupc2021/tasks/kupc2021_g
https://atcoder.jp/contests/kupc2021/tasks/kupc2021_h
https://atcoder.jp/contests/kupc2021/tasks/kupc2021_i
https://atcoder.jp/contests/kupc2021/tasks/kupc2021_j
https://atcoder.jp/contests/kupc2021/tasks/kupc2021_k
https://atcoder.jp/contests/kupc2021/tasks/kupc2021_l
https://atcoder.jp/contests/kupc2021/tasks/kupc2021_m
https://atcoder.jp/contests/loadchecking/tasks/loadchecking_a
https://atcoder.jp/contests/m-solutions2019/tasks/m_solutions2019_a
输入N,问正N边形内角和是多少度?
https://atcoder.jp/contests/m-solutions2019/tasks/m_solutions2019_b
输入一个字符串,问其中的x
的个数是否小于等于7,输出YES或NO
https://atcoder.jp/contests/m-solutions2019/tasks/m_solutions2019_c
https://atcoder.jp/contests/m-solutions2019/tasks/m_solutions2019_d
https://atcoder.jp/contests/m-solutions2019/tasks/m_solutions2019_e
https://atcoder.jp/contests/m-solutions2019/tasks/m_solutions2019_f
https://atcoder.jp/contests/m-solutions2020/tasks/m_solutions2020_a
https://atcoder.jp/contests/m-solutions2020/tasks/m_solutions2020_b
https://atcoder.jp/contests/m-solutions2020/tasks/m_solutions2020_c
https://atcoder.jp/contests/m-solutions2020/tasks/m_solutions2020_d
https://atcoder.jp/contests/m-solutions2020/tasks/m_solutions2020_e
https://atcoder.jp/contests/m-solutions2020/tasks/m_solutions2020_f
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_a
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_aa
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_ab
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_ac
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_ad
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_ae
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_af
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_ag
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_ah
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_ai
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_aj
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_ak
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_al
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_am
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_an
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_ao
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_ap
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_aq
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_ar
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_as
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_at
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_au
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_av
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_aw
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_ax
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_ay
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_az
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_b
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_ba
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bb
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bc
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bd
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_be
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bf
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bg
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bh
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bi
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bj
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bk
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bl
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bm
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bn
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bo
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bp
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bq
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_br
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bs
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bt
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bu
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bv
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bw
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_bx
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_by
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_c
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_d
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_e
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_f
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_g
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_h
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_i
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_j
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_k
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_l
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_m
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_n
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_o
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_p
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_q
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_r
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_s
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_t
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_u
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_v
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_w
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_x
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_y
https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_z
https://atcoder.jp/contests/maximum-cup-2013/tasks/maximum_2013_a
https://atcoder.jp/contests/maximum-cup-2013/tasks/maximum_2013_b
https://atcoder.jp/contests/maximum-cup-2013/tasks/maximum_2013_c
https://atcoder.jp/contests/maximum-cup-2013/tasks/maximum_2013_d
https://atcoder.jp/contests/maximum-cup-2013/tasks/maximum_2013_e
https://atcoder.jp/contests/maximum-cup-2013/tasks/maximum_2013_f
https://atcoder.jp/contests/maximum-cup-2013/tasks/maximum_2013_g
https://atcoder.jp/contests/maximum-cup-2013/tasks/maximum_2013_h
https://atcoder.jp/contests/maximum-cup-2013/tasks/maximum_2013_i
https://atcoder.jp/contests/maximum-cup-2013/tasks/maximum_2013_j
https://atcoder.jp/contests/maximum-cup-2018/tasks/maximum_cup_2018_a
https://atcoder.jp/contests/maximum-cup-2018/tasks/maximum_cup_2018_b
https://atcoder.jp/contests/maximum-cup-2018/tasks/maximum_cup_2018_c
https://atcoder.jp/contests/maximum-cup-2018/tasks/maximum_cup_2018_d
https://atcoder.jp/contests/maximum-cup-2018/tasks/maximum_cup_2018_e
https://atcoder.jp/contests/maximum-cup-2018/tasks/maximum_cup_2018_f
https://atcoder.jp/contests/maximum-cup-2018/tasks/maximum_cup_2018_g
https://atcoder.jp/contests/maximum-cup-2018/tasks/maximum_cup_2018_h
https://atcoder.jp/contests/monamieHB2021/tasks/monamieHB2021_a
https://atcoder.jp/contests/monamieHB2021/tasks/monamieHB2021_b
https://atcoder.jp/contests/monamieHB2021/tasks/monamieHB2021_c
https://atcoder.jp/contests/monamieHB2021/tasks/monamieHB2021_d
https://atcoder.jp/contests/monamieHB2021/tasks/monamieHB2021_e
https://atcoder.jp/contests/mujin-pc-2016/tasks/mujin_pc_2016_a
https://atcoder.jp/contests/mujin-pc-2016/tasks/mujin_pc_2016_b
https://atcoder.jp/contests/mujin-pc-2016/tasks/mujin_pc_2016_c
https://atcoder.jp/contests/mujin-pc-2016/tasks/mujin_pc_2016_d
https://atcoder.jp/contests/mujin-pc-2016/tasks/mujin_pc_2016_e
https://atcoder.jp/contests/mujin-pc-2017/tasks/mujin_pc_2017_a
https://atcoder.jp/contests/mujin-pc-2017/tasks/mujin_pc_2017_b
https://atcoder.jp/contests/mujin-pc-2017/tasks/mujin_pc_2017_c
https://atcoder.jp/contests/mujin-pc-2017/tasks/mujin_pc_2017_d
https://atcoder.jp/contests/mujin-pc-2018/tasks/mujin_pc_2018_a
https://atcoder.jp/contests/mujin-pc-2018/tasks/mujin_pc_2018_b
https://atcoder.jp/contests/mujin-pc-2018/tasks/mujin_pc_2018_c
https://atcoder.jp/contests/mujin-pc-2018/tasks/mujin_pc_2018_d
https://atcoder.jp/contests/mujin-pc-2018/tasks/mujin_pc_2018_e
https://atcoder.jp/contests/mujin-pc-2018/tasks/mujin_pc_2018_f
https://atcoder.jp/contests/mujin-pc-2018/tasks/mujin_pc_2018_g
https://atcoder.jp/contests/mujin-pc-2018/tasks/mujin_pc_2018_h
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_a
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_b
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_c
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_d
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_e
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_f
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_g
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_h
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_i
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_j
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_k
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_l
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_m
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_n
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_o
https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_p
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_a
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_b
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_c
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_d
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_e
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_f
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_g
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_h
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_i
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_j
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_k
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_l
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_m
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_n
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_o
https://atcoder.jp/contests/nadafes2022_day2/tasks/nadafes2022_day2_p
https://atcoder.jp/contests/nikkei2019-2-final/tasks/nikkei2019_2_final_a
https://atcoder.jp/contests/nikkei2019-2-final/tasks/nikkei2019_2_final_b
https://atcoder.jp/contests/nikkei2019-2-final/tasks/nikkei2019_2_final_c
https://atcoder.jp/contests/nikkei2019-2-final/tasks/nikkei2019_2_final_d
https://atcoder.jp/contests/nikkei2019-2-final/tasks/nikkei2019_2_final_e
https://atcoder.jp/contests/nikkei2019-2-final/tasks/nikkei2019_2_final_f
https://atcoder.jp/contests/nikkei2019-2-final/tasks/nikkei2019_2_final_g
https://atcoder.jp/contests/nikkei2019-2-final/tasks/nikkei2019_2_final_h
https://atcoder.jp/contests/nikkei2019-2-qual/tasks/nikkei2019_2_qual_a
输入正整数N,问有多少种方法把N分成两个不同的正整数(不计顺序,1+2=3和2+1=3算同一种方案)
https://atcoder.jp/contests/nikkei2019-2-qual/tasks/nikkei2019_2_qual_b
https://atcoder.jp/contests/nikkei2019-2-qual/tasks/nikkei2019_2_qual_c
https://atcoder.jp/contests/nikkei2019-2-qual/tasks/nikkei2019_2_qual_d
https://atcoder.jp/contests/nikkei2019-2-qual/tasks/nikkei2019_2_qual_e
https://atcoder.jp/contests/nikkei2019-2-qual/tasks/nikkei2019_2_qual_f
https://atcoder.jp/contests/nikkei2019-final/tasks/nikkei2019_final_a
https://atcoder.jp/contests/nikkei2019-final/tasks/nikkei2019_final_b
https://atcoder.jp/contests/nikkei2019-final/tasks/nikkei2019_final_c
https://atcoder.jp/contests/nikkei2019-final/tasks/nikkei2019_final_d
https://atcoder.jp/contests/nikkei2019-final/tasks/nikkei2019_final_e
https://atcoder.jp/contests/nikkei2019-final/tasks/nikkei2019_final_f
https://atcoder.jp/contests/nikkei2019-final/tasks/nikkei2019_final_g
https://atcoder.jp/contests/nikkei2019-final/tasks/nikkei2019_final_h
https://atcoder.jp/contests/nikkei2019-qual/tasks/nikkei2019_qual_a
N个人做两道题,A个人做对了第一题,B个人做对了第二题
问至多和至少有多少人做对了两个题
N个人回答两个Yes No的问题
A个人第一个问题回答Yes
B个人第二个问题回答Yes
问至多有多少人两个都是Yes?
问至少有多少人两个都是Yes?
https://atcoder.jp/contests/nikkei2019-qual/tasks/nikkei2019_qual_b
输入三个长度相等的字符串,每次操作可以修改其中一个字符串的一个位置
目标是让3个字符串相同,问至少多少次操作
https://atcoder.jp/contests/nikkei2019-qual/tasks/nikkei2019_qual_c
https://atcoder.jp/contests/nikkei2019-qual/tasks/nikkei2019_qual_d
https://atcoder.jp/contests/nikkei2019-qual/tasks/nikkei2019_qual_e
https://atcoder.jp/contests/nikkei2019-qual/tasks/nikkei2019_qual_f
https://atcoder.jp/contests/nikkei2019-ex/tasks/nikkei2019ex_a
https://atcoder.jp/contests/nikkei2019-ex/tasks/nikkei2019ex_b
https://atcoder.jp/contests/nikkei2019-ex/tasks/nikkei2019ex_c
https://atcoder.jp/contests/nikkei2019-ex/tasks/nikkei2019ex_d
https://atcoder.jp/contests/nikkei2019-ex/tasks/nikkei2019ex_e
https://atcoder.jp/contests/nikkei2019-ex/tasks/nikkei2019ex_f
https://atcoder.jp/contests/nikkei2019-ex/tasks/nikkei2019ex_g
https://atcoder.jp/contests/nikkei2019-ex/tasks/nikkei2019ex_h
https://atcoder.jp/contests/njpc2017/tasks/njpc2017_a
https://atcoder.jp/contests/njpc2017/tasks/njpc2017_b
https://atcoder.jp/contests/njpc2017/tasks/njpc2017_c
https://atcoder.jp/contests/njpc2017/tasks/njpc2017_d
https://atcoder.jp/contests/njpc2017/tasks/njpc2017_e
https://atcoder.jp/contests/njpc2017/tasks/njpc2017_f
https://atcoder.jp/contests/njpc2017/tasks/njpc2017_g
https://atcoder.jp/contests/njpc2017/tasks/njpc2017_h
https://atcoder.jp/contests/nomura2020/tasks/nomura2020_a
从H1时M1分,到H2时M2分,选出连续K分钟,问起点可能的区间有多长?
https://atcoder.jp/contests/nomura2020/tasks/nomura2020_b
一个只包含D和P的字符串,得分是D出现的次数加上PD出现的次数
输入一个包含D和P和?的字符串,把?替换成D或P,问最多得多少分?
https://atcoder.jp/contests/nomura2020/tasks/nomura2020_c
https://atcoder.jp/contests/nomura2020/tasks/nomura2020_d
https://atcoder.jp/contests/nomura2020/tasks/nomura2020_e
https://atcoder.jp/contests/nomura2020/tasks/nomura2020_f
https://atcoder.jp/contests/NYC2015/tasks/nyc2015_1
https://atcoder.jp/contests/NYC2015/tasks/nyc2015_10
https://atcoder.jp/contests/NYC2015/tasks/nyc2015_11
https://atcoder.jp/contests/NYC2015/tasks/nyc2015_12
https://atcoder.jp/contests/NYC2015/tasks/nyc2015_13
https://atcoder.jp/contests/NYC2015/tasks/nyc2015_2
https://atcoder.jp/contests/NYC2015/tasks/nyc2015_3
https://atcoder.jp/contests/NYC2015/tasks/nyc2015_4
https://atcoder.jp/contests/NYC2015/tasks/nyc2015_5
https://atcoder.jp/contests/NYC2015/tasks/nyc2015_6
https://atcoder.jp/contests/NYC2015/tasks/nyc2015_7
https://atcoder.jp/contests/NYC2015/tasks/nyc2015_8
https://atcoder.jp/contests/NYC2015/tasks/nyc2015_9
https://atcoder.jp/contests/oidashi/tasks/oidashi_a
https://atcoder.jp/contests/oidashi/tasks/oidashi_b
https://atcoder.jp/contests/oidashi/tasks/oidashi_c
https://atcoder.jp/contests/oidashi/tasks/oidashi_d
https://atcoder.jp/contests/oidashi/tasks/oidashi_e
https://atcoder.jp/contests/otemae2019/tasks/otemae2019_a
https://atcoder.jp/contests/otemae2019/tasks/otemae2019_b
https://atcoder.jp/contests/otemae2019/tasks/otemae2019_c
https://atcoder.jp/contests/otemae2019/tasks/otemae2019_d
https://atcoder.jp/contests/otemae2019/tasks/otemae2019_e
https://atcoder.jp/contests/otemae2019/tasks/otemae2019_f
https://atcoder.jp/contests/otemae2019/tasks/otemae2019_g
https://atcoder.jp/contests/otemae2019/tasks/otemae2019_h
https://atcoder.jp/contests/otemae2019/tasks/otemae2019_i
https://atcoder.jp/contests/pakencamp-2018-day2/tasks/pakencamp_2018_day2_a
https://atcoder.jp/contests/pakencamp-2018-day2/tasks/pakencamp_2018_day2_b
https://atcoder.jp/contests/pakencamp-2018-day2/tasks/pakencamp_2018_day2_c
https://atcoder.jp/contests/pakencamp-2018-day2/tasks/pakencamp_2018_day2_d
https://atcoder.jp/contests/pakencamp-2018-day2/tasks/pakencamp_2018_day2_e
https://atcoder.jp/contests/pakencamp-2018-day2/tasks/pakencamp_2018_day2_f
https://atcoder.jp/contests/pakencamp-2018-day2/tasks/pakencamp_2018_day2_g
https://atcoder.jp/contests/pakencamp-2018-day2/tasks/pakencamp_2018_day2_h
https://atcoder.jp/contests/pakencamp-2018-day3/tasks/pakencamp_2018_day3_a
https://atcoder.jp/contests/pakencamp-2018-day3/tasks/pakencamp_2018_day3_b
https://atcoder.jp/contests/pakencamp-2018-day3/tasks/pakencamp_2018_day3_c
https://atcoder.jp/contests/pakencamp-2018-day3/tasks/pakencamp_2018_day3_d
https://atcoder.jp/contests/pakencamp-2018-day3/tasks/pakencamp_2018_day3_e
https://atcoder.jp/contests/pakencamp-2018-day3/tasks/pakencamp_2018_day3_f
https://atcoder.jp/contests/pakencamp-2018-day3/tasks/pakencamp_2018_day3_g
https://atcoder.jp/contests/pakencamp-2018-day3/tasks/pakencamp_2018_day3_h
https://atcoder.jp/contests/pakencamp-2019-day2/tasks/pakencamp_2019_day2_a
https://atcoder.jp/contests/pakencamp-2019-day3/tasks/pakencamp_2019_day3_a
https://atcoder.jp/contests/pakencamp-2019-day3/tasks/pakencamp_2019_day3_b
https://atcoder.jp/contests/pakencamp-2019-day3/tasks/pakencamp_2019_day3_c
https://atcoder.jp/contests/pakencamp-2019-day3/tasks/pakencamp_2019_day3_d
https://atcoder.jp/contests/pakencamp-2019-day3/tasks/pakencamp_2019_day3_e
https://atcoder.jp/contests/pakencamp-2019-day3/tasks/pakencamp_2019_day3_f
https://atcoder.jp/contests/pakencamp-2019-day3/tasks/pakencamp_2019_day3_g
https://atcoder.jp/contests/pakencamp-2019-day3/tasks/pakencamp_2019_day3_h
https://atcoder.jp/contests/pakencamp-2019-day4/tasks/pakencamp_2019_day4_a
https://atcoder.jp/contests/pakencamp-2019-day4/tasks/pakencamp_2019_day4_b
https://atcoder.jp/contests/pakencamp-2019-day4/tasks/pakencamp_2019_day4_c
https://atcoder.jp/contests/pakencamp-2019-day4/tasks/pakencamp_2019_day4_d
https://atcoder.jp/contests/pakencamp-2019-day4/tasks/pakencamp_2019_day4_e
https://atcoder.jp/contests/pakencamp-2019-day4/tasks/pakencamp_2019_day4_f
https://atcoder.jp/contests/pakencamp-2019-day4/tasks/pakencamp_2019_day4_g
https://atcoder.jp/contests/pakencamp-2019-day4/tasks/pakencamp_2019_day4_h
https://atcoder.jp/contests/pakencamp-2020-day1/tasks/pakencamp_2020_day1_a
https://atcoder.jp/contests/pakencamp-2020-day1/tasks/pakencamp_2020_day1_b
https://atcoder.jp/contests/pakencamp-2020-day1/tasks/pakencamp_2020_day1_c
https://atcoder.jp/contests/pakencamp-2020-day1/tasks/pakencamp_2020_day1_d
https://atcoder.jp/contests/pakencamp-2020-day1/tasks/pakencamp_2020_day1_e
https://atcoder.jp/contests/pakencamp-2020-day1/tasks/pakencamp_2020_day1_f
https://atcoder.jp/contests/pakencamp-2020-day1/tasks/pakencamp_2020_day1_g
https://atcoder.jp/contests/pakencamp-2020-day1/tasks/pakencamp_2020_day1_h
https://atcoder.jp/contests/pakencamp-2020-day1/tasks/pakencamp_2020_day1_i
https://atcoder.jp/contests/pakencamp-2020-day1/tasks/pakencamp_2020_day1_j
https://atcoder.jp/contests/pakencamp-2020-day1/tasks/pakencamp_2020_day1_k
https://atcoder.jp/contests/pakencamp-2020-day1/tasks/pakencamp_2020_day1_l
https://atcoder.jp/contests/pakencamp-2020-day1/tasks/pakencamp_2020_day1_m
https://atcoder.jp/contests/pakencamp-2020-day1/tasks/pakencamp_2020_day1_n
https://atcoder.jp/contests/pakencamp-2020-day1/tasks/pakencamp_2020_day1_o
https://atcoder.jp/contests/pakencamp-2020-day2/tasks/pakencamp_2020_day2_a
https://atcoder.jp/contests/pakencamp-2020-day2/tasks/pakencamp_2020_day2_b
https://atcoder.jp/contests/pakencamp-2020-day2/tasks/pakencamp_2020_day2_c
https://atcoder.jp/contests/pakencamp-2020-day2/tasks/pakencamp_2020_day2_d
https://atcoder.jp/contests/pakencamp-2020-day2/tasks/pakencamp_2020_day2_e
https://atcoder.jp/contests/pakencamp-2020-day2/tasks/pakencamp_2020_day2_f
https://atcoder.jp/contests/pakencamp-2020-day2/tasks/pakencamp_2020_day2_g
https://atcoder.jp/contests/pakencamp-2020-day2/tasks/pakencamp_2020_day2_h
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_a
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_b
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_c
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_d
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_e
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_f
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_g
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_h
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_i
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_j
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_k
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_l
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_m
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_n
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_o
https://atcoder.jp/contests/pakencamp-2021-day2/tasks/pakencamp_2021_day2_p
https://atcoder.jp/contests/pakencamp-2021-day3/tasks/pakencamp_2021_day3_a
https://atcoder.jp/contests/pakencamp-2021-day3/tasks/pakencamp_2021_day3_b
https://atcoder.jp/contests/pakencamp-2021-day3/tasks/pakencamp_2021_day3_c
https://atcoder.jp/contests/pakencamp-2021-day3/tasks/pakencamp_2021_day3_d
https://atcoder.jp/contests/pakencamp-2021-day3/tasks/pakencamp_2021_day3_e
https://atcoder.jp/contests/pakencamp-2021-day3/tasks/pakencamp_2021_day3_f
https://atcoder.jp/contests/pakencamp-2021-day3/tasks/pakencamp_2021_day3_g
https://atcoder.jp/contests/pakencamp-2021-day3/tasks/pakencamp_2021_day3_h
https://atcoder.jp/contests/panasonic2020/tasks/panasonic2020_a
问题目中的数字第K个数字是什么?
https://atcoder.jp/contests/panasonic2020/tasks/panasonic2020_b
H行W列的国际象棋棋盘,象从左上角能到多少个格子
https://atcoder.jp/contests/panasonic2020/tasks/panasonic2020_c
输入A B C
问 sqrt(A)+sqrt(B)<sqrt(c)
是否成立
不能直接开根号,必须用整数计算!
https://atcoder.jp/contests/panasonic2020/tasks/panasonic2020_d
https://atcoder.jp/contests/panasonic2020/tasks/panasonic2020_e
https://atcoder.jp/contests/panasonic2020/tasks/panasonic2020_f
https://atcoder.jp/contests/past201912-open/tasks/past201912_a
https://atcoder.jp/contests/past201912-open/tasks/past201912_b
https://atcoder.jp/contests/past201912-open/tasks/past201912_c
https://atcoder.jp/contests/past201912-open/tasks/past201912_d
https://atcoder.jp/contests/past201912-open/tasks/past201912_e
https://atcoder.jp/contests/past201912-open/tasks/past201912_f
https://atcoder.jp/contests/past201912-open/tasks/past201912_g
https://atcoder.jp/contests/past201912-open/tasks/past201912_h
https://atcoder.jp/contests/past201912-open/tasks/past201912_i
https://atcoder.jp/contests/past201912-open/tasks/past201912_j
https://atcoder.jp/contests/past201912-open/tasks/past201912_k
https://atcoder.jp/contests/past201912-open/tasks/past201912_l
https://atcoder.jp/contests/past201912-open/tasks/past201912_m
https://atcoder.jp/contests/past201912-open/tasks/past201912_n
https://atcoder.jp/contests/past201912-open/tasks/past201912_o
https://atcoder.jp/contests/past202004-open/tasks/past202004_a
https://atcoder.jp/contests/past202004-open/tasks/past202004_b
https://atcoder.jp/contests/past202004-open/tasks/past202004_c
https://atcoder.jp/contests/past202004-open/tasks/past202004_d
https://atcoder.jp/contests/past202004-open/tasks/past202004_e
https://atcoder.jp/contests/past202004-open/tasks/past202004_f
https://atcoder.jp/contests/past202004-open/tasks/past202004_g
https://atcoder.jp/contests/past202004-open/tasks/past202004_h
https://atcoder.jp/contests/past202004-open/tasks/past202004_i
https://atcoder.jp/contests/past202004-open/tasks/past202004_j
https://atcoder.jp/contests/past202004-open/tasks/past202004_k
https://atcoder.jp/contests/past202004-open/tasks/past202004_l
https://atcoder.jp/contests/past202004-open/tasks/past202004_m
https://atcoder.jp/contests/past202004-open/tasks/past202004_n
https://atcoder.jp/contests/past202004-open/tasks/past202004_o
https://atcoder.jp/contests/past202005-open/tasks/past202005_a
https://atcoder.jp/contests/past202005-open/tasks/past202005_b
https://atcoder.jp/contests/past202005-open/tasks/past202005_c
https://atcoder.jp/contests/past202005-open/tasks/past202005_d
https://atcoder.jp/contests/past202005-open/tasks/past202005_e
https://atcoder.jp/contests/past202005-open/tasks/past202005_f
https://atcoder.jp/contests/past202005-open/tasks/past202005_g
https://atcoder.jp/contests/past202005-open/tasks/past202005_h
https://atcoder.jp/contests/past202005-open/tasks/past202005_i
https://atcoder.jp/contests/past202005-open/tasks/past202005_j
https://atcoder.jp/contests/past202005-open/tasks/past202005_k
https://atcoder.jp/contests/past202005-open/tasks/past202005_l
https://atcoder.jp/contests/past202005-open/tasks/past202005_m
https://atcoder.jp/contests/past202005-open/tasks/past202005_n
https://atcoder.jp/contests/past202005-open/tasks/past202005_o
https://atcoder.jp/contests/past202010-open/tasks/past202010_a
https://atcoder.jp/contests/past202010-open/tasks/past202010_b
https://atcoder.jp/contests/past202010-open/tasks/past202010_c
https://atcoder.jp/contests/past202010-open/tasks/past202010_d
https://atcoder.jp/contests/past202010-open/tasks/past202010_e
https://atcoder.jp/contests/past202010-open/tasks/past202010_f
https://atcoder.jp/contests/past202010-open/tasks/past202010_g
https://atcoder.jp/contests/past202010-open/tasks/past202010_h
https://atcoder.jp/contests/past202010-open/tasks/past202010_i
https://atcoder.jp/contests/past202010-open/tasks/past202010_j
https://atcoder.jp/contests/past202010-open/tasks/past202010_k
https://atcoder.jp/contests/past202010-open/tasks/past202010_l
https://atcoder.jp/contests/past202010-open/tasks/past202010_m
https://atcoder.jp/contests/past202010-open/tasks/past202010_n
https://atcoder.jp/contests/past202010-open/tasks/past202010_o
https://atcoder.jp/contests/past202012-open/tasks/past202012_a
https://atcoder.jp/contests/past202012-open/tasks/past202012_b
https://atcoder.jp/contests/past202012-open/tasks/past202012_c
https://atcoder.jp/contests/past202012-open/tasks/past202012_d
https://atcoder.jp/contests/past202012-open/tasks/past202012_e
https://atcoder.jp/contests/past202012-open/tasks/past202012_f
https://atcoder.jp/contests/past202012-open/tasks/past202012_g
https://atcoder.jp/contests/past202012-open/tasks/past202012_h
https://atcoder.jp/contests/past202012-open/tasks/past202012_i
https://atcoder.jp/contests/past202012-open/tasks/past202012_j
https://atcoder.jp/contests/past202012-open/tasks/past202012_k
https://atcoder.jp/contests/past202012-open/tasks/past202012_l
https://atcoder.jp/contests/past202012-open/tasks/past202012_m
https://atcoder.jp/contests/past202012-open/tasks/past202012_n
https://atcoder.jp/contests/past202012-open/tasks/past202012_o
https://atcoder.jp/contests/past202104-open/tasks/past202104_a
https://atcoder.jp/contests/past202104-open/tasks/past202104_b
https://atcoder.jp/contests/past202104-open/tasks/past202104_c
https://atcoder.jp/contests/past202104-open/tasks/past202104_d
https://atcoder.jp/contests/past202104-open/tasks/past202104_e
https://atcoder.jp/contests/past202104-open/tasks/past202104_f
https://atcoder.jp/contests/past202104-open/tasks/past202104_g
https://atcoder.jp/contests/past202104-open/tasks/past202104_h
https://atcoder.jp/contests/past202104-open/tasks/past202104_i
https://atcoder.jp/contests/past202104-open/tasks/past202104_j
https://atcoder.jp/contests/past202104-open/tasks/past202104_k
https://atcoder.jp/contests/past202104-open/tasks/past202104_l
https://atcoder.jp/contests/past202104-open/tasks/past202104_m
https://atcoder.jp/contests/past202104-open/tasks/past202104_n
https://atcoder.jp/contests/past202104-open/tasks/past202104_o
https://atcoder.jp/contests/past202107-open/tasks/past202107_a
https://atcoder.jp/contests/past202107-open/tasks/past202107_b
https://atcoder.jp/contests/past202107-open/tasks/past202107_c
https://atcoder.jp/contests/past202107-open/tasks/past202107_d
https://atcoder.jp/contests/past202107-open/tasks/past202107_e
https://atcoder.jp/contests/past202107-open/tasks/past202107_f
https://atcoder.jp/contests/past202107-open/tasks/past202107_g
https://atcoder.jp/contests/past202107-open/tasks/past202107_h
https://atcoder.jp/contests/past202107-open/tasks/past202107_i
https://atcoder.jp/contests/past202107-open/tasks/past202107_j
https://atcoder.jp/contests/past202107-open/tasks/past202107_k
https://atcoder.jp/contests/past202107-open/tasks/past202107_l
https://atcoder.jp/contests/past202107-open/tasks/past202107_m
https://atcoder.jp/contests/past202107-open/tasks/past202107_n
https://atcoder.jp/contests/past202107-open/tasks/past202107_o
https://atcoder.jp/contests/past202109-open/tasks/past202109_a
https://atcoder.jp/contests/past202109-open/tasks/past202109_b
https://atcoder.jp/contests/past202109-open/tasks/past202109_c
https://atcoder.jp/contests/past202109-open/tasks/past202109_d
https://atcoder.jp/contests/past202109-open/tasks/past202109_e
https://atcoder.jp/contests/past202109-open/tasks/past202109_f
https://atcoder.jp/contests/past202109-open/tasks/past202109_g
https://atcoder.jp/contests/past202109-open/tasks/past202109_h
https://atcoder.jp/contests/past202109-open/tasks/past202109_i
https://atcoder.jp/contests/past202109-open/tasks/past202109_j
https://atcoder.jp/contests/past202109-open/tasks/past202109_k
https://atcoder.jp/contests/past202109-open/tasks/past202109_l
https://atcoder.jp/contests/past202109-open/tasks/past202109_m
https://atcoder.jp/contests/past202109-open/tasks/past202109_n
https://atcoder.jp/contests/past202109-open/tasks/past202109_o
https://atcoder.jp/contests/past202112-open/tasks/past202112_a
https://atcoder.jp/contests/past202112-open/tasks/past202112_b
https://atcoder.jp/contests/past202112-open/tasks/past202112_c
https://atcoder.jp/contests/past202112-open/tasks/past202112_d
https://atcoder.jp/contests/past202112-open/tasks/past202112_e
https://atcoder.jp/contests/past202112-open/tasks/past202112_f
https://atcoder.jp/contests/past202112-open/tasks/past202112_g
https://atcoder.jp/contests/past202112-open/tasks/past202112_h
https://atcoder.jp/contests/past202112-open/tasks/past202112_i
https://atcoder.jp/contests/past202112-open/tasks/past202112_j
https://atcoder.jp/contests/past202112-open/tasks/past202112_k
https://atcoder.jp/contests/past202112-open/tasks/past202112_l
https://atcoder.jp/contests/past202112-open/tasks/past202112_m
https://atcoder.jp/contests/past202112-open/tasks/past202112_n
https://atcoder.jp/contests/past202112-open/tasks/past202112_o
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/past202203_a_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/past202203_b_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/past202203_c_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/past202203_d_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/past202203_e_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/past202203_f_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/past202203_g_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/past202203_h_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/past202203_i_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/past202203_j_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/past202203_k_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/past202203_l_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/past202203_m_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/past202203_n_t.md'
Error: ENOENT: no such file or directory, open '/Users/wwwwodddd/Dropbox/Github/Informatics/trans/past202203_o_t.md'
https://atcoder.jp/contests/practice2/tasks/practice2_a
https://atcoder.jp/contests/practice2/tasks/practice2_b
https://atcoder.jp/contests/practice2/tasks/practice2_c
https://atcoder.jp/contests/practice2/tasks/practice2_d
https://atcoder.jp/contests/practice2/tasks/practice2_e
https://atcoder.jp/contests/practice2/tasks/practice2_f
https://atcoder.jp/contests/practice2/tasks/practice2_g
https://atcoder.jp/contests/practice2/tasks/practice2_h
https://atcoder.jp/contests/practice2/tasks/practice2_i
https://atcoder.jp/contests/practice2/tasks/practice2_j
https://atcoder.jp/contests/practice2/tasks/practice2_k
https://atcoder.jp/contests/practice2/tasks/practice2_l
https://atcoder.jp/contests/abs/tasks/practice_1
https://atcoder.jp/contests/qupc2014/tasks/qupc2014_a
https://atcoder.jp/contests/qupc2014/tasks/qupc2014_b
https://atcoder.jp/contests/qupc2014/tasks/qupc2014_c
https://atcoder.jp/contests/qupc2014/tasks/qupc2014_d
https://atcoder.jp/contests/qupc2014/tasks/qupc2014_e
https://atcoder.jp/contests/qupc2014/tasks/qupc2014_f
https://atcoder.jp/contests/qupc2014/tasks/qupc2014_g
https://atcoder.jp/contests/qupc2014/tasks/qupc2014_h
https://atcoder.jp/contests/qupc2018/tasks/qupc2018_a
https://atcoder.jp/contests/qupc2018/tasks/qupc2018_b
https://atcoder.jp/contests/qupc2018/tasks/qupc2018_c
https://atcoder.jp/contests/qupc2018/tasks/qupc2018_d
https://atcoder.jp/contests/qupc2018/tasks/qupc2018_e
https://atcoder.jp/contests/qupc2018/tasks/qupc2018_f
https://atcoder.jp/contests/qupc2018/tasks/qupc2018_g
https://atcoder.jp/contests/qupc2018/tasks/qupc2018_h
https://atcoder.jp/contests/qupc2018/tasks/qupc2018_i
https://atcoder.jp/contests/qupc2018/tasks/qupc2018_j
https://atcoder.jp/contests/rcl-contest-2020-final/tasks/rcl_contest_2020_final_a
https://atcoder.jp/contests/rcl-contest-2020-final/tasks/rcl_contest_2020_final_b
https://atcoder.jp/contests/rcl-contest-2020-qual/tasks/rcl_contest_2020_qual_a
https://atcoder.jp/contests/rcl-contest-2020-qual/tasks/rcl_contest_2020_qual_b
https://atcoder.jp/contests/rcl-contest-2021/tasks/rcl_contest_2021_a
https://atcoder.jp/contests/rcl-contest-2021/tasks/rcl_contest_2021_b
https://atcoder.jp/contests/rcl-contest-2021-long/tasks/rcl_contest_2021_long_a
https://atcoder.jp/contests/rco-contest-2017-final/tasks/rco_contest_2017_final_a
https://atcoder.jp/contests/rco-contest-2017-final/tasks/rco_contest_2017_final_b
https://atcoder.jp/contests/rco-contest-2017-qual/tasks/rco_contest_2017_qual_a
https://atcoder.jp/contests/rco-contest-2017-qual/tasks/rco_contest_2017_qual_b
https://atcoder.jp/contests/rco-contest-2018-final/tasks/rco_contest_2018_final_a
https://atcoder.jp/contests/rco-contest-2018-final/tasks/rco_contest_2018_final_b
https://atcoder.jp/contests/rco-contest-2018-qual/tasks/rco_contest_2018_qual_a
https://atcoder.jp/contests/rco-contest-2018-qual/tasks/rco_contest_2018_qual_b
https://atcoder.jp/contests/rco-contest-2019-final/tasks/rco_contest_2019_final_a
https://atcoder.jp/contests/rco-contest-2019-final/tasks/rco_contest_2019_final_b
https://atcoder.jp/contests/rco-contest-2019-qual/tasks/rco_contest_2019_qual_a
https://atcoder.jp/contests/rco-contest-2019-qual/tasks/rco_contest_2019_qual_b
https://atcoder.jp/contests/Recruit-Programing-contest-practice/tasks/recruite_2013_pre_a
https://atcoder.jp/contests/Recruit-Programing-contest-practice/tasks/recruite_2013_pre_b
https://atcoder.jp/contests/cf18-relay-open/tasks/relay2018_a
https://atcoder.jp/contests/cf18-relay-open/tasks/relay2018_b
https://atcoder.jp/contests/cf18-relay-open/tasks/relay2018_c
https://atcoder.jp/contests/cf18-relay-open/tasks/relay2018_d
https://atcoder.jp/contests/cf18-relay-open/tasks/relay2018_e
https://atcoder.jp/contests/cf18-relay-open/tasks/relay2018_f
https://atcoder.jp/contests/cf18-relay-open/tasks/relay2018_g
https://atcoder.jp/contests/cf18-relay-open/tasks/relay2018_h
https://atcoder.jp/contests/cf18-relay-open/tasks/relay2018_i
https://atcoder.jp/contests/cf18-relay-open/tasks/relay2018_j
https://atcoder.jp/contests/cf17-relay-open/tasks/relay2_a
https://atcoder.jp/contests/cf17-relay-open/tasks/relay2_b
https://atcoder.jp/contests/cf17-relay-open/tasks/relay2_c
https://atcoder.jp/contests/cf17-relay-open/tasks/relay2_d
https://atcoder.jp/contests/cf17-relay-open/tasks/relay2_e
https://atcoder.jp/contests/cf17-relay-open/tasks/relay2_f
https://atcoder.jp/contests/cf17-relay-open/tasks/relay2_g
https://atcoder.jp/contests/cf17-relay-open/tasks/relay2_h
https://atcoder.jp/contests/cf17-relay-open/tasks/relay2_i
https://atcoder.jp/contests/cf17-relay-open/tasks/relay2_j
https://atcoder.jp/contests/cf16-relay-open/tasks/relay_a
https://atcoder.jp/contests/cf16-relay-open/tasks/relay_b
https://atcoder.jp/contests/cf16-relay-open/tasks/relay_c
https://atcoder.jp/contests/cf16-relay-open/tasks/relay_d
https://atcoder.jp/contests/cf16-relay-open/tasks/relay_e
https://atcoder.jp/contests/cf16-relay-open/tasks/relay_f
https://atcoder.jp/contests/cf16-relay-open/tasks/relay_g
https://atcoder.jp/contests/cf16-relay-open/tasks/relay_h
https://atcoder.jp/contests/cf16-relay-open/tasks/relay_i
https://atcoder.jp/contests/cf16-relay-open/tasks/relay_j
https://atcoder.jp/contests/cf16-relay-open/tasks/relay_k
https://atcoder.jp/contests/s8pc-1/tasks/s8pc_1_a
https://atcoder.jp/contests/s8pc-1/tasks/s8pc_1_b
https://atcoder.jp/contests/s8pc-1/tasks/s8pc_1_c
https://atcoder.jp/contests/s8pc-1/tasks/s8pc_1_d
https://atcoder.jp/contests/s8pc-1/tasks/s8pc_1_e
https://atcoder.jp/contests/s8pc-1/tasks/s8pc_1_f
https://atcoder.jp/contests/s8pc-1/tasks/s8pc_1_g
https://atcoder.jp/contests/s8pc-1/tasks/s8pc_1_h
https://atcoder.jp/contests/s8pc-2/tasks/s8pc_2_a
https://atcoder.jp/contests/s8pc-2/tasks/s8pc_2_b
https://atcoder.jp/contests/s8pc-2/tasks/s8pc_2_c
https://atcoder.jp/contests/s8pc-2/tasks/s8pc_2_d
https://atcoder.jp/contests/s8pc-2/tasks/s8pc_2_e
https://atcoder.jp/contests/s8pc-2/tasks/s8pc_2_f
https://atcoder.jp/contests/s8pc-2/tasks/s8pc_2_g
https://atcoder.jp/contests/s8pc-2/tasks/s8pc_2_h
https://atcoder.jp/contests/s8pc-3/tasks/s8pc_3_a
https://atcoder.jp/contests/s8pc-3/tasks/s8pc_3_b
https://atcoder.jp/contests/s8pc-3/tasks/s8pc_3_c
https://atcoder.jp/contests/s8pc-3/tasks/s8pc_3_d
https://atcoder.jp/contests/s8pc-3/tasks/s8pc_3_e
https://atcoder.jp/contests/s8pc-3/tasks/s8pc_3_f
https://atcoder.jp/contests/s8pc-3/tasks/s8pc_3_g
https://atcoder.jp/contests/s8pc-3/tasks/s8pc_3_h
https://atcoder.jp/contests/s8pc-4/tasks/s8pc_4_a
https://atcoder.jp/contests/s8pc-4/tasks/s8pc_4_b
https://atcoder.jp/contests/s8pc-4/tasks/s8pc_4_c
https://atcoder.jp/contests/s8pc-4/tasks/s8pc_4_d
https://atcoder.jp/contests/s8pc-4/tasks/s8pc_4_e
https://atcoder.jp/contests/s8pc-4/tasks/s8pc_4_f
https://atcoder.jp/contests/s8pc-4/tasks/s8pc_4_g
https://atcoder.jp/contests/s8pc-4/tasks/s8pc_4_h
https://atcoder.jp/contests/s8pc-5/tasks/s8pc_5_a
https://atcoder.jp/contests/s8pc-5/tasks/s8pc_5_b
https://atcoder.jp/contests/s8pc-5/tasks/s8pc_5_c
https://atcoder.jp/contests/s8pc-5/tasks/s8pc_5_d
https://atcoder.jp/contests/s8pc-5/tasks/s8pc_5_e
https://atcoder.jp/contests/s8pc-5/tasks/s8pc_5_f
https://atcoder.jp/contests/s8pc-5/tasks/s8pc_5_g
https://atcoder.jp/contests/s8pc-5/tasks/s8pc_5_h
https://atcoder.jp/contests/s8pc-5/tasks/s8pc_5_i
https://atcoder.jp/contests/s8pc-6/tasks/s8pc_6_a
https://atcoder.jp/contests/s8pc-6/tasks/s8pc_6_b
https://atcoder.jp/contests/s8pc-6/tasks/s8pc_6_c
https://atcoder.jp/contests/s8pc-6/tasks/s8pc_6_d
https://atcoder.jp/contests/s8pc-6/tasks/s8pc_6_e
https://atcoder.jp/contests/s8pc-6/tasks/s8pc_6_f
https://atcoder.jp/contests/s8pc-6/tasks/s8pc_6_g
https://atcoder.jp/contests/s8pc-6/tasks/s8pc_6_h
https://atcoder.jp/contests/s8pc-6/tasks/s8pc_6_i
https://atcoder.jp/contests/snuke21/tasks/snuke21_a
https://atcoder.jp/contests/snuke21/tasks/snuke21_b
https://atcoder.jp/contests/snuke21/tasks/snuke21_c
https://atcoder.jp/contests/snuke21/tasks/snuke21_d
https://atcoder.jp/contests/snuke21/tasks/snuke21_e
https://atcoder.jp/contests/snuke21/tasks/snuke21_f
https://atcoder.jp/contests/snuke21/tasks/snuke21_g
https://atcoder.jp/contests/snuke21/tasks/snuke21_h
https://atcoder.jp/contests/snuke21/tasks/snuke21_i
https://atcoder.jp/contests/snuke21/tasks/snuke21_j
https://atcoder.jp/contests/soundhound2018/tasks/soundhound2018_a
https://atcoder.jp/contests/soundhound2018/tasks/soundhound2018_b
https://atcoder.jp/contests/soundhound2018/tasks/soundhound2018_c
https://atcoder.jp/contests/soundhound2018/tasks/soundhound2018_d
https://atcoder.jp/contests/soundhound2018/tasks/soundhound2018_e
https://atcoder.jp/contests/soundhound2018-summer-final/tasks/soundhound2018_summer_final_a
https://atcoder.jp/contests/soundhound2018-summer-final/tasks/soundhound2018_summer_final_b
https://atcoder.jp/contests/soundhound2018-summer-final/tasks/soundhound2018_summer_final_c
https://atcoder.jp/contests/soundhound2018-summer-final/tasks/soundhound2018_summer_final_d
https://atcoder.jp/contests/soundhound2018-summer-final/tasks/soundhound2018_summer_final_e
https://atcoder.jp/contests/soundhound2018-summer-qual/tasks/soundhound2018_summer_qual_a
输入a和b,如果a+b==15
输出+
,如果a*b==15
输出*
,如果都不符合输出x
。
https://atcoder.jp/contests/soundhound2018-summer-qual/tasks/soundhound2018_summer_qual_b
输入一个字符串S和w,字符串下标从0开始
输出所有w的倍数的位置的字符
https://atcoder.jp/contests/soundhound2018-summer-qual/tasks/soundhound2018_summer_qual_c
https://atcoder.jp/contests/soundhound2018-summer-qual/tasks/soundhound2018_summer_qual_d
https://atcoder.jp/contests/soundhound2018-summer-qual/tasks/soundhound2018_summer_qual_e
https://atcoder.jp/contests/stage0-2021/tasks/stage0_2021_a
https://atcoder.jp/contests/sumitrust2019/tasks/sumitb2019_a
https://atcoder.jp/contests/sumitrust2019/tasks/sumitb2019_b
https://atcoder.jp/contests/sumitrust2019/tasks/sumitb2019_c
https://atcoder.jp/contests/sumitrust2019/tasks/sumitb2019_d
https://atcoder.jp/contests/sumitrust2019/tasks/sumitb2019_e
https://atcoder.jp/contests/sumitrust2019/tasks/sumitb2019_f
https://atcoder.jp/contests/summerfes2018-div2/tasks/summerfes2018_a
https://atcoder.jp/contests/summerfes2018-div2/tasks/summerfes2018_b
https://atcoder.jp/contests/summerfes2018-div2/tasks/summerfes2018_c
https://atcoder.jp/contests/summerfes2018-div1/tasks/summerfes2018_d
https://atcoder.jp/contests/summerfes2018-div1/tasks/summerfes2018_e
https://atcoder.jp/contests/summerfes2018-div1/tasks/summerfes2018_f
https://atcoder.jp/contests/summerfes2018-div1/tasks/summerfes2018_g
https://atcoder.jp/contests/summerfes2018-div1/tasks/summerfes2018_h
https://atcoder.jp/contests/summerfes2018-div1/tasks/summerfes2018_i
https://atcoder.jp/contests/summerfes2018-div1/tasks/summerfes2018_j
https://atcoder.jp/contests/tdpc/tasks/tdpc_ball
https://atcoder.jp/contests/tdpc/tasks/tdpc_cat
https://atcoder.jp/contests/tdpc/tasks/tdpc_concatenation
https://atcoder.jp/contests/tdpc/tasks/tdpc_contest
https://atcoder.jp/contests/tdpc/tasks/tdpc_dice
https://atcoder.jp/contests/tdpc/tasks/tdpc_eel
https://atcoder.jp/contests/tdpc/tasks/tdpc_fibonacci
https://atcoder.jp/contests/tdpc/tasks/tdpc_game
https://atcoder.jp/contests/tdpc/tasks/tdpc_graph
https://atcoder.jp/contests/tdpc/tasks/tdpc_grid
https://atcoder.jp/contests/tdpc/tasks/tdpc_house
https://atcoder.jp/contests/tdpc/tasks/tdpc_iwi
https://atcoder.jp/contests/tdpc/tasks/tdpc_knapsack
https://atcoder.jp/contests/tdpc/tasks/tdpc_lexicographical
https://atcoder.jp/contests/tdpc/tasks/tdpc_number
https://atcoder.jp/contests/tdpc/tasks/tdpc_semiexp
https://atcoder.jp/contests/tdpc/tasks/tdpc_string
https://atcoder.jp/contests/tdpc/tasks/tdpc_target
https://atcoder.jp/contests/tdpc/tasks/tdpc_tournament
https://atcoder.jp/contests/tdpc/tasks/tdpc_tree
https://atcoder.jp/contests/tenka1-2012-qualC/tasks/tenka1_2012_10
https://atcoder.jp/contests/tenka1-2012-qualC/tasks/tenka1_2012_11
https://atcoder.jp/contests/tenka1-2012-qualC/tasks/tenka1_2012_12
https://atcoder.jp/contests/tenka1-2012-qualB/tasks/tenka1_2012_5
https://atcoder.jp/contests/tenka1-2012-qualB/tasks/tenka1_2012_6
https://atcoder.jp/contests/tenka1-2012-qualB/tasks/tenka1_2012_7
https://atcoder.jp/contests/tenka1-2012-qualB/tasks/tenka1_2012_8
https://atcoder.jp/contests/tenka1-2012-qualC/tasks/tenka1_2012_9
https://atcoder.jp/contests/tenka1-2012-final/tasks/tenka1_2012_final_a
https://atcoder.jp/contests/tenka1-2012-final/tasks/tenka1_2012_final_b
https://atcoder.jp/contests/tenka1-2012-final/tasks/tenka1_2012_final_c
https://atcoder.jp/contests/tenka1-2012-final/tasks/tenka1_2012_final_d
https://atcoder.jp/contests/tenka1-2012-final/tasks/tenka1_2012_final_e
https://atcoder.jp/contests/tenka1-2012-qualA/tasks/tenka1_2012_qualA_1
https://atcoder.jp/contests/tenka1-2012-qualA/tasks/tenka1_2012_qualA_2
https://atcoder.jp/contests/tenka1-2012-qualA/tasks/tenka1_2012_qualA_3
https://atcoder.jp/contests/tenka1-2012-qualA/tasks/tenka1_2012_qualA_4
https://atcoder.jp/contests/tenka1-2013-final/tasks/tenka1_2013_final_a
https://atcoder.jp/contests/tenka1-2013-final/tasks/tenka1_2013_final_b
https://atcoder.jp/contests/tenka1-2013-final/tasks/tenka1_2013_final_c
https://atcoder.jp/contests/tenka1-2013-final/tasks/tenka1_2013_final_d
https://atcoder.jp/contests/tenka1-2013-final/tasks/tenka1_2013_final_e
https://atcoder.jp/contests/tenka1-2013-quala/tasks/tenka1_2013_qualA_a
https://atcoder.jp/contests/tenka1-2013-quala/tasks/tenka1_2013_qualA_b
https://atcoder.jp/contests/tenka1-2013-quala/tasks/tenka1_2013_qualA_c
https://atcoder.jp/contests/tenka1-2013-quala/tasks/tenka1_2013_qualA_d
https://atcoder.jp/contests/tenka1-2013-quala/tasks/tenka1_2013_qualA_e
https://atcoder.jp/contests/tenka1-2013-qualb/tasks/tenka1_2013_qualB_a
https://atcoder.jp/contests/tenka1-2013-qualb/tasks/tenka1_2013_qualB_b
https://atcoder.jp/contests/tenka1-2013-qualb/tasks/tenka1_2013_qualB_c
https://atcoder.jp/contests/tenka1-2013-qualb/tasks/tenka1_2013_qualB_d
https://atcoder.jp/contests/tenka1-2013-qualb/tasks/tenka1_2013_qualB_e
https://atcoder.jp/contests/tenka1-2014-final-open/tasks/tenka1_2014_final_a
https://atcoder.jp/contests/tenka1-2014-final-open/tasks/tenka1_2014_final_b
https://atcoder.jp/contests/tenka1-2014-final-open/tasks/tenka1_2014_final_c
https://atcoder.jp/contests/tenka1-2014-final-open/tasks/tenka1_2014_final_d
https://atcoder.jp/contests/tenka1-2014-final-open/tasks/tenka1_2014_final_e
https://atcoder.jp/contests/tenka1-2014-quala/tasks/tenka1_2014_qualA_a
https://atcoder.jp/contests/tenka1-2014-quala/tasks/tenka1_2014_qualA_b
https://atcoder.jp/contests/tenka1-2014-quala/tasks/tenka1_2014_qualA_c
https://atcoder.jp/contests/tenka1-2014-quala/tasks/tenka1_2014_qualA_d
https://atcoder.jp/contests/tenka1-2014-quala/tasks/tenka1_2014_qualA_e
https://atcoder.jp/contests/tenka1-2014-qualb/tasks/tenka1_2014_qualB_a
https://atcoder.jp/contests/tenka1-2014-qualb/tasks/tenka1_2014_qualB_b
https://atcoder.jp/contests/tenka1-2014-qualb/tasks/tenka1_2014_qualB_c
https://atcoder.jp/contests/tenka1-2014-qualb/tasks/tenka1_2014_qualB_d
https://atcoder.jp/contests/tenka1-2014-qualb/tasks/tenka1_2014_qualB_e
https://atcoder.jp/contests/tenka1-2015-final/tasks/tenka1_2015_final_a
https://atcoder.jp/contests/tenka1-2015-final/tasks/tenka1_2015_final_b
https://atcoder.jp/contests/tenka1-2015-final/tasks/tenka1_2015_final_c
https://atcoder.jp/contests/tenka1-2015-final/tasks/tenka1_2015_final_d
https://atcoder.jp/contests/tenka1-2015-final/tasks/tenka1_2015_final_e
https://atcoder.jp/contests/tenka1-2015-final/tasks/tenka1_2015_final_f
https://atcoder.jp/contests/tenka1-2015-final/tasks/tenka1_2015_final_g
https://atcoder.jp/contests/tenka1-2015-quala/tasks/tenka1_2015_qualA_a
https://atcoder.jp/contests/tenka1-2015-quala/tasks/tenka1_2015_qualA_b
https://atcoder.jp/contests/tenka1-2015-quala/tasks/tenka1_2015_qualA_c
https://atcoder.jp/contests/tenka1-2015-quala/tasks/tenka1_2015_qualA_d
https://atcoder.jp/contests/tenka1-2015-quala/tasks/tenka1_2015_qualA_e
https://atcoder.jp/contests/tenka1-2015-qualb/tasks/tenka1_2015_qualB_a
https://atcoder.jp/contests/tenka1-2015-qualb/tasks/tenka1_2015_qualB_b
https://atcoder.jp/contests/tenka1-2015-qualb/tasks/tenka1_2015_qualB_c
https://atcoder.jp/contests/tenka1-2015-qualb/tasks/tenka1_2015_qualB_d
https://atcoder.jp/contests/tenka1-2015-qualb/tasks/tenka1_2015_qualB_e
https://atcoder.jp/contests/tenka1-2016-final/tasks/tenka1_2016_final_a
https://atcoder.jp/contests/tenka1-2016-final/tasks/tenka1_2016_final_b
https://atcoder.jp/contests/tenka1-2016-final/tasks/tenka1_2016_final_c
https://atcoder.jp/contests/tenka1-2016-final/tasks/tenka1_2016_final_d
https://atcoder.jp/contests/tenka1-2016-final/tasks/tenka1_2016_final_e
https://atcoder.jp/contests/tenka1-2016-final/tasks/tenka1_2016_final_f
https://atcoder.jp/contests/tenka1-2016-quala/tasks/tenka1_2016_qualA_a
https://atcoder.jp/contests/tenka1-2016-quala/tasks/tenka1_2016_qualA_b
https://atcoder.jp/contests/tenka1-2016-quala/tasks/tenka1_2016_qualA_c
https://atcoder.jp/contests/tenka1-2016-quala/tasks/tenka1_2016_qualA_d
https://atcoder.jp/contests/tenka1-2016-quala/tasks/tenka1_2016_qualA_e
https://atcoder.jp/contests/tenka1-2016-qualb/tasks/tenka1_2016_qualB_a
https://atcoder.jp/contests/tenka1-2016-qualb/tasks/tenka1_2016_qualB_b
https://atcoder.jp/contests/tenka1-2016-qualb/tasks/tenka1_2016_qualB_c
https://atcoder.jp/contests/tenka1-2016-qualb/tasks/tenka1_2016_qualB_d
https://atcoder.jp/contests/tenka1-2016-qualb/tasks/tenka1_2016_qualB_e
https://atcoder.jp/contests/tenka1-2017-beginner/tasks/tenka1_2017_a
https://atcoder.jp/contests/tenka1-2017-beginner/tasks/tenka1_2017_b
https://atcoder.jp/contests/tenka1-2017/tasks/tenka1_2017_c
https://atcoder.jp/contests/tenka1-2017/tasks/tenka1_2017_d
https://atcoder.jp/contests/tenka1-2017/tasks/tenka1_2017_e
https://atcoder.jp/contests/tenka1-2017/tasks/tenka1_2017_f
https://atcoder.jp/contests/tenka1-2018-beginner/tasks/tenka1_2018_a
https://atcoder.jp/contests/tenka1-2018-beginner/tasks/tenka1_2018_b
https://atcoder.jp/contests/tenka1-2018/tasks/tenka1_2018_c
https://atcoder.jp/contests/tenka1-2018/tasks/tenka1_2018_d
https://atcoder.jp/contests/tenka1-2018/tasks/tenka1_2018_e
https://atcoder.jp/contests/tenka1-2018/tasks/tenka1_2018_f
https://atcoder.jp/contests/tenka1-2019-beginner/tasks/tenka1_2019_a
https://atcoder.jp/contests/tenka1-2019-beginner/tasks/tenka1_2019_b
https://atcoder.jp/contests/tenka1-2019/tasks/tenka1_2019_c
https://atcoder.jp/contests/tenka1-2019/tasks/tenka1_2019_d
https://atcoder.jp/contests/tenka1-2019/tasks/tenka1_2019_e
https://atcoder.jp/contests/tenka1-2019/tasks/tenka1_2019_f
https://atcoder.jp/contests/language-test-ver1/tasks/test001_a
https://atcoder.jp/contests/language-test-ver1/tasks/test001_b
https://atcoder.jp/contests/language-test-ver1/tasks/test001_c
https://atcoder.jp/contests/language-test-ver1/tasks/test001_d
https://atcoder.jp/contests/language-test-ver1/tasks/test001_e
https://atcoder.jp/contests/language-test-ver1/tasks/test001_f
https://atcoder.jp/contests/language-test-ver1/tasks/test001_g
https://atcoder.jp/contests/tkppc/tasks/tkppc2015_a
https://atcoder.jp/contests/tkppc/tasks/tkppc2015_b
https://atcoder.jp/contests/tkppc/tasks/tkppc2015_c
https://atcoder.jp/contests/tkppc/tasks/tkppc2015_d
https://atcoder.jp/contests/tkppc/tasks/tkppc2015_e
https://atcoder.jp/contests/tkppc/tasks/tkppc2015_f
https://atcoder.jp/contests/tkppc/tasks/tkppc2015_g
https://atcoder.jp/contests/tkppc/tasks/tkppc2015_h
https://atcoder.jp/contests/tkppc/tasks/tkppc2015_i
https://atcoder.jp/contests/tkppc/tasks/tkppc2015_j
https://atcoder.jp/contests/tkppc2/tasks/tkppc2016_a
https://atcoder.jp/contests/tkppc2/tasks/tkppc2016_b
https://atcoder.jp/contests/tkppc2/tasks/tkppc2016_c
https://atcoder.jp/contests/tkppc2/tasks/tkppc2016_d
https://atcoder.jp/contests/tkppc2/tasks/tkppc2016_e
https://atcoder.jp/contests/tkppc2/tasks/tkppc2016_f
https://atcoder.jp/contests/tkppc2/tasks/tkppc2016_g
https://atcoder.jp/contests/tkppc2/tasks/tkppc2016_h
https://atcoder.jp/contests/tkppc2/tasks/tkppc2016_i
https://atcoder.jp/contests/tkppc2/tasks/tkppc2016_j
https://atcoder.jp/contests/tkppc3/tasks/tkppc3_a
https://atcoder.jp/contests/tkppc3/tasks/tkppc3_b
https://atcoder.jp/contests/tkppc3/tasks/tkppc3_c
https://atcoder.jp/contests/tkppc3/tasks/tkppc3_d
https://atcoder.jp/contests/tkppc3/tasks/tkppc3_e
https://atcoder.jp/contests/tkppc3/tasks/tkppc3_f
https://atcoder.jp/contests/tkppc3/tasks/tkppc3_g
https://atcoder.jp/contests/tkppc3/tasks/tkppc3_h
https://atcoder.jp/contests/tkppc3/tasks/tkppc3_i
https://atcoder.jp/contests/tkppc3/tasks/tkppc3_j
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_a
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_b
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_c
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_d
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_e
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_f
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_g
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_h
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_i
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_j
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_k
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_l
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_m
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_n
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_o
https://atcoder.jp/contests/tkppc4-1/tasks/tkppc4_1_p
https://atcoder.jp/contests/tkppc4-2/tasks/tkppc4_2_a
https://atcoder.jp/contests/tkppc4-2/tasks/tkppc4_2_b
https://atcoder.jp/contests/tkppc4-2/tasks/tkppc4_2_c
https://atcoder.jp/contests/tkppc4-2/tasks/tkppc4_2_d
https://atcoder.jp/contests/tkppc4-2/tasks/tkppc4_2_e
https://atcoder.jp/contests/tkppc4-2/tasks/tkppc4_2_f
https://atcoder.jp/contests/tkppc4-2/tasks/tkppc4_2_g
https://atcoder.jp/contests/tkppc4-2/tasks/tkppc4_2_h
https://atcoder.jp/contests/tkppc4-2/tasks/tkppc4_2_i
https://atcoder.jp/contests/tkppc4-2/tasks/tkppc4_2_j
https://atcoder.jp/contests/tkppc4-2/tasks/tkppc4_2_k
https://atcoder.jp/contests/tkppc4-2/tasks/tkppc4_2_l
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_a
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_b
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_c
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_d
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_e
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_f
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_g
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_h
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_i
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_j
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_k
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_l
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_m
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_n
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_o
https://atcoder.jp/contests/tkppc6-1/tasks/tkppc6_1_p
https://atcoder.jp/contests/tkppc6-2/tasks/tkppc6_2_a
https://atcoder.jp/contests/tkppc6-2/tasks/tkppc6_2_b
https://atcoder.jp/contests/tkppc6-2/tasks/tkppc6_2_c
https://atcoder.jp/contests/tkppc6-2/tasks/tkppc6_2_d
https://atcoder.jp/contests/tkppc6-2/tasks/tkppc6_2_e
https://atcoder.jp/contests/tkppc6-2/tasks/tkppc6_2_f
https://atcoder.jp/contests/tkppc6-2/tasks/tkppc6_2_g
https://atcoder.jp/contests/tkppc6-2/tasks/tkppc6_2_h
https://atcoder.jp/contests/tkppc6-2/tasks/tkppc6_2_i
https://atcoder.jp/contests/tkppc6-2/tasks/tkppc6_2_j
https://atcoder.jp/contests/tkppc6-2/tasks/tkppc6_2_k
https://atcoder.jp/contests/tkppc6-2/tasks/tkppc6_2_l
https://atcoder.jp/contests/tkppc6-2/tasks/tkppc6_2_m
https://atcoder.jp/contests/tokiomarine2020/tasks/tokiomarine2020_a
输入一个字符串,输出前三个字母
https://atcoder.jp/contests/tokiomarine2020/tasks/tokiomarine2020_b
https://atcoder.jp/contests/tokiomarine2020/tasks/tokiomarine2020_c
https://atcoder.jp/contests/tokiomarine2020/tasks/tokiomarine2020_d
https://atcoder.jp/contests/tokiomarine2020/tasks/tokiomarine2020_e
https://atcoder.jp/contests/tokiomarine2020/tasks/tokiomarine2020_f
https://atcoder.jp/contests/tricky/tasks/tricky_1
https://atcoder.jp/contests/tricky/tasks/tricky_2
https://atcoder.jp/contests/tricky/tasks/tricky_3
https://atcoder.jp/contests/tricky/tasks/tricky_4
https://atcoder.jp/contests/tricky/tasks/tricky_5
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_a
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_b
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_c
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_d
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_e
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_f
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_g
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_h
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_i
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_j
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_k
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_l
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_m
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_n
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_o
https://atcoder.jp/contests/ttpc2015/tasks/ttpc2015_p
https://atcoder.jp/contests/ttpc2019/tasks/ttpc2019_a
https://atcoder.jp/contests/ttpc2019/tasks/ttpc2019_b
https://atcoder.jp/contests/ttpc2019/tasks/ttpc2019_c
https://atcoder.jp/contests/ttpc2019/tasks/ttpc2019_d
https://atcoder.jp/contests/ttpc2019/tasks/ttpc2019_e
https://atcoder.jp/contests/ttpc2019/tasks/ttpc2019_f
https://atcoder.jp/contests/ttpc2019/tasks/ttpc2019_g
https://atcoder.jp/contests/ttpc2019/tasks/ttpc2019_h
https://atcoder.jp/contests/ttpc2019/tasks/ttpc2019_i
https://atcoder.jp/contests/ttpc2019/tasks/ttpc2019_j
https://atcoder.jp/contests/ttpc2019/tasks/ttpc2019_k
https://atcoder.jp/contests/ttpc2019/tasks/ttpc2019_l
https://atcoder.jp/contests/ttpc2019/tasks/ttpc2019_m
https://atcoder.jp/contests/ttpc2019/tasks/ttpc2019_n
https://atcoder.jp/contests/ttpc2019/tasks/ttpc2019_o
https://atcoder.jp/contests/typical90/tasks/typical90_a
https://atcoder.jp/contests/typical90/tasks/typical90_aa
https://atcoder.jp/contests/typical90/tasks/typical90_ab
https://atcoder.jp/contests/typical90/tasks/typical90_ac
https://atcoder.jp/contests/typical90/tasks/typical90_ad
https://atcoder.jp/contests/typical90/tasks/typical90_ae
https://atcoder.jp/contests/typical90/tasks/typical90_af
https://atcoder.jp/contests/typical90/tasks/typical90_ag
https://atcoder.jp/contests/typical90/tasks/typical90_ah
https://atcoder.jp/contests/typical90/tasks/typical90_ai
https://atcoder.jp/contests/typical90/tasks/typical90_aj
https://atcoder.jp/contests/typical90/tasks/typical90_ak
https://atcoder.jp/contests/typical90/tasks/typical90_al
https://atcoder.jp/contests/typical90/tasks/typical90_am
https://atcoder.jp/contests/typical90/tasks/typical90_an
https://atcoder.jp/contests/typical90/tasks/typical90_ao
https://atcoder.jp/contests/typical90/tasks/typical90_ap
https://atcoder.jp/contests/typical90/tasks/typical90_aq
https://atcoder.jp/contests/typical90/tasks/typical90_ar
https://atcoder.jp/contests/typical90/tasks/typical90_as
https://atcoder.jp/contests/typical90/tasks/typical90_at
https://atcoder.jp/contests/typical90/tasks/typical90_au
https://atcoder.jp/contests/typical90/tasks/typical90_av
https://atcoder.jp/contests/typical90/tasks/typical90_aw
https://atcoder.jp/contests/typical90/tasks/typical90_ax
https://atcoder.jp/contests/typical90/tasks/typical90_ay
https://atcoder.jp/contests/typical90/tasks/typical90_az
https://atcoder.jp/contests/typical90/tasks/typical90_b
https://atcoder.jp/contests/typical90/tasks/typical90_ba
https://atcoder.jp/contests/typical90/tasks/typical90_bb
https://atcoder.jp/contests/typical90/tasks/typical90_bc
https://atcoder.jp/contests/typical90/tasks/typical90_bd
https://atcoder.jp/contests/typical90/tasks/typical90_be
https://atcoder.jp/contests/typical90/tasks/typical90_bf
https://atcoder.jp/contests/typical90/tasks/typical90_bg
https://atcoder.jp/contests/typical90/tasks/typical90_bh
https://atcoder.jp/contests/typical90/tasks/typical90_bi
https://atcoder.jp/contests/typical90/tasks/typical90_bj
https://atcoder.jp/contests/typical90/tasks/typical90_bk
https://atcoder.jp/contests/typical90/tasks/typical90_bl
https://atcoder.jp/contests/typical90/tasks/typical90_bm
https://atcoder.jp/contests/typical90/tasks/typical90_bn
https://atcoder.jp/contests/typical90/tasks/typical90_bo
https://atcoder.jp/contests/typical90/tasks/typical90_bp
https://atcoder.jp/contests/typical90/tasks/typical90_bq
https://atcoder.jp/contests/typical90/tasks/typical90_br
https://atcoder.jp/contests/typical90/tasks/typical90_bs
https://atcoder.jp/contests/typical90/tasks/typical90_bt
https://atcoder.jp/contests/typical90/tasks/typical90_bu
https://atcoder.jp/contests/typical90/tasks/typical90_bv
https://atcoder.jp/contests/typical90/tasks/typical90_bw
https://atcoder.jp/contests/typical90/tasks/typical90_bx
https://atcoder.jp/contests/typical90/tasks/typical90_by
https://atcoder.jp/contests/typical90/tasks/typical90_bz
https://atcoder.jp/contests/typical90/tasks/typical90_c
https://atcoder.jp/contests/typical90/tasks/typical90_ca
https://atcoder.jp/contests/typical90/tasks/typical90_cb
https://atcoder.jp/contests/typical90/tasks/typical90_cc
https://atcoder.jp/contests/typical90/tasks/typical90_cd
https://atcoder.jp/contests/typical90/tasks/typical90_ce
https://atcoder.jp/contests/typical90/tasks/typical90_cf
https://atcoder.jp/contests/typical90/tasks/typical90_cg
https://atcoder.jp/contests/typical90/tasks/typical90_ch
https://atcoder.jp/contests/typical90/tasks/typical90_ci
https://atcoder.jp/contests/typical90/tasks/typical90_cj
https://atcoder.jp/contests/typical90/tasks/typical90_ck
https://atcoder.jp/contests/typical90/tasks/typical90_cl
https://atcoder.jp/contests/typical90/tasks/typical90_d
https://atcoder.jp/contests/typical90/tasks/typical90_e
https://atcoder.jp/contests/typical90/tasks/typical90_f
https://atcoder.jp/contests/typical90/tasks/typical90_g
https://atcoder.jp/contests/typical90/tasks/typical90_h
https://atcoder.jp/contests/typical90/tasks/typical90_i
https://atcoder.jp/contests/typical90/tasks/typical90_j
https://atcoder.jp/contests/typical90/tasks/typical90_k
https://atcoder.jp/contests/typical90/tasks/typical90_l
https://atcoder.jp/contests/typical90/tasks/typical90_m
https://atcoder.jp/contests/typical90/tasks/typical90_n
https://atcoder.jp/contests/typical90/tasks/typical90_o
https://atcoder.jp/contests/typical90/tasks/typical90_p
https://atcoder.jp/contests/typical90/tasks/typical90_q
https://atcoder.jp/contests/typical90/tasks/typical90_r
https://atcoder.jp/contests/typical90/tasks/typical90_s
https://atcoder.jp/contests/typical90/tasks/typical90_t
https://atcoder.jp/contests/typical90/tasks/typical90_u
https://atcoder.jp/contests/typical90/tasks/typical90_v
https://atcoder.jp/contests/typical90/tasks/typical90_w
https://atcoder.jp/contests/typical90/tasks/typical90_x
https://atcoder.jp/contests/typical90/tasks/typical90_y
https://atcoder.jp/contests/typical90/tasks/typical90_z
https://atcoder.jp/contests/ukuku09/tasks/ukuku09_a
https://atcoder.jp/contests/ukuku09/tasks/ukuku09_b
https://atcoder.jp/contests/ukuku09/tasks/ukuku09_c
https://atcoder.jp/contests/ukuku09/tasks/ukuku09_d
https://atcoder.jp/contests/ukuku09/tasks/ukuku09_e
https://atcoder.jp/contests/atc001/tasks/unionfind_a
https://atcoder.jp/contests/utpc2011/tasks/utpc2011_1
https://atcoder.jp/contests/utpc2011/tasks/utpc2011_10
https://atcoder.jp/contests/utpc2011/tasks/utpc2011_11
https://atcoder.jp/contests/utpc2011/tasks/utpc2011_12
https://atcoder.jp/contests/utpc2011/tasks/utpc2011_2
https://atcoder.jp/contests/utpc2011/tasks/utpc2011_3
https://atcoder.jp/contests/utpc2011/tasks/utpc2011_4
https://atcoder.jp/contests/utpc2011/tasks/utpc2011_5
https://atcoder.jp/contests/utpc2011/tasks/utpc2011_6
https://atcoder.jp/contests/utpc2011/tasks/utpc2011_7
https://atcoder.jp/contests/utpc2011/tasks/utpc2011_8
https://atcoder.jp/contests/utpc2011/tasks/utpc2011_9
https://atcoder.jp/contests/utpc2012/tasks/utpc2012_01
https://atcoder.jp/contests/utpc2012/tasks/utpc2012_02
https://atcoder.jp/contests/utpc2012/tasks/utpc2012_03
https://atcoder.jp/contests/utpc2012/tasks/utpc2012_04
https://atcoder.jp/contests/utpc2012/tasks/utpc2012_05
https://atcoder.jp/contests/utpc2012/tasks/utpc2012_06
https://atcoder.jp/contests/utpc2012/tasks/utpc2012_07
https://atcoder.jp/contests/utpc2012/tasks/utpc2012_08
https://atcoder.jp/contests/utpc2012/tasks/utpc2012_09
https://atcoder.jp/contests/utpc2012/tasks/utpc2012_10
https://atcoder.jp/contests/utpc2012/tasks/utpc2012_11
https://atcoder.jp/contests/utpc2012/tasks/utpc2012_12
https://atcoder.jp/contests/utpc2013/tasks/utpc2013_01
https://atcoder.jp/contests/utpc2013/tasks/utpc2013_02
https://atcoder.jp/contests/utpc2013/tasks/utpc2013_03
https://atcoder.jp/contests/utpc2013/tasks/utpc2013_04
https://atcoder.jp/contests/utpc2013/tasks/utpc2013_05
https://atcoder.jp/contests/utpc2013/tasks/utpc2013_06
https://atcoder.jp/contests/utpc2013/tasks/utpc2013_07
https://atcoder.jp/contests/utpc2013/tasks/utpc2013_08
https://atcoder.jp/contests/utpc2013/tasks/utpc2013_09
https://atcoder.jp/contests/utpc2013/tasks/utpc2013_10
https://atcoder.jp/contests/utpc2013/tasks/utpc2013_11
https://atcoder.jp/contests/utpc2013/tasks/utpc2013_12
https://atcoder.jp/contests/utpc2014/tasks/utpc2014_a
https://atcoder.jp/contests/utpc2014/tasks/utpc2014_b
https://atcoder.jp/contests/utpc2014/tasks/utpc2014_c
https://atcoder.jp/contests/utpc2014/tasks/utpc2014_d
https://atcoder.jp/contests/utpc2014/tasks/utpc2014_e
https://atcoder.jp/contests/utpc2014/tasks/utpc2014_f
https://atcoder.jp/contests/utpc2014/tasks/utpc2014_g
https://atcoder.jp/contests/utpc2014/tasks/utpc2014_h
https://atcoder.jp/contests/utpc2014/tasks/utpc2014_i
https://atcoder.jp/contests/utpc2014/tasks/utpc2014_j
https://atcoder.jp/contests/utpc2014/tasks/utpc2014_k
https://atcoder.jp/contests/utpc2014/tasks/utpc2014_l
https://atcoder.jp/contests/utpc2020/tasks/utpc2020_a
https://atcoder.jp/contests/utpc2020/tasks/utpc2020_b
https://atcoder.jp/contests/utpc2020/tasks/utpc2020_c
https://atcoder.jp/contests/utpc2020/tasks/utpc2020_d
https://atcoder.jp/contests/utpc2020/tasks/utpc2020_e
https://atcoder.jp/contests/utpc2020/tasks/utpc2020_f
https://atcoder.jp/contests/utpc2020/tasks/utpc2020_g
https://atcoder.jp/contests/utpc2020/tasks/utpc2020_h
https://atcoder.jp/contests/utpc2020/tasks/utpc2020_i
https://atcoder.jp/contests/utpc2020/tasks/utpc2020_j
https://atcoder.jp/contests/utpc2020/tasks/utpc2020_k
https://atcoder.jp/contests/utpc2020/tasks/utpc2020_l
https://atcoder.jp/contests/utpc2020/tasks/utpc2020_m
https://atcoder.jp/contests/utpc2021/tasks/utpc2021_a
https://atcoder.jp/contests/utpc2021/tasks/utpc2021_b
https://atcoder.jp/contests/utpc2021/tasks/utpc2021_c
https://atcoder.jp/contests/utpc2021/tasks/utpc2021_d
https://atcoder.jp/contests/utpc2021/tasks/utpc2021_e
https://atcoder.jp/contests/utpc2021/tasks/utpc2021_f
https://atcoder.jp/contests/utpc2021/tasks/utpc2021_g
https://atcoder.jp/contests/utpc2021/tasks/utpc2021_h
https://atcoder.jp/contests/utpc2021/tasks/utpc2021_i
https://atcoder.jp/contests/utpc2021/tasks/utpc2021_j
https://atcoder.jp/contests/utpc2021/tasks/utpc2021_k
https://atcoder.jp/contests/utpc2021/tasks/utpc2021_l
https://atcoder.jp/contests/utpc2021/tasks/utpc2021_m
https://atcoder.jp/contests/utpc2021/tasks/utpc2021_n
https://atcoder.jp/contests/wn2017_1/tasks/wn2017_1_a
https://atcoder.jp/contests/wtf19-open/tasks/wtf19_a
https://atcoder.jp/contests/wtf19-open/tasks/wtf19_b
https://atcoder.jp/contests/wtf19-open/tasks/wtf19_c1
https://atcoder.jp/contests/wtf19-open/tasks/wtf19_c2
https://atcoder.jp/contests/wtf19-open/tasks/wtf19_d
https://atcoder.jp/contests/wtf19-open/tasks/wtf19_e
https://atcoder.jp/contests/wupc2012/tasks/wupc2012_1
https://atcoder.jp/contests/wupc2012/tasks/wupc2012_2
https://atcoder.jp/contests/wupc2012/tasks/wupc2012_3
https://atcoder.jp/contests/wupc2012/tasks/wupc2012_4
https://atcoder.jp/contests/wupc2012/tasks/wupc2012_5
https://atcoder.jp/contests/wupc2012/tasks/wupc2012_6
https://atcoder.jp/contests/wupc2019/tasks/wupc2019_a
https://atcoder.jp/contests/wupc2019/tasks/wupc2019_b
https://atcoder.jp/contests/wupc2019/tasks/wupc2019_c
https://atcoder.jp/contests/wupc2019/tasks/wupc2019_d
https://atcoder.jp/contests/wupc2019/tasks/wupc2019_e
https://atcoder.jp/contests/wupc2019/tasks/wupc2019_f
https://atcoder.jp/contests/wupc2019/tasks/wupc2019_g
https://atcoder.jp/contests/wupc2019/tasks/wupc2019_h
https://atcoder.jp/contests/wupc2019/tasks/wupc2019_i
https://atcoder.jp/contests/wupc2019/tasks/wupc2019_j
https://atcoder.jp/contests/wupc2nd/tasks/wupc_01
https://atcoder.jp/contests/wupc2nd/tasks/wupc_02
https://atcoder.jp/contests/wupc2nd/tasks/wupc_03
https://atcoder.jp/contests/wupc2nd/tasks/wupc_04
https://atcoder.jp/contests/wupc2nd/tasks/wupc_05
https://atcoder.jp/contests/wupc2nd/tasks/wupc_06
https://atcoder.jp/contests/wupc2nd/tasks/wupc_07
https://atcoder.jp/contests/wupc2nd/tasks/wupc_08
https://atcoder.jp/contests/wupc2nd/tasks/wupc_09
https://atcoder.jp/contests/xmascon16midnight/tasks/xmascon16_a
https://atcoder.jp/contests/xmascon16midnight/tasks/xmascon16_b
https://atcoder.jp/contests/xmascon16midnight/tasks/xmascon16_c
https://atcoder.jp/contests/xmascon16midnight/tasks/xmascon16_d
https://atcoder.jp/contests/xmascon16midnight/tasks/xmascon16_e
https://atcoder.jp/contests/xmascon16midnight/tasks/xmascon16_f
https://atcoder.jp/contests/xmascon16midnight/tasks/xmascon16_g
https://atcoder.jp/contests/xmascon16midnight/tasks/xmascon16_h
https://atcoder.jp/contests/xmascon16midnight/tasks/xmascon16_i
https://atcoder.jp/contests/xmascon16midnight/tasks/xmascon16_j
https://atcoder.jp/contests/xmascon17/tasks/xmascon17_a
https://atcoder.jp/contests/xmascon17/tasks/xmascon17_b
https://atcoder.jp/contests/xmascon17/tasks/xmascon17_c
https://atcoder.jp/contests/xmascon17/tasks/xmascon17_d
https://atcoder.jp/contests/xmascon17/tasks/xmascon17_e
https://atcoder.jp/contests/xmascon17/tasks/xmascon17_f
https://atcoder.jp/contests/xmascon17/tasks/xmascon17_g
https://atcoder.jp/contests/xmascon17/tasks/xmascon17_h
https://atcoder.jp/contests/xmascon17/tasks/xmascon17_i
https://atcoder.jp/contests/xmascon18/tasks/xmascon18_a
https://atcoder.jp/contests/xmascon18/tasks/xmascon18_b
https://atcoder.jp/contests/xmascon18/tasks/xmascon18_c
https://atcoder.jp/contests/xmascon18/tasks/xmascon18_d
https://atcoder.jp/contests/xmascon18/tasks/xmascon18_e
https://atcoder.jp/contests/xmascon18/tasks/xmascon18_f
https://atcoder.jp/contests/xmascon18/tasks/xmascon18_g
https://atcoder.jp/contests/xmascon18/tasks/xmascon18_h
https://atcoder.jp/contests/xmascon18/tasks/xmascon18_i
https://atcoder.jp/contests/xmascon18/tasks/xmascon18_j
https://atcoder.jp/contests/xmascon19/tasks/xmascon19_a
https://atcoder.jp/contests/xmascon19/tasks/xmascon19_b
https://atcoder.jp/contests/xmascon19/tasks/xmascon19_c
https://atcoder.jp/contests/xmascon19/tasks/xmascon19_d
https://atcoder.jp/contests/xmascon19/tasks/xmascon19_e
https://atcoder.jp/contests/xmascon19/tasks/xmascon19_f
https://atcoder.jp/contests/xmascon19/tasks/xmascon19_g
https://atcoder.jp/contests/xmascon19/tasks/xmascon19_h
https://atcoder.jp/contests/xmascon19/tasks/xmascon19_i
https://atcoder.jp/contests/xmascon19/tasks/xmascon19_j
https://atcoder.jp/contests/xmascon19/tasks/xmascon19_k
https://atcoder.jp/contests/xmascon19/tasks/xmascon19_l
https://atcoder.jp/contests/xmascon20/tasks/xmascon20_a
https://atcoder.jp/contests/xmascon20/tasks/xmascon20_b
https://atcoder.jp/contests/xmascon20/tasks/xmascon20_c
https://atcoder.jp/contests/xmascon20/tasks/xmascon20_d
https://atcoder.jp/contests/xmascon20/tasks/xmascon20_e
https://atcoder.jp/contests/xmascon20/tasks/xmascon20_f
https://atcoder.jp/contests/xmascon20/tasks/xmascon20_g
https://atcoder.jp/contests/xmascon20/tasks/xmascon20_h
https://atcoder.jp/contests/xmascon20/tasks/xmascon20_i
https://atcoder.jp/contests/xmascon21/tasks/xmascon21_a
https://atcoder.jp/contests/xmascon21/tasks/xmascon21_b
https://atcoder.jp/contests/xmascon21/tasks/xmascon21_c
https://atcoder.jp/contests/xmascon21/tasks/xmascon21_d
https://atcoder.jp/contests/xmascon21/tasks/xmascon21_e
https://atcoder.jp/contests/xmascon21/tasks/xmascon21_f
https://atcoder.jp/contests/xmascon21/tasks/xmascon21_g
https://atcoder.jp/contests/xmascon21/tasks/xmascon21_h
https://atcoder.jp/contests/xmascon21/tasks/xmascon21_i
https://atcoder.jp/contests/xmascontest2015/tasks/xmascontest2015_a
https://atcoder.jp/contests/xmascontest2015/tasks/xmascontest2015_b
https://atcoder.jp/contests/xmascontest2015/tasks/xmascontest2015_c
https://atcoder.jp/contests/xmascontest2015/tasks/xmascontest2015_d
https://atcoder.jp/contests/xmascontest2015/tasks/xmascontest2015_e
https://atcoder.jp/contests/xmascontest2015/tasks/xmascontest2015_f
https://atcoder.jp/contests/xmascontest2015/tasks/xmascontest2015_g
https://atcoder.jp/contests/xmascontest2015/tasks/xmascontest2015_h
https://atcoder.jp/contests/yahoo-procon2017-final/tasks/yahoo_procon2017_final_a
https://atcoder.jp/contests/yahoo-procon2017-final/tasks/yahoo_procon2017_final_b
https://atcoder.jp/contests/yahoo-procon2017-final/tasks/yahoo_procon2017_final_c
https://atcoder.jp/contests/yahoo-procon2017-final/tasks/yahoo_procon2017_final_d
https://atcoder.jp/contests/yahoo-procon2017-final/tasks/yahoo_procon2017_final_e
https://atcoder.jp/contests/yahoo-procon2017-qual/tasks/yahoo_procon2017_qual_a
https://atcoder.jp/contests/yahoo-procon2017-qual/tasks/yahoo_procon2017_qual_b
https://atcoder.jp/contests/yahoo-procon2017-qual/tasks/yahoo_procon2017_qual_c
https://atcoder.jp/contests/yahoo-procon2017-qual/tasks/yahoo_procon2017_qual_d
https://atcoder.jp/contests/yahoo-procon2017-qual/tasks/yahoo_procon2017_qual_e
https://atcoder.jp/contests/yahoo-procon2018-final/tasks/yahoo_procon2018_final_a
https://atcoder.jp/contests/yahoo-procon2018-final/tasks/yahoo_procon2018_final_b
https://atcoder.jp/contests/yahoo-procon2018-final/tasks/yahoo_procon2018_final_c
https://atcoder.jp/contests/yahoo-procon2018-final/tasks/yahoo_procon2018_final_d
https://atcoder.jp/contests/yahoo-procon2018-final/tasks/yahoo_procon2018_final_e
https://atcoder.jp/contests/yahoo-procon2018-qual/tasks/yahoo_procon2018_qual_a
https://atcoder.jp/contests/yahoo-procon2018-qual/tasks/yahoo_procon2018_qual_b
https://atcoder.jp/contests/yahoo-procon2018-qual/tasks/yahoo_procon2018_qual_c
https://atcoder.jp/contests/yahoo-procon2018-qual/tasks/yahoo_procon2018_qual_d
https://atcoder.jp/contests/yahoo-procon2018-qual/tasks/yahoo_procon2018_qual_e
https://atcoder.jp/contests/yahoo-procon2019-final/tasks/yahoo_procon2019_final_a
https://atcoder.jp/contests/yahoo-procon2019-final/tasks/yahoo_procon2019_final_b
https://atcoder.jp/contests/yahoo-procon2019-final/tasks/yahoo_procon2019_final_c
https://atcoder.jp/contests/yahoo-procon2019-final/tasks/yahoo_procon2019_final_d
https://atcoder.jp/contests/yahoo-procon2019-final/tasks/yahoo_procon2019_final_e
https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_a
问能不能从1到n中选出k个数字,其中没有两个数字相差1
输入N和K,问能不能从1到N中选K个数字,使得没有任何两个数字的差是1
https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_b
1,2,3,4一共四个点,输入三条边,问是否构成一条链
输入的边是无向的,保证连通
四个点,三条边,问是不是连成了一条路径
https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_c
https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_d
https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_e
https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_f
https://atcoder.jp/contests/yuha-c83/tasks/yuha_c83_01
https://atcoder.jp/contests/yuha-c83/tasks/yuha_c83_02
https://atcoder.jp/contests/yuha-c83/tasks/yuha_c83_03
https://atcoder.jp/contests/yuha-c83/tasks/yuha_c83_04
https://atcoder.jp/contests/yuha-c83/tasks/yuha_c83_05
https://atcoder.jp/contests/yuha-c88/tasks/yuha_c88_a
https://atcoder.jp/contests/yuha-c88/tasks/yuha_c88_b
https://atcoder.jp/contests/yuha-c88/tasks/yuha_c88_c
https://atcoder.jp/contests/yuha-c88/tasks/yuha_c88_d
https://atcoder.jp/contests/yuha-c88/tasks/yuha_c88_e
https://atcoder.jp/contests/yuha-c88/tasks/yuha_c88_f
https://atcoder.jp/contests/yuha-c88/tasks/yuha_c88_g
https://atcoder.jp/contests/yuha-c88/tasks/yuha_c88_h
https://atcoder.jp/contests/yuha-c88/tasks/yuha_c88_i
https://atcoder.jp/contests/yuha-c88/tasks/yuha_c88_j
https://atcoder.jp/contests/zone2021/tasks/zone2021_a
输入一个字符串S,输出ZONe
在其中出现几次?
https://atcoder.jp/contests/zone2021/tasks/zone2021_b
输入N,D,H
目标是距离为D,高度为H的飞碟
但中间有N个障碍物,第i个障碍物的距离是di,高度是hi
问自己要从原地升到多高,才能看到飞碟
https://atcoder.jp/contests/zone2021/tasks/zone2021_c
从n个人中选3个人
每个人有5个属性Ai Bi Ci Di Ei
选出的3个人的5个属性,每一个属性三个人求最大值,得到5个数字
最后的强度是5个属性的最大值中的最小值
最大化最后的强度
https://atcoder.jp/contests/zone2021/tasks/zone2021_d
https://atcoder.jp/contests/zone2021/tasks/zone2021_e