- 博客(8)
- 资源 (1)
- 收藏
- 关注
原创 UVA OJ:445 - Marvelous Mazes
#include#include#include#define maxn 100int main(){ char a; int i,count=0; while((a=getchar())!=EOF) { if(a==10) printf("\n"); if(isdigit(a)) c
2014-04-15 15:03:59
407
原创 UVA OJ:494 - Kindergarten Counting Game
#include#include#include#define maxn 1000000int main(){ char str[maxn]; int i,count; while(fgets(str,maxn,stdin)!=NULL) { count=1; for(i=0;i {
2014-04-15 15:00:45
413
原创 UVA OJ:458 - The Decoder
#include#define maxn 100000int main(){ char str[maxn]; int i; while(gets(str)!=NULL) { for(i=0;i { str[i]-=7; } puts(
2014-04-15 14:59:44
395
原创 UVA OJ: 10300 - Ecological Premium
#includeint main(){ int n,mon; int a,b,c; int t; scanf("%d",&n); while(n--) { mon=0; scanf("%d",&t); while(t--) { sca
2014-04-15 14:57:14
420
原创 UVA OJ: 10071 - Back to High School Physics
#includeint main(){ int v,t; while(scanf("%d%d",&v,&t)!=EOF) { printf("%d\n",2*v*t); } return 0;}这一题主要是要
2014-04-15 14:54:16
307
原创 UVA OJ: 10055 - Hashmat the Brave Warrior
#include#includeint main(){ long long a,b; while(scanf("%lld%lld",&a,&b)!=EOF) { printf("%lld\n",a>b?a-b:b-a); } return 0;}
2014-04-13 10:48:35
328
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人