freopen

codeforces 395 D

#includeusingnamespacestd;intx[100500];inty[100500];intk[100500];intt[100500];intdfs(){}intmain(){//freopen
ye-leng·2020-08-10 19:59

ACM Plan UVa - 441 Lotto

——LinusTorvalds循环版本#include#includeusingnamespacestd;intmain(){//freopen("i.txt","r",stdin);//freopen
殇尘·2020-08-10 19:21

10591 - Happy Number

描述：判断是否循环就可以了#include#include#include#defineN10003intnum[N];intmain(){//freopen("a.txt","r",stdin);intn
moyan_min·2020-08-10 18:47

uva414

include#include#include#include#include#includeusingnamespacestd;charstr[120];intmain(){#ifdefLOCAL//freopen
蓝宇·2020-08-10 17:25

NOIP2005年普及组题解

#include#includeusingnamespacestd;inta[15],hei,ans;intmain(){freopen("apple.in","r",stdin);freopen
ljp946·2020-08-10 17:22

NOIP2009年普及组题解

直接上代码~~~#include#includeusingnamespacestd;intn,a[110];intmain(){//freopen("poly.in","w",stdin);//
ljp946·2020-08-10 17:52

Playing With Stones UVALive - 5059 Nim SG函数 打表找规律

i/2:SG(i/2);}llarr[100000];intmain(){//freopen("input.in","r",stdin);intT;scanf("%d",&T);while(T--){intn
EM-LGH·2020-08-10 17:44

异或求和式 (数位DP)

include#includeusingnamespacestd;typedeflonglongLL;#defineMAXN110intn,a,dp[MAXN][2]={0};intmain(){//freopen
LzyRapX·2020-08-10 17:28

NOIP-2016-普及组 复赛题解

T1(Pencil)随便做#includeusingnamespacestd;intn,a,b,ans=2147483647;intmain(){freopen("pencil.in","r",stdin
Jacky_50·2020-08-10 17:19

NOIP 2018普及组复赛C++详细题解报告（1）

第1题标题统计一、代码#include#includeusingnamespacestd;intmain(){freopen("title.in","r",stdin);freopen("title.out
海天一树·2020-08-10 16:26

NOIP 2016普及组复赛C/C++详细题解报告

#include#include#includeusingnamespacestd;intmain(){freopen(".\\pencil.in","r",stdin);freopen(".
海天一树·2020-08-10 16:54

乱七八糟的编程技巧（随机数、效率）和网站（http://bytew.net/OIer/）

ints=clock();doublek=0;for(inti=1;i#include#include#include#defineN10000000usingnamespacestd;intmain(){freopen
flymist·2020-08-10 16:47

poj 3253 huffman（切木棍）

include#include#defineN20005ints[N],n,T;voidadjust(inti){intx=s[i];i=1){if(s[i/2]>=1;}s[i]=x;}intmain(){freopen
dumeichen·2020-08-10 16:31

CDOJ 1134 男神的约会 状压dp

includeusingnamespacestd;#defineINF99999999intpow_2[10];intgrid[10][10];intdp[1024][10][10];intmain(){//freopen
sky-edge·2020-08-10 15:54

【2017NOIP普及组】T2 图书管理员

P3955图书管理员题目传送门方法一：#include#include#include#include#include#include#include#definefre(x)freopen(#x".in
Code farmer—John·2020-08-10 15:11

【2019CSP-J普及组】T1 数字游戏

方法一：#include#include#include#include#include#include#definefre(x)freopen(#x".in","r",stdin),freopen(#
Code farmer—John·2020-08-10 15:11

排列组合简单练习

1#includeusingnamespacestd;intN,r;unsignedlonglongp=1,ans=1,f[1005][1005];intmain(){freopen("1034.in"
bell041030·2020-08-10 15:05

【动态规划】 基础题目（一）

1、P1359租用游艇#includeusingnamespacestd;intdp[205],n,x;intmain(){freopen("a.in","r",stdin);memset(dp,0x3f
andyc_03·2020-08-10 15:31

北京集训②DAY1 Morning

水题最后一个非零数减1即可1#include2#include34constintMAXN=110;56intn,cnt;78inthh(){9freopen("bit.in","r",stdin);10freopen
WhiStLenA·2020-08-10 14:41

【考题详解】 4月DP练习赛题解

1usingnamespacestd;inta[1000000];intF[20000][1500];inlineintMax(inta,intb,intc){returnmax(a,max(b,c));}intmain(){freopen
pigzhouyb·2020-08-10 14:39

Jzoj4778 数列编辑器

defineN1000010usingnamespacestd;intl[N],r[N],s[N];charc[5];intw[N],f[N]={-1<<29},n=0,m,t,cnt=0;intmain(){freopen
扩展的灰·2020-08-10 14:23

[巴什博奕]HDU 2147——kiki's game

给出n个数，每次可以取x个(1usingnamespacestd;intn,m;intmain(){freopen("exam.in","r",stdin);freopen("exam.out","w"
CHN_JZ·2020-08-10 13:40

Codeforces Round #243 (Div. 2) C. Sereja and Swaps

#include#includeusingnamespacestd;intmain(){freopen("in2.txt","r",stdin);intn,k,a[500],b[500],c[500];
wintermelon27·2020-08-10 13:31

hdu2024C语言合法标识符

1#include2#include3#include4#include5#include6#include7usingnamespacestd;89intmain()10{11//freopen("in.txt
叁包辣條·2020-08-10 13:00

HM学习心得3

网上搜了一下，发现了一个函数“freopen”,可以简单的实现测试结果的保存
u010485442·2020-08-10 13:14

【题解】洛谷P1233木棍加工 贪心

includeusingnamespacestd;#define_rep(i,a,b)for(inti=(a);irhs.l||(l==rhs.l&&w>rhs.w);}}wood[N];intmain(){//freopen
不进清北不改名·2020-08-10 13:59

NOIP 2018普及组复赛第1题答案详解

一、C程序###解法一：用gets()函数#include#includeintmain(){//将控制台的数据重定向到文件里freopen("title.in","r",stdin);freopen(
海天一树·2020-08-10 12:18

暑假第十六测

#includeusingnamespacestd;#definelllonglongconstintM=1e5+10;llst[M][2];llans,tot;intmain(){freopen("guass.in
weixin_30437481·2020-08-10 07:59

freopen的相关应用

和这个函数的结缘好像还是大二的一次网络赛，这次再查资料也是很多和竞赛挂钩的博文。有很多讲的很细的文章，这里引用一下，若有冒犯，麻烦私信我一下，我都会删除。（简介版）https://blog.csdn.net/xavierdarkness/article/details/80638641（应用版）https://www.jianshu.com/p/988e4bbf1b4f（分析版）https://b
OPMR·2020-08-10 07:44

QBXT金秋测试题解qwq

两个特判留保底分用的qwq#include#includeusingnamespacestd;intn;doublep[1001][1001],ans,g[1001][1001];intmain(){freopen
weixin_30840573·2020-08-10 02:57

最长不下降序列

)且b(i)j)，若存在i1#includeintp[10000],a[10000];structss{  intx,y;}dp[10000];chars[100000];intmain(){  //freopen
u011123263·2020-08-10 01:56

2016计算机学科夏令营上机考试C:反反复复（字符串处理）

include#include#includeusingnamespacestd;constintmaxn=210;charstr[maxn];charmap[maxn][25];intmain(){freopen
孱弱Lynch·2020-08-10 00:47

Educational Codeforces Round 88 (Rated for Div. 2)(A~D)

就应该让尽可能多的的joker牌在一个人的手中，那么我们就分类讨论如果mct,就把ct张牌给一个人，然后剩下的牌平均分配就行了代码#includeusingnamespacestd;voidfre(){freopen
做一只大熊猫·2020-08-09 23:43

Codeforces Round #647 (Div. 2) - Thanks, Algo Muse!(A~D)

问我们通过一些这样的操作以后能否把a变成b，如果能输出需要的最小次数，否则输出-1分析这个题中既可能有乘法又有除法操作，我们可能在输入a、b的之后，如果ausingnamespacestd;voidfre(){freopen
做一只大熊猫·2020-08-09 23:43

Codeforces Round #621 (Div. 1 + Div. 2)(A~D)

#include#include#include#include#include#include#include#include#includeusingnamespacestd;voidfre(){freopen
做一只大熊猫·2020-08-09 23:42

区间划定最小值题解--单调队列

include#include#includeusingnamespacestd;dequeq;deque::iteratorit;inta[12345678],b[12345687];intmain(){//freopen
farines·2020-08-09 20:09

2020.2.29普及C组 扫雷(mine) 【纪中】【暴力模拟】

代码#include#include#include#includeusingnamespacestd;intn,a[60][60],x,y,bj;intmain(){freopen("mine.in"
Jackma_mayichao·2020-08-09 18:34

uva437(经典DAG题目)

题意：有n(n#include#include#include#include#include#include#include#include#include#include#include//freopen
谢符宝·2020-08-09 16:32

The Tower of Babylon UVA - 437

defineINF0x3f3f3f3f#definemod1000000007;usingnamespacestd;constintmaxn=32;intcube[maxn][3];intn,d[maxn][3];//freopen
沐妖·2020-08-09 11:27

codeforces1313D Happy New Year 题解

比赛时没做出来orz剩下一段时间去hack了不过当时估计也做不出了好难啊题目#include#definelllonglong#defineN200015#defineM1mem[N];intmain(){//freopen
czdzx233·2020-08-09 11:44

20190724杭电多校第二场

includeusingnamespacestd;#definep_bpush_back#defineFor(i,a,b)for(inti=a;iv[maxn];//第一维下标为LIS长度intmain(){//freopen
happy_windman·2020-08-09 11:32

Codeforces 622C (vector 二分)

点击打开链接题意:给出n个usingnamespacestd;#definemaxn1000005vectorgg[maxn];intn,m;intfa[maxn],a[maxn];intmain(){//freopen
morejarphone·2020-08-09 09:07

HDU 3605 Escape

代码：1#include2usingnamespacestd;3#defineFopenfreopen("_in.txt","r",stdin);freopen("_out.txt","w",st
dengpangbu3703·2020-08-09 07:10

HDU-1532 网络流裸题

代码：1#include2usingnamespacestd;3#defineFopenfreopen("_in.txt","r",stdin);freopen("_out.txt","w",stdout
dengpangbu3703·2020-08-09 07:09

CodeForces 103D Time to Raid Cowavans 询问分块

代码：#includeusingnamespacestd;#defineFopenfreopen("_in.txt","r",stdin);freopen("_out.txt","w",stdout);
dengpangbu3703·2020-08-09 07:09

分层图 单调决策性DP

#includeusingnamespacestd;#defineFopenfreopen("_in.txt","r",stdin);freopen("_out.txt","w",stdout);#defineLLlonglong
dengpangbu3703·2020-08-09 07:09

Codeforces652C

includeusingnamespacestd;constintmaxn=300005;inta[maxn],t[maxn],tag[maxn];intr[maxn];intn,m;intmain(){//freopen
Apel_dey·2020-08-09 05:17

linux I/O操作 ---流文件

一、打开和关闭流FILE*fopen(constchar*pathname,constchar*mode);FILE*freopen(constchar*pathname,constchar*mode,
sunlin5000·2020-08-08 21:25

NOIP2015提高组解析

：i+1在i的右上方，如果已经有数了，就填在i的下方）参考程序：#include#includeusingnamespacestd;inta[50][50];intnx,ny,n;intmain(){freopen
I_AM_HelloWord·2020-08-08 18:29

BZOJ 4712 洪水 动态dp(LCT+矩阵乘法）

defineN200005#definelllonglong#defineinf10000000005#definelsonp[x].ch[0]#definersonp[x].ch[1]#definesetIO(s)freopen
EM-LGH·2020-08-08 17:01
上一页 6 7 8 9 10 11 12 13 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他