OJ Board

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 #include <iostream> #include <string> #include <map> using namespace std; long t[...

thanks very much!

i really misunderstand it...

input:
10
3 1 2 4 9 5 10 6 8 7
2 10 1 3 8 4 9 5 7 6

output:
9



why the output is 9? i think it is 5...

thanks

i always add a blank line after the last output..

i want to know why i got P.E.

it seems if i submit a multiple input problem , i will got P.E.

need some sample ouput ......
(maybe i lose one blank line somewhere,i think) ..

thanks

accepted!

i think this problem is very easy.....but i got WA again and again..... i dont know ..... who can give me some input and output smaple..?? #include <iostream> #include <cmath> using namespace std; void main() { double a1,b1,c1; double a2,b2,c2; cout.setf(ios::fixed,ios::floatfield); cout.precision(3...

what's the limit of the input number?
shall i use BigInteger??

right..thanks..

why it is always WA............ I misunderstand the problem?? #include <iostream> using namespace std; void main() { unsigned long n; while((cin>>n) != NULL) { if(n!=1) { long *p=new long[n]; long *q=new long[n]; unsigned long i=0; while(i<n) { cin>>p[i]; q[i]=0; i++; } for(i=0;i<n-1;i++) { unsigned...

why use fstream?

#include <iostream> using namespace std; unsigned long primeTable[25]={2,3,5,7, 11,13,17,19, 23,29, 31,37, 41,43,47, 53,59, 61,67, 71,73,79, 83,89, 97}; unsigned long func(unsigned long n,unsigned long p) { unsigned long i=0; while(n>0) { n=n/p; i+=n; } return i; } void main() { unsigned long n; ci...

thanks ...
but why ?

my code here .....I dont know why it wrong..... #include <iostream> using namespace std; void main() { char *str[6]={"BCG","BGC","CBG","CGB","GBC","GCB"}; unsigned int a[9]; //store input num unsigned int b[6]; while(1) { if(cin.eof()) brea...