Python3 解法, 执行用时: 41ms, 内存消耗: 4568K, 提交时间: 2023-08-13 15:43:43

n,a,b=map(int,input().split())
print(min((n-i*a)%b for i in range(n//a+1)))

Java 解法, 执行用时: 46ms, 内存消耗: 10744K, 提交时间: 2023-08-10 10:02:03

import java.util.Scanner;

public class Main {
    public static void main(String[] arg) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt(), a = scanner.nextInt(), b = scanner.nextInt();
        int ans = n;
        for ( int i = 0; i * a <= n; i++ ) {
            ans = Math.min(ans, (n - a * i ) % b);
        }
        
        System.out.println(ans);
    }
}

Go 解法, 执行用时: 3ms, 内存消耗: 1000K, 提交时间: 2023-08-09 23:20:35

package main
import "fmt"

func main() {
    var n, a, b int
    fmt.Scanf("%d %d %d", &n, &a, &b)
    ans := n
    
    for i := 0; i * a <= n; i++ {
        ans = min(ans, (n - i * a) % b)
    }
    fmt.Println(ans)
}

func min(a, b int) int { if a < b { return a }; return b }

PHP 解法, 执行用时: 9ms, 内存消耗: 3088K, 提交时间: 2023-08-09 23:18:30

<?php

$input = explode(' ', fgets(STDIN));
// todo
$n = intval($input[0]);
$a = intval($input[1]);
$b = intval($input[2]);

$ans = $n;
for ( $i = 0; $i * $a <= $n; $i++ ) {
    $ans = min(($n - $i*$a)%$b, $ans);
}
echo $ans;

C++ 解法, 执行用时: 3ms, 内存消耗: 556K, 提交时间: 2023-08-09 23:14:10

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6;
typedef long long ll;
int main()
{
	int t = 1;
	while( t-- )
	{
		int n,a, b;
		cin >>n>> a >>b;
		int ans = n;
		for( int i = 0 ; i *a <= n ; i++ )
		{
			ans = min(ans, (n-i*a)%b);
		}
		cout << ans;
	}
}