#include<iostream> #include<cstring> #include<algorithm> using namespace std; double arr[33][33]; int arrfinal[33][33]; int main(){ memset(arr,0,sizeof(arr)); memset(…

#include<iostream> #include<stdlib.h> #include<time.h> #include<iomanip> using namespace std; int main() { srand((int)time(0)); int a,b,c,d,e,b1,c1,d1; a=(rand()%2…

#include<iostream> using namespace std; int n; int arr[105]; int flag=0; bool judge(int x,int y){ cout<<"x:"<<x<<"y:"<<y<<endl; if(x==1||y==1)…

#include<iostream> #include<cstring> using namespace std; int arr[1300005]; void f(){ memset(arr,0,sizeof(arr)); arr[0]=1; arr[1]=1; int count=0; for(int i=2;i<130000…

#include<iostream> #include<cstring> using namespace std; int main(){ char ch[10]; memset(ch,'a',sizeof(ch)); ch[5]=0;//ch[5]='\0';等价 cout<<ch<<endl; return …

#include <cstdio> #include <cstring> #define INF 1000000 //无穷大 #define MAXN 21 //顶点个数最大值 int n, m; //顶点个数、边数 int Edge[MAXN][MAXN]; //邻接矩阵 int lowcost[MAXN]; int nearvex[…

#include<iostream> #include<vector> using namespace std; #define MAX 5005 #define MAXCOST 100000 int prim(vector<vector<int> >vec,int n){ int lowcost[MAX]; int mst…

#include<iostream> using namespace std; int main(){ int n,k,arr[100005]; int count=0; cin>>n>>k; for(int i=0;i<n;i++){ cin>>arr[i]; } for(int i=0;i<n;i++){ int sum=0;…

public class DijkstraHeap { public static final int INF=100000; public int[] dist=new int[10000]; public int[] s=new int[10000]; public int[] path=new int[10000]; private int …

import json from tkinter import * import requests def getType(postId): url='http://www.kuaidi100.com/autonumber/autoComNum?resultv2=1&text='+postId rs=requests.get(url) po…