- 博客(3)
- 收藏
- 关注
RSS订阅原创 Codeforces - 1703D
You are given nn strings s1,s2,…,sns1,s2,…,sn of length at most 88.For each string sisi, determine if there exist two strings sjsj and sksk such that si=sj+sksi=sj+sk. That is, sisi is the concatenation of sjsj and sksk. Note that jj can be equal to kk.R
2023-01-05 19:55:47
270
原创 Codeforce 299A - Ksusha and Array
Ksusha is a beginner coder. Today she starts studying arrays. She has array a1, a2, ..., an, consisting of n positive integers.Her university teacher gave her a task. Find such number in the array, that all array elements are divisible by it. Help her an
2022-12-21 21:47:04
328
1
原创 Codeforces 114A-Cifera
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (whic
2022-12-21 21:32:01
1086
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人