- 博客(8)
- 收藏
- 关注
原创 LA 2678 Subsequence
题目链接: https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=9&problem=679&mosmsg=Submission+received+with+ID+1430409
2014-04-08 19:42:12 395
原创 UVA 11078 Open Credit System
题目链接: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=22&page=show_problem&problem=2019
2014-04-08 15:21:13 279
原创 UVA 11462 Age Sort
题目链接: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=26&page=show_problem&problem=2457
2014-04-08 15:05:42 302
原创 UVA 11520 Fill the Square
题目链接: #include#includeusing namespace std;int main(){ int T,n; char c[15][15]; cin>>T; for(int kase=1;kase<=T;kase++) { memset(c,0,sizeof c); cin>
2014-04-08 14:05:10 270
原创 HDU 1005 Number Sequence
#includeusing namespace std;int main(){ int a,b,n,f[60]; while(cin>>a>>b>>n && a) { a%=7; b%=7; f[1]=f[2]=1; if(n<55) { for(int i=3;i
2014-04-05 15:49:07 300
原创 HDU 1004 Let the Balloon Rise
#include#include#includeusing namespace std;int main(){ int N,num[1010]; string c[1000]; while(cin>>N && N) { memset(num,0,sizeof num); int t=0; for(int i=
2014-04-05 14:49:37 308
原创 HDU 1003 Max Sum
#includeusing namespace std;const int maxn=100010;int T,N,p[maxn],b[2],e[2],ans[2]; int main(){ cin>>T; for(int t=1;t<=T;t++) { if(t>1) cout<<endl; cin>>N>>p[0];
2014-04-05 14:04:56 271
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人