Codeforces
关注
分享
扫一扫
AndrewThompson
这个作者很懒，什么都没留下…
展开
-
803A Maximal Binary Matrix
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;using namespace placeholders;int main(){原创 2017-04-30 10:49:01 · 393 阅读 · 0 评论 -
796A - Buying A House
#include#include#include#include#include#include#include#includeusing namespace std;int main(){ int n, m, k; while (cin >> n >> m >> k){ vector prices(n + 1); for (int i = 1; i > price原创 2017-04-26 15:24:07 · 278 阅读 · 0 评论 -
796B Find The Bone
#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ int n, m, k; while (scanf("%d %d %d", &n, &m, &k)!=EOF){ vector hole(n + 1, false原创 2017-04-26 15:57:04 · 373 阅读 · 0 评论 -
796C Bank Hacking
#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ int n; while (scanf("%d",&n)!=EOF){ multiset st; vector strength(n + 1); fo原创 2017-04-26 19:26:07 · 309 阅读 · 0 评论 -
796D Police Stations
#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ int n, k, d; while (cin >> n >> k >> d){ vector police(k + 1); vector visit(n +原创 2017-04-27 10:01:28 · 447 阅读 · 0 评论 -
codeforces 808A Lucky Year
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;string year;//900000000//1000000000long i原创 2017-05-19 22:03:25 · 409 阅读 · 0 评论 -
Codeforces 808B Average Sleep Time
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;long long int n, k;long long int原创 2017-05-19 22:53:13 · 318 阅读 · 0 评论 -
Codeforces 808C Tea Party
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int n, k;typedef struct node{ i原创 2017-05-19 23:45:36 · 417 阅读 · 0 评论 -
808D Array Division
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;long long int n;int main(){ whi原创 2017-05-20 17:09:47 · 295 阅读 · 0 评论 -
808E. Selling Souvenirs***
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long int LL;LL n, m原创 2017-05-20 20:42:17 · 330 阅读 · 0 评论 -
807A Is it rated?
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int n;typedef struct person{ int原创 2017-05-20 21:49:03 · 318 阅读 · 0 评论 -
807B T-Shirt Hunt
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int p, x, y;bool get(int temp){原创 2017-05-20 22:27:53 · 309 阅读 · 0 评论 -
805B - 3-palindrome
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int n;int main(){ while (cin >>原创 2017-05-20 23:33:03 · 235 阅读 · 0 评论 -
805A Fake NP
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long int LL;LL x, y;原创 2017-05-21 09:16:20 · 275 阅读 · 0 评论 -
804A - Find Amir
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int n;int main(){ while (cin >> n原创 2017-05-21 09:36:16 · 279 阅读 · 0 评论 -
797E - Array Queries
#include#include#include#include#include#include#include#includeusing namespace std;int main(){ int n; while (cin >> n){ vector elem(n + 1); for (int i = 1; i > elem[i]; int dp[10000原创 2017-04-25 22:33:35 · 296 阅读 · 0 评论 -
797D Broken BST
#include#include#include#include#include#include#include#includeusing namespace std;void get(int root, vector &val, vector &left, vector &right, int min_val, int max_val, map &dic1, map &dic原创 2017-04-25 21:18:27 · 330 阅读 · 0 评论 -
797C Minimal string
#include#include#include#include#include#include#include#includeusing namespace std;int main(){ string s; while (cin >> s){ vector amount(26, 0); for (int i = 0; i < s.size(); i++) amo原创 2017-04-25 17:39:37 · 341 阅读 · 0 评论 -
803B Distances to Zero
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;using namespace placeholders;int main(){原创 2017-04-30 11:45:49 · 301 阅读 · 0 评论 -
803C Maximal GCD
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;using namespace placeholders;typedef long原创 2017-04-30 14:42:07 · 317 阅读 · 0 评论 -
803D - Magazine Ad
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;using namespace placeholders;bool used(int原创 2017-04-30 16:33:01 · 352 阅读 · 0 评论 -
803E - Roma and Poker
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;using namespace placeholders;map> dp;int原创 2017-05-01 15:25:39 · 290 阅读 · 0 评论 -
793A - Oleg and shares
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;using namespace placeholders;typedef long原创 2017-05-02 20:14:11 · 339 阅读 · 0 评论 -
793B - Igor and his way to work
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;using namespace placeholders;int n, m;int原创 2017-05-02 23:24:05 · 349 阅读 · 0 评论 -
793C Mice problem
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;using namespace placeholders;const double原创 2017-05-03 14:02:11 · 292 阅读 · 0 评论 -
793D Presents in Bankopolis
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;using namespace placeholders;int area[82][原创 2017-05-05 10:44:26 · 371 阅读 · 0 评论 -
798A - Mike and palindrome
In this problem,we can change the only one character.We define a variable amount to count the number of different characters when we traverse from the both ends to the middle.When the amount>=2,it mea原创 2017-04-24 22:05:11 · 371 阅读 · 0 评论 -
B. Mike and strings
I use the way of brute force.Everytime I set the string t as the string that I want the remaining string to be equal to.And I caculate the steps.Then I choose the minimum steps as the result.#includ原创 2017-04-24 23:23:43 · 292 阅读 · 0 评论 -
798 C. Mike and gcd problem
#include#include#include#include#include#include#includeusing namespace std;int gcd(int a, int b){ while (a > 0){ int c = b%a; b = a; a = c; } return b;}int main(){ int n; whi原创 2017-04-25 09:49:35 · 493 阅读 · 0 评论 -
798D Mike and distribution
#include#include#include#include#include#include#includeusing namespace std;int main(){ int n; while (cin >> n){ vector A(n); vector B(n); vector index(n); for (int i = 0; i < n; i+原创 2017-04-25 14:52:52 · 349 阅读 · 0 评论 -
797A - k-Factorization
#include#include#include#include#include#include#includeusing namespace std;void judge(vector& res, bool &flag, int n, int k){ for (int i = 2; i < n; i++){ while (n%i == 0){ res.push_b原创 2017-04-25 15:20:40 · 292 阅读 · 0 评论 -
797B - Odd sum
#include#include#include#include#include#include#includeusing namespace std;int main(){ int n; while (cin >> n){ vector odd; int sum = 0; for (int i = 0; i < n; i++){ int t; cin原创 2017-04-25 15:41:01 · 426 阅读 · 0 评论 -
B - Minimum number of steps
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;string s;long long int Mod = 1000原创 2017-05-21 11:20:44 · 270 阅读 · 0 评论