gwj1139177410

摘要： problemsolutioncodes//f[i]:第i秒最远可以走多远#includeusing namespace std;const int maxn = 300010;int m, s, t, f[maxn];int main(){ cin>>m>>s... 阅读全文

posted @ 2018-06-04 21:36 gwj1139177410 阅读(159) 评论(0) 推荐(0)

摘要： problemsolutioncodes//语文题,这很好 last submit#include#includeusing namespace std;const int maxn = 3100;int n, m, a[maxn][maxn], vis[maxn]... 阅读全文

posted @ 2018-06-04 21:34 gwj1139177410 阅读(99) 评论(0) 推荐(0)

摘要： problemsolutioncodes#include#includeusing namespace std;int main(){ int n; string s; cin>>s>>n; for(int i = 0; i pos)pos ... 阅读全文

posted @ 2018-06-03 10:50 gwj1139177410 阅读(229) 评论(0) 推荐(0)

摘要： 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 ... 阅读全文

posted @ 2018-06-03 10:49 gwj1139177410 阅读(117) 评论(0) 推荐(0)

摘要： problemsolutioncodes#include#include#includeusing namespace std;int a[101],b[101];double f[101][101];int n,m,x,y,s,t;void floyd(){ ... 阅读全文

posted @ 2018-06-03 10:46 gwj1139177410 阅读(108) 评论(0) 推荐(0)

摘要： 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... 阅读全文

posted @ 2018-06-03 10:41 gwj1139177410 阅读(86) 评论(0) 推荐(0)

摘要： 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... 阅读全文

posted @ 2018-06-03 10:39 gwj1139177410 阅读(120) 评论(0) 推荐(0)

摘要： problemsolutioncodes#include#include#includeusing namespace std;int n, k;double a[10000];bool C(double x){ int sum = 0; for(int ... 阅读全文

posted @ 2018-06-03 10:37 gwj1139177410 阅读(120) 评论(0) 推荐(0)

摘要： problemsolutioncodes#include#includeusing namespace std;int N,M,ans,n;struct nm{ int Pi; int Ai;}U[5050];bool cmp( const nm a,co... 阅读全文

posted @ 2018-06-03 10:36 gwj1139177410 阅读(135) 评论(0) 推荐(0)

摘要： problemsolutioncodes#include#includeusing namespace std;struct xyz{ int x, y; xyz(int x = 0, int y = 0):x(x),y(y){};};int n, m, ... 阅读全文

posted @ 2018-06-03 10:33 gwj1139177410 阅读(108) 评论(0) 推荐(0)

选择