跳转至

整除与同余

视频讲解

🎥 视频讲解

同余

\[(a + b) \mod m = \left( (a \mod m) + (b \mod m) \right) \mod m\]
\[(a \times b) \mod m = \left( (a \mod m) \times (b \mod m) \right) \mod m\]
\[(a - b) \mod m = \left( \left( (a - b) \mod m \right) + m \right) \mod m\]

模板题

洛谷：Hello, 2023

代码实现

参考实现 
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    cout << (n % 2023 + 2023) % 2023 << "\n";
    return 0;
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        System.out.println((n % 2023 + 2023) % 2023);
    }
}

n = int(input())
print(n % 2023)

练习题单

整除与同余