OJ Board

I solved this problem just now,
and want to share some information to those who is trobled with this question.

First,you may not need to stored those num you count before.
When I stored, I got AC by 1.1 sec.
When I didn't, I got AC by 1.3 sec.

You can just try using those factors to build the ans ...

There were a mistake in my input.
(Because I typed -....--.-.-- however it should be -....- -.-.--)
And I've fix it, still getting WA..

I have tried all test case that everyone offered and passed all of them.

But I still got WA.

And I also tried this

3 ...

Is there a better way to solve this question?

Thanks for your advise .
#include<iostream>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
typedef struct _set
{
int v,t;
}PG;
PG s[1001];
void makeset(PG* s,int smax)
{
for(int i=1;i<=smax;i ...