【数论】Disgruntled Judge, NWERC 2008, UVa12169
2016-10-10 21:55
344 查看
#include<bits/stdc++.h> #define mod 10001 using namespace std; typedef long long LL; LL n,p[210]; void exgcd(LL a,LL b,LL& d,LL& x,LL& y){ if(!b) d=a,x=1,y=0; else exgcd(b,a%b,d,y,x),y-=x*(a/b); } int main(){ ios::sync_with_stdio(false); cin>>n; for(int i=1;i<n*2;i+=2)cin>>p[i]; for(LL a=0;;a++) { LL k,b,d; LL t = (p[3]-a*a*p[1]); exgcd(mod,a+1,d,k,b); if(t%d)continue;//无解 b = b*t/d; bool ok = true; for(int i=2;i<=2*n;i++){ if(i&1){ if(p[i]!=((a*p[i-1]+b)%mod)){ ok = false; break; } }else{ p[i]=(a*p[i-1]+b)%mod; } } if(ok)break; } for(int i=2;i<=2*n;i+=2)cout<<p[i]<<endl; return 0; }
相关文章推荐
- 扩展欧几里得应用解不定方程(uva12169,Disgruntled Judge,NWERC 2008)
- 例题8-15 Shuffle的播放记录(Shuffle, ACM/ICPC NWERC 2008, UVa 12174)
- 习题6-6 修改天平(Equilibrium Mobile, NWERC 2008, UVa12166)
- Disgruntled Judge UVA - 12169 (数论 之 扩展欧几里得+模运算)
- IIUC ONLINE CONTEST 2008 / UVa 11388 GCD LCM (数论)
- 【数论】[Uva12169]Disgruntled Judge
- UVa 12169 Disgruntled Judge
- UVA 10820 - Send a Table 数论 (欧拉函数)
- UVA 10110(数论)
- UVa 138 Street Numbers(数论&Pell方程)
- UVA 10791 - Minimum Sum LCM(数论)
- UVA 571(数论)
- UVA - 10791 - Minimum Sum LCM (数论相关!)
- 例10-2 uva12169(扩展欧几里得)
- Disgruntled Judge UVA - 12169 (暴力或者拓展欧几里得)
- UVA - 10375Choose and divide(数论)
- UVA 10515 - Powers Et Al.(数论)
- 【数论】GCD XOR, ACM/ICPC Dhaka 2013, UVa12716 【异或】【好题】
- uva 10555 - Dead Fraction)(数论)
- BZOJ2190: [SDOI2008]仪仗队 题解 【数论】【素数筛】