freopen

UVA 10905(p79)----Children's Game

intn; stringst[55]; intcmp(stringst1,stringst2) { returnst1+st2>st2+st1; } intmain() { #ifdefdebug freopen
wang2147483647·2016-03-10 21:00

HDOJ-1398 Square Coins

#include #include #include usingnamespacestd; #definemaxn300 intc1[maxn],c2[maxn]; intmain() { //freopen
qq_26122039·2016-03-10 14:00

C语言基础语法

输入输出输入重定向freopen("input.txt","r",stdin);整行输入c++stringa; #include getline(cin,a);C语言chara[100]; #include
artemisrj·2016-03-09 21:00

ACM 中wrong answer（WA）的一种处理办法 UVA10474 where is the marble

长时间没有用输入输出重定向，所以每次提交我的freopen("input.txt","r",stdin);  freopen("output.txt","w",stdout);都没有删除，OJ一直WA,
u011613367·2016-03-08 15:00

Codeforces Round #345 (Div. 2)题解

1minute，#include #definelllonglong #defineN100 usingnamespacestd; intmain() { #ifndefONLINE_JUDGE //freopen
qq_21120027·2016-03-07 19:00

ACM freopen

总觉德这东西有毒啊今天交杭电#ifdefONLINE#elsefreopen(“in.txt”,”r”,stdin);#endif结果无脑TLE。。。。。。。。。。。。。。。。。。。。。。应该是ONLINE_JUDGE，当时傻逼了把………………………………
mymilkbottles·2016-03-07 19:00

POJ-1230 Pass-Muraille

include usingnamespacestd; structWalls{ intx1,y1,x2,y2; ints; }wall[105]; intnum[105]; intmain() { //freopen
qq_26122039·2016-03-05 20:00

POJ-1323 Game Prediction

include #include #include #include #include #include usingnamespacestd; intnum[55]; intmain() { //freopen
qq_26122039·2016-03-05 11:00

文件重定向函数freopen

头文件：stdio.hFILE*freopen(constchar*filename,constchar*mode,FILE*stream);参数说明：filename：需要重定向到的文件名或文件路径。
itwolf·2016-03-04 16:59

PAT1069. The Black Hole of Numbers

脸打肿 #include#includeusingnamespacestd;intmain(){//freopen("input.txt","r",stdin);inti,n,s[5];while(scanf
zeroArn·2016-03-03 22:00

ZOJ-2488 Rotten Ropes

include #include #include #include #include #include usingnamespacestd; intnum[1005]; intmain() { //freopen
qq_26122039·2016-03-03 21:00

UVA 11991(p187)----Easy Problem from Rujia Liu?

#include #definedebu usingnamespacestd; intn,m; map>a; intmain() { #ifdefdebug freopen("in.in","r",stdin
wang2147483647·2016-03-02 17:00

PAT1023. Have Fun with Numbers

可能用的strlen属于string库，但是只能用于字符，不能用数字，因为\0就是0.出现0无法判断，其次二倍时有可能有进位//第一次在二倍进位上出了问题#include#includeintmain(){freopen
zeroArn·2016-03-02 15:00

hdu1542 矩阵面积并+线段树+离散化+二分+扫描线

这道题还是反应出我的很多问题一开始我的没有接触过扫描线这东西于是找博客学习了先对着1542的cpp使劲看觉得自己看的差不多了就开始自己写(我觉得编程你觉得自己看懂了没用还是自己理解了写出来懂的比较透彻)也发现了自己很多问题比如freopen
mymilkbottles·2016-02-28 16:00

PAT-1023 组个最小数

不用排序#include#include#include#include#include#includeusingnamespacestd;#defineMAX50+5intmain(){//freopen
wjzz·2016-02-28 16:35

HDOJ-1059 Dividing

include #include #include #include usingnamespacestd; intdp[120005]; intnum[7],k[20005]; intmain() { //freopen
qq_26122039·2016-02-28 11:00

HDOJ-2577 How to type

个字母的最少按键数#include #include #include #include #include usingnamespacestd; intdp[110][2]; intmain() { //freopen
qq_26122039·2016-02-28 10:00

UVA 12325(p210)----Zombie's Treasure Chest

include #include usingnamespacestd; typedeflonglongLL; intmain() { //ios::sync_with_stdio(false); //freopen
wang2147483647·2016-02-27 14:00

程序2-10 数据统计 （重定向版）

#defineLOCAl #include #defineINF1000000000 intmain() { #ifdefLOCAL freopen("data.in","r",stdin); freopen
hurmishine·2016-02-27 12:00

UVA 10391(p135)----Compound Words

#include #include #include #include #definedebu usingnamespacestd; sets; intmain() { #ifdefdebug freopen
wang2147483647·2016-02-26 14:00

UVA 10410(p180)----Tree Reconstruction

usingnamespacestd; constintmaxn=1010; intn,root,v; intd[maxn]; stacks; vectorg[maxn]; intmain() { #ifdefdebug freopen
wang2147483647·2016-02-26 14:00

UVA 1641(p337)----ASCII Area

#include #definehelloworl usingnamespacestd; charst[150][150]; intn,m; intmain() { #ifdefhelloworld freopen
wang2147483647·2016-02-26 13:00

UVA 815(p99)----Flooded!

*m #definedebu usingnamespacestd; constintmaxn=1000; intn,m; doublea[maxn]; intmain() { #ifdefdebug freopen
wang2147483647·2016-02-25 23:00

UVA 455(p57)----Periodic Strings

#include #include #include usingnamespacestd; charst[200]; intt,flag,f; intmain() { /*freopen("in.in"
wang2147483647·2016-02-25 22:00

HDOJ-1087 Super Jumping! Jumping! Jumping!

include #include #include #include #include usingnamespacestd; intdp[1005],num[1005]; intmain() { //freopen
qq_26122039·2016-02-22 19:00

HDOJ-1978 How many ways

选择一个终点代表了一种路径选择#include #include #include #include #include usingnamespacestd; intdp[105][105]; intmain() { //freopen
qq_26122039·2016-02-22 15:00

HDOJ-1114 Piggy-Bank

include #include #include usingnamespacestd; #defineINF1e9 intc[505],v[505],dp[10005]; intmain() { //freopen
qq_26122039·2016-02-22 12:00

HDOJ-1712 ACboy needs your help

include #include #include #include #include usingnamespacestd; intA[105][105],dp[105]; intmain() { //freopen
qq_26122039·2016-02-22 12:00

LA 3510

-","sym","sym-","bhsym","bhsym-","bvsym","bvsym-","div","div-","mix","mix-"}; intmain() { intT=100; freopen
Tczxw·2016-02-21 15:00

九度[1150]Counterfeit Dollar

structnode{ stringa; stringb; }s[3]; intmain() { stringa[3]; intn=0; boolheavy; charc; //freopen
dreamer123·2016-02-20 22:00

查找

每组输入n，然后输入n个整数，再输入m，然后再输入m个整数（1 #include usingnamespacestd; constintmaxn=100; intmain(){ freopen
笨蛋杜杜鸟·2016-02-19 16:00

打印极值点下标

输入:每个案例的输入如下：有2×n+1行输入：第一行是要处理的数组的个数n；对其余2×n行，第一行是此数组的元素个数k(4 #include intmain(){ //freopen("input.txt
笨蛋杜杜鸟·2016-02-19 14:00

HDU 1231 最大连续子序列 --- 入门DP

/*HDU1231最大连续子序列---入门DP*/ #include #include intdp[10005]; intmain() { #ifdef_LOCAL freopen
TommyChok·2016-02-19 01:00

HDU 1231 最大连续子序列 --- 入门DP

/*HDU1231最大连续子序列---入门DP*/ #include #include intdp[10005]; intmain() { #ifdef_LOCAL freopen
TommyChok·2016-02-19 01:00

HDOJ-1171 Big Event in HDU

#include #include usingnamespacestd; structGoods{ intv,m; }goods[55]; intdp[130000]; intmain() { //freopen
qq_26122039·2016-02-18 14:00

SAP解决USACO4.2.1网络流问题

include #include usingnamespacestd; inta[201][201],pre[201],level[201],gap[201]; intmain(){ inti,j,k,m,n; freopen
huangkuizuiniu·2016-02-17 17:00

hdu2571 命运（简单DP）

（后面的状态由前面的得到）#include#include#includeusingnamespacestd;constintN=1005;intmain(){//freopen("in
Flynn_curry·2016-02-17 17:47

C语言数据结构之栈：括号匹配

括号匹配这是个很简单的题目，如果只有小括号，就模拟进栈和出栈的过程就行了：注：输入时'@'作为结束标志#include intmain() { freopen("stack.in","r",stdin
软剑攻城狮·2016-02-17 17:00

奇怪的电梯解题报告

问需要这样多少次能到达需要到的终点n#include#defineMAXN100000+20usingnamespacestd;intnum[MAXN];intarr[MAXN];intmain(){freopen
社会主义市场经济·2016-02-17 17:00

【信息学奥赛一本通】第三部分_队列 ex2_3produce 产生数

definemaxn1000 4 5charnum[33]; 6intlen,q[maxn],Visited[11]; 7longlongans=1; 8 9intmain(){ 10//freopen
AeolusW·2016-02-17 17:00

hdu1231 最大连续子序列（DP之最大子序列和）

#include#include#includeusingnamespacestd;constintN=10005;intmain(){//freopen("in.txt","r",stdin);intK
Flynn_curry·2016-02-15 13:49

usaco Your Ride Is Here

#include #include chara[10],b[10]; intmain(){ inti,j,k,n=1,m=1,l1,l2; freopen("ride.in","r",stdin); freopen
yalishiyanzhouyu888·2016-02-13 19:00

usaco numtri

inta[1010][1010],n,d[1010][1010]; intmax(intx,inty){ if(x>y)returnx; returny; } intmain(){ inti,j,k,m; freopen
yalishiyanzhouyu888·2016-02-13 19:00

usaco milk

#include #include intp[5010],a[5010],sum=0; intmain(){ intn,m; freopen("milk.in","r",stdin); freopen(
yalishiyanzhouyu888·2016-02-13 19:00

usaco Friday the Thirteenth

#include #include intm[12]={31,28,31,30,31,30,31,31,30,31,30,31}; intd[7]; main(){ freopen("friday.in
yalishiyanzhouyu888·2016-02-13 19:00

usaco ariprog

flag; intn,max,i1; boolpd(intx,inty){ for(i1=0;i1max)returnfalse; returntrue; } intmain(){ inti,j,k,m; freopen
yalishiyanzhouyu888·2016-02-13 19:00

hdu1248 寒冰王座（完全背包）

暴力法：#include #include #include usingnamespacestd; constintN=1005; intmain() { //freopen("in.txt","
Flynn_curry·2016-02-13 00:00

HDOJ 5621 KK's Point

再从第三个点出发，以此循环#include #include #include #include usingnamespacestd; #definemaxn100000 intmain() { //freopen
qq_26122039·2016-02-11 08:00

文件流的处理 C C++

C:借鉴C文件操作库函数总结eg：#include #include #include usingnamespacestd; intmain(){ freopen("D:\\input.in
jiu~·2016-02-11 00:00

hdu1695(莫比乌斯)或欧拉函数+容斥

include #include #include #include #include #include #include #include #include #include #include //freopen
phlsheji·2016-02-04 21:00
上一页 20 21 22 23 24 25 26 27 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他