cf只有思路,没有代码
worker003
这个作者很懒,什么都没留下…
展开
-
CF-447A
A. QAQ time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output “QAQ” is a word to denote an expression of crying. Imagine “Q” as eyes with tears an原创 2017-11-28 22:36:24 · 238 阅读 · 0 评论 -
CF-897B.Chtholly's request
Chtholly’s request— Thanks a lot for today. — I experienced so many great things.— You gave me memories like dreams… But I have to leave now…— One last request, can you…— Help me solve a Codeforces pr原创 2017-12-09 22:51:46 · 534 阅读 · 0 评论 -
CF-448(Div.2)-A. Pizza Separation
A.Pizza Separation Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius.原创 2017-12-01 21:00:18 · 241 阅读 · 0 评论 -
CodeForces-a
A. Chess For Three time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Alex, Bob and Carl will soon participate in a team chess tournament. Sin原创 2017-11-27 13:04:08 · 223 阅读 · 0 评论 -
CF-B.Beautiful Divisors
题目链接:http://codeforces.com/contest/893/problem/B 这道题的意思是从以上的几个“美丽数”里找出最大的约数,明白这一点就特别好做,接下来唯一的难点就是把范围内的“美丽数”找出来。有两种方法,第一种用计算器算,第二种代码如下:#include<stdio.h> #include<math.h> int main() { int i,a[100],m原创 2017-11-27 19:18:46 · 208 阅读 · 0 评论