ABC227A Last Card
#include <bits/stdc++.h>
using namespace std;
int n,k,a;
int main()
{
cin>>n>>k>>a;
k-=(n-a+1);
if(k%n==0)cout<<n;
else cout<<k%n;
return 0;
}
输入一组数据,就明白为什么没有AC了
691 60 43
输出的结果为-589
为什么会这样呢
将上面的数据代入公式
n=691
k=60
a=43
k-=(n-a+1);
n-a+1
=n-(a-1)
=691-(43-1)
=649
k-=649
k=60-649
=-589
参考下面博客:
【转】C/C++除法实现方式及负数取模详解
C/C++ 取模的正负和被除数的正负相对应,
也就是说,比如a%b
a为负数,则a%b的结果为负数
a为正数,则a%b的结果为正数
本题更好的题解程序见下面博客:
AtCoder Beginner Contest 227(A-F)好
AtCoder Beginner Contest 227(A-F)_atcoder beginner contest 227 c - abc conjecture-优快云博客
AtCoder Beginner Contest 227(A-D)
AtCoder Beginner Contest 227C题ABC conjecture(数学)
AtCoder Beginner Contest 227D题Project Planning(二分)
AtCoder Beginner Contest 277 C~E题解
AtCoder Beginner Contest 277 C~E题解_atcoder beginner contest 227 c - abc conjecture-优快云博客
KEYENCE Programming Contest 2021 (AtCoder Beginner Contest 227) B
AtCoder Beginner Contest 227 E(比较复杂的dp)
Atcoder Beginner Contest 227——F - Treasure Hunting
Atcoder Beginner Contest 227——F - Treasure Hunting_哔哩哔哩_bilibili
AtCoder Beginner Contest 227 F(枚举/DP)
KEYENCE Programming Contest 2021 (AtCoder Beginner Contest 227) F. Treasure Hunting(线性dp)
AtCoder Beginner Contest 227 G - Divisors of Binomial Coefficient (埃筛分解较大数)
AtCoder Beginner Contest 227 G - Divisors of Binomial Coefficient (埃筛分解较大数)_arriage分解法-优快云博客
AtCoder Beginner Contest 227
AtCoder Beginner Contest 227_atcoder beginner contest 227 c - abc conjecture-优快云博客
AtCoder Beginner Contest 227(A-F)好
AtCoder Beginner Contest 227(A-F)_atcoder beginner contest 227 c - abc conjecture-优快云博客
AtCoder Beginner Contest 323
AtCoder Beginner Contest 335
AtCoder Beginner Contest 336
AtCoder Beginner Contest 337 (ABCDEG题)
AtCoder Beginner Contest 337 (ABCDEG题)-优快云博客
AtCoder Beginner Contest 351
AtCoder Beginner Contest 361
AtCoder Beginner Contest ABC-361(2024.12.17)