755 - 487-3279

[hiloshi]

hi tetuya!
I think you had take mistake in func method.

[cpp]
if(counter>0)
printf("%03d-%04d %d\n",tmp/10000,tmp%10000,++counter);

}
skip:;
if(duple) cout << "No duplicates." << endl;
}
[/cpp]

Label skip and follow code is executed any case.
You should type "return" before label skip:

Check this input

1

2
1111111
1111111
--------------
correct output is
111-1111 2

but your program will output
111-1111 2
No duplicates.

[tetuya]

No soon had I followed your Advice and submitted,than I got Accepted !

Thank you for your Accurate Advice !

My heart was saved (^-')b

[tetuya]

Hello emka.
It's a bug.

Code: Select all

else if ( s[i] == 'O' || s[i] == 'N' || s[i] == 'O' || s[i] == '6' )

good luck

[tetuya]

Hi 20717TZ.

string is slow in case of this problem.
you could handle it with primitive measure.

[Ivo Sluganovic]

How is it possible that for the following code,
OJ says it uses only 64 KB when it should use at least 0.3 MB?

It also says WA in 0.00 seconds.

[c]
[/c]

I don't understand this.

[Ivo Sluganovic]

I found the error.

[Ali Arman Tamal]

Why OJ gives WA Please help me ...

Code: Select all

CUT AFTER AC


Please Help !

[kenneth]

Would anyone be able to provide some input and output with lots of data in there as i think my program is correct, but keep getting WA =p

Thanks alot

[Raj Ariyan]

Hi,
You can check this input. Hope it helps. Good luck

Input :-

4

5
-0-0-0-0-1-0-1
IYSDS-1-1-
MMDPS-22
0000A--AA
-----AMSAM--AA

6
3-10-10-1A
6464642
ASACCS5
-1111115
F101010
888-1200

5
-5-5-9-7-4-9-2
2947955
GO-HOME-1
HOME-123
12344-AA

9
-123-5657
12----12121
ABBCSS1
12112-A--B
ABBC-123
-1-2----3AABC
KKSDS-AA
ALNKNDS
----KKJ1234

Output:-

No duplicates.
No duplicates.
No duplicates.
No duplicates.

[kenneth]

I think the 3rd test case is wrong since the number of phone numbers is wrong.

Furthermore, for the last input, how come the output is as such?

[Raj Ariyan]

Hi Kenneth.
I'm extreamly sorry. Actually when i copy my input file at that time something was missing. Now i edited my input and output. Sorry again.

[Raj Ariyan]

Hi Tamal,

There are two mistake.

1. You print your output like this

printf("%3d-%4d",temp/10000,temp%10000);
printf(" %ld\n",count);

But what abt this case --->
** when temp/10000 returns 1 digit then u print only 1 not 001
output will be 001-0002 2, but ur output will be 1- 2 2
so use this :-

printf("%03ld-%04ld",temp/10000,temp%10000);
printf(" %ld\n",count);

2. You always print extra new line cause you a P.E.

I think u still get P.E after modify this. That is upto you. Good Luck.

[Ali Arman Tamal]

Thank you Raj Ariyan
I got AC

I really appreciated your help, I didn't thought of that problem.

Thanks

[sunnycare]

i solved the problem 755 ,but used 9.928 seconds ...

i see others use only 0.0xx seconds......

i have generated 1,000,000 random telephone number,and my prog solved it in 118.xxx seconds......so long......

my code here

Code: Select all

#include <iostream>
#include <string>
#include <map>

using namespace std;

long t[26]={2,2,2,
            3,3,3,
            4,4,4,
            5,5,5,
            6,6,6,
            7,7,7,7,
            8,8,8,
            9,9,9,9};
long table[128];

long convert(string &s)
{
   
   long n=s.length();
   long ret=0;
   long i;
   for(i=0;i<n;i++)
   {
      if(s[i]!='-')
         ret=ret*10+table[s[i]];
   }
   
   return ret;
}
void InitTable()
{
   unsigned char i;
   for(i=0;i<128;i++)
   {
      if(i>='0'&&i<='9')
         table[i]=i-'0';
      else
         if(i>='A'&&i<='Z')
            table[i]=t[i-'A'];
   }
}
void main()
{
   
   InitTable();
   
   long ncase;
   string s;
   long tel;
   long occu;
   long n;
   cin>>ncase;
   map<long,long> telmap;
   map<long,long>::iterator ptr,end;
   cout.fill('0');
   while(ncase-->=1)
   {
      cin>>n;
      telmap.clear();
      while(n-->=1)
      {
         cin>>s;
         telmap[convert(s)]++;
      }
      ptr=telmap.begin();
      end=telmap.end();
      bool dup=false;
      
      while(ptr!=end)
      {
         if(ptr->second!=1)
         {
            dup=true;
            cout.width(3);
            tel=ptr->first;
            cout<<tel/10000<<'-';
            cout.width(4);
            cout<<tel%10000<<' ';
            cout<<ptr->second<<endl;
         }
         ptr++;
      }
      if(!dup)
         cout<<"No duplicates."<<endl;
      if(ncase!=1)
         cout<<endl;
      
   }

}


my code looks ugly..... need help...[/code]

[mf]

I used my own tuned implementation of quicksort and read() function to take input, and ran less than 1 second.

Try to get rid of STL, cin/cout. This will speed up your program significantly.