huatian5的博客

Matrix  Accepts: 214  Submissions: 1115 Time Limit: 3000/1500 MS (Java/Others)  Memory Limit: 131072/131072 K (Java/Others)Problem DescriptionThere is a matrix MM that

A. Interview with Olegtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp has interviewed Oleg and has

A. Arpa’s hard exam and Mehrdad’s naive cheattime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere exists a

A.题意：给你a柠檬，b苹果，c梨子，让求按照1: 2: 4比例所得的最多水果。B.题意：给你一个字符串str，让你按照顺序将str拆解为字符串s。要求：开始放到s的中心位置，然后不断向1和len位置赋值（优先左方），知道len个字符赋值完毕C.题意：一个电车，车轨为s长。然后someone要从x1到x2，可步行，可蹭车，无上限，让求最少时间花费方向这方面挺难处理的

官方题解hereA#include#include#include#includeusing namespace std;const int N = 100005;int a[N],b[N];int main(){ int t,n; cin>>t; while(t--) { scanf("%d",&n);

A. Andryusha and Sockstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndryusha is an orderly boy and like

A.题意：给你一个字符串，让你判断这个字符串能否修改一个字符后是回文串思路：暴力枚举，（一定要与原来的字符串不同，开始忘了判了，queue那么长，好久才出结果，又用char型写了几次，最后才改了原来的做法过了）#includeusing namespace std;bool pa(string s){ string ss = s; reverse(ss.beg

A.B.C.题意：有c个人，有q个question，每个question中的人代表的是答对这个question的，然后给你n组回答的结果，来寻找是否有且仅有一个人满足回答，有的话输出这个人。思路：map记录查询D.题意：有n天，m天内两人通话+1，输入a call b的初始天数和结尾天数，，，，，思路：直接判断端点的大小情况，贪心选择。

这次又错过了比赛，但是想着还没做过，就补了一下。感觉真的比cf的div2简单，特别是前两个题，a+b，，beginner啊A.a+bB.a~bC.贪心#include#includeusing namespace std;int a[105];int n,x;int main(){ scanf("%d",&n); int sum = 0; fo

题目：http://arc077.contest.atcoder.jp/assignments C - pushpush： 题意：你有n个整数，每次向一个空的序列放入一个ai，每次将ai放到序列最后，然后将序列反转，求最后的序列。 思路：规律，列出前几项，规律很明显/*111 22 12 1 33 1 23 1 2 44 2 1 34 2 1 3 55 3 1 2 45 3 1 2

题目：https://www.nowcoder.com/test/5523985/summary题解：https://www.nowcoder.com/discuss/28582倒水：#includeusing namespace std;const int N = 1e5+5;int t[N],c[N];int n,T,C;//minn = (t*c+T*C)/(c+C)

题目：https://www.nowcoder.com/test/5599304/summary题解：子串：#include#include#include#includeusing namespace std;const int N = 1000005;char t[N],s[N];int Next[N],d[15];//void Getfail(int m){

A. B. C. 题意：两人轮流玩卡片，共n*2张，每次随机抽一张，比较大小，赢了的话加一分胜点，求Fat brother的期望胜点。 思路：两人获胜的期望是相等的，所以直接n/2就是结果了#include<iostream>#include<cstdio>using namespace std;const int N = 2e4+5;int a[N];int main(){

题目：http://codeforces.com/contest/864 A. 题意：两人将卡片拿光，且数量相等 The game is considered fair if Petya and Vasya can take all n cards, and the number of cards each player gets is the same.代码：#include<bits/

A 银行存款#include&lt;bits/stdc++.h&gt;using namespace std;double dp[25];int main(){ int n; double r[6]; scanf("%d",&amp;n); scanf("%lf",&amp;r[1]); scanf("%lf",&amp;r[2]);...

美团点评2017秋招笔试编程题 1.#include&amp;amp;lt;bits/stdc++.h&amp;amp;gt;using namespace std;int f[8] = {0,1,1,1,1,1,1};int main(){ int n; cin &amp;amp;gt;&amp;amp;gt; n; for(int i = 1;i &amp;amp;lt;= n;i++) for(int

A. Night at the Museumtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGrigoriy, like the hero of one famous

A. The New Year: Meeting Friendstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are three friend livi

FZU 2212  Problem A Super Mobile ChargerAccept: 217    Submit: 402 Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem DescriptionWhile HIT ACM Group finished their contest in S

1001#include#include#includeusing namespace std;int main(){ int t,n,a[50]; scanf("%d",&t); while(t--) { scanf("%d",&n); for(int i=0;i<n;i++) scanf(

A. Free Ice Creamtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter their adventure with the magic mirr

Codeforces Round #354 (Div. 2)  纪念一下自己差劲的适应能力，cf，要锻炼自己，适应能力很关键！！！A. Nicholas and Permutationtime limit per test1 secondmemory limit per test256 megabytesinputstandard

A.Alyona and Numbers题意：略思路：这个有一看就不能暴力，找规律。只需要查找5的五个余数0 1 2 3 4的个数就行了，1~n中，因为求余相同的对应的在1~m中有相同的符合个数。#include#includeusing namespace std;int main(){ int n,m; while(~scanf("%d%d",&

A. Pineapple Incidenttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTed has a pineapple. This pineapple is

A. Opponentstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputArya has n opponents in the school. Each day he

A. Mike and Cellphonetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhile swimming at the beach, Mike has

ztr loves math  Accepts: 315  Submissions: 1975 Time Limit: 2000/1000 MS (Java/Others)  Memory Limit: 65536/65536 K (Java/Others)Problem Descriptionztr loves research M

A. Bus to Udaylandtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder and Chris the Baboon are tr

A. Brain's Photostime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSmall, but very brave, mouse Brain was no

A. Beru-taxitime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasiliy lives at point (a, b) of the coordinate

A. Grasshopper And the Stringtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day, the Grasshopper was j

A. One-dimensional Japanese Crosswordtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently Adaltik disco

A. Vitya in the Countrysidetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputEvery summer Vitya comes to visi

源地址：here A在三维空间中，平面 x = 0, y = 0, z = 0，以及平面 x + y + z = K 围成了一个三棱锥。 整天与整数打交道的小明希望知道这个三棱锥内、上整点的数目。 他觉得数量可能很多，所以答案需要对给定的 M 取模。思路1:对于一个三菱锥来说,其是由k+1个直角三角形组成,仅仅考虑其整数点对于其中一个直角三角形来说,其中的整数点为(i^2 + i) /2于是三菱...