bettle_king的博客

目录P5707 【深基2.例12】上学迟到P5707 【深基2.例12】上学迟到https://www.luogu.com.cn/problem/P5707#include<cstdio>#include<iostream>#include<cmath>using namespace std;int a1=8*60;int a2=24*60;int main(void) { int s,v; cin>>s>>v; int

目录P1428 小鱼比可爱P1428 小鱼比可爱https://www.luogu.com.cn/problem/P1428#include<cstdio>#include<iostream>using namespace std;int a[105],b[105];int main(void){ int n; cin>>n; for(int i=0;i<n;i++) cin>>a[i]; b[0]=0; for(int i=1

目录P1125 [NOIP2008 提高组] 笨小猴P1957 口算练习题P1125 [NOIP2008 提高组] 笨小猴https://www.luogu.com.cn/problem/P1125#include<cstdio>#include<iostream>#include<string>#include<cmath> using namespace std;int hush[30];bool judge(int x){ if(

目录P5735 【深基7.例1】距离函数P5736 【深基7.例2】质数筛P5735 【深基7.例1】距离函数https://www.luogu.com.cn/problem/P5735#include<cstdio>#include<iostream>#include<cmath>using namespace std;double x_1,y_1,x_2,y_2,x_3,y_3;double F() { double a=sqrt( (x_1-x

目录P2670 [NOIP2015 普及组] 扫雷游戏 【dfs / 模拟】P1601 A+B Problem（高精加）P1303 A*B Problem(高精度乘)P2670 [NOIP2015 普及组] 扫雷游戏 【dfs / 模拟】https://www.luogu.com.cn/problem/P2670#include<cstdio>#include<iostream>#include<string>using namespace std;cha

目录P1271 【深基9.例1】选举学生会 题解 【水题】P1271 【深基9.例1】选举学生会 题解 【水题】https://www.luogu.com.cn/problem/P1271方法一: sort()#include<cstdio>#include<iostream>#include<algorithm>using namespace std;int a[2000005];int main(void){ int n,m; cin>

目录P2089 烤鸡P2089 烤鸡https://www.luogu.com.cn/problem/P2089#include<cstdio>#include<iostream>#include<cmath>using namespace std;int n;int a[10];int b[60005][10];int ans=0;void dfs(int index){ if(index==10) { int sum=0; for

目录P1255 数楼梯P1255 数楼梯https://www.luogu.com.cn/problem/P1255#include<cstdio>#include<iostream>#include<vector>using namespace std;vector<int>A,B,C;vector<int> add(vector<int> &A,vector<int> &B){ ve

目录P1223 排队接水P1223 排队接水https://www.luogu.com.cn/problem/P1223#include<cstdio>#include<iostream>#include<algorithm>using namespace std;struct student{ int id; int t;}stu[1005];bool cmp(student a,student b){ return a.t<b.t;

目录P1024 [NOIP2001 提高组] 一元三次方程求解果真自己还是菜啊，二分模板背的比较熟悉了，做二分的题还是笨的摸不着边际。P1024 [NOIP2001 提高组] 一元三次方程求解https://www.luogu.com.cn/problem/P1024方法一: 暴力首先零点的左右两边的符号一定是不同的。#include<cstdio>#include<iostream>using namespace std;double a,b,c,d;do

目录[USACO1.5]八皇后 Checker Challenge 【经典】P1135 奇怪的电梯【经典】P1036 [NOIP2002 普及组] 选数 【经典 n中选k】P1605 迷宫 【经典】P1101 单词方阵 【有意思】P2404 自然数的拆分问题 【有点意思 / 经典】P1596 [USACO10OCT]Lake Counting S 【经典】P1162 填涂颜色 【思维秒】[USACO1.5]八皇后 Checker Challenge 【经典】https://www.luogu.com.

目录P3156 【深基15.例1】询问学号P3156 【深基15.例1】询问学号https://www.luogu.com.cn/problem/P3156#include<cstdio>#include<iostream>#include<map>using namespace std;int a[2000005];int main(void){ int n,m;cin>>n>>m; int number; for(in

目录P1143 进制转换P1143 进制转换https://www.luogu.com.cn/problem/P1143#include<cstdio>#include<iostream>#include<cmath>#include<string>using namespace std;int n,m;string a;int change_D(string s,int n){ int sum=0; for(int i=0;i&l

目录P3397 地毯P3397 地毯https://www.luogu.com.cn/problem/P3397#include<cstdio>#include<iostream>using namespace std;int a[1005][1005];int n,m;int main(void){ cin>>n>>m; while(m--) { int x,y,xx,yy; cin>>x>>y>&

目录P5318 【深基18.例3】查找文献 【图的两种遍历】P5318 【深基18.例3】查找文献 【图的两种遍历】https://www.luogu.com.cn/problem/P5318#include<cstdio>#include<iostream>#include<cstring> #include<algorithm>#include<queue>using namespace std;const int N=1e