摘要：
problemsolutioncodes#include#includeusing namespace std;int main(){ int n; string s; cin>>s>>n; for(int i = 0; i pos)pos ... 阅读全文
摘要：
problemsolutioncodes#includeusing namespace std;int n, ans=0, c[10], e[10][10];bool ok(int pos){ for(int i = 0; i >n; for(int i ... 阅读全文
摘要：
problemsolutioncodes#include#include#includeusing namespace std;int a[101],b[101];double f[101][101];int n,m,x,y,s,t;void floyd(){ ... 阅读全文
摘要：
problemsolutioncodes#include int p[101], a[101], k, n;long long ans[100001], MIN;int main(){ ans[0]=1; scanf("%d%d",&k,&n); f... 阅读全文
摘要：
problemsolutioncodes#includeint n, A[15], isp[50], vis[50], ok = 1;bool is_prime(int x){ for(int i = 2; i < x; i++)if(x%i == 0)retu... 阅读全文
摘要：
problemsolutioncodes#include#include#includeusing namespace std;int n, k;double a[10000];bool C(double x){ int sum = 0; for(int ... 阅读全文
摘要：
problemsolutioncodes#include#includeusing namespace std;int N,M,ans,n;struct nm{ int Pi; int Ai;}U[5050];bool cmp( const nm a,co... 阅读全文
摘要：
problemsolutioncodes#include#includeusing namespace std;struct xyz{ int x, y; xyz(int x = 0, int y = 0):x(x),y(y){};};int n, m, ... 阅读全文
摘要：
problemsolutioncodes#include#includeusing namespace std;int n, m, a[1010][1010], book[1010][1010], x, y, ans;const int dx[] = {0,0,-1,... 阅读全文
摘要：
problem给你一个长为n的序列求一个长不超过m的连续子段，使子段和最大solution如果n#include#define maxn 300010using namespace std;int a[maxn], q[maxn];long long s[maxn],... 阅读全文