与‘数论-模算术’有关的日志

poj1844

maksyuki 发表于 oj 分类,标签: ,
0
poj1844

Sum

Consider the natural numbers from 1 to N. By associating to each number a sign (+ or -) and calculating the value of this expression we obtain a sum S. The problem is to determine for a given sum S the minimum number N for which we can obtain S >>继续阅读

hdu1792

maksyuki 发表于 oj 分类,标签:
0
hdu1792

A New Change Problem

Problem Description

Now given two kinds of coins A and B,which satisfy that GCD(A,B)=1. >>继续阅读

hdu1788

maksyuki 发表于 oj 分类,标签:
0
hdu1788

Chinese remainder theorem again

Problem Description

我知道部分同学最近在看中国剩余定理,就这个定理本身,还是比较简单的:

假设m1,m2,…,mk两两互素,则下面同余方程组: >>继续阅读