韧锋zzZ的Blog

B. Minesweeper time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output One day Alex decided to remember childhood when computers were not too powe...

【题目链接】：Educational Codeforces Round 35 (Rated for Div. 2)A. Nearest Minimums time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output ...

【题意】：给你一个数k，求所有使得1/k = 1/x + 1/y成立的x≥y的整数对。枚举y从k+1到2*k， 1/k-1/y 结果的分子是1，分母是整数即可!#include<bits/stdc++.h>using namespace std;int x1[10005],y1[10005];int main(){ int k; int x,y; ...

The heat during the last few days has been really intense. Scientists from all over the Berland study how the temperatures and weather change, and they claim that this summer is abnormally hot. But an...

#include<bits/stdc++.h>using namespace std;int a[5001];int main(){ int i,j; int n,m; while(~scanf("%d%d",&n,&m)){ int cnt=0; memset(a,0,sizeof(a)); ...

A. Points on the line time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output We’ve got no test cases. A big olympiad is coming up. But th...

There are many homeless cats in PKU campus. They are all happy because the students in the cat club of PKU take good care of them. Li lei is one of the members of the cat club. He loves those cats ver...

有一个形似央视大楼（Orz）的筒，从A口可以放球，放进去的球可通过挡板DE使其掉进B裤管或C裤管里，现有带1-10标号的球按给定顺序从A口放入，问是否有一种控制挡板的策略可以使B裤管和C裤管中的球从下往上标号递增。 输入：第一行输入数据组数N。接下来N行为N组具体数据，每组数据中有10个整数，代表球的放入顺序。 输出：对于每组数据，若策略存在，输出YES；若不存在，输出NO ;...

给n个框架，每个给k个坐标，问最长的连续出现的坐标值长度。 思路：map直接记录就行了，只不过需要注意的是同一个框架会出现相同坐标。 #include <bits/stdc++.h>#define INF 0x3f3f3f3f#define LL long longusing namespace std;typedef pair<int,int>P;map...