摘要：#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<queue>using namespace std;const int N = 1e5+10;int h[N],e[N],ne[N],w[N] 阅读全文

摘要：#include<iostream>#include<cstring>using namespace std;const int N = 510,M = 1e4+10;int n,m,k;int dist[N],backup[N];struct node{ int a,b,w;}edge[M];in 阅读全文

摘要：朴素版dijkstra O(n^2) 用于稠密图 #include<iostream>#include<algorithm>#include<cstring>using namespace std;const int N = 510;int n,m;int g[N][N],dist[N];bool 阅读全文

摘要：代码 #include<iostream>using namespace std; int main(){ int n; cin>>n; int res=1,d2=0,d5=0; for(int i=1;i<=n;i++){ int x=i; while(x%2==0) x/=2,d2++; whi 阅读全文