数学
Ostmbh
731391331
展开
-
codeforces817c Really Big Numbers
C. Really Big Numberstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIvan likes to learn different things a原创 2017-06-20 17:36:10 · 533 阅读 · 0 评论 -
codeforces809A Do you want a date?
Leha decided to move to a quiet town Vičkopolis, because he was tired by living in Bankopolis. Upon arrival he immediately began to expand his network of hacked computers. During the week Leha managed原创 2017-05-21 20:27:58 · 598 阅读 · 0 评论 -
Codeforces Round #449划水报告
cf又是卡在D上了呢出题人热爱珂学.jpgA题题意:给你一个字符串 m个操作 每次把[l,r]里面的字符c1换成字符c2数据范围不大直接暴力#include #include #include using namespace std;char A[110];int main(){ //freopen("a.in","r",stdin); //freopen("原创 2017-12-04 08:16:50 · 190 阅读 · 0 评论 -
bzoj2818Gcd
Description给定整数N,求1<=x,y<=N且Gcd(x,y)为素数的 数对(x,y)有多少对.Input一个整数NOutput如题Sample Input4Sample Output4 HINThint对于样例(2,2),(2,4),(3,3),(4,2)1<=N<=10^7Source湖北省队互测题解:要求gcd(x,y)==pgcd(x,y)==p 那么就是求gcd(x/p,y原创 2017-12-04 15:01:25 · 274 阅读 · 0 评论 -
NOIP2017解题报告
T1小凯的疑惑根据裴蜀定理,一定存在ax+by==k的解(gcd(a,b)==1) 要求的是ax+by==kax+by==k,且x<0||y<0,的最大解 那么一定有ax+by==k+1ax+by==k+1一定是组合法解 考虑两边同时减ax′+by′==1ax'+by'==1 得到 a(x−x′)+b(y−y′)==1a(x-x')+b(y-y')==1 那么可以将x减小,也可以将y减小原创 2017-11-27 17:03:47 · 443 阅读 · 0 评论 -
Codeforces Round #452 (Div. 2)划水报告
A. Splitting in Teams 贪心 先把二人组和一人组配对 然后一人组单独组成3个#include <iostream>#include <cstdio>using namespace std;int main(){ //freopen("a.in","r",stdin); //freopen("a.out","w",stdout); int n;原创 2017-12-18 21:42:31 · 295 阅读 · 0 评论