snowy_smile的博客

#include #include#include#include#include#include#include#includeusing namespace std;typedef long long LL;const int N=1e3+10;int n,m;LL t[N],a[N],d[N],b[N];LL gcd(LL x,LL y){ return

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c:

#include #include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c

#include #include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c:

map套set法：#include #include#include#include#include#include#include#includeusing namespace std;const int N=1e4+5;const int L=2e6+10;setname;//记录所有人名map >cnt;//记录说过每句话的所有人名mapfreq;//记录每句话

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c:

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c:

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c:

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c:

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c:

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c:

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c:

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c:

H. Tourist Guidetime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputIt is not that easy to create a tourist guide as one might expect. A good tourist guide should properly distribute flow of tourists a

D. Boulevardtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputWelcoming autumn evening is the best for walking along the boulevard and n people decided to do so.The boulevard can be represented as

G. Hiringtime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputThe head of human resources department decided to hire a new employee. He created a test exercise for candidates which should be accomplishe

C. Duff and Weight Liftingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Duff has been practicing

A. Olesya and Rodiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOlesya loves numbers consisting of n digits, and Rodion only likes numbers that are divisible by t. Find some number that sat

B. Duff in Lovetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDuff is in love with lovely numbers! A positi

B. Kolya and Tanyatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputKolya loves putting gnomes at the circle table and giving them coins, and Tanya loves studying triplets of gnomes, sitting in the ve

C. Marina and Vasyatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMarina loves strings of the same length an

D. Duff in Beachtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhile Duff was resting in the beach, she acc

E. Duff in the Armytime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputRecently Duff has been a soldier in the a

A. Email Aliasestime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputPolycarp has quite recently learned about email aliases. Of course, he used to suspect that the case of the letters doesn't matter in

I. Lotterytime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputToday Berland holds a lottery with a prize — a huge sum of money! There are k persons, who attend the lottery. Each of them will receive a

J. Cleaner Robottime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputMasha has recently bought a cleaner robot, it can clean a floor without anybody's assistance.Schematically Masha's room is a rectan

D. Dima and Lisatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDima loves representing an odd number as the

A. Duff and Meattime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDuff is addicted to meat! Malek wants to keep

E. Anton and Iratime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton loves transforming one permutation into

最少加入多少个细胞，可以使得有一天，培养皿中细胞的数量会恰好为x

最优组队匹配

使得最大的元素的和绝对值尽可能小

数列乘k次x后求最大or值

A. Asphalting Roadstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputCity X consists of n vertical and n hori

C. GCD Tabletime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe GCD table G of size n × n for an array of

B. Robot's Tasktime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRobot Doc is located in the hall, with n compu

D. Once Again...time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array of positive integers a

B. Rebrandingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe name of one small but proud corporation con

D. Chip 'n Dale Rescue Rangerstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA team of furry rescue rangers