HDU 1788——Chinese remainder theorem again
2014-06-25 01:19
459 查看
思路:看上去是用中国剩余定理,其实仅仅是求最大公约数
代码如下:
代码如下:
#include<cstdio> #include<iostream> using namespace std; typedef long long ll; ll m[15]; ll extend_gcd(ll a,ll b){ if(b==0){ return a; } else{ ll r=extend_gcd(b,a%b); return r; } } int main(){ // freopen("data.txt","r",stdin); int I; ll a; while(scanf("%d%I64d",&I,&a)!=EOF){ // cout<<I<<' '<<a<<endl; if(I==0&&a==0)break; ll lcm; for(int i=0;i<I;++i){ scanf("%I64d",&m[i]); // cout<<m[i]<<endl; if(i==0){lcm=m[i];} else {//gcd=M/extend_gcd(gcd,m[i],x,y); lcm=(lcm*m[i])/extend_gcd(lcm,m[i]); } } ll ans=lcm-a; printf("%I64d\n",ans); } return 0; }
相关文章推荐
- 【HDU】 1788 Chinese remainder theorem again
- hdu 1788 Chinese remainder theorem again
- hdu 1788 Chinese remainder theorem again
- hdu 1788 Chinese remainder theorem again((数学:简单题)
- 读控制台HDU 1788 Chinese remainder theorem again 数论读控制台
- HDU——1788 Chinese remainder theorem again
- HDU 1788 Chinese remainder theorem again
- HDU 1788 Chinese remainder theorem again
- HDU1788 Chinese remainder theorem again 中国剩余定理
- hdu 1788 Chinese remainder theorem again(最小公倍数)
- hdu - 1788 - Chinese remainder theorem again-(gcd,不互质的中国剩余定理)
- hdu 1788 Chinese remainder theorem again(最小公倍数)
- hdu 1788 Chinese remainder theorem again
- HDU 1788 Chinese remainder theorem again
- Chinese remainder theorem again(HDU 1788)
- Hdu 1788 Chinese remainder theorem again
- HDU1788 Chinese remainder theorem again【中国剩余定理】
- Chinese remainder theorem again(hdu 1788)两种解法:线性同余方程或者简单的最小公倍数
- HDU 1788 Chinese remainder theorem again 中国剩余定理转换
- 【数论】 HDOJ 1788 Chinese remainder theorem again