I've got WA #5. Help me, please!


#include <string.h>
#include <iostream>

int main(int argc, char* argv[])
{
        char s[51];
        int a[26];
        for(int i=0;i<26;i++)
                a[i] = 0;
        std::cin>>s;
        for(int i=0;i<strlen(s);i++)
                (a[(int)(s[i]) - 91])++;
        int max = 0;
        bool g = false;
        for(int i=0; i<26; i++)
                if (max<a[i])
                {
                        max = a[i];
                }
        for(int i=0;i<strlen(s);i++)
                if(a[(int)(s[i]) - 91] == max)
                {
                g=true;
                std::cout<< s[i];
                a[(int)(s[i]) - 91] = -1;
                }
                else if (g)
                {
                        break;
                }
        std::cout<<"\n";
        return 0;
}

Edited by author 23.09.2011 00:42

Edited by author 23.09.2011 00:43

6
abcabcabcf
15 15 15 15 18 19 18 18 19 18

Hi,
 Please let me know the input for Test#2.
 I have verified my program with different test cases and is working fine.
 It would be interesting to see which test case is failing.

Could anyone post 1st test? My solution passes all tests I found here or come up with myself, but still get WA1.

#include <iostream>
#include <string>
using namespace std;


long p[260000],x,i,j,k,d,l;
char t[260000],s[510000];
void prefix()
{

     p[0]=0;k=0;
     for (i=1;i<x;i++)
     {
         while ((k>0)&&(t[k]!=t[i])) k=p[k];

         if (t[k]==t[i]) k++;
         p[i]=k;

     }

}

   void solve()
   {
        k=0;d=0;
        for (i=0;i<2*x;i++)
        {
            while ((k>0)&&(t[k]!=s[i])) k=p[k];
            if (s[i]==t[k]) k++;
            if (k>=x) {d=1;break;}
        }
        l=2*x-i-1; if (l==x) l=0;
        if (d==0) cout<<-1<<endl; else cout<<l<<endl;
   }

int main()
{long l;
   freopen("input.txt","r",stdin);
   freopen("output.txt","w",stdout);
    cin>>x; cin.get();
    for (i=1;i<=x;i++)
     p[i]=0;
     gets(s);
    l=strlen(s);
     gets(t);

     strncat(s,s,l);
     l=strlen(s);
     prefix();

     solve();
    fclose(stdin); fclose(stdout);
    return 0;
}
what is wrong here?

Tell me what is 6 test pelase

I've found out that there's a triangle in this test.
My program is likely to find the center of inscribed circle
correctly, so I don't understand where is the mistake.
Can somebody give me more information to pass this test?

[Code deleted by moderator]

Edited by moderator 04.03.2012 00:14

Edited by author 03.07.2011 19:23

what does fairly mean

this is a O(n^3) algo for this problem:
- for each node such v, first you use dijekstra which have a "v" as a root, then you   clacute the:
            k= E.wei + dis[E.e1]+ dis[E.e2].
  where E is a edge that not exist in a tree of dijekstra algo, and E is
  a (e1, e2). and at the end you must print the minimum of all the k.

sorry for my poor english.

Edited by author 12.11.2010 11:12

Edited by author 12.11.2010 11:13

#include <iostream>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<iomanip>
using namespace std;
void main(){
    std::cout<<fixed;
    cout.precision(4);
long double K[500];long double L[500]; int flag=0;

while (std::cin>>K[flag])
{flag++;
};






for(int k=flag-1;k>=0;k--){L[k]=sqrt((double)K[k]);
std::cout <<L[k]<<"\n";};
printf(" ");
//system("pause");
}

please, change the task! firstly, the first number is time of ZZZ.secondly, if the commands have the same time, the right aswer is 'no chance'.

input:
2 2
10
Output:
2.00
1 1
Algo:
cin>>a>>b; cin>>k;
    for(i=0; i<=k-1; i++){
              for(j=0;j<=k-i; j++){
               l=i*i+j*j;
               g=i*a+j*b;
               x=g-l;
              if(x>=r){n++; r=x; s[n]=r; si[n]=i; sj[n]=j;}}}
      for(int y=1; y<=n; y++){ if(s[n]==s[y]){
              cout<<fixed<<setprecision(2)<<s[y];
              cout<<endl<<si[y]<<" "<<sj[y]<<endl; } }

Is it right?

I did not quite understand this part.
"calculated modulo 10^9 + 9"
What does that mean, and what is it used for...?

I know what modulo is, but I don't know what am I supposed to do with it... :)

Edited by author 06.05.2008 01:54

Edited by author 06.05.2008 01:54

Edited by author 06.05.2008 01:54

Can someone explain test number 5?

pleas help anybodoy to minimize time in java

I tried to use <pair.h> in my programm, but there is a compilation error. How can i use it?
I don't wan't to use map.

It'll be cool to have internal message system (so users can contact directly to each other, without forum)... Comrades! Vote for this, if you agree!!!

I don't understand, why only 96 authors got ac.