Codeforces Round #367 (Div. 2) A思路：%lf",&a,&b); int n; scanf("%d",&n); double ans = 1e9; for(int i = 1;i<=n;i+
原创
2023-06-09 18:25:15
70阅读
A. Beru-taxi time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Vasiliy lives at point (a, b
转载
2016-08-12 09:50:00
268阅读
2评论
原题链接C. Hard problemtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outp
原创
2023-06-12 17:24:40
79阅读
C. Hard problemtime limit per test1 secondmemory limtstandard outputVasiliy is fond of solving different tasks.
原创
2022-08-12 09:47:42
37阅读
原题链接D. Vasiliy's Multisettime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAuthor has gone o
原创
2023-06-12 17:30:08
42阅读
思路：二分upper_bound就好了...#includeusing namespace std;const int maxn = 100000+5;int a[maxn];int main(){ int n; scanf("%d",&n); for(int i = 0;i<n;i++) scanf("%d",&a[i]); sort(a,a
原创
2023-06-09 18:34:53
57阅读
andard outputAuthor has gone out of the stories ab
原创
2022-08-12 09:51:48
53阅读
D. Vasitoutputstandard outputAuthor has gone out of the stories ab
原创
2022-08-12 09:48:51
40阅读
D. Vasiliy's Multiset time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output Author has gone ou
转载
2016-08-12 09:55:00
63阅读
2评论
B. Interestinndard outputVasiliy likes to rest after a hard wor
原创
2022-08-12 09:46:46
155阅读
public class Solution {
public bool IsPerfectSquare(int num) {
int low = 1, high = num;
while (low <= high)
{
long mid = (low + high) >> 1
转载
2017-04-21 16:08:00
20阅读
Youre performing tablespace point-in-time recovery on a tablespace called USERS. If an object inthat tablespace has a foreign key constraint owned by
转载
2017-11-13 14:09:00
40阅读
2评论
阅读目录 "一.楔子" "二.客户端／服务端架构" "三.网络基础" "四.套接字（socket）初使用" "五.黏包" "六.socket的更多方法介绍" "七.验证客户端链接的合法性" "八.socketserver模块" 一.楔子 你现在已经学会了写python代码，假如你写了两个python
转载
2020-03-12 20:26:00
83阅读
2评论
E. Working routinetime limit per test2.5 secondsmemory litstandard outputVasiliy finally got to work, where the
原创
2022-08-12 09:42:57
41阅读
Given a positive integer num, write a function which returns True if num is a perfect square else False.No
原创
2022-08-03 16:31:29
17阅读
367. Valid Perfect Square*
https://leetcode.com/problems/valid-perfe
原创
2022-05-30 10:44:16
20阅读
题目传送门一、题目分析\(Tarjan\) 缩点将原图转化成 \(DAG\)，统计每个强连通分量的出度入度，起点数量为 \(src\)，终点数量为 \(des\)。对于一个强连通分量，其中只要有一所学校获得新软件那么整个分量都能获得。问题一
结论:只要把软件给所有起点即可，答案为起点个数 \(src\)。证明:
所有起点都无法由别的点到达，因此每个起点必须分配一个软件，而对于其他所有点，一
原创
2022-04-20 15:52:18
95阅读
Given a positive integer num, write a function which returns True if num is a perfect squ16Returns: TrueE
原创
2022-08-23 20:24:53
143阅读
