FZU 1402 豬的安家 中國剩餘定理

來源：http://acm.fzu.edu.cn/problem.php?pid=1402

題意：中文~

思路：就是中國剩餘定理的模板題，本來是做poj上的一道題，那道題沒要求兩輛不互質，還要轉化成兩輛互質的，還不會，，，先把這道題水過了。。

代碼：

#include <iostream>#include <cstdio>#include <string.h>using namespace std;#define CLR(arr,val) memset(arr,val,sizeof(arr))const int N = 1010;long long a[N],r[N];void extend_Eulid(long long a,long long b,long long &x,long long &y){if(b == 0){  y = 0;  x = 1;  return;}extend_Eulid(b,a%b,x,y);int temp = x;x = y;y = temp - a/b * y;}int main(){//freopen("1.txt","r",stdin);int n;while(scanf("%d",&n) != EOF){long long M = 1;for(int i = 1;i <= n; ++i){  scanf("%lld%lld",&a[i],&r[i]);  M *= a[i];}long long sum = 0;for(int i = 1;i <= n;++i){  long long m = M / a[i];  long long x,y;  extend_Eulid(m,a[i],x,y);  x = (x % a[i] + a[i]) % a[i];  sum = ( sum + x * m * r[i])%M ;}printf("%lld\n",sum );}return 0;}