周赛题解

N！Again

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 23   Accepted Submission(s) : 10

Problem Description

WhereIsHeroFrom:             Zty, what are you doing ?
Zty:                                     I want to calculate N!......
WhereIsHeroFrom:             So easy! How big N is ?
Zty:                                    1 <=N <=1000000000000000000000000000000000000000000000…
WhereIsHeroFrom:             Oh! You must be crazy! Are you Fa Shao?
Zty:                                     No. I haven's finished my saying. I just said I want to calculate N! mod 2009


Hint : 0! = 1, N! = N*(N-1)!

 

Input

Each line will contain one integer N(0 <= N<=10^9). Process to end of file.

 

Output

For each case, output N! mod 2009

 

Sample Input

4 5

 

Sample Output

24 120

 

题解：（a+b）%2009=a%2009+b%2009;而任一个数如果大于2009就可以写成a=（2009*x+b）再与另外一个数相乘有用的就是b也就是amod(%)2009;

代码：

#include<stdio.h> 
#include<string.h>
int main()
{
    int temp,N;
    while(~scanf("%d",&N)){temp=1;
        for(int i=1;i<=N;i++){
            temp*=i;
            if(temp>=2009)temp%=2009;
            if(i>2009)break;
        }
        printf("%d
",temp);
    }
    return 0;
} 

1sting

Time Limit : 5000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 35   Accepted Submission(s) : 10

Problem Description

You will be given a string which only contains ‘1’; You can merge two adjacent ‘1’ to be ‘2’, or leave the ‘1’ there. Surly, you may get many different results. For example, given 1111 , you can get 1111, 121, 112,211,22. Now, your work is to find the total number of result you can get.

 

Input

The first line is a number n refers to the number of test cases. Then n lines follows, each line has a string made up of ‘1’ . The maximum length of the sequence is 200.

 

Output

The output contain n lines, each line output the number of result you can get .

 

Sample Input

3 1 11 11111

 

Sample Output

1 2 8

 题解：大数斐波那契；

代码：

#include<stdio.h> 
#include<string.h>
#define MAX(x,y) x>y?x:y
char a[201][1010]; 
void bignum(char *x,char *y,int v){int c[1010],d[1010],z[1010];
    int t,t1,t2,i,j;
    memset(c,0,sizeof(c));
    memset(d,0,sizeof(d));
    memset(z,0,sizeof(z));
    t1=strlen(x);
    t2=strlen(y);
    t=MAX(t1,t2);
    for(i=t1-1,j=0;i>=0;i--,j++)c[j]=x[i]-'0';
    for(i=t2-1,j=0;i>=0;i--,j++)d[j]=y[i]-'0';
    for(i=0;i<t;++i){
        z[i]=c[i]+d[i]+z[i];
        if(z[i]>9)z[i+1]++,z[i]%=10;
        if(z[t])t++;
    }
    for(i=t-1,j=0;i>=0;i--,j++){
        a[v][j]=z[i]+'0';
    }
    a[v][j]='';
}
int main()
{
    
    int n,m,i,j,l;
    char s[201];
    memset(a,0,sizeof(a));
    a[0][0]='0';
    a[1][0]='1';
    a[2][0]='2';
    //printf("%s %s %s
",a[0],a[1],a[2]);
    for(i=3;i<=200;i++)
    {
        bignum(a[i-1],a[i-2],i);
    }
    scanf("%d",&n);
    getchar();
    while(n--)
    {
        scanf("%s",s);
        l=strlen(s);
        printf("%s
",a[l]);
    }
    return 0;
} 

Word Amalgamation

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 20000/10000K (Java/Other)

Total Submission(s) : 5   Accepted Submission(s) : 3

Problem Description

In millions of newspapers across the United States there is a word game called Jumble. The object of this game is to solve a riddle, but in order to find the letters that appear in the answer it is necessary to unscramble four words. Your task is to write a program that can unscramble words.

 

Input

The input contains four parts: 1) a dictionary, which consists of at least one and at most 100 words, one per line; 2) a line containing XXXXXX, which signals the end of the dictionary; 3) one or more scrambled 'words' that you must unscramble, each on a line by itself; and 4) another line containing XXXXXX, which signals the end of the file. All words, including both dictionary words and scrambled words, consist only of lowercase English letters and will be at least one and at most six characters long. (Note that the sentinel XXXXXX contains uppercase X's.) The dictionary is not necessarily in sorted order, but each word in the dictionary is unique.

 

Output

For each scrambled word in the input, output an alphabetical list of all dictionary words that can be formed by rearranging the letters in the scrambled word. Each word in this list must appear on a line by itself. If the list is empty (because no dictionary words can be formed), output the line "NOT A VALID WORD" instead. In either case, output a line containing six asterisks to signal the end of the list.

 

Sample Input

tarp given score refund only trap work earn course pepper part XXXXXX resco nfudre aptr sett oresuc XXXXXX

 

Sample Output

score ****** refund ****** part tarp trap ****** NOT A VALID WORD ****** course ******

 题解：查找，注意排序

代码：

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
using namespace std;
char m[10010][100];
char temp[110],temp1[110];
int cmp(const void *a,const void *b){
    if(strcmp((char *)a,(char *)b)>0)return 1;
    else return -1;
}
int t=0,c[110],p;
int find(char *s){int x=strlen(s),y,flot=0;sort(s,s+x);p=0;
    for(int i=0;i<=t;++i){y=strlen(m[i]);
        strcpy(temp,m[i]);
        sort(temp,temp+y);
        if(!strcmp(temp,s))printf("%s
",m[i]),flot=1;
    }
    return flot;
}
int main(){
    int i;
    while(scanf("%s",m[t]),strcmp(m[t],"XXXXXX"))t++;
    qsort(m,t,sizeof(m[0]),cmp);
    while(scanf("%s",temp1),strcmp(temp1,"XXXXXX")){
        if(!find(temp1))puts("NOT A VALID WORD");
        puts("******");
    }
    return 0;
}

叠筐

Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 52   Accepted Submission(s) : 11

Problem Description

需要的时候，就把一个个大小差一圈的筐叠上去，使得从上往下看时，边筐花色交错。这个工作现在要让计算机来完成，得看你的了。

 

Input

输入是一个个的三元组，分别是，外筐尺寸n（n为满足0<N<80的奇整数），中心花色字符，外筐花色字符，后二者都为ASCII可见字符；< div>

 

Output

输出叠在一起的筐图案，中心花色与外筐花色字符从内层起交错相叠，多筐相叠时，最外筐的角总是被打磨掉。叠筐与叠筐之间应有一行间隔。

 

Sample Input

11 B A 5 @ W

 

Sample Output

AAAAAAAAA ABBBBBBBBBA ABAAAAAAABA ABABBBBBABA ABABAAABABA ABABABABABA ABABAAABABA ABABBBBBABA ABAAAAAAABA ABBBBBBBBBA AAAAAAAAA @@@ @WWW@ @W@W@ @WWW@ @@@

 题解：坑，注意两边磨损的都是空格；；；

代码：

/*1007题Input不全，后边内容为（n为满足0<n<80的奇整数），
中心花色字符，外筐花色字符，后二者都为ASCII可见字符；*/
#include<stdio.h>
#include<string.h>
char m[81][81];
int main(){char a,b,c;
    int n,i,x,y,flot=0;
    while(~scanf("%d %c %c",&n,&a,&b)){i=1;x=y=0;
    if(flot)puts("");
    flot++;
    c=(n+1)/2%2?a:b;
    memset(m,0,sizeof(m));m[0][0]=c;
        while(i<n*n){
            while(m[y][x+1]==''&&x+1<n)m[y][++x]=c,i++;
            while(m[y+1][x]==''&&y+1<n)m[++y][x]=c,i++;
            while(m[y][x-1]==''&&x-1>=0)m[y][--x]=c,i++;
            while(m[y-1][x]==''&&y-1>=0)m[--y][x]=c,i++;
            c=a+b-c;
        }
        for(y=0;y<n;++y){
            for(x=0;x<n;x++){
                if(n==1)m[0][0]=a;
                else if(y==0)m[y][0]=' ',m[y][n-1]=' ';
                else if(y==n-1)m[y][0]=' ',m[y][n-1]=' ';
                m[y][n]='';
            }
        }
        if(n==1)printf("%c
",a);
        else for(y=0;y<n;++y)printf("%s
",m[y]);
    }
    return 0;
}

I Love You Too

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 9   Accepted Submission(s) : 5

Problem Description

This is a true story. A man showed his love to a girl,but the girl didn't replied clearly ,just gave him a Morse Code:
****-/*----/----*/****-/****-/*----/---**/*----/****-/*----/-****/***--/****-/*----/----*/**---/-****/**---/**---/***--/--***/****-/   He was so anxious that he asked for help in the Internet and after one day a girl named "Pianyi angel" found the secret of this code. She translate this code as this five steps:
1.First translate the morse code to a number string:4194418141634192622374
2.Second she cut two number as one group 41 94 41 81 41 63 41 92 62 23 74,according to standard Mobile phone can get this alphabet:GZGTGOGXNCS

3.Third she change this alphabet according to the keyboard:QWERTYUIOPASDFGHJKLZXCVBNM = ABCDEFGHIJKLMNOPQRSTUVWXYZ
So ,we can get OTOEOIOUYVL
4.Fourth, divide this alphabet to two parts: OTOEOI and OUYVL, compose again.we will get OOTUOYEVOLI
5.Finally,reverse this alphabet the answer will appear : I LOVE YOU TOO

I guess you might worship Pianyi angel as me,so let's Orz her.
Now,the task is translate the number strings.

 

Input

A number string each line(length <= 1000). I ensure all input are legal.

 

Output

An upper alphabet string.

 

Sample Input

4194418141634192622374 41944181416341926223

 

Sample Output

ILOVEYOUTOO VOYEUOOTIO

 题解：一遍ac，读懂题就好，不过想交个这样的女朋友也真累，要是我肯定看不出来；

代码：

#include<stdio.h>
#include<string.h>
char m[26]={'Q','W','E','R','T','Y','U','I','O','P','A','S','D','F','G','H','J','K','L','Z','X','C','V','B','N','M'};
char sj[11][5]={"","","ABC","DEF","GHI","JKL","MNO","PQRS","TUV","WXYZ"};
char n[1010],temp1[1010],temp2[1010],temp3[1010];
int t;
void step1(char a,char b){
    temp1[t]=sj[a-'0'][b-'0'-1];
    for(int i=0;i<26;++i){
        if(m[i]==temp1[t])temp2[t]='A'+i;
    }
    t++;
}
void step2(){
    int v=strlen(temp2),i,j,k;
    memset(temp1,0,sizeof(temp1));
    //printf("%s
",temp2);
    for(i=0;i<(v+1)/2;++i)temp1[i]=temp2[i];
    for(i=0,j=(v+1)/2,k=0;j<v;++i,++j)temp3[k++]=temp1[i],temp3[k++]=temp2[j];
    if(v&1)temp3[k++]=temp2[(v+1)/2-1];
    //printf("%s
",temp3);
    for(i=0,j=k-1;i<k;i++,j--)n[i]=temp3[j];
    n[i]='';
}
int main(){
char s[1010];
while(~scanf("%s",s)){t=0;int x;
memset(n,0,sizeof(n));
memset(temp1,0,sizeof(temp1));
memset(temp2,0,sizeof(temp2));
memset(temp3,0,sizeof(temp3));
x=strlen(s);
    for(int i=0;i<x;i+=2){
        step1(s[i],s[i+1]);
    }
    step2();
    printf("%s
",n);
}
return 0;}

1006题Input不全，后边内容是(0<n,m<=2000). The input is terminated when n=0 and m=0. 1007题Input不全，后边内容为（n为满足0<n<80的奇整数），中心花色字符，外筐花色字符，后二者都为ASCII可见字符；

数塔

Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 14   Accepted Submission(s) : 11

Problem Description

在讲述DP算法的时候，一个经典的例子就是数塔问题，它是这样描述的：

有如下所示的数塔，要求从顶层走到底层，若每一步只能走到相邻的结点，则经过的结点的数字之和最大是多少？

已经告诉你了，这是个DP的题目，你能AC吗?

 

Input

输入数据首先包括一个整数C,表示测试实例的个数，每个测试实例的第一行是一个整数N(1 <= N <= 100)，表示数塔的高度，接下来用N行数字表示数塔，其中第i行有个i个整数，且所有的整数均在区间[0,99]内。

 

Output

对于每个测试实例，输出可能得到的最大和，每个实例的输出占一行。

 

Sample Input

1 5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5

 题解：最简单的动态规划

代码：

#include<stdio.h>
#define MAX(x,y) x>y?x:y 
int dp[110][110];
int main()
{int x,y,N,C;
scanf("%d",&C);
    while(C--){
        scanf("%d",&N);
        for(y=0;y<N;y++){
            for(x=0;x<=y;x++){
                scanf("%d",&dp[x][y]);
            }
        }
        for(y=N-2;y>=0;y--){
            for(x=0;x<=y;x++){
                dp[x][y]+=MAX(dp[x][y+1],dp[x+1][y+1]);
            }
        }
        printf("%d
",dp[0][0]);
    }
    return 0;
}