basasuya的博客

最近有点神志无知 命运中很多事情真是奇妙 我必须改变自己的状态 1001 简单的模拟#include<bits/stdc++.h> using namespace std;int main() { int a,b; while(~scanf("%d %d",&a,&b)) { int tt = a+b; if(tt == 0) { printf("0\n")

1121#include<cmath> #include<map> #include<iostream> #include<cstring> #include<cstdio> #include<set> #include<vector> #include<queue> #include<stack> #include<algorithm> using namespace std; typedef l

1111 比较麻烦的最短路#include<cmath> #include<map> #include<iostream> #include<cstring> #include<cstdio> #include<set> #include<vector> #include<queue> #include<stack> #include<algorithm> using namespace std;

1101#include<cmath> #include<map> #include<iostream> #include<cstring> #include<cstdio> #include<set> #include<vector> #include<queue> #include<stack> #include<algorithm> using namespace std; typedef l

1081 #include<cmath> #include<map> #include<iostream> #include<cstring> #include<cstdio> #include<set> #include<vector> #include<queue> #include<algorithm> using namespace std; typedef long long ll; co

1091bfs傻逼题，dfs会爆栈#include<iostream> #include<cstdio> #include<cstring> #include<vector> #include<cmath> #include<queue> #include<algorithm> #include<ctime> #include<cstdlib> #include<map> #include<set>

1071#include<iostream> #include<cstdio> #include<cstring> #include<vector> #include<cmath> #include<queue> #include<algorithm> #include<ctime> #include<cstdlib> #include<map> #include<set>using namespa

1061 我想吐槽这题的题意不够清楚，不过下次得长记性，对于模糊的题意要大胆猜测，而不是固执己见#include<iostream> #include<cstdio> #include<map> #include<cstring> using namespace std;char a[4][65]; char week[10][10] = {"MON", "TUE", "WED", "THU","F

1031#include<iostream> #include<cstdio> #include<cstring> #include<vector> #include<cmath> #include<queue>using namespace std; const int INF = 0x3f3f3f3f; const int N = 1e6+5; const int M = 3e5+5;char

1021求树的直径网上一搜就有，但是我不太理解 只需要一共求两次的dfs的论调，好吧我收回这句话，好想脑补了下，第一次dfs有多个最长点，只需要搜一个就行QAQ。这么看来我写麻烦了#include<bits/stdc++.h> using namespace std; typedef long long ll; #define MP(x, y) make_pair(x, y) #define FI

1051 自己写的非常麻烦 http://blog.youkuaiyun.com/biaobiaoqi/article/details/9338397 的算法比较好，我的就贴下吧，主要对入栈出栈不够理解#include<cmath> #include<map> #include<iostream> #include<cstring> #include<cstdio> #include<set> #inclu

没想到半天就做完了10题 = =，这几题太简单了,基本10分钟一题 1041#include<cmath> #include<map> #include<iostream> #include<cstring> #include<cstdio> #include<set> #include<vector> #include<queue> #include<algorithm> using names

一开始几道题写到吐血，真的自己现在好弱 1011 水题不说了#include<bits/stdc++.h> using namespace std; const int N = 105; typedef unsigned long long ll; const int MOD = 1e9+7;int c[5]; int main() { double ans = 1; for(int i