UVA
乐哥不焦虑
这个作者很懒,什么都没留下…
展开
-
UVA10167 生日蛋糕
//birthday cake#include#define N 500main(){ int n, x[110], y[110]; int a, b; while (scanf("%d ", &n) != EOF && n) { for (int i = 0; i < 2*n; i++)原创 2012-05-06 18:29:40 · 478 阅读 · 0 评论 -
UVA 10474
#include#includeint a[10009];int b[10009];int c[10009];main(){ int n, q; int i = 1; while (scanf("%d %d", &n, &q) != EOF && n && q) { memset(a, 0, sizeof(a)原创 2012-05-06 18:25:06 · 566 阅读 · 0 评论 -
uva11205损坏的步数计
//增量构造法 #include#include#include#include int cmp(const void *a,const void *b){ return strcmp((char *)a,(char *)b);}#define N 100int A[20];char s[N][16];char tmp[N][16];int t,p,n;原创 2012-05-06 18:28:29 · 429 阅读 · 0 评论 -
uva110 没有循环的排序程序
#include#includeusing namespace std;void make_prog(int cur, int n, vector &q){ int i,j; if (cur == n) { for (j = 0; j < n; j++)printf(" "); printf("原创 2012-05-06 18:27:03 · 417 阅读 · 0 评论