• 博客园logo
  • 会员
  • 众包
  • 新闻
  • 博问
  • 闪存
  • 赞助商
  • HarmonyOS
  • Chat2DB
    • 搜索
      所有博客
    • 搜索
      当前博客
  • 写随笔 我的博客 短消息 简洁模式
    用户头像
    我的博客 我的园子 账号设置 会员中心 简洁模式 ... 退出登录
    注册 登录
泳裤王子
不要挂科..
博客园 首页 新随笔 联系 订阅 订阅 管理

2011年4月16日

The 8th Zhejiang Provincial Collegiate Programming Contest / D - String Successor
摘要: 返回目录悲剧地wa了,不知道哪错,而且代码越改越恶心不喜勿看=。= ,知道哪错的麻烦告诉我一下O(∩_∩)O...①未改#include<cstdio>#include<cstring>using namespace std;inline int Rint() { int x; scanf("%d", &x); return x;}#define MAXN 110unsigned char s[MAXN];int n;int m;int isan(int cur) //!!{ for(int i=cur; i>=0; i--) if(( 阅读全文
posted @ 2011-04-16 18:24 泳裤王子 阅读(154) 评论(0) 推荐(0)
 
The 8th Zhejiang Provincial Collegiate Programming Contest / M - Median
摘要: 返回目录代码:#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;inline int Rint() {int x; scanf("%d", &x); return x;}inline double Rd() {double x; scanf("%lf", &x); return x;}int n;#define MAXN 502double a[MAXN];int ma 阅读全文
posted @ 2011-04-16 18:19 泳裤王子 阅读(148) 评论(0) 推荐(0)
 
The 8th Zhejiang Provincial Collegiate Programming Contest / L - Javabeans
摘要: 返回目录代码:#include<cstdio>#include<cstring>#define int64 long longinline int64 Rint() {int64 x; scanf("%lld", &x); return x;}int64 n;int solve(){ int ans=0; while(n) { n/=2; ans++; } return ans;}int main(){ int64 t = Rint(); while(t--) { n = Rint(); printf("%d/n", so 阅读全文
posted @ 2011-04-16 18:18 泳裤王子 阅读(159) 评论(0) 推荐(0)
 
The 8th Zhejiang Provincial Collegiate Programming Contest / F - Kagome Kagome
摘要: 返回目录代码:#include<cstdio>#include<cstring>#define MAXN 102char a[MAXN][22]; //0~n-1inline int Rint() {int x; scanf("%d", &x); return x;}#define Fi(n) for(int i=0; i<n; i++)int n;char b[22];int main(){ int t = Rint(); while(t--) { int pos; n = Rint(); scanf("%s", 阅读全文
posted @ 2011-04-16 18:17 泳裤王子 阅读(147) 评论(0) 推荐(0)
 
The 8th Zhejiang Provincial Collegiate Programming Contest / B - Conic Section
摘要: 返回目录代码:#include<cstdio>#include<cstring>using namespace std;void solve(){ if(a!=0&&c!=0&&a==c) printf("circle/n"); else if(a!=0&&c!=0&&a!=c&&a*c>0) printf("ellipse/n"); else if((a==0&&c!=0&&d!=0)||(a!=0&&a 阅读全文
posted @ 2011-04-16 18:15 泳裤王子 阅读(131) 评论(0) 推荐(0)
 
The 8th Zhejiang Provincial Collegiate Programming Contest / A - Ordinal Numbers
摘要: 返回目录代码:#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;inline int Rint() {int x; scanf("%d", &x); return x;}int x;void solve(){ int t = (x/10)%10; if(t == 1) { printf("%dth/n", x); } else { t = x%10; if(t == 1) pr 阅读全文
posted @ 2011-04-16 18:11 泳裤王子 阅读(136) 评论(0) 推荐(0)
 
The 8th Zhejiang Provincial Collegiate Programming Contest / 解题报告 11.4.16
摘要: 比赛链接先声明本人菜鸟一只,各种牛就不用看了⊙﹏⊙b..写在这里只为督促自己尽快弄完这些题咯。解题报告链接:A Ordinal Numbers 51.24% (413/806)B Conic Section 29.45% (291/988) C Old Labels 5.26% (6/114)D String Successor 15.50% (198/1277) E Wall-nut Bowling 0.00% (0/13)F Kagome Kagome 55.55% (345/621) G Palm Up and Palm Down 10.52% (4/38) H BCD Code 15. 阅读全文
posted @ 2011-04-16 18:10 泳裤王子 阅读(156) 评论(0) 推荐(0)
 
 

公告


博客园  ©  2004-2025
浙公网安备 33010602011771号 浙ICP备2021040463号-3