20140714 「初等数论 - 拓展欧几里得+同余模方程」POJ 2115 C Looooops

Online JudgeProblem SetAuthorsOnline ContestsUserWeb Board
Home Page
F.A.Qs
Statistical Charts

Problems
Submit Problem
Online Status
Prob.ID:

Register
Update your info
Authors ranklist

Current Contest
Past Contests
Scheduled Contests
Award Contestwilson1068      Log Out
Mail:0(0)
Login Log      Archive

Language:Default

C Looooops

Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16982 Accepted: 4386

Description

A Compiler Mystery: We are given a C-language style for loop of type 

for (variable = A; variable != B; variable += C)  statement;

I.e., a loop which starts by setting variable to value A and while variable is not equal to B, repeats statement followed by increasing the variable by C. We want to know how many times does the statement get executed for particular values of A, B and C, assuming that all arithmetics is calculated in a k-bit unsigned integer type (with values 0 <= x < 2^k) modulo 2^k. 

Input

The input consists of several instances. Each instance is described by a single line with four integers A, B, C, k separated by a single space. The integer k (1 <= k <= 32) is the number of bits of the control variable of the loop and A, B, C (0 <= A, B, C < 2^k) are the parameters of the loop. 

The input is finished by a line containing four zeros. 

Output

The output consists of several lines corresponding to the instances on the input. The i-th line contains either the number of executions of the statement in the i-th instance (a single integer number) or the word FOREVER if the loop does not terminate. 

Sample Input

3 3 2 163 7 2 167 3 2 163 4 2 160 0 0 0

Sample Output

0232766FOREVER

Source

CTU Open 2004

[Submit]   [Go Back]   [Status]   [Discuss]

Home Page   Go Back  To top

---

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator

数论：拓展欧几里得 + 同余模方程模板一份。

题解嘛，有空再补。。。（其实就是模板题。）

#include <stdio.h>#include <string.h>#include <iostream>using namespace std;typedef long long LL;LL ext_gcd(LL a, LL b, LL &x, LL &y){         if( 0==b ){x=1; y=0;return a;}LL d = ext_gcd(b, a%b, x, y);LL t = x;x = y;y = t - (a/b)*y;return d;}LL MLES(LL a, LL b, LL n){LL d, x, y;d = ext_gcd(a, n, x, y);/* d's solve. */if( b%d )   return -1;LL x0 = x*(b/d) % n;return  (x0%(n/d)+n/d)%(n/d);}int main(){               freopen("2115.in", "r", stdin);    LL A, B, C, k;    while( cin>>A>>B>>C>>k ){        if( 0==A+B+C+k )            break;        LL n=(LL)1<<k, a=C, b=(B-A+n)%n;        LL ans = MLES(a, b, n);        if( -1==ans )   cout<<"FOREVER"<<endl;        else            cout<<ans<<endl;    }return 0;}