codefores
Pandauncle
写给自己的。
学好自己该学的,
什么都想学的,什么都学不好。
什么都不学的,神马都是浮云。
不要好高骛远。
脚踏实地,
想要的会来的。
展开
-
Codeforces Round #432 Div2 B. Arpa and an exam about geometry
B. Arpa and an exam about geometry time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Arpa is taking a geometry exam. Here is the last proble原创 2017-08-30 16:55:40 · 488 阅读 · 0 评论 -
C. Permute Digits
C. Permute Digits time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You are given two positive integer numbers a and b. Permute (change order原创 2018-01-14 10:38:50 · 957 阅读 · 0 评论 -
Codeforces Round #447 (Div. 2) C. Marco and GCD Sequence
**C. Marco and GCD Sequence** time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard outputIn原创 2017-11-20 18:57:37 · 684 阅读 · 0 评论 -
Codeforces Round #446 (Div. 2) D. Gluttony
传送门:http://codeforces.com/contest/892/problem/D 题意是: 给你一个a[]数组,让你构造出一个b[]数组,使得a[]数组的前k项子集和,和b[]数组的不同。 思路: 简单构造题,首先让a[]数组排序然后左移动一格或者右移动一格,就可以构造出和原来不同的子集和了。#include<bits/stdc++.h>usi原创 2017-11-18 21:07:25 · 896 阅读 · 0 评论 -
Codeforces Round #446(div 2) C. Pride
C. Pride time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You have an array a with length n, you can perform operations. Each operation is原创 2017-11-18 12:19:15 · 587 阅读 · 0 评论 -
Codeforces Round #441 Div 2 B. Divisiblity of Differences
B. Divisiblity of Differences 题意很简单:从n个整数中选取k个数,任意的两两整数只差能整出m. 很不幸,比赛中这题被Hack了,用两重for循环来写的,还是自己比较菜,,唉。。。。。 思路:也很简单,用一个数组来存对m同余的个数,若题目同余的个数大于K个的话,则他们任意两两数只差肯定能整出m.#include<bits/stdc++.h>using namesp原创 2017-10-16 23:39:07 · 302 阅读 · 0 评论 -
Codeforces Round #439 C.The Intriguing Obsession(组合数学)
C. The Intriguing Obsession time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output — This is原创 2017-10-11 20:07:12 · 377 阅读 · 0 评论 -
Codeforces 849 B. Tell Your World(计算几何)
**题目大概意思是:给出n个坐标(i,y[i]),问是否存在两条不重合的平行线,经过所有点,且每条平行线上至少有一个点。***思路为:把所有的点分成两个平行线的集合,则第一个点与第二个点连接的斜率和第一个点和第三个点连接的斜率或第三个点和第二个点连接的斜率必定有一个存在其中一个平行线的集合当中,否则不存在两条不重合的平行线,经过所有的点。*直接上代码:#include<stdio.h>#in原创 2017-09-02 20:07:18 · 355 阅读 · 0 评论 -
Codeforces 742 B. Arpa’s obvious problem and Mehrdad’s terrible solution
B. Arpa’s obvious problem and Mehrdad’s terrible solution time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output There are some beautiful girls in原创 2017-09-01 20:21:01 · 347 阅读 · 0 评论 -
Codeforces Round #432 Div. 2 C. Five Dimensional Points(数学)
C. Five Dimensional Points time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You are given set of n points in 5-dimensional space. The point原创 2017-09-06 20:27:01 · 385 阅读 · 0 评论 -
codeforces Hello 2018 C. Party Lemonade(DP+思维)
C. Party Lemonade time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output A New Year party is not a New Year party without lemonade! As usual, you原创 2018-01-09 16:44:40 · 460 阅读 · 0 评论