摘要: http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2965View Code 1 #include<iostream> 2 using namespace std ; 3 int main() 4 { 5 int a[100] = {0,7,27,70,70,70,70,70,70,70,70,270 } ; 6 int t, i, p ; 7 cin>>t ; 8 for(i=12; i<100; i++) 9 a[i] = 700 ;10 while(t--)11 ... 阅读全文
posted @ 2013-03-16 20:38 yelan@yelan 阅读(245) 评论(0) 推荐(0) 编辑
摘要: http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2966prim:View Code 1 #include<stdio.h> 2 #include<string.h> 3 const int INF = 1<<28 ; 4 #define maxn 510 5 int map[maxn][maxn], dis[maxn], visited[maxn] ; 6 int main() 7 { 8 int t, a, b, k, n, e, minco, min ; 9 int i, j ; 阅读全文
posted @ 2013-03-16 20:26 yelan@yelan 阅读(296) 评论(0) 推荐(0) 编辑
摘要: http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2969610MS :View Code 1 #include<iostream> 2 using namespace std; 3 int main() 4 { 5 int t; 6 cin>>t; 7 for(int i = 1; i <= t; i++) 8 { 9 int n;10 cin>>n;11 for(int j = 0, num; cin>>num && j< n; j++)... 阅读全文
posted @ 2013-03-16 20:16 yelan@yelan 阅读(180) 评论(0) 推荐(0) 编辑
摘要: http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2970View Code 1 #include<stdio.h> 2 #include<string.h> 3 int main() 4 { 5 char s[20] ; 6 int t, i, n, a[2010] ; 7 scanf("%d", &t) ; 8 while(t--) 9 {10 scanf("%s", s) ;11 scanf("%d", &n) ;12 阅读全文
posted @ 2013-03-16 19:53 yelan@yelan 阅读(199) 评论(0) 推荐(0) 编辑
摘要: http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2971View Code 1 #include<iostream> 2 #include<map> 3 #include<string.h> 4 using namespace std ; 5 map<string, int>a ; 6 string s ; 7 void init() 8 { 9 a["zero"] = 0 ;10 a["one"] = 1 ;11 a["t 阅读全文
posted @ 2013-03-16 19:48 yelan@yelan 阅读(238) 评论(0) 推荐(0) 编辑