E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
freopen
poj1003"Hangover"解题报告
这道题目并不难,思路就不在说了,看懂题意后就简单了,直接把自己的代码附上,供大家参考哈#includeusingnamespacestd;intmain(){//
freopen
("in.txt","r"
wei_xiaohui
·
2020-08-25 04:45
固定文件,算工资,节约时间
#include#includeusingnamespacestd;intmain(){doublesalarys[500];intn=0;
freopen
("a.txt","r",stdin);while
wangzhichao
·
2020-08-25 04:55
扫雷游戏
1usingnamespacestd;intmain(){
freopen
("in
hipoole
·
2020-08-25 03:22
c++题库
计蒜客 杨辉三角(DP)
include#include#include#include#definemaxn55usingnamespacestd;intn,m;longlongdp[maxn][maxn];intmain(){//
freopen
ccshijtgc
·
2020-08-25 02:41
DP
【USACO06FEB】数字三角形
inta[13][13];intb1[13],b2[13];//longlongk[13];intn;intsum;longlongf=0;intp=0;voiddfs(int);intmain(){//
freopen
zhuzy2020
·
2020-08-25 02:55
动态规划之序列dp
【题解】洛谷P1216[USACO1.5][IOI1999]数字三角形 递推
题目链接递推入门#include#includeusingnamespacestd;inta[10000][10000];intmain(){//
freopen
("in.txt","r",stdin);
不进清北不改名
·
2020-08-24 22:51
IOI
USACO
洛谷
递推
大深坑
个点原因在运算时没有进行特判超出所需要的运算次数2017年10月24日一道水题NOIPT1难度不幸WA了1个点原因特殊情况的特判要多考虑几种情况避免失误2017年10月22日一道水题NOIPT1难度不幸全部无输出原因
freopen
almz654321
·
2020-08-24 22:45
C++编程
黑恶势力
杂论
题
]*i求连续吃k道菜的最大的美味值处理前缀和注意爆int#include#includeusingnamespacestd;longlonga[200001],s[200001];intmain(){
freopen
almz654321
·
2020-08-24 22:45
C++编程
SCU - 4438(KMP)
#include#defineLLlonglong#definefread()
freopen
("in.in","r",stdin)#definefwrite()
freopen
("out.out","w"
favomj
·
2020-08-24 22:07
CCF认证2014093-字符串匹配
具体代码如下:#include#include#includeusingnamespacestd;intmain(){//FILE*stream;//
freopen
_s(&stream,"data.txt
Zee_Chao
·
2020-08-24 21:45
刷题笔记:CCF认证
hdu1496 Equations(哈希表)
#include#include#includeusingnamespacestd;constintN=2000005;intmain(){//
freopen
("in.txt","r",stdin);inta
Flynn_curry
·
2020-08-24 21:36
hdu
ACM-各种水题
HDU - 6330(模拟画图)
代码:#include#includeusingnamespacestd;intmain(){//
freopen
("in.txt","r",stdin);//
freopen
("out.txt","w",
20172674
·
2020-08-24 20:33
水题
模拟
P1164 小A点菜
看了题解才明白到的是哪里出现了错误-····哎好菜二维题解#includeusingnamespacestd;constintLen=1005;intn,m;intdp[Len][Len*10];intmain(){//
freopen
做一只大熊猫
·
2020-08-24 20:12
#
背包九讲
G - 前m大的数 HDU - 1280(水题)
include#include#include#include#include#include#include#include#include#includevoidfre(){system("clear"),
freopen
做一只大熊猫
·
2020-08-24 20:12
#Hash
uva 10763 Foreign Exchange
structnode{intstart;intend;};booloperatorm;intmain(void){intn,i,t;structnodeno;boolf;map::iteratorit;//
freopen
皓首不倦
·
2020-08-24 18:15
acm
[刷题]算法竞赛入门经典(第2版) 4-9/UVa1591 - Data Mining
1hssH0KO代码:(Accepted,0ms)#includeunsignedN,A,B,Sp,Sq,ansA,ansB;unsignedlonglongPofs,K,nowK;intmain(){//
freopen
weixin_30662011
·
2020-08-24 17:42
DNA Consensus String UVA - 1368
#include#include#include//A0C1G2T3intmain(){
freopen
("i.txt","r",stdin);intn;intarr[1010][4];chardna[100
1hdmx1t
·
2020-08-24 15:25
刷题
【ACM算法】-- Hash篇 - 哈希问题
代码如下:#includeintn;ints;intisFirst=1;//如果有格式要求,则定义是否是第一个,如果不是第一个就要先输出一个回车在输出数intmain(){
freopen
("in.txt
猪猪传奇
·
2020-08-24 15:37
UVA1594
include"deque"#include"queue"#include"stack"#include"cstdio"#include"cmath"usingnamespacestd;intmain(){//
freopen
zzfyh
·
2020-08-24 15:40
UVA
UVA10935
include"deque"#include"queue"#include"stack"#include"cstdio"#include"cmath"usingnamespacestd;intmain(){//
freopen
zzfyh
·
2020-08-24 15:40
UVA
uva 10763 Foreign Exchange我认为我这种做法最符合题意!
#include#include#include#include#include#include#include#include#include#includeusingnamespacestd;//
freopen
点羽染墨
·
2020-08-24 15:07
UVA10763 - Foreign Exchange
#include#include#includeusingnamespacestd;intnum[500001];intmain(){//
freopen
("in.txt","r",stdin);intn
anqier0468
·
2020-08-24 13:00
Algorithm
Design
【习题5-4 UVA-10763】Foreign Exchange
【代码】#includeusingnamespacestd;intn;map,int>mmap;intmain(){//
freopen
("F:\\rush.txt","r",stdin);while(~
adgnfega11455
·
2020-08-24 13:09
codeforces #165 div2
includeintmain(){inti,j,n,T;scanf("%d",&T);while(T--){scanf("%d",&n);if(n>=180||nintx[100005];intmain(){//
freopen
jkxqj
·
2020-08-24 13:38
【编程题】
《算法竞赛入门经典2ndEdition 》习题3-9 子序列(All in All, Uva10340)
#include#include#includeusingnamespacestd;strings,t;intmain(){//
freopen
("NewTextDocument.txt","r",stdin
Occupiedcsdn
·
2020-08-24 13:04
算法竞赛入门经典
uva
UVa - 227 Puzzle
真是醉了,这道题有两个坑第一个坑是样例给的数是没有空格TRGSJXDOKIMVLN#include#include#include#includeusingnamespacestd;intmain(){//
freopen
Coder_Jeremy Wu
·
2020-08-24 12:55
UVa
UVA-3.10-盒子-1587
#include#include#includestructA{intx;inty;};intmain(){structAnum[8];//memset("num,0,sizeof(num)");//
freopen
DLKKILL
·
2020-08-24 12:06
UVa - 10340 - All in All(暴力遍历、子序列)
#include#includeusingnamespacestd;chars1[101000];chars2[101000];intmain(){//
freopen
("input.txt","r",stdin
i逆天耗子丶
·
2020-08-24 12:34
UVa
竞赛常用算法题目解析
HDU 2669 Romantic 拓展欧几里得模板题
b){d=a,y=0,x=1;}else{gcd(b,a%b,d,y,x);y-=x*(a/b);}}intmain(){//
freopen
("E:\
小萨摩
·
2020-08-24 09:49
算法
对抗赛
;voiddfs(intst,intx){if(x==0){cnt++;return;}inti;for(i=st+1;i<=n;i++)dfs(i,x-value[i]);}intmain(){//
freopen
xiaofang3a
·
2020-08-24 06:59
ACM
luogu 5471 [NOI2019]弹跳 KDtree + Dijkstra
Code:#include#definesetIO(s)
freopen
(s".in","r",stdin)#definemaxn2000000#defineinf100000000#definelsont
EM-LGH
·
2020-08-24 05:25
对抗赛 解题报告
对抗赛【问题描述】程序设计对抗赛设有N(0#include#includeusingnamespacestd;intn,i,j,m;longlonga[55],f[55][5005];intmain(){
freopen
Clove_unique
·
2020-08-24 05:16
dp
题解
算法设计与分析习题3-3 石子合并问题直线排列最大得分
直线最大得分#include#includeusingnamespacestd;intmain(){
freopen
("in.txt","r",stdin);intn;cin>>n;inta[100],m
_吴天德
·
2020-08-24 04:30
算法经验
MFC下启用控制台
AllocConsole();//打开控制台资源
freopen
("CONOUT$","w+t",stdout);//申请写
freopen
("CONIN$","r+t",stdin);//申请读printf
安东time
·
2020-08-24 04:20
Qt
及MFC
2008北京市小学生程序设计友谊赛详细答案
#include#includeusingnamespacestd;intmain(){
freopen
("first.in","r",stdin);
freopen
("first.out","w",stdout
海天一树X
·
2020-08-23 23:57
九度OJ 题目1029
25];charContent[81];}Magics[100000];//#defineLOCALintmain(){#ifdefLOCALfreopen("data.in","r",stdin);
freopen
wo1185246535
·
2020-08-23 21:18
ACM
序列问题(续)
include3usingnamespacestd;4#defineMax10000+105intmain()6{7intn,s,e,sum,sumMax,S,E;8inta[Max];9inti,j;10
freopen
weixin_30653097
·
2020-08-23 20:31
【洛谷 P1060】开心的金明
#defineLOCAL0intv[30];intp[30];intf[30001];intmain(){//文件重定向#ifLOCALfreopen("datain.txt","r",stdin);
freopen
Siding
·
2020-08-23 19:37
九度 oj 题目1480:最大上升子序列和
pid=1480#include#include#includeintmain(){//
freopen
("in/1480.in","r",stdin);intdp[1005],a[1005],n;while
guojiaqi007
·
2020-08-23 16:12
oj
九度
动态规划
洛谷 P6236 [COCI2010-2011#1] LJUTNJA (尚贤)
ans,n,m,maxx,qwq=1;//注意开longlongboolcmp(longlongx,longlongy)//手打cmp{returnx>y;//降幂排列}intmain()//主函数{
freopen
广东清远Oier谭尚贤
·
2020-08-23 08:29
牛客假日团队赛2 C.修围栏
N(1usingnamespacestd;typedeflonglongLL;constintMAXN=3e5+10;constintMOD=1e9+7;intn,m,k,t;intmain(){//
freopen
weixin_33888907
·
2020-08-23 08:30
暑期ACM队内练习赛 H题 数字游戏
include#includeusingnamespacestd;constintMAXN=500005;chars[MAXN],a[MAXN];vectorv[10];intmain(void){//
freopen
muximuxi525
·
2020-08-23 06:42
DP
简单的堆与优先队列问题
为此,他需要N(1usingnamespacestd;priority_queue,greater>q;longlongn,sum,ans,a,b;intmain(){
freopen
("plank.in
lummerx
·
2020-08-23 04:57
c++
队列
BZOJ 1724: [Usaco2006 Nov]Fence Repair 切割木板 贪心_堆_反向思考
BZOJ1724:[Usaco2006Nov]FenceRepair切割木板贪心_堆_反向思考Code:#include#definesetIO(s)
freopen
(s".in","r",stdin)#
EM-LGH
·
2020-08-23 04:42
noip 2016 做题记录
#includeusingnamespacestd;constintmaxn=100005;intn,m,cur=1;boold[maxn];chars[maxn][15];intmain(){//
freopen
oyblxzd
·
2020-08-23 03:10
Noip
【NOIP】普及组2010 三国游戏
include#include#includeusingnamespacestd;constintmaxn=510;inta[maxn][maxn],n,max1,max2,ans;intmain(){//
freopen
weixin_33809981
·
2020-08-23 03:59
洛谷3865 ST表
min(dp[i][j-1],dp[i+(1#include#include#include#include#include#include#definelllonglong#definefile(a)
freopen
山清水秀iOS
·
2020-08-23 03:48
玉米田(cowfood)HGOI
题目描述FJ购买了一处肥沃的矩形牧场,分成MN(1#include#include#includeusingnamespacestd;voidf(){
freopen
("cowfood.in","r",stdin
朝阳的二愣子
·
2020-08-23 02:00
[P1970][NOIP2013]花匠
include#include#include#includeusingnamespacestd;intn,i,cnt,h[100005],top,pos[100005],ans;intmain(){
freopen
TirpitzOVO
·
2020-08-23 02:11
刷题
模拟
NOIP2012提高组解析
参考程序:#include#include#include#includeusingnamespacestd;charkey[110];chardark[1100];intmain(){
freopen
(
I_AM_HelloWord
·
2020-08-23 02:05
上一页
1
2
3
4
5
6
7
8
下一页
按字母分类:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他