Anoyer_元戎内推:AEMTt
Anoyer_元戎内推:AEMTt
全部文章
Codeforces
51nod(2)
51Nod-题解(4)
ACM(7)
ACM模板(1)
ACM模版(1)
AC自动机(1)
C/C++(1)
Camp(11)
Hash(1)
HDU(8)
POJ(2)
其他(1)
字符串(2)
字符串模版(1)
未归档(83)
输入外挂(1)
题解(13)
归档
标签
去牛客网
登录
/
注册
Anoyer_元戎内推:AEMTt的博客
全部文章
/ Codeforces
(共4篇)
D. Vasya And The Matrix------Educational Codeforces Round 48 (Rated for Div. 2)
D. Vasya And The Matrix time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Now Vasya is taking ...
codeforces
ACM
题解
算法
2018-08-04
0
422
B. The Bits--Codeforces Round #502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2)
B. The Bits B. The Bits time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Rudolf is on his way...
codeforces
ACM
算法
2018-08-09
0
642
Codeforces Round #512---B.Vasya and Cornfield
博主链接 题目 题意: 给出一个矩形,顶点坐标具有笛卡尔性质,然后m次询问,每次询问给一个点,温这个点是否再矩形内 解题思路: 因为矩形顶点具有笛卡尔性质所以矩形4条边的方程分别为y=a+x,y=a-x,y=x-a,y=2*n-d-x,所以判断下点和4条边的关系便可值答案 ...
codeforces
ACM
2018-09-23
0
538
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