Momo_98-CSDN博客

原创 Codeforces Round #462 (Div. 2)题解ABC

A. A Compatible Pairtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputNian is a monster which lives deep in the oceans. Once a year, it shows up on t...

2018-02-18 18:50:56 344

原创 Codeforces Round #460 (Div. 2)题解ABC

A. Supermarkettime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe often go to supermarkets to buy some fruits or vegetables, and on the tag there p...

2018-02-11 23:56:31 302

原创 Codeforces Round #461 (Div. 2)题解ABC

A. Cloning Toystime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputImp likes his plush toy a lot.Recently, he found a machine that can clone plush toys...

2018-02-11 19:15:18 334

原创 CF#71A Way Too Long Words

A. Way Too Long Wordstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSometimes some words like "localizati

2014-11-06 14:57:07 974 1

原创 CF#4A Watermelon

A. Watermelontime limit per test1 secondmemory limit per test64 megabytesinputstandard inputoutputstandard outputOne hot summer day Pete and his friend Billy de

2014-11-06 14:48:56 895

原创 CF#1A. Theatre Square

A. Theatre Squaretime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputTheatre Square in the capital city of Berl

2014-11-06 14:35:50 599

原创快速幂fromHZWER

long long mi(long long a,long long k,long long n)//{ int ans=1; for(int i=k;i;i>>=1,a=(a*a)%n) if(i&1) ans=(ans*a)%n; return ans;}

2014-11-05 17:03:22 847

原创 CODEVS 1230 元素查找

题目描述 Description给出n个正整数，然后有m个询问，每个询问一个整数，询问该整数是否在n个正整数中出现过。输入描述 Input Description第一行两个整数 n 和m。第二行n个正整数（1第三行m个整数(1输出描述 Output Description一共m行，若出现则输出YES，否则输出NO

2014-10-11 19:36:02 689

Momo