OJ Board

tnx CodeMaker.

Dear martin can u solve this test case : 10 14?

is there any idea about this problem?

What's wrong with my code?


#include <stdio.h>
#include <string.h>
#include <math.h>
double pi=3.141592653589793;
double r=6378;
struct city
{
char name[32];
double x;
double y;
int l;
};
city a[102];
char p[102];
char q[102];
main()
{
int i=0,lp,lq,j,f,g,h,c;
double d;
scanf("%s",&a[i ...

what's wrong with my code?

#include <stdio.h>
#include <string.h>
#include <math.h>

char a[50];
char a1[50];
char b[50];
char b1[50];
main()
{
int i,j,h,la,lb,f,ma,mb;
unsigned long va,vb;
while(scanf("%s%s",&a1,&b1)==2)
{
ma=mb=0;
strcpy(a,a1);
strcpy(b,b1);
f=0;
la=strlen(a)-1;
lb ...

thanx Dear Arsalan.I got AC.
But is there faster algorithm for this problem?

can any body give i/o for this problem.I got WA

very very tnx A1.But I dint know why

dear sohel
406:D

help me WA :(
[cpp]
#include <stdio.h>

int main()
{
int a[]={1,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,
101,103,107,109,113,127,131,137,139,149,
151,157,163,167,173,179,181,191,193,197,
199,211,223,227,229,233,239,241,251,257,
263,269,271,277,281,283,293,307 ...

I delete it:D