Difference between revisions of "CCPC-Wannafly Winter Camp Day1 (Div 1)"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) (Created page with "= CCPC-Wannafly Winter Camp Day1 (Div 1) = == Problem A == Unsolved. == Problem B == Unsolved. == Problem C == Unsolved. == Problem D == Unsolved. == Problem E == Un...") |
Xiejiadong (talk | contribs) |
||
| Line 11: | Line 11: | ||
== Problem C == | == Problem C == | ||
| − | + | solved. | |
| + | |||
| + | 温暖的签到 | ||
| + | |||
| + | 题意：给两个long long范围之内的数$A, B$，求一种拆分使得$\sum_{i=1}^{n}{a_i}=A,\sum_{i=1}^{n}{b_i}=B,gcd(a_i,b_i)=1$如果有多个输出n最小的一个 | ||
| + | |||
| + | 思路：随机就完事了。。特判完$n=1$就随机划分成两个数直到找到解为止，不可能无解 | ||
== Problem D == | == Problem D == | ||
Revision as of 08:27, 28 January 2019
CCPC-Wannafly Winter Camp Day1 (Div 1)
Problem A
Unsolved.
Problem B
Unsolved.
Problem C
solved.
温暖的签到
题意：给两个long long范围之内的数$A, B$，求一种拆分使得$\sum_{i=1}^{n}{a_i}=A,\sum_{i=1}^{n}{b_i}=B,gcd(a_i,b_i)=1$如果有多个输出n最小的一个
思路：随机就完事了。。特判完$n=1$就随机划分成两个数直到找到解为止，不可能无解
Problem D
Unsolved.
Problem E
Unsolved.
Problem F
Unsolved.
Problem G
Unsolved.
Problem H
Unsolved.
Problem I
Unsolved.
Problem J
Unsolved.
Problem K
Unsolved.