tr990511的专栏

Function Run FunTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 12713Accepted: 6621DescriptionWe all love recursion! Don't we? Consider a three-p

World Cup NoiseTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 13552Accepted: 6703DescriptionBackground"KO-RE-A, KO-RE-A" shout 54.000 happy football fan

1000  纯属适应题1003  做的时候花了很久，现在看好像也不难1004  适应题，求下平均就行1005  要读懂题就行1007  逆序数，discuss方法1046  全部暴搜一遍。。1118  照抄2606没看题。。WA。。RE全占了1207  貌似我的方法超级麻烦1247  读懂题目比较麻烦1248  暴力过的。。1250  一整个晚上整这一道题。

#includeint main (){    int al,num,i,n,m=1;    while(scanf("%d",&n)&&n){        int a[55],sum=0;        for(i=0;i        scanf("%d",&a[i]);        sum+=a[i];        }        al=sum/n

#includeint main(){    int a[31];    int n,tmp,tol;    while(1){  int sum=0;  scanf("%d",&n);  if(n==0)break;  for(int i=1;i   scanf("%d",&a[i]);   sum+=a[i];}  if((sum%2!=0)){pr

#include#define max 32769//32767int main (){    int n=1;    while (1){        int d_max=1;        int num=0,max_s=1;        int a[max];//存储数组        int b[max];//记录最长        scanf("%

1

DescriptionFarmer John made a profit last year! He would like to invest it well but wonders how much money he will make. He knows the interest rate R (an integer between 0 and 20) that is compound

3278 Catch That CowDescriptionFarmer Johnhas been informed of the location of a fugitive cow and wants to catch herimmediately. He starts at a pointN (0 ≤N ≤ 100,000) on a numberline and the cow