UVa Online Judge
文章平均质量分 65
LILI-XU
这个作者很懒,什么都没留下…
展开
-
11150 - Cola
#include int main() { int t,n,p,d;while(scanf("%d",&t)!=EOF){ d=t;p=0; while(t>=3){ p=t%3; t/=3; d+=t; t+=p; }if(t==2) d++; printf("%d\n",d);} return 0; }原创 2013-05-04 23:28:22 · 642 阅读 · 0 评论 -
10812 - Beat the Spread!
#includeint main(){ int c,sum,dif; scanf("%d",&c); while(c--){ scanf("%d%d",&sum,&dif); int a; for(a=0;a<=sum;a++) if(sum-2*a==dif||sum-2*a==-dif) {if(a<(sum-a)) a=(sum-a); goto print;}原创 2013-05-04 23:45:50 · 629 阅读 · 0 评论 -
10683 - The decadary watch
#includeint main(){ long r; int h,m,s,c;long g; while(scanf("%ld",&r)!=EOF) { h=r/1000000; m=r/10000-h*100; s=r/100-h*10000-m*100; c=r-h*1000000-m*10000-s*100; g=(3600*h+60*m+s)*100+c;原创 2013-05-05 08:37:41 · 649 阅读 · 0 评论 -
694 - The Collatz Sequence
#includeint main(void){ long a=0,A=0,l=0,count=0,t=0; while(scanf("%ld%ld",&a,&l)==2&&(a!=-1)&&(l!=-1)){ count++; A=a; t=0; do{ if(a%2) {++t;a=3*a+1;} else {++t;a=a/2;} } whi原创 2013-05-04 23:29:43 · 521 阅读 · 0 评论 -
573 - The Snail
#includeint main(void){ int h,u,d,f,n; double F,s; while(scanf("%d%d%d%d",&h,&u,&d,&f)==4){ if(!h) break; F=(double)f/100; for(n=1;;n++){ if(((n-1)*F)>=1) goto slide; s=(n-(n*(n-1)/2)原创 2013-05-04 23:35:34 · 501 阅读 · 0 评论 -
488 - Triangle Wave
#includevoid print(int n){int i,j;for(i=1;i<=n;i++){ for (j=1; j<=i; j++) printf("%d",i); printf("\n");}for(i=n-1;i>=1;i--){ for (j=1; j<=i; j++) printf("%d",i); printf("\n");}}i原创 2013-05-04 23:36:59 · 603 阅读 · 0 评论 -
11172 - Relational Operator
#includeint main(void){ int t;long long a,b; scanf("%d",&t);while(t--){ scanf("%ld%ld",&a,&b);if(a<b) puts("<");if(a>b) puts(">");if(a==b) puts("=");} return 0;}原创 2013-05-04 23:39:37 · 684 阅读 · 0 评论 -
272 - TEX Quotes
#include#includeint main(void){ int flag=0;char c;while((c=getchar())!=EOF){ if(c=='"') { if(flag==0) {printf("``");flag=1;} else {printf("''"); flag=0;} } else printf("%c",c);} ret原创 2013-05-04 23:53:25 · 507 阅读 · 0 评论 -
490 - Rotating Sentences
#include#includeint main(void){ char buf[101][101]={NULL}; int len[101]={NULL}; int h=0,max=0; int i,j; while((gets(buf[h]))!=NULL) { if(strlen(buf[h])>max) max=strlen(buf[h]); len[h]=str原创 2013-05-05 08:37:09 · 668 阅读 · 0 评论 -
11799 - Horror Dash
#includevoid quick(int *a,int i,int j){ int m,n,temp; int k; m=i; n=j; k=a[(i+j)/2]; do { while(a[m]<k&&m<j) m++; while(a[n]>k&&n>i) n--; if(m<=n) { temp=a[m]; a[m]=a[n]; a[n原创 2013-05-05 15:16:50 · 698 阅读 · 0 评论 -
10878 - Decode the tape
#include int main(void) { int i,temp; char buf[20]; while (fgets(buf, 20, stdin) != NULL) { temp = 0; if (buf[0] == '_') continue; for (i = 1; i < 11; ++i) { if (b原创 2013-05-05 18:35:16 · 577 阅读 · 0 评论 -
11942 - Lumberjack Sequencing
#includeint main(void){ int n,a[10]; scanf("%d",&n); puts("Lumberjacks:"); while(n--){ int i; for(i=0;i<10;i++) scanf("%d",&a[i]); for(i=0;i<8;i++) if(a[i]a[i+2]||a[i]>a[i+1]&&a[i+1]原创 2013-05-05 19:41:24 · 563 阅读 · 0 评论 -
11332 - Summing Digits
#includelong f(long i){ long h=0; while(i){ h+=i%10; i/=10; } if(h>=10) h=f(h); else return h;}int main(void){ long num; while(scanf("%ld",&num)) {if(!num) break; printf("%ld\n",原创 2013-05-05 21:40:08 · 967 阅读 · 0 评论 -
11636 - Hello World!
#includeint main(void){ int sum,count=0,n,i; while(scanf("%d",&sum)) { if (sum<0) break; count++; i=0;n=1; while(n*2<sum) {i++;n*=2;} if(n!=sum) i++; printf("Case %d: %d\n",count,i原创 2013-05-04 23:25:32 · 538 阅读 · 0 评论 -
11559 - Event Planning
#include#includeint main(void){ int i,j,price[20],week[20][15],n,b,h,w,min,money; while(scanf("%d%d%d%d",&n,&b,&h,&w)==4){ for(i=1;i<=h;i++){ scanf("%d",&price[i]); for(j=1;j<=w;j++)原创 2013-05-04 23:26:30 · 608 阅读 · 0 评论 -
11764 - Jumping Mario
#includeint main(void){ int i,c,n,u,d,count=0,wall[55]; scanf("%d",&c); while(c--) {count++; u=0;d=0; scanf("%d",&n); for(i=1;i<=n;i++) scanf("%d",&wall[i]); if(n==1) goto print; for(i原创 2013-05-04 23:19:15 · 683 阅读 · 0 评论 -
10550 - Combination Lock
#includeint main(void){ int a,b,c,d; while(scanf("%d%d%d%d",&a,&b,&c,&d)){ if(!a&&!b&&!c&&!d) break; int ang=0; if(b>a) ang+=40-b+a; else ang+=a-b; if(c>b) ang+=c-b; else a原创 2013-05-05 23:16:20 · 657 阅读 · 0 评论 -
414 - Machined Surfaces
#include #include int main(void) { int i, j; int n; char a[27]; int min, sum, t[14]; while (scanf("%d", &n) != EOF && n) { getchar(); sum = 0; min = 30; mems原创 2013-05-05 23:30:07 · 507 阅读 · 0 评论 -
575 - Skew Binary
#include#include#includeint main(void){ char a[1000]={0}; while(gets(a)) { if(strlen(a)==1&&a[0]=='0') break; long i,sum=0; for(i=0;i<strlen(a);i++) sum+=(a[i]-'0')*(pow(2,strlen(a)-i)原创 2013-05-19 19:13:40 · 451 阅读 · 0 评论 -
12015 - Google is Feeling Lucky
#includeint max(int *b){ int i,max=0; for(i=0;i<10;i++) if(b[i]>max) max=b[i]; return max;}int main(void){ int n,count=0; scanf("%d",&n); while(n--){ count++; char a[10][100]={0}; i原创 2013-05-06 21:30:50 · 594 阅读 · 0 评论 -
11498 - Division of Nlogonia
#includeint main(void){ int i,t,n,m,x,y; while(scanf("%d",&t)!=EOF){ if (t==0) break; scanf("%d%d",&n,&m); while(t--) { scanf("%d%d",&x,&y); if(x==n||y==m) puts("divisa"); else原创 2013-05-04 23:49:11 · 649 阅读 · 0 评论 -
113 - Power of Cryptography
#include#include int main(void){ double n,p; while(scanf("%lf%lf",&n,&p)!=EOF) printf("%lf\n",(pow(p,1/n))); return 0;}原创 2013-05-06 23:53:41 · 513 阅读 · 0 评论 -
10110 - Light, more light
#include#includeint main(void){ long long n; while(scanf("%d",&n)&&n) { if((long long)sqrt(n)*(long long)sqrt(n)==n) puts("yes"); else puts("no"); } return 0;}原创 2013-05-19 19:27:53 · 496 阅读 · 0 评论 -
10055 - Hashmat the Brave Warrior
#includeint main(void){ long long a,b; while(scanf("%lld%lld",&a,&b)!=EOF) printf("%lld\n",a>b?a-b:b-a); return 0;}原创 2013-05-07 00:04:43 · 468 阅读 · 0 评论 -
568 - Just the Facts
#includeint main(void){ int i, n, m, temp; while(scanf("%d", &n) != EOF) { for(m=i=1; i<=n; ++i) { temp = i; while(temp%10 == 0) temp /= 10; m *= temp; while(m%10 == 0) m /= 10;原创 2013-05-20 21:23:53 · 486 阅读 · 0 评论 -
10970 - Big Chocolate
#includeint main(void){ int m,n; while(scanf("%d%d",&m,&n)!=EOF) printf("%d\n",m-1+m*(n-1)); return 0;}原创 2013-05-20 21:46:32 · 590 阅读 · 0 评论 -
11850 - Alaska
#includevoid quick(int *a,int i,int j){ int m,n,temp; int k; m=i; n=j; k=a[(i+j)/2]; do { while(a[m]<k&&m<j) m++; while(a[n]>k&&n>i) n--; if(m<=n) { temp=a[m]; a[m]=a[n]; a[原创 2013-05-08 22:36:39 · 613 阅读 · 0 评论 -
10420 - List of Conquests
#include#include#includestruct list{ char na[75]; int nu; int scan;}country[2005];int temp(void const *a,void const *b){return strcmp((*(list *)a).na,(*(list *)b).na);}int main(void){原创 2013-05-09 18:45:52 · 502 阅读 · 0 评论 -
102 - Ecological Bin Packing
#includeint max(int *a){ int max=0,i; for(i=0;i<6;i++) if(a[i]>max) max=a[i]; return max;}void print(int x){ if(x==0)printf("BCG"); if(x==1)printf("BGC"); if(x==2)printf("CBG"); if(x==3)原创 2013-05-10 21:20:07 · 564 阅读 · 0 评论 -
11340 - Newspaper
#include#includestruct{char x;int y;}p[105];int main(void){ int n; scanf("%d",&n); while(n--) { int k,i,j,q,m; double sum=0; scanf("%d",&k); for(i=0;i<k;i++) scanf(" %c %d",&p[i].x,原创 2013-05-11 22:57:13 · 711 阅读 · 0 评论 -
661 - Blowing Fuses
#includeint main(){ int n,m,c,count=0; while(scanf("%d%d%d",&n,&m,&c)) { int a[25]={0},b[25]={0},i,sum=0,temp,max=0; if(n==m&&m==c&&n==0)break; count++; for(i=1;i<=n;i++) { scanf("%d原创 2013-05-12 18:34:47 · 756 阅读 · 0 评论 -
10008 - What's Cryptanalysis?
What's Cryptanalysis? Cryptanalysis is the process of breaking someone else's cryptographicwriting. This sometimes involves some kind of statistical analysis ofa passage of (encrypted) tex原创 2013-06-04 22:39:22 · 751 阅读 · 0 评论 -
10790 - How Many Points of Intersection?
How Many Points of Intersection? We have two rows. There are a dots on the toprow andb dots on the bottom row. We draw line segments connecting every dot on the top row with every dot on原创 2013-06-02 22:01:50 · 650 阅读 · 0 评论 -
10916 - Factstone Benchmark
Problem B: Factstone BenchmarkAmtel has announced that it will release a 128-bit computer chip by 2010,a 256-bit computer by 2020, and so on, continuing its strategy ofdoubling the word-size every t原创 2013-06-02 14:24:48 · 701 阅读 · 0 评论 -
11687 - Digits
Problem D: DigitsA googol written out in decimal has 101 digits. A googolplex hasone plus a googol digits. That's a lot of digits!Given any number x0, define a sequenceusing the following recurren原创 2013-05-26 20:56:51 · 1522 阅读 · 0 评论 -
10130 - SuperSale
SuperSaleThere is a SuperSale in a SuperHiperMarket.Every person can take only one object of each kind, i.e. one TV, one carrot,but for extra low price. We are going with a whole family to that Supe原创 2013-06-13 21:57:19 · 854 阅读 · 0 评论 -
579 - ClockHands
ClockHands The medieval interest in mechanical contrivances is well illustrated by the development ofthe mechanical clock, the oldest of which is driven by weights and controlled by a verg原创 2013-06-08 22:16:13 · 642 阅读 · 0 评论 -
674 - Coin Change
Coin Change Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and1-cent. We want to make changes with these coins for a given amountof money.For example, if we原创 2013-06-07 22:17:36 · 707 阅读 · 0 评论 -
10815 - Andy's First Dictionary
ProblemB: Andy's First DictionaryTimelimit: 3 secondsAndy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of word原创 2013-06-03 22:50:16 · 640 阅读 · 0 评论 -
10919 - Prerequisites?
Problem E: Prerequisites?Freddie the frosh has chosen to take k courses.To meet the degree requirements, he must takecourses from each of several categories. Can you assureFreddie that he will gradu原创 2013-05-27 21:46:21 · 991 阅读 · 0 评论