2015年09月_Tczxw

原创 uva 10375 唯一分解定理

#include using namespace std;int p, q, r, s;int main(int argc, char const *argv[]){ while (cin >> p >> q >> r >> s) { q = min(p - q, q); s = min(r - s, s); double sum = 1.0; for (int i = 1

2015-09-30 19:02:09 423

原创 uva 12169 暴力

#include using namespace std;const int maxn = 100 * 2 + 5;const int M = 10001;int T, x[maxn];void solve(){ for (int i = 0; i < M; i++) for (int j = 0; j < M; j++) { bool ok = 1; for (

2015-09-29 17:41:17 494

原创 uva 11582 循环

#include using namespace std;const int maxn = 1E6 + 10;typedef unsigned long long ull;ull T, a, b, n, F[maxn] = {0, 1};int pow_mod(ull a, ull n, ull b){ ull ans = 1; while (n) { if (n & 1)

2015-09-29 16:30:09 355

原创 uva 1001 dijkstra

#include using namespace std;#define RPE(i,n) for(int i=0;i<(n);i++)const int N = 110;typedef pair pii;typedef pair pdi;typedef long long LL;int x[N], y[N], z[N], r[N];double dist[N][N];dou

2015-09-25 20:53:16 730

原创 uva 1632 动规

#include using namespace std;const int maxn = 1E4 + 10;const int INF = 0x3f3f3f3f;int n, ans, dp[maxn][maxn][2], dis[maxn], deadline[maxn];int main(int argc, char const *argv[]){ while (cin >>

2015-09-25 15:23:34 364

原创 uva 1629 动规

#include using namespace std;const int maxn = 20 + 5;const int INF = 0x3f3f3f3f;#define REP(i,j,n) for(int i=(j);i<=(n);i++)int n, m, k, inp[maxn][maxn], cnt[maxn][maxn], kase, dp[maxn][maxn][max

2015-09-25 13:00:28 304

原创 uva 10118 动规

#include using namespace std;const int maxn = 40 + 5;int pile[4][maxn], dp[maxn][maxn][maxn][maxn], n, top[4];#define REP(i,n) for(int i=0;i<(n);i++)int DP(int cnt, int bit){ int &ans = dp[top[

2015-09-24 22:08:49 343

原创 uva 10285 动规

#include using namespace std;#define REP(i,n) for(int i=1;i<=(n);i++)const int maxn = 100 + 5;int T, n, m, dp[maxn][maxn], inp[maxn][maxn];string str;int DP(int i, int j){ if (dp[i][j] != -1)

2015-09-24 16:51:15 405

原创 uva 11584 动规

#include using namespace std;const int maxn = 1000 + 5;int kase, d[maxn], T;bool vis[maxn][maxn], p[maxn][maxn];string str;int is_palindrome(int i, int j){ if (i >= j) return 1; if (str[i -

2015-09-18 12:23:03 363

原创 uva 10801 SPFA

#include using namespace std;typedef pairpii;priority_queue, greater > q;const int N = 105;const int INF = 1E9;int n, k, T[6], w[N][N], arr[N], d[N];bool vis[N];inline void read(){ for (int

2015-09-08 20:21:53 430

原创 uva 821 floyd

#include using namespace std;const int INF = 0x3f3f3f3f;const int maxn = 110;int G[maxn][maxn], vis[maxn], v, u, kase;int main(int argc, char const *argv[]){ while (cin >> u >> v && u || v)

2015-09-08 16:01:10 375

原创 uva 11175

#include using namespace std;const int maxn = 3E2 + 5;int G1[maxn][maxn], G2[maxn][maxn], gx[maxn], gy[maxn], to[maxn], n, m, x, y, T, kase;bool check(){ for (int i = n - 1; i >= 0; i--) { me

2015-09-03 21:51:04 696

原创 UVA 1620

#include using namespace std;const int maxn = 5E2 + 10;int inp[maxn], T, n;int main(int argc, char const *argv[]){ cin >> T; while (T--) { cin >> n; int cnt = 0; for (int i = 0; i < n; i

2015-09-03 11:00:07 1278

原创 UVA 1623

#include using namespace std;const int maxn = 1E6 + 10;int T, n, m, inp, last[maxn];int main(int argc, char const *argv[]){ ios::sync_with_stdio(false), cin.tie(NULL); cin >> T; while (T--) {

2015-09-03 10:36:50 364

原创 UVA 1611

#include using namespace std;typedef pair pii;const int maxn = 1E4 + 10;int inp[maxn], T, n;void change(int l, int r){ for (int i = l, j = l + (r - l + 1) / 2; j <= r; j++, i++) swap(inp[i],

2015-09-02 20:19:26 478

原创 UVA 11491 在线处理

#include using namespace std;int n, l;int main(int argc, char const *argv[]){ while (cin >> n >> l && n || l) { char ans[100010]; cin.get(); for (int i = 0, j = 0; i < n; i++) { char c

2015-09-02 09:57:00 444

原创 UVA 1610

#include using namespace std;const int maxn = 1E3 + 10;int n, k;string inp[maxn];int main(int argc, char const *argv[]){ while (cin >> n && n) { for (int i = 0; i < n; i++) cin >> inp[i];

2015-09-02 09:04:54 399

原创 UVA 1624 打结

#include using namespace std;const int INF = 0x3f3f3f3f;const double eps = 1E-6;const int maxn = 1E6 + 10;struct Node{ int l, r, face;};Node nodes[maxn];int F[maxn], used[maxn];int T, L, P,

2015-09-01 21:20:35 879

原创 UVA 1149 水题

#include using namespace std;const int maxn = 1E5 + 10;int n, l, cnt, T, L[maxn];int main(int argc, char const *argv[]){ cin >> T; while (T--) { cin >> n >> l; for (int i = 0; i < n; i++)

2015-09-01 20:02:17 304

Tczxw的专栏