- 博客(18)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 A + B Problem II
#include<iostream>#include<cstdio>#include<cstring>using namespace std;int main(){ int n,x,y,pi,flag; char str1[1005],str2[1005]; scanf("%d",&n); int a[1005]={0},i,j; for(int k
2015-03-31 00:26:01
336
原创 Let the Balloon Rise
#include<iostream>#include<map>#include<cstring>using namespace std;int main(){ map<string,int>color; int n,maxn; string a,b; while(cin>>n&&n!=0) { maxn=0; for(
2015-03-31 00:25:39
312
原创 Elevator
#include<iostream>using namespace std;int main(){ int n,a[10005]={0},sum=0; while(cin>>n&&n!=0) { sum=0; for(int i=1;i<=n;i++) { cin>>a[i]; }
2015-03-31 00:25:28
319
原创 Number Sequence
#include<iostream>#define maxn 100000005using namespace std;int a[maxn];int main(){ int A,B,n,T,i; while(cin>>A>>B>>n&&(A!=0||B!=0||n!=0)) { a[1]=1; a[2]=1; for
2015-03-31 00:24:32
304
原创 Max Sum
#include<stdio.h>int main(){ int n,m,pos1,pos2,temp,maxn,now,x; scanf("%d",&n); for(int k=1;k<=n;k++) { scanf("%d%d",&m,&temp); now=maxn=temp; pos1=pos2=x=1;
2015-03-31 00:24:27
347
原创 杭电 acm AC Me
#include <stdio.h>#include <string.h>#include <ctype.h>int main(){ int i,len; char s[100000]; while(gets(s)) { int a[26]={0}; len=strlen(s); for(i=0;i<len;i++
2015-03-31 00:23:52
386
原创 杭电 acm Balloon Comes!
#include<stdio.h>#include<iostream>using namespace std;int main(){ int n; scanf("%d",&n); for(int i=0;i<n;i++) { char sign; int a,b; cin>>sign>>a>>b;
2015-03-31 00:22:43
543
原创 杭电 acm Box of Bricks
#include<iostream>#include<algorithm>using namespace std;int main(){ int n,a[100],sum=0,ave,kase=0,coun=0; while(cin>>n&&n!=0) { coun++; for(int i=0;i<n;i++) {
2015-03-31 00:22:03
503
原创 杭电 acm Saving HDU
#include<iostream>using namespace std;struct Bag{ int pi; int mi;};int main(){ int n,v; struct Bag bag[100],temp; while(cin>>v&&v!=0) { int sum=0; cin>>n;
2015-03-31 00:21:14
350
原创 杭电 acm shǎ崽 OrOrOrOrz
#include<stdio.h>#include<algorithm>using namespace std;int a[10005];int main(){ int n,flags=1,t; int i,j; while(scanf("%d",&n)!=EOF) { int k=n; while(k--)
2015-03-31 00:20:42
319
原创 杭电 acm The Seven Percent Solution
#include<iostream>#include<stdio.h>#include<vector>#include<cstring>using namespace std;int main(){ char str[100]; while(gets(str)&&str[0]!='#') { vector<char> vi; vec
2015-03-31 00:19:37
393
原创 杭电 acm Who's in the Middle
includeincludeusing namespace std; int main() { int n,a[10005],i,j; while(cin>>n) { for(i=0;i
2015-03-31 00:19:07
320
原创 杭电 acm 百步穿杨
#include<iostream>#include<algorithm>#include<vector>using namespace std;struct Num{ int a; int b;};int main(){ int n; cin>>n; while(n--) { int k; Num num[
2015-03-31 00:18:24
652
原创 杭电 acm 今年暑假不AC
#include<iostream>using namespace std;struct Time{ unsigned int T1,T2;};int main(){ Time time[100],temp; int n; while(cin>>n&&n!=0) { int kase=1; for(int i=0;i<
2015-03-31 00:16:58
638
原创 杭电acm Biker's Trip Odometer
#include<iostream>#include<iomanip>using namespace std;const double PI=3.1415927;int main(){ double length,time,sum_road,av_speed; int row_number,i=0; while(cin>>length>>row_number>>ti
2015-03-31 00:16:52
317
原创 杭电acmText Reverse
#include<iostream>#include<stdio.h>#include<string.h>#include<ctype.h>using namespace std;int main(){ int n,kase=0; char temp; scanf("%d",&n); getchar(); while(n--) {
2015-03-31 00:15:36
535
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人