Anoyer_元戎内推:AEMTt
Anoyer_元戎内推:AEMTt
全部文章
分类
51nod(2)
51Nod-题解(4)
ACM(7)
ACM模板(1)
ACM模版(1)
AC自动机(1)
C/C++(1)
Camp(11)
Codeforces(9)
Hash(1)
HDU(8)
POJ(2)
其他(1)
字符串(2)
字符串模版(1)
未归档(83)
输入外挂(1)
题解(13)
归档
标签
去牛客网
登录
/
注册
Anoyer_元戎内推:AEMTt的博客
全部文章
(共12篇)
Codeforces Round #525 (Div. 2) (2)-A. Ehab and another construction problem
博主链接 题目链接 题意: 给你一个x,让你求出两个整数a,b,满足他给的那些条件 题解: 数据范围很小就100,直接O(n*n)暴力枚举就可以了 代码: #include<stdio.h> #include<bits/stdc++.h> using nam...
Codeforces
题解
ACM
2018-12-05
0
609
Codeforces Round #525 (Div. 2) -C. Ehab and a 2-operation task
博主链接 题目链接 Note In the first sample, the array is already increasing so we don’t need any operations. In the second sample: In the first...
ACM
题解
Codeforces
2018-12-05
0
510
首页
上一页
1
2
下一页
末页