725 - Division

All about problems in Volume 7. If there is a thread about your problem, please use it. If not, create one with its number in the subject.

Moderator: Board moderators

FlyDeath
Learning poster
Posts: 73
Joined: Wed Jan 02, 2002 2:00 am
Location: Taiwan

725 - Division

Post by FlyDeath » Wed Jan 23, 2002 5:23 pm

following is my 725 code , i can't find what's wrong:

#include <stdio.h>

void print(long down,long up);
int check(long down,long up);
int flag=0;

void main()
{
int num;
int result=0;
long down=1;
while(scanf("%d",&num)!=EOF)
{
if(num==0)
break;
flag=0;
for(down=1;down<=99999/num;down++)
{
result=check(down,down*num);
if(result==1)
{
flag=1;
print(down,down*num);
printf("%dn",num);
}
}
if(flag==0)
printf("There are no solutions for %d.n",num);
printf("n");
}
}

void print(long down,long up)
{
int i;
int ou[5],od[5];
for(i=0;i<5;i++)
{
ou=up%10;
up=up/10;
}
for(i=0;i<5;i++)
{
od=down%10;
down=down/10;
}
for(i=4;i>=0;i--)
printf("%d",ou);
printf(" / ");
for(i=4;i>=0;i--)
printf("%d",od);
printf(" = ");
}

int check(long down,long up)
{
int dig[10];
int i;
for(i=0;i<5;i++)
{
if(dig[down%10]==1)
return 0;
dig[down%10]=1;
down=down/10;
}
for(i=0;i<5;i++)
{
if(dig[up%10]==1)
return 0;
dig[up%10]=1;
up=up/10;
}
return 1;
}

cyfra
Experienced poster
Posts: 144
Joined: Thu Nov 22, 2001 2:00 am
Location: Gdynia, Poland

Post by cyfra » Mon Mar 18, 2002 2:27 pm

Hi!

Hmm...
that's strange...
Your program gives "There is no solution" for 62 and many others integers..

Try to change it..

Good Luck :smile:

andrew10
New poster
Posts: 7
Joined: Wed Jan 08, 2003 10:18 am
Location: Indonesia

725

Post by andrew10 » Wed Jan 08, 2003 11:03 am

Please help to give the solve for problem number 725 in C Language!!!!
I really need it for my assignment in 3 more days!!

Thank you very much

User avatar
angga888
Experienced poster
Posts: 143
Joined: Sat Dec 21, 2002 11:41 am
Location: Indonesia

Post by angga888 » Sun Jan 12, 2003 3:07 pm

Kalau boleh tahu, anda kuliah di mana ? (BINUS)?
Semester berapa ?
Problem nomor berapa saja yang jadi tugas ?

Cobalah buat dahulu... kalau ada yang ingin ditanyakan, pasang saja di BOARD. :wink:

Regards.

andrew10
New poster
Posts: 7
Joined: Wed Jan 08, 2003 10:18 am
Location: Indonesia

Re: C Language : 725!!!!

Post by andrew10 » Mon Jan 13, 2003 7:02 am

Kalo bisa, gue juga nggak mau nanya2!

fishbao
New poster
Posts: 4
Joined: Fri Jun 18, 2004 10:05 am

725-WA???????? Please Help

Post by fishbao » Fri Jul 30, 2004 4:25 am

I think the problem is that finding two words which have 5 digits each, and these ten digits must 0~9, and the div must be N.
Here is my code ,I don't know why it gives me WA!
Please HELP ME!!!!!!!!!!!!!!!!! :lol:
[cpp]#include <iostream.h>

class Acm725
{
private:

long c;
public:
int cb (long c,long b);
void ReadCase();
void Print(long c,long b);
};

int Acm725::cb(long c,long b)
{
bool check[10];
long temp,temp1;
int i;
for (i=1;i<10;i++)
check=0;
temp=c*b;
if (temp>99999)
return 0;
else
{
if (temp<10000)
return -1;
while (temp)
{
if (!check[temp%10])
check[temp%10]=1;
else
return -1;
temp=temp/10;
}

while (b)
{
if (!check[b%10])
check[b%10]=1;
else
return -1;
b=b/10;
}

return 1;
}
}


void Acm725::ReadCase()
{
int check=0,j,m;
while (cin>>c&&c!=0)
{
check=0;
for (j=1000;j<50001;j++)
{
// cout<<j<<"\t";
if (!(m=cb(c,j)))
break;
else
if (m!=-1)
{
// cout<<endl<<endl;
Print (c,j);
check=1;
}
}
if (!check)
cout<<"There are no solutions for "<<c<<"."<<endl;
cout<<endl;
}
}

void Acm725::Print(long c,long b)
{
if (b<10000)
cout<<c*b<<" / 0"<<b<<" = "<<c<<endl;
else
cout<<c*b<<" / "<<b<<" = "<<c<<endl;
}

int main()
{

Acm725 a;


a.ReadCase();
return 1;
}[/cpp]

fishbao
New poster
Posts: 4
Joined: Fri Jun 18, 2004 10:05 am

Post by fishbao » Sun Aug 01, 2004 2:05 am

Please HELP ME!!!!!!!!!!!!!!!!!!!!!

Ryan Pai
Learning poster
Posts: 67
Joined: Fri Jul 04, 2003 9:59 am
Location: USA
Contact:

Post by Ryan Pai » Wed Aug 04, 2004 1:41 am

You don't initialize check[0]. I don't know if that's your only error.
I'm always willing to help, if you do the same.

refa
New poster
Posts: 8
Joined: Thu Mar 17, 2005 9:00 pm
Contact:

725! WA Don't know where to look anymore!

Post by refa » Thu Mar 17, 2005 9:05 pm

Could somebody please compare my output with his/her who got AC because I don't know where to look anymore. I get WA all the time whatever I change so did I miss maybe a value or something? Thank you :oops:

Here is my code:

Code: Select all

#include <stdio.h>

int
main ()
{
  int n, r = 0;
  bool first = 0;
  while ((scanf ("%d", &n) == 1) && n != 0)
    {
      if (first == 0)
	{
	  r = n;
	  first = 1;
	}
      if (r != n)
	{
	  printf ("\n");
	  r=n;
	}

      if (n == 2)
	{
	  printf ("%s",
		  "13458 / 06729 = 2\n13584 / 06792 = 2\n13854 / 06927 = 2\n14538 / 07269 = 2\n14586 / 07293 = 2\n14658 / 07329 = 2\n15384 / 07692 = 2\n15846 / 07923 = 2\n15864 / 07932 = 2\n18534 / 09267 = 2\n18546 / 09273 = 2\n18654 / 09327 = 2\n26970 / 13485 = 2\n27096 / 13548 = 2\n27690 / 13845 = 2\n29076 / 14538 = 2\n29370 / 14685 = 2\n29670 / 14835 = 2\n29706 / 14853 = 2\n29730 / 14865 = 2\n30972 / 15486 = 2\n32970 / 16485 = 2\n37092 / 18546 = 2\n37290 / 18645 = 2\n41358 / 20679 = 2\n41538 / 20769 = 2\n41586 / 20793 = 2\n46158 / 23079 = 2\n53418 / 26709 = 2\n53814 / 26907 = 2\n54138 / 27069 = 2\n54186 / 27093 = 2\n54618 / 27309 = 2\n58134 / 29067 = 2\n58146 / 29073 = 2\n58614 / 29307 = 2\n61458 / 30729 = 2\n61584 / 30792 = 2\n61854 / 30927 = 2\n62970 / 31485 = 2\n64158 / 32079 = 2\n65418 / 32709 = 2\n65814 / 32907 = 2\n69702 / 34851 = 2\n70296 / 35148 = 2\n70962 / 35481 = 2\n76290 / 38145 = 2\n76902 / 38451 = 2\n90276 / 45138 = 2\n90372 / 45186 = 2\n90762 / 45381 = 2\n92370 / 46185 = 2\n93702 / 46851 = 2\n96270 / 48135 = 2\n96702 / 48351 = 2\n97026 / 48513 = 2\n97032 / 48516 = 2\n97062 / 48531 = 2\n97230 / 48615 = 2\n97302 / 48651 = 2\n");
	}
      else if (n == 3)
	{
	  printf ("%s",
		  "17469 / 05823 = 3\n17496 / 05832 = 3\n50382 / 16794 = 3\n53082 / 17694 = 3\n61749 / 20583 = 3\n69174 / 23058 = 3\n91746 / 30582 = 3\n96174 / 32058 = 3\n");
	}
      else if (n == 4)
	{
	  printf ("%s",
		  "15768 / 03942 = 4\n17568 / 04392 = 4\n23184 / 05796 = 4\n31824 / 07956 = 4\n60948 / 15237 = 4\n68940 / 17235 = 4\n69408 / 17352 = 4\n81576 / 20394 = 4\n81756 / 20439 = 4\n86940 / 21735 = 4\n94068 / 23517 = 4\n94860 / 23715 = 4\n");
	}
      else if (n == 5)
	{
	  printf ("%s",
		  "13485 / 02697 = 5\n13845 / 02769 = 5\n14685 / 02937 = 5\n14835 / 02967 = 5\n14865 / 02973 = 5\n16485 / 03297 = 5\n18645 / 03729 = 5\n31485 / 06297 = 5\n38145 / 07629 = 5\n46185 / 09237 = 5\n48135 / 09627 = 5\n48615 / 09723 = 5\n67290 / 13458 = 5\n67920 / 13584 = 5\n69270 / 13854 = 5\n72690 / 14538 = 5\n72930 / 14586 = 5\n73290 / 14658 = 5\n76920 / 15384 = 5\n79230 / 15846 = 5\n79320 / 15864 = 5\n92670 / 18534 = 5\n92730 / 18546 = 5\n93270 / 18654 = 5\n");
	}
      else if (n == 6)
	{
	  printf ("%s",
		  "17658 / 02943 = 6\n27918 / 04653 = 6\n34182 / 05697 = 6\n");
	}
      else if (n == 7)
	{
	  printf ("%s",
		  "16758 / 02394 = 7\n18459 / 02637 = 7\n31689 / 04527 = 7\n36918 / 05274 = 7\n37926 / 05418 = 7\n41832 / 05976 = 7\n53298 / 07614 = 7\n98532 / 14076 = 7\n");
	}
      else if (n == 8)
	{
	  printf ("%s",
		  "25496 / 03187 = 8\n36712 / 04589 = 8\n36728 / 04591 = 8\n37512 / 04689 = 8\n37528 / 04691 = 8\n38152 / 04769 = 8\n41896 / 05237 = 8\n42968 / 05371 = 8\n46312 / 05789 = 8\n46328 / 05791 = 8\n46712 / 05839 = 8\n47136 / 05892 = 8\n47328 / 05916 = 8\n47368 / 05921 = 8\n51832 / 06479 = 8\n53928 / 06741 = 8\n54312 / 06789 = 8\n54328 / 06791 = 8\n54712 / 06839 = 8\n56984 / 07123 = 8\n58496 / 07312 = 8\n58912 / 07364 = 8\n59328 / 07416 = 8\n59368 / 07421 = 8\n63152 / 07894 = 8\n63528 / 07941 = 8\n65392 / 08174 = 8\n65432 / 08179 = 8\n67152 / 08394 = 8\n67352 / 08419 = 8\n67512 / 08439 = 8\n71456 / 08932 = 8\n71536 / 08942 = 8\n71624 / 08953 = 8\n71632 / 08954 = 8\n73248 / 09156 = 8\n73264 / 09158 = 8\n73456 / 09182 = 8\n74528 / 09316 = 8\n74568 / 09321 = 8\n74816 / 09352 = 8\n75328 / 09416 = 8\n75368 / 09421 = 8\n76184 / 09523 = 8\n76248 / 09531 = 8\n76328 / 09541 = 8\n83672 / 10459 = 8\n83752 / 10469 = 8\n84296 / 10537 = 8\n84632 / 10579 = 8\n84736 / 10592 = 8\n85392 / 10674 = 8\n85432 / 10679 = 8\n85936 / 10742 = 8\n86352 / 10794 = 8\n87456 / 10932 = 8\n87536 / 10942 = 8\n87624 / 10953 = 8\n87632 / 10954 = 8\n96584 / 12073 = 8\n98456 / 12307 = 8\n98760 / 12345 = 8\n");
	}
      else if (n == 9)
	{
	  printf ("%s",
		  "57429 / 06381 = 9\n58239 / 06471 = 9\n75249 / 08361 = 9\n95742 / 10638 = 9\n95823 / 10647 = 9\n97524 / 10836 = 9\n");
	}
      else if (n == 12)
	{
	  printf ("%s",
		  "45792 / 03816 = 12\n73548 / 06129 = 12\n89532 / 07461 = 12\n91584 / 07632 = 12\n");
	}
      else if (n == 13)
	{
	  printf ("%s",
		  "67392 / 05184 = 13\n81549 / 06273 = 13\n94653 / 07281 = 13\n");
	}
      else if (n == 14)
	{
	  printf ("%s",
		  "25746 / 01839 = 14\n27384 / 01956 = 14\n41538 / 02967 = 14\n46158 / 03297 = 14\n51492 / 03678 = 14\n54768 / 03912 = 14\n61572 / 04398 = 14\n65982 / 04713 = 14\n");
	}
      else if (n == 15)
	{
	  printf ("%s", "27945 / 01863 = 15\n92745 / 06183 = 15\n");
	}
      else if (n == 16)
	{
	  printf ("%s",
		  "45936 / 02871 = 16\n73296 / 04581 = 16\n98352 / 06147 = 16\n");
	}
      else if (n == 17)
	{
	  printf ("%s",
		  "26843 / 01579 = 17\n28543 / 01679 = 17\n29546 / 01738 = 17\n36958 / 02174 = 17\n45713 / 02689 = 17\n45781 / 02693 = 17\n54689 / 03217 = 17\n59126 / 03478 = 17\n64957 / 03821 = 17\n65297 / 03841 = 17\n67184 / 03952 = 17\n67218 / 03954 = 17\n76823 / 04519 = 17\n76891 / 04523 = 17\n78132 / 04596 = 17\n78523 / 04619 = 17\n78591 / 04623 = 17\n81532 / 04796 = 17\n83572 / 04916 = 17\n83657 / 04921 = 17\n89437 / 05261 = 17\n89471 / 05263 = 17\n89641 / 05273 = 17\n91426 / 05378 = 17\n92837 / 05461 = 17\n92871 / 05463 = 17\n93126 / 05478 = 17\n");
	}
      else if (n == 18)
	{
	  printf ("%s", "28674 / 01593 = 18\n");
	}
      else if (n == 19)
	{
	  printf ("%s", "51984 / 02736 = 19\n81567 / 04293 = 19\n");
	}
      else if (n == 22)
	{
	  printf ("%s", "51678 / 02349 = 22\n");
	}
      else if (n == 23)
	{
	  printf ("%s",
		  "36294 / 01578 = 23\n81627 / 03549 = 23\n81972 / 03564 = 23\n");
	}
      else if (n == 24)
	{
	  printf ("%s", "39528 / 01647 = 24\n46872 / 01953 = 24\n");
	}
      else if (n == 26)
	{
	  printf ("%s",
		  "42978 / 01653 = 26\n56498 / 02173 = 26\n61854 / 02379 = 26\n67314 / 02589 = 26\n67418 / 02593 = 26\n76518 / 02943 = 26\n82654 / 03179 = 26\n89726 / 03451 = 26\n92846 / 03571 = 26\n");
	}
      else if (n == 27)
	{
	  printf ("%s",
		  "39852 / 01476 = 27\n49572 / 01836 = 27\n69741 / 02583 = 27\n96714 / 03582 = 27\n");
	}
      else if (n == 28)
	{
	  printf ("%s", "75348 / 02691 = 28\n");
	}
      else if (n == 29)
	{
	  printf ("%s", "37584 / 01296 = 29\n73689 / 02541 = 29\n");
	}
      else if (n == 32)
	{
	  printf ("%s", "75168 / 02349 = 32\n");
	}
      else if (n == 35)
	{
	  printf ("%s",
		  "48265 / 01379 = 35\n63945 / 01827 = 35\n64295 / 01837 = 35\n74865 / 02139 = 35\n93485 / 02671 = 35\n");
	}
      else if (n == 37)
	{
	  printf ("%s", "65934 / 01782 = 37\n");
	}
      else if (n == 38)
	{
	  printf ("%s", "65892 / 01734 = 38\n74328 / 01956 = 38\n");
	}
      else if (n == 43)
	{
	  printf ("%s", "93654 / 02178 = 43\n");
	}
      else if (n == 44)
	{
	  printf ("%s",
		  "58476 / 01329 = 44\n59268 / 01347 = 44\n67892 / 01543 = 44\n69432 / 01578 = 44\n95348 / 02167 = 44\n");
	}
      else if (n == 46)
	{
	  printf ("%s", "58374 / 01269 = 46\n");
	}
      else if (n == 52)
	{
	  printf ("%s", "95472 / 01836 = 52\n");
	}
      else if (n == 53)
	{
	  printf ("%s",
		  "65879 / 01243 = 53\n75896 / 01432 = 53\n84376 / 01592 = 53\n92538 / 01746 = 53\n");
	}
      else if (n == 59)
	{
	  printf ("%s", "73986 / 01254 = 59\n");
	}
      else if (n == 62)
	{
	  printf ("%s", "79546 / 01283 = 62\n94736 / 01528 = 62\n");
	}
      else if (n == 66)
	{
	  printf ("%s", "83754 / 01269 = 66\n");
	}
      else if (n == 68)
	{
	  printf ("%s", "98736 / 01452 = 68\n");
	}
      else
	{
	  printf ("%s%d.\n", "There are no solutions for ", n);
	}
    }
}
Best regards,
Refa :oops: :oops:

sumankar
A great helper
Posts: 286
Joined: Tue Mar 25, 2003 8:36 am
Location: calcutta
Contact:

Post by sumankar » Fri Mar 18, 2005 5:57 am

You call this code?You can very well go shoot yourself.

Suman.

refa
New poster
Posts: 8
Joined: Thu Mar 17, 2005 9:00 pm
Contact:

Post by refa » Fri Mar 18, 2005 1:41 pm

This is the generated result because I didn't know how to solve it on a better way.

sumankar
A great helper
Posts: 286
Joined: Tue Mar 25, 2003 8:36 am
Location: calcutta
Contact:

Post by sumankar » Fri Mar 18, 2005 2:20 pm

How did you generate this much?Use that algo only, it will get into the time
limit.

Regards,
Suman.

refa
New poster
Posts: 8
Joined: Thu Mar 17, 2005 9:00 pm
Contact:

Post by refa » Fri Mar 18, 2005 4:56 pm

The computer(1.5GHz) needed 1 hour to calculate these values, it was a brute force method using for loops to retrive these values. So I guess with one hour I would get TIME LIMIT EXCEEDED :(

sumankar
A great helper
Posts: 286
Joined: Tue Mar 25, 2003 8:36 am
Location: calcutta
Contact:

Post by sumankar » Fri Mar 18, 2005 5:04 pm

AFAIK, I used some brute force method only, but I guess it was a little more intelligent than yours :wink:

The input limits should give you a hint on how you can cut down on the size of calculations to be made. I will need to have a look at the problem though.

But that's it for now.
Regards,
Suman.

refa
New poster
Posts: 8
Joined: Thu Mar 17, 2005 9:00 pm
Contact:

Post by refa » Fri Mar 18, 2005 5:25 pm

Thank you Suman :)

Post Reply

Return to “Volume 7 (700-799)”