贪心
Jianbagengmu
换了id,换了我的人生的态度.
展开
-
POJ 3617 Best Cow Line
Best Cow LineTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged on PKU. Original ID: 361764-bit integer IO format: %lld Java class name: MainPrev Submit St原创 2017-04-24 16:11:11 · 217 阅读 · 0 评论 -
UVA 11729 STL - Commando War
水 贪心,主要用下STL#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<string>#include<algorithm>#include<stack>#include<queue>#include<cctype>#include<functional>using namesp原创 2017-05-07 19:39:42 · 196 阅读 · 0 评论 -
hdu2069
Coin Change Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 2069 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics Ne原创 2017-07-01 16:32:00 · 345 阅读 · 0 评论 -
hdu_1078_FatMouse and Cheese_神奇的贪心_动态规划_算不上是dp
FatMouse and Cheese FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At each原创 2017-08-16 22:03:27 · 239 阅读 · 0 评论 -
Codeforce_827C_Two Seals_Educational Codeforces Round 26
C. Two Seals time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output One very important person has a piece of paper in the form of a rectangle a ×原创 2017-08-09 22:13:49 · 345 阅读 · 0 评论 -
hdu_2609_循环字符串的最小字典序
Problem Description Give you n ( n < 10000) necklaces ,the length of necklace will not large than 100,tell me How many kinds of necklaces total have.(if two necklaces can equal by rotating ,we say th原创 2017-10-18 22:31:09 · 649 阅读 · 0 评论 -
nitoj_怎么又是签到题
怎么又是签到题 Time Limit: 500msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Prev Submit Status Statistics Next Type: NoneTag it! 万年过去,一切都归于尘土。女神觉得世界太单调,于是创造了balakala原创 2017-11-28 21:10:28 · 925 阅读 · 0 评论 -
nitoj_244_很有意思的贪心
SYS招新啦! ES天天在SYS没事干,忽然想组织一波招新以扩大SYS的队伍。然后有一堆萌新报名了,所有萌新的关系都特别好,因为同性。因为萌新实在是太多了,ES想要做一个刷选,来刷掉一些人。ES使用超自然力,造了一条很长很长的直线跑道,萌新被带到了跑道上面,跑道上有些位置存在宝石,坏坏的ES说:“如果你们能按规定的时间拿到宝石并到我指定的点,就算你们晋级了!”每个萌新,宝石以及ES指定的位置都在同原创 2017-11-25 18:54:33 · 311 阅读 · 0 评论 -
计蒜客_A. Amsterdam Distance_思维
给你图片让你走,只有两种走法#include<bits/stdc++.h>using namespace std;#define pi acos(-1.0)int main(){ // cout<<pi<<endl; // printf("%lf\n",2.0/5+(pi*(4.0/5)*3)/6); double n,l,r,x,y,xx,yy; while(c原创 2017-11-25 19:08:47 · 299 阅读 · 0 评论