FOWng_lp的博客

//快速排序 hoare版本(左右指针法)void QuickSort(int* arr, int begin, int end){//只有一个数或区间不存在if (begin >= end)return;int left = begin;int right = end;//选左边为keyint keyi = begin;while (begin < end){//右边选小 等号防止和key值相等 防止顺序begin和end越界while (arr[en.

畅通工程Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 53110 Accepted Submission(s): 23698Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。经过调查评估，得到的统计表中列出了有可能建设公路的若

https://pintia.cn/problem-sets/994805046380707840/problems/994805063963230208思路这个代码的意思是将图分块，能走通的节点合并为一个集合，记块的总数为num1。然后去掉一个节点后，再次分块，记块的总数为num2。如果num2-1（去掉了单独的一个节点）与num1相等或num2（去掉该节点之后，该节点所在的块仍互通）等于num1，则不影响连通性。#include<cstdio>#include<iostre..

AC Code#include<cstdio>#include<iostream>using namespace std;typedef long long ll;int main(){ double ans,h,w; int n; cin >> n; while(n--){ cin >> h >> w; ans = (h-100)*0.9*2; if(w >= ans*11/10){ cout <.

AC code#include<cstdio>#include<iostream>#include<algorithm>using namespace std; string a,b; int l=-1,r,ans;int main(){ cin >> a >> b; for(int i = 0;i < a.size();i++){ if(a[i]!=b[i]){ if(l==-1)l = i; els...

A positive proper divisor is a positive divisor of a number n, excluding n itself. For example, 1, 2, and 3 are positive proper divisors of 6, but 6 itself is not.Peter has two positive integers n and d. He would like to know the number of integers below

题目链接https://www.luogu.com.cn/problem/P1928点这里Code简单易懂的代码答案#include<cstdio>#include<iostream>#include<cmath>#include<algorithm>#include<string>using namespace std;string dg(){ int cnt; string s="",ss; char c; wh.

判断闰年#include<cstdio>#include<iostream>#include<algorithm>using namespace std;int main(){ int n,year=1777,month=4,day=29; int a[15]={0,31,28,31,30,31,30,31,31,30,31,30,31}; cin >> n; //for(int i = 1;i <= 12;i++)cout <

linkhttps://www.luogu.org/problem/P1064题目描述金明今天很开心，家里购置的新房就要领钥匙了，新房里有一间金明自己专用的很宽敞的房间。更让他高兴的是，妈妈昨天对他说：“你的房间需要购买哪些物品，怎么布置，你说了算，只要不超过NN元钱就行”。今天一早，金明就开始做预算了，他把想买的物品分为两类：主件与附件，附件是从属于某个主件的，下表就是一些主件与附件的例子...

题目描述金明今天很开心，家里购置的新房就要领钥匙了，新房里有一间他自己专用的很宽敞的房间。更让他高兴的是，妈妈昨天对他说：“你的房间需要购买哪些物品，怎么布置，你说了算，只要不超过NN元钱就行”。今天一早金明就开始做预算，但是他想买的东西太多了，肯定会超过妈妈限定的NN元。于是，他把每件物品规定了一个重要度，分为55等：用整数1-51−5表示，第55等最重要。他还从因特网上查到了每件物品的价格（...

最近xhd正在玩一款叫做FATE的游戏，为了得到极品装备，xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感，但又不得不通过杀怪来升完这最后一级。现在的问题是，xhd升掉最后一级还需n的经验值，xhd还留有m的忍耐度，每杀一个怪xhd会得到相应的经验，并减掉相应的忍耐度。当忍耐度降到0或者0以下时，xhd就不会玩这游戏。xhd还说了他最多只杀s只怪。请问他能升掉这最后一级吗？Inpu...

Cow ContestN (1 ≤ N ≤ 100) cows, conveniently numbered 1…N, are participating in a programming contest. As we all know, some cows code better than others. Each cow has a certain constant skill rat...

Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get b...

The term of this problem is the same as the previous one, the only exception — increased restrictions.InputThe first line contains two positive integers n and k (1 ≤ n ≤ 100 000, 1 ≤ k ≤ 109) — the ...

For the daily milking, Farmer John’s N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the cows. To keep things ...

想想明天要交10篇题解就有点兴（nan）奋（shou）啊但是今天依旧划水写篇博客休闲一下大佬博客（菜是原罪） 真是太真实了https://blog.youkuaiyun.com/qq_42815188/article/details/88677836题目A prefix of a string is a substring starting at the beginning of the give...

In an attempt to escape the Mischievous Mess Makers’ antics, Farmer John has abandoned his farm and is traveling to the other side of Bovinia. During the journey, he and his k cows have decided to sta...

http://codeforces.com/problemset/problem/689/BB. Mike and Shortcutstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Mike was very b...

http://codeforces.com/contest/20/problem/CC. Dijkstra?time limit per test1 secondmemory limit per test64 megabytesinputstandard inputoutputstandard outputYou are given a weighted undirected grap...

http://poj.org/problem?id=3669Meteor ShowerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 30527 Accepted: 7859DescriptionBessie hears that an extraordinary meteor shower is coming; r...

One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1…N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-way roa...

PolandBall lives in a forest with his family. There are some trees in the forest. Trees are undirected acyclic graphs with k vertices and k - 1 edges, where k is some integer. Note that one vertex is ...