- 博客(15)
- 收藏
- 关注
RSS订阅转载 1020. Tree Traversals (25)
1020. Tree Traversals (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueSuppose that all the keys in a binary tree
2016-09-26 18:08:43
221
原创 1019. General Palindromic Number (20)
A number that will be the same when it is written forwards or backwardsis known as a Palindromic Number. For example, 1234321 is a palindromicnumber. All single digit numbers are palindromic numbe
2016-09-25 16:06:44
175
原创 1004. Counting Leaves (30)
1004. Counting Leaves (30)时间限制 400 ms内存限制 65536 kB代码长度限制 16000 B判题程序 Standard 作者 CHEN, YueA family hierarchy is usually presented by a pedigree tree.
2016-09-24 22:17:46
196
原创 1017. Queueing at Bank (25)
1017. Queueing at Bank (25)时间限制 400 ms内存限制 65536 kB代码长度限制 16000 B判题程序 Standard 作者 CHEN, YueSuppose a bank has K windows open for service. There is a
2016-09-24 21:48:38
209
原创 1011. World Cup Betting (20)
1011. World Cup Betting (20)时间限制 400 ms内存限制 65536 kB代码长度限制 16000 B判题程序 Standard 作者 CHEN, YueWith the 2010 FIFA World Cup running, football fans the
2016-09-19 20:24:28
212
原创 1009. Product of Polynomials (25)
#include#includeusing namespace std;int a1[1200], a2[1200];double b1[1210];double b2[1210];double b3[2010];int main(){ int k; cin >> k; for (int i = 0; i<k; i++) { int x; cin >> x;
2016-09-18 17:04:19
152
原创 1008. Elevator (20)
1008. Elevator (20)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThe highest building in our city has only one ele
2016-09-18 15:16:59
198
原创 1007. Maximum Subsequence Sum (25) 第二种想法
1007. Maximum Subsequence Sum (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueGiven a sequence of K integers { N
2016-09-18 15:04:02
266
原创 1007. Maximum Subsequence Sum (25)
#includeusing namespace std;int main(){ int k; cin>>k; int n[10002]; bool flag=false; for(int i=1;i<=k;i++) { cin>>n[i]; if(n[i]>=0) flag=1; } if(!flag) cout"0 "1]" "<
2016-09-18 13:11:43
180
原创 1006. Sign In and Sign Out (25)
#include#include#include#includeusing namespace std;struct node{string name;int start;int end;};bool cmp1(struct node node1 ,struct node node2){return node1.start}
2016-09-14 19:27:33
137
原创 1005. Spell It Right (20)
#include#include#include#includeusing namespace std;int main(){string s;cin>>s;int l=s.length(),sum=0;stringstream ss;for(int i=0;i{string s1;s1=s.substr(i,1);ss
2016-09-14 18:49:58
161
原创 1003. Emergency (25)
dijkstra算法#include#includeusing namespace std;const int inf = 1000000000;int n;int road[502][502];int cost[502];bool mark[502];int bypass[502],num[502];int people[502];in
2016-09-14 14:07:41
227
原创 1002. A+B for Polynomials (25)
#include#includeusing namespace std;struct node{double x;double sum;};node node[1002];int main(){int k;cin>>k;for(int i=0;i{int x;cin>>x;cin>>node[x].x;
2016-09-12 15:26:46
246
原创 1001 A+B Format (20)
#include#includeusing namespace std;int main(){int a;cin>>a;int b;cin>>b;int max=1000000;int min=1000; int c=a+b;if(c>=max){coutprintf("%04d,%03d",(c%max)/min,c%min);
2016-09-12 15:19:45
227
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人