P9645 [SNCPC2019] K-hour Clock（同余&数学）

[SNCPC2019] K-hour Clock

题面翻译

给定三个数 $x,y,z$，求一个数 $k$ 使得 $x+y\equiv z(\mathrm{mod}k)$。

题目描述

A $k$-hour clock is a day keeping method which follows the rules below:

• A day is divided into $k$ hours, where the $i$-th hour is called the $(i-1)$ o’ clock;
• If it’s $x$ o’clock now, it will be $(x+1)$ o’clock after $1$ hour if $0\le x<k-1$;
• If it’s $(k-1)$ o’clock now, it will be $0$ o’clock after $1$ hour.

We know that it’s $x$ o’clock now, and after $y$ hours it will be $z$ o’clock. What’s the value of $k$?

输入格式

There are multiple test cases. The first line of the input is an integer $T$ (about $10^5$), indicating the number of test cases. For each test case:

The first and only line contains three integers $x$, $y$ and $z$ ($0\le x,z\le 10^9$, $1\le y\le 10^9$).

输出格式

For each test case output one line containing one integer, indicating the value of $k$. Note that there must be $1\le k\le 2\times 10^9$. If there are multiple valid answers, you can print any of them; If there is no valid answer, print -1 (without quotes) instead.

样例 #1

样例输入 #1

4
11 18 5
3 49 4
1 9 1
1 3 10

样例输出 #1

12
24
3
-1

解析

问题转换为 a+b和c同余k，所以我们分类讨论
1.a+b=c的时候，取k为c+1即可
2.a+b不等于c，特判 k 必须大于a和大于c，否则输出 a+b-c即可

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+5;
//int n,a[N]; 
void solve(){
	int a,b,c;
	scanf("%lld%lld%lld",&a,&b,&c);
	if(a+b==c) printf("%lld\n",c+1);
	else{
		int k=a+b-c;
		if(a>=k||c>=k) puts("-1");
		else printf("%lld\n",k);
	}
}
signed main(){
	int t=1;
	scanf("%lld",&t);
	while(t--) solve();
	return 0;
}