Educational Codeforces Round 34 题解

A. Hungry Student Problemtime limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Ivan’s classes ...

2017-12-14 16:05:48

阅读数 279

评论数 0

Codeforces Round #438 题解

A. Bark to Unlock注意特判相等的情况#include<bits/stdc++.h> using namespace std; typedef long long ll; const int INF = 1e9; inline int read(){int ra,fh;c...

2017-10-05 21:27:36

阅读数 113

评论数 0

C - Restore Graph CodeForces - 404C BFS+小trick

Valera had an undirected connected graph without self-loops and multiple edges consisting of nvertices. The graph had an interesting property: there ...

2017-09-15 00:06:19

阅读数 146

评论数 0

Codeforces Round #429 (Div. 2) 题解

题目链接A Generous Kefa找字母出现的最大次数#include<iostream> #include<string> #include<vector> #include<algorithm> #include<queue> #...

2017-08-19 09:50:35

阅读数 463

评论数 0

Codeforces Round #418 (Div. 2) 题解 ABC

A. An abandoned sentiment from past time limit per test 1 second memory limit per test 256 megabytes input standard input outp...

2017-06-08 10:15:01

阅读数 351

评论数 0

Codeforces Round #402 (Div. 2) C. Dishonest Sellers 简单模拟

C. Dishonest Sellers time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard o...

2017-03-15 12:52:24

阅读数 379

评论数 0

Codeforces Round #401 (Div. 2) 题解

A. Shell Game time limit per test 0.5 seconds memory limit per test 256 megabytes input standard input output standard output Bomboslav li...

2017-02-28 15:19:23

阅读数 305

评论数 0

Codeforces 768C Jon Snow and his Favourite Number

C. Jon Snow and his Favourite Number time limit per test 4 seconds memory limit per test 256 megabytes input standard input ou...

2017-02-21 10:09:45

阅读数 1273

评论数 0

Codeforces 768B Code For 1

B. Code For 1 time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output ...

2017-02-21 10:06:24

阅读数 347

评论数 0

Codeforces 768A Oath of the Night's Watch

A. Oath of the Night's Watch time limit per test 2 seconds memory limit per test 256 megabytes input standard input output st...

2017-02-21 10:02:41

阅读数 459

评论数 0

Codeforces Round #398 (Div. 2) B. The Queue brute force+greedy

B. The Queue time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output ...

2017-02-18 21:42:16

阅读数 273

评论数 0

Codeforces Round #398 (Div. 2) A. Snacktower 模拟

A. Snacktower time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output ...

2017-02-18 21:28:51

阅读数 666

评论数 0

Codeforces Round #397 题解

A. Neverending competitions time limit per test 2 seconds memory limit per test 512 megabytes input standard input output sta...

2017-02-15 22:40:42

阅读数 507

评论数 2

Codeforces Round #272 (Div. 2) < math >

A Dreamoon and Stairs 数学水题题目思路:判断一下m的倍数的两倍是否大于n.代码#include <iostream> #include <cstdio> #include <cstdlib> #include <cmath> ...

2017-02-13 17:37:57

阅读数 188

评论数 0

Codeforces Round #396 (Div. 2)题解

A Mahmoud and Longest Uncommon Subsequence解题思路整理:最长不相同串,思路很简单,如果两个串相同,则肯定不存在不相同串,如果两个串不相同,则取最长串的长度~解题代码:#include <iostream> #include <cstdi...

2017-02-10 14:16:13

阅读数 259

评论数 0

Codeforces Round #268 (Div. 2) 题解

A I Wanna Be the Guy解题思路直接用一个set,最后判断一下是否有n个数。#include <iostream> #include <cstdio> #include <cstdlib> #include <cmath> #inc...

2017-02-10 14:03:36

阅读数 199

评论数 0

假期训练——THE DRUNK JAILER POJ - 1218 模拟

A certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked. One night, ...

2017-02-06 19:49:13

阅读数 198

评论数 0

Codeforces Round #269 (Div. 2) C MUH and House of Cards 爆搜+剪枝

C. MUH and House of Cards time limit per test 1 second memory limit per test 256 megabytes input standard input output standa...

2017-02-06 10:08:18

阅读数 215

评论数 0

Codeforces Round #269 (Div. 2) D MUH and Cube Walls KMP

D. MUH and Cube Walls time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard ...

2017-02-06 10:01:13

阅读数 242

评论数 0

Codeforces Round #395 (Div. 2) 题解

题目连接:http://codeforces.com/contest/764A. Taymyr is calling you解题思路:两个for循环,对一个数组进行操作,访问次数为2的数目为答案时间复杂度:O(n) 空间复杂度:O(n)代码如下:#include <iostream>...

2017-02-03 21:43:56

阅读数 235

评论数 0

提示
确定要删除当前文章?
取消 删除
关闭
关闭