> 就是选最小正整数那里不是太会
> #include <stdio.h>
> 
> struct node
> {
>   int d,x,y;
> };
> 
> struct node gcd(int a,int b)
> {
>   struct node c;
>   int e;
>   
>   if(b==0)
>   {
>     c.d=a;
>     c.x=1;
>     c.y=0;
>     return(c);
>   }
>   else 
>   {
>     c=gcd(b,a%b);
>     e=c.x;
>     c.x=c.y;
>     c.y=e-(a/b)*c.y;
>     return(c);
>   }
> }
> 
> main()
> {
>   int i,m,n,a,b,l,x,min;
>   struct node c;
> 
>   scanf("%d%d%d%d%d",&a,&b,&m,&n,&l);
>   if(m>n) c=gcd(m-n,l);
>   else c=gcd(m-n+l,l);
>   if((b-a)%(c.d)==0)
>   {
>     x=(c.x*((b-a)/c.d))% l;
>     if(x<0) x+=l;
>     min=x;
>     for(i=0;i<c.d;i++)
>     { 
>       x=(x+i*(l/c.d))%l;
>       if(x<0) x+=l;
>       if(x<min) min=x;
>     }
>     printf("%d\n",min);
>   }
>   else printf("Impossible\n");
> 
>   return(0);
> }

• Re:如果c.d特别大 就超时 (19) jackie_wyx 2006-12-08 15:11:57
  • 我是0MS过的 (0) TopBoy 2006-12-08 15:20:16
    • Re:我是0MS过的 (10) jackie_wyx 2006-12-08 15:25:09
      • 就是用的扩展Euclid (0) TopBoy 2006-12-08 15:45:02