The ACM/ICPC Asia Harbin Online First Round Contest 2010 Warmup-2

1001

table

TimeLimit: 1 Second   MemoryLimit: 32 Megabyte

Totalsubmit: 1692   Accepted: 270  

Description

There is a table, on which some plates were put in a circle. Some apples were put in the plates. Let's play a game. For each plate, separate the apples into two parts. For example if a plate containing M apples, put M/2 apples into the lefthand plate and the rest to the righthand plate. Note that if M is a odd number, then M/2 equals (M-1)/2. Plates are numbered from 1 to N in counter-clockwise. The lefthand plate is the plate whose number is smaller. The lefthand plate of plate numbered 1 is the plate numbered N. Given the number of apples in each plate(1,2,...N), output the the number of apples in each plate when game is over.

Input

The input contains multiple test case. The first line of each case contains a integer N, the number of plates on the table, followd by N integers representing the number of apples in the plates(1,2,...N).

Output

For each test case print the number of apples in each plate(from numbered 1 to N) when game is over.

Sample Input

5
1 2 3 4 5
10
1 2 3 4 5 6 7 8 9 10

Sample Output

4 2 3 4 2
6 2 3 4 5 6 7 8 9 5

 

#include<stdio.h> #include<string.h> int main() { int n; int a[10000]; int b[10000]; int c[10000]; while(scanf("%d",&n)!=-1) { memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); memset(c,0,sizeof(c)); if(n==0) continue; int i; for(i=1;i<=n;i++) { scanf("%d",&a[i]); b[i]=a[i]; c[i]=a[i]; } if(n==1) { printf("%d/n",a[n]); continue; } for(i=1;i<=n;i++) { if(i==1) { a[n]+=b[1]/2; a[2]+=(b[1]-b[1]/2); } else if(i==n) { a[n-1]+=b[n]/2; a[1]+=(b[n]-b[n]/2); } else { a[i-1]+=b[i]/2; a[i+1]+=(b[i]-b[i]/2); } } for(i=1;i<n;i++) printf("%d ",a[i]-c[i]); printf("%d/n",a[n]-c[n]); } return 0; }

 

 

print

TimeLimit: 1 Second   MemoryLimit: 32 Megabyte

Totalsubmit: 544   Accepted: 364  

Description

Give you a number, print characters like this:

1
*
2
...
.*.
...
3
*****
*...*
*.*.*
*...*
*****

Input

The input contains multiple test cases. Each case consist of a integer n.

Output

For each test case, print the character table like the examples.

Sample Input

1
2
3
4
5

Sample Output

*
...
.*.
...
*****
*...*
*.*.*
*...*
*****
.......
.*****.
.*...*.
.*.*.*.
.*...*.
.*****.
.......
*********
*.......*
*.*****.*
*.*...*.*
*.*.*.*.*
*.*...*.*
*.*****.*
*.......*
*********

#include<iostream> using namespace std; char g[1000][1000]; int x[8]={1,1,0,-1,-1,-1,0,1}; int y[8]={0,1,1,1,0,-1,-1,-1}; int main() { int n; while(cin>>n) { g[n][n]='*'; int tp=1; int nn=n; char ch; while(nn--) { if(tp&1) ch='.'; else ch='*'; for(int i=0;i<=tp;i++) g[n+tp][n-i]=ch; for(int i=0;i<=tp;i++) g[n+tp][n+i]=ch;//xia for(int i=0;i<=tp;i++) g[n-tp][n-i]=ch; for(int i=0;i<=tp;i++) g[n-tp][n+i]=ch;//shang for(int i=0;i<=tp;i++) g[n+i][n-tp]=ch; for(int i=0;i<=tp;i++) g[n-i][n-tp]=ch; //zuo for(int i=0;i<=tp;i++) g[n+i][n+tp]=ch; for(int i=0;i<=tp;i++) g[n-i][n+tp]=ch; //you tp++; if(nn==1) break; } for(int i=1;i<=2*n-1;i++) { for(int j=1;j<=2*n-1;j++) cout<<g[i][j]; cout<<endl; } } return 0; }

 

 

1003

count

TimeLimit: 1 Second   MemoryLimit: 32 Megabyte

Totalsubmit: 1191   Accepted: 342  

Description

Given a number of strings, can you find how many times a string appear in the input?

Input

The input contains multiple test cases. Each case begins with a integer N(the number of strings you will get, N<=100000), followed by N lines, each consists of a string.

Output

For each test case, print "Case K:" where K is the Kth case. K begins with 1. Then print the times(T) a string appears and the number(M) of strings that appear T times. Don't print T or M where M<=0. The output is ordered by T. The length of each strings won't longer than 20.

Sample Input

5
BBA
BBA
BEA
DEC
CCF

Sample Output

Case 1:
1 3
2 1

#include<stdio.h> #include<iostream> #include<string> #include<map> #include<algorithm> #include<string.h> using namespace std; int main() { int n; int p=1; int sum[100001]; while(scanf("%d",&n)!=-1) { int i; memset(sum,0,sizeof(sum)); map<string,int> m; for(i=0;i<n;i++) { string temp; cin>>temp; m[temp]++; } map<string,int>::iterator map_m=m.begin(); for(;map_m!=m.end();map_m++) { sum[map_m->second]++; } printf("Case %d:/n",p++); for(i=1;i<100001;i++) { if(sum[i]>0) printf("%d %d/n",i,sum[i]); } } return 0; }

 

 

1004

 

Sum Of SubRectangular Parallelepiped

TimeLimit: 2 Second   MemoryLimit: 32 Megabyte

Totalsubmit: 503   Accepted: 144  

Description

There is a rectangular parallelepiped with a integer in each cell.Can you caculate the maximum sum of sub rectangular parallelepipeds?

Input

Input contains multiple test cases. The first line is the test number T, followed by cases. Each case begin with three integer L,M,N presenting the rectangular parallelepiped you will get. Then L matrixes each with M rows and N column follow.

Output

For each case print a line with the maximum sum of sub rectangular parallelepipeds.If all the integers are negtive,print 0.

Sample Input

1
2 2 2
7 -4
3 7

-9 -6
4 7

Sample Output

21

Source Code Problem: 1004 Username: team11 Run Time: 1573MS Memory: 11776K Language:C++ JudgeStatus: Accepted #include <iostream> #include <cstdio> using namespace std; const int maxn = 1009; int rem[maxn]; int map[59][maxn][maxn]; int sto[maxn][maxn]; int t1, t2, t3; int re() { int res = 0; int tmp = 0; for(int i = 1; i <= t3; i++) { if( tmp > 0 ) tmp += rem[i]; else tmp = rem[i]; res = tmp > res ? tmp : res; } return res; } int tes() { int i,j,k,max=0,temp=0; for(i=1;i<=t2;i++) { memset(rem,0,sizeof(rem)); for(j=i;j<=t2;j++) { for(k=1;k<=t3;k++) rem[k]+=sto[j][k]; temp=re(); if(temp>max)max=temp; } } return max; } int ans() { int tmp,res; res = -1; for(int t = 1;t <= t1; t++) { memset(sto,0,sizeof(sto)); for(int k = t;k <= t1; k++) { for(int i = 1; i <= t2; i++) for(int j = 1; j <= t3; j++) sto[i][j] += map[k][i][j]; tmp = tes(); res = tmp > res ? tmp : res; } } return res; } int main() { int cas; scanf("%d",&cas); while(cas--) { scanf("%d%d%d",&t1,&t2,&t3); for(int i=1;i<=t1;i++) for(int j=1;j<=t2;j++) for(int k=1;k<=t3;k++) scanf("%d",&map[i][j][k]); printf("%d/n",ans()); } return 0; }  

1006

 

ACM again- Ancient China Mathematics again

TimeLimit: 1 Second   MemoryLimit: 32 Megabyte

Totalsubmit: 263   Accepted: 20  

Description

ACM again- Ancient China Mathematics again
ACM again- Ancient China Mathematics again


Dr.K has published a essay on ACM(Ancient China Mathematics), he asked me to thank you for your help what really helped a lot. But another problem raised that the ACM is not as simple as we descripted last time.

In order to help you understand it, we should first go over the ancient people's counting system again:

1、They use only 7 digits to represent numbers, and numbers are as follow:

| -> 1

|| -> 2

||| -> 3

|||| -> 4

||||| -> 5

|||||| -> 6

||||||| -> 7

It is a pity that they have not developed "0" before these people disapeared.

2、If a number is greater than 7, they use digit place just as we do today. Between each two digit places, there is a ",".

eg:

|||||,|| -> 42 (5x8+2)

|||,||,|||| -> 212 (3*64+2*8+4)

In Dr.K's further study, he noticed that, there comes another two symbols - "[" and "]". They are often used together and there is always an expression between them. To see it more clearly, we define it as a grammer expression:

expression = [exp1]

exp1 = [exp1] | [exp1]exp1 | exp1[exp1] | Digit

Digit = "|" | "||" | "|||" | "||||" | "|||||" | "||||||" | "|||||||"

For example:

[||,||||]

[[||][||,|]]

[||[|||][|||||,|]]

are all acceptable expressions.


But what does these expressions mean? That really confused Dr.K a long time, fortunately, he conquered it. He found that:

1、"[]" is used in pairs and all the time with an expersion between them.

2、An expersion is always a number (certainly in their "|||..." form) or another expression.

3、An "exp1[exp2]" or "[exp1]exp2" expersion means exp1 + exp2.

4、An "[exp1][exp2]" expersion means exp1 x exp2.

For example:

[||[||]] = 2+2 = 4

[|] = 1

[[||][|,|]] = 2x9 = 18

[||[[||]|][||]|,||] = 2+(2+1)x2+10 = 18

As same as mordern mathematics, multiplication is piror to addition, and expersion in a "[]" should be count piror to the outer expersion.

For another time, he turns to you for help, it is sure that you will not let him down.

Input

The first line of standard input contains an integer N, the number of test cases. N lines followed.

In each line a squence is given, it is guaranteed that the length of the squence will not exceed 1024 characters and the outcome number will not be greater than 1000000.

Output

For each case you are to output a line giving the number in today's decimal counting system.

Sample Input

3

[||[||]]

[|]

[[||][|,|]]

Sample Output

4

1

18

 

 

 

今天的名次是33，嘿，按照成绩说还是不错的。不过让我感觉到有很多高手没有参加，否则会是这个名词吗？？？

桂晨先把1003用map水过去，接着我没过多久，冯新宇把三维的最大字段和A掉，我是最悲剧的，那个print题花了我1个小时，一直再找bug，还好最后找到了。那个1001数据有问题，挂了1400来人，桂做完了一直没提交，等到哈工大说数据有误抱歉时，桂才提交。

今天的比赛我们全是1Y，而且是4道题中排名第二的，所以才是33名。

悲剧的还是我，最后那个表达式计算根本没做过，我写了近俩小时……悲剧啊！！！

还有1005没读懂题……………………  以后怎么办？？？

 

一句话 会的太少！！！