LanFear0929的博客

存图方式//// Created by lanfear on 2021/2/18.//const int N = 1e5;// 1. adjacent matrix *******************************************************************int graph[N][N];// 2. adjacency list (array) ***********************************************..

A-P2036 [COCI2008-2009#2] PERKET#include<bits/stdc++.h>using namespace std;const int N = 50;const int INF = 0x3f3f3f3f;int n,ans = INF;int acid[N],sweet[N];void DFS(int i,int x,int y){ if(i > n){ if(x == 1 && y == 0)return;

第一个真正意义上的BFS注意点:方向数组初始化不能用小括号!!!#include<bits/stdc++.h>using namespace std;const int N = 500;int ans[N][N];int n,m,x,y;int dir[][2] = {{1,-2},{2,-1},{2,1},{1,2},{-1,2},{-2,1},{-2,-1},{-1,-2}};//奇怪!!!!!//为什么一定要用中括号括起来 struct node{ int x;

A. P2241 统计方形（数据加强版）#include<bits/stdc++.h>#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);#define ms(a,b) memset(a,b,sizeof(a))#define rush() int T;cin>>T;while(T--)#define ll long long//找规律....... using namespace

A. 最小硬币问题#include<iostream>using namespace std;const int NUM = 3;const int Value[NUM] = {1,2,5};int main(){ int i,money; int ans[NUM] = {0}; cin>>money; for(i = NUM - 1;i >= 0;i--){ ans[i] = money / Value[i]; money -= ans[i] * V

(以下题目均来自洛谷LUOGU)A.P2249 【深基13.例1】查找(入门)#include<bits/stdc++.h>#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);#define ms(a,b) memset(a,b,sizeof(a))#define MP make_pair #define rush() int T;cin>>T;while(T--)#define