![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
模拟
文章平均质量分 67
JogRunner
这个作者很懒,什么都没留下…
展开
-
POJ 1926 Pollution 直接模拟也能过!!
#include #include #include #include #include using namespace std;double capcity[105];const double eps = 1e-5;int point[105][105];int n,m;double Abs(double f){ return f>0?f:-f;}void so原创 2012-06-08 10:55:28 · 596 阅读 · 0 评论 -
hdu 2399
OJ#include #include using namespace std;typedef __int64 LL;char s[1005];void deal(LL num){ s[0] = '0';s[1]='.'; int xi = 10; int k = 2; while(xi&&k<1000) { s[k++] = '0'+(xi/num)原创 2012-07-07 17:23:16 · 493 阅读 · 0 评论 -
hdu 1998
OJ#include #include using namespace std;int M[20][20];int main(){ int test; cin>>test; while(test--) { int n; cin>>n; memset(M,0,sizeof(M)); int k = n/2; int r = 0; M[r原创 2012-07-07 22:09:20 · 401 阅读 · 0 评论 -
hdu 1048
OJimport java.util.*;class Main { public static String ar ="VWXYZABCDEFGHIJKLMNOPQRSTU"; public static void main(String []args) { Scanner in = new Scanner(System.in); String a;原创 2012-07-09 00:09:35 · 402 阅读 · 0 评论 -
hdu 1201
OJ#include #include using namespace std;int ar[12]={31,28,31,30,31,30,31,31,30,31,30,31};bool isleapyear(int year){ if(year%4==0&&year%100!=0)return true; else if(year%400==0) return true;原创 2012-07-09 13:00:40 · 385 阅读 · 0 评论 -
hdu 1172
OJ#include#include #include #include #include #include #include #include using namespace std;#define PD(x) (scanf("%d",&x))#define PP(a,b) (scanf("%d%d",&a,&b))#define PR(a) (printf(原创 2012-06-29 20:11:05 · 511 阅读 · 0 评论 -
给你些火柴棍,找出能摆的最大大值和最小值
#include //本题据说是个动态规划,本人硬着头皮去找规律,所以代码只能说是投机,或者说是暴力去解决问题的。#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;原创 2012-07-15 00:05:10 · 1572 阅读 · 0 评论 -
pku 1099
#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define PF(x) (scanf("%d",&x))#define PT(x,y)原创 2012-08-26 13:58:54 · 309 阅读 · 0 评论