zhousilijames的专栏

#include #include #include #include #include using namespace std; int n,t,num; char s[300],c[30]="2223334445556667777888999"; int main() { while(~scanf("%d",&n)) { priority_queue, gr

#include #include #include #include #include #include using namespace std; int n; double l,v; struct Inhsbit { double pos; char dir; string name; bool operator < (const Inhsbit& t

#include #include #include #include #include using namespace std; typedef long long ll; int n; vector v; void factor(int n) { for(int i=2;i*i<=n;i++) { int time=0; while(n%i==

#include #include #include #include using namespace std; int n,a[105][105],dp[105][105],row[105]; int main() { int ans=-12700000; scanf("%d",&n); for(int i=1;i<=n;i++) { for(

#include #include #include #include #include #include #include using namespace std; const int mx=1000000+1000; typedef long long ll; int T,n,deg[mx*2]; map mp1,mp2; vector g[mx*2]; void init() {

时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 Little Hi and Little Ho are playing a construction simulation game. They build N cities (numbered from 1 to N) in the game and connect them by N-