- 博客(83)
- 收藏
- 关注
原创 test
import threadingimport timeimport telnetlibdef worker(host): tn = telnetlib.Telnet(host) tn.write(b'\r\n') tn.read_until(b":") tn.write('admin'.encode('utf-8')+b'\r\n') tn.
2013-11-21 09:02:56 588 1
原创 九度oj1043
//0001.1.1 星期一#include #include #include #include int leapyear(int year){ if((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0)) return 1; else return 0;}int main(
2012-04-13 16:44:29 444
原创 九度oj1375
http://ac.jobdu.com/problem.php?id=1375 #include #include #include #include int main(){ int n,cn; int num; int i; int a[100002]; while(scanf("%d",&n) != EOF) { for(
2012-02-19 23:24:53 411
原创 九度oj1093
#include #include #include #include int main(){ int i; char *p; char str[100] = "1234567890-=QWERTYUIOP[]\\ASDFGHJKL;\'ZXCVBNM,./"; char str1[100] = "1234567890_+QWERTYUIOP{}|AS
2012-02-19 22:10:15 368
原创 九度oj1004
#include #include #include #include int main(){ int s1[100000]; int s2[100000]; int result; int n1,n2; int i,j,med,cn; int find; while(scanf("%d",&n1) != EOF) {
2012-02-19 21:28:10 455
原创 九度oj1033
http://ac.jobdu.com/problem.php?id=1033 #include #include #include #include int main(){ int a[500]; int hash[1000001]; int r[500]; int t; int i,j,n,k; while(scanf(
2012-02-19 19:31:28 264
原创 九度oj1399
#include #include #include #include #include using namespace std;struct treasure{ int w; int v; double price;}a[100000];bool cmp(struct treasure t1,struct treasure t2)
2012-02-19 16:21:48 267
原创 九度oj1109
http://ac.jobdu.com/problem.php?id=1109#include #include #include #include int a[1001][1001];int visited[1001];void dfs(int start,int n){ int j; visited[start] = 1; for(j
2012-02-16 16:54:28 369
原创 九度oj1022
http://ac.jobdu.com/problem.php?id=1022#include #include #include #include int main(int argc, char* argv[]){ int id; int i; char op[2]; char t[9]; int tstart,tend; int co
2012-02-01 23:07:05 296
原创 九度oj1121
#include #include #include #include int main(int argc, char* argv[]){ char str[100]; char *p; int start; while(gets(str)) { p = str; start = 1; while(*p != '\0') {
2012-02-01 10:45:58 215
原创 九度oj1200
http://ac.jobdu.com/problem.php?id=1200 #include #include #include #include int main(){ int a[4][5]; int result[2][5]; int max1,max2,max1i,max2i; int i,j; int c,n; w
2012-01-31 23:51:46 232
原创 九度oj1151
http://ac.jobdu.com/problem.php?id=1151 #include #include #include #include int main(){ unsigned short a,b; unsigned short a1,a2; int i,j,n,flag; scanf("%d",&n)
2012-01-31 20:10:55 356
原创 九度oj1167
http://ac.jobdu.com/problem.php?id=1167#include #include #include #include struct s{ int num; int dup;}a[10001];int b[10002];int cmp(const void *s1,const void *s2){ int
2012-01-31 17:11:49 357
原创 九度oj1346
#include #include #include #include struct customer{ int id; int sum;}a[1002];int cmp(const void *a,const void *b){ struct customer *s1; struct customer *s2; s1 = (st
2012-01-31 10:12:04 254
原创 九度oj1020
#include #include #include #include int main() { int x,y; int minx,miny,maxx,maxy; while(scanf("%d %d",&x,&y) != EOF) { if( x== 0 && y == 0) break; else { maxx =
2012-01-30 20:59:05 317
原创 九度oj1203
#include #include #include #include int main(int argc, char* argv[]){ char ipadr[20]; int a[20]; int i,j,k,len; int n,c,sum; int flag; while(scanf("%d",&n) != EOF) { fo
2012-01-30 16:13:23 232
原创 九度oj1072
#include #include #include #include int main(int argc, char* argv[]){ int a[200]; int i,j,k; int sum,count; for(i=0;i a[i] = 0; for(i=0;i for(j=0;j for(k=0;k {
2012-01-29 13:42:31 201
原创 九度oj1195
#include #include #include #include int main(int argc, char* argv[]){ struct z { char str[1001]; int len; } s[1000]; char input1[1001]; int k,i; int min,max; k =
2012-01-28 22:58:45 227
原创 九度oj1188
#include #include #include #include int main(int argc, char* argv[]){ struct person { int id; int exit; } a[3001]; int n,p; int i,cn,k; while(scanf("%d %d",&n,&p) !
2012-01-28 21:50:08 269
原创 九度oj1197
#include #include #include #include void process(int num){ int s[8]; int i,k,cn; k = 0; if(num == 0) printf("10000000\n"); else { cn = 0; while(num > 0) { s[k++]
2012-01-28 21:15:57 283
原创 九度oj1051
#include #include #include #include int main(int argc, char* argv[]){ int b[200]; int i,k,j,mul; int remind; int a,n; while(scanf("%d %d",&a,&n) != EOF) { remind = 0; k
2012-01-27 22:45:39 197
原创 九度oj1127
#include #include #include char str[1001];char str1[100];char str2[100]; void process(char *p){ while(*p != '\0') { if(*p == 'a') *p = 'v'; else if(*p == 'A') *p =
2012-01-27 21:49:21 210
原创 九度oj1074
#include #include #include #include int snum(int num){ int total = 0 ; int orinum = num; if( num == 0) return 1; else { while(num > 0) { total = total * 10 + num % 10;
2012-01-27 19:10:35 220
原创 九度oj1186
#include #include #include #include int leap(int year){ if(year % 400 == 0 || (year % 4 == 0 && year % 100 != 0)) return 1; else return 0;}int main(int argc, char* argv[]){
2012-01-25 14:39:02 227
原创 九度o j1026
#include #include #include #include int main(int argc, char* argv[]){ int m; unsigned int a,b; unsigned int sum; int s[100]; int i,k; scanf("%d",&m); while(m!= 0) { sc
2012-01-25 11:56:54 236
原创 九度oj1182
#include #include #include #include int main(int argc, char* argv[]){ char str[1001]; int a[101]; int i,k; char *p; int count; while(gets(str)) { p = str; count = 0
2012-01-25 11:06:02 267
原创 九度oj1207
#include #include #include #include int prime(int num){ int i; if(num == 2) return 1; else if(num == 1) return 0; else { for(i=2;i if(num % i == 0) return 0; }
2012-01-24 21:21:50 205
原创 九度oj1181
#include #include #include #include int main(int argc, char* argv[]){ int i,n; int num; typedef struct node { int num; struct node *next; } NODE; NODE *root,*p,*pre,*r;
2012-01-24 13:51:04 292
原创 poj.grids4022
<br />#include <stdio.h><br />#include <string.h><br />#include <stdlib.h><br />int main(int argc, char* argv[])<br />{ <br /> float n,k;<br /> double house,money;<br /> int year,flag;<br /> while(scanf("%f %f",&n,&k) != EOF)<br /> {<br /> house = 200.0;<
2011-03-26 22:18:00 212
原创 poj3750
#include #include #include int main(int argc, char* argv[]){ struct child { int no; char name[16]; int visit; } c[65]; int n,w,s; int i,k; int count = 0; char name[16]; scanf("%d",&n); for(i=1;i { scanf("%s",name); c[i].no = i; strcpy(c[i].name, nam
2011-03-26 01:25:00 260
原创 poj3979
<br />#include <stdio.h><br />#include <string.h><br />#include <stdlib.h><br />#include <math.h><br />int gcd(int n1,int n2)<br />{<br /> int temp;<br /> if(n1 < n2)<br /> {<br /> temp = n1;<br /> n1 = n2;<br /> n2 = temp;<br /> }<br /> while(n2 != 0)<
2011-03-26 00:23:00 400
原创 hdoj2524
<br />#include <stdio.h><br />#include <string.h><br />#include <stdlib.h><br /><br />int main(int argc, char* argv[])<br />{ <br /> int t,n,m;<br /> int i,j,k;<br /> int sum1,sum2;<br /> scanf("%d",&t);<br /> for(i=1;i<=t;i++)<br /> {<br /> scanf("%d %d"
2011-03-24 13:54:00 294
原创 hdoj3787
<br />#include <stdio.h><br />#include <string.h><br />#include <stdlib.h><br />#include <math.h><br />int main(int argc, char* argv[])<br />{<br /> __int64 opa,opb;<br /> char input1[25],input2[25]; <br /> char a[13],b[13];<br /> int i,j;<br /> int flag1,
2011-03-24 11:22:00 275
原创 hdoj2502
<br />#include <stdio.h><br />#include <string.h><br />#include <stdlib.h><br />int main(int argc, char* argv[])<br />{ <br /> int i,j,k;<br /> int cnt,num;<br /> int a[21];<br /> int res;<br /> a[1] = 1;<br /> for(i=2;i<=20;i++)<br /> a[i] = 0;<br /> for
2011-03-22 22:04:00 343
原创 hdoj3791
<br />#include <stdio.h><br />#include <string.h><br />#include <stdlib.h><br />typedef struct tree<br />{<br /> char no;<br /> struct tree *left,*right;<br />}<br />NODE;<br /> <br />NODE *create(NODE *root,char *sn)<br />{<br /> NODE *p,*pre,*insert;<br
2011-03-22 19:52:00 332
原创 hdoj1862
<br />#include "stdafx.h"<br />#include <stdio.h><br />#include <string.h><br />#include <stdlib.h><br /> <br />struct student<br />{<br /> char no[7];<br /> char name[9];<br /> int score;<br />}<br />s[100001];<br />int cmp1(const void *a,const void *b)<b
2011-03-04 12:05:00 267
原创 hdoj1860
<br />#include <stdio.h><br />#include <string.h><br /> <br />int main(int argc, char* argv[])<br />{ <br /> char small[6];<br /> char big[81];<br /> char *pbhead,*pb,*ps;<br /> int c;<br /> gets(small);<br /> while(strcmp(small,"#") != 0)<br /> {<br /> g
2011-03-04 10:20:00 217
原创 hdoj1859
<br />#include <stdio.h><br /> <br />int main(int argc, char* argv[])<br />{ <br /> int x,y;<br /> int minx,miny,maxx,maxy;<br /> while(1)<br /> {<br /> scanf("%d %d",&x,&y);<br /> if(x == 0 && y == 0)<br /> break;<br /> maxx = maxy = -230;<br /> min
2011-03-04 09:17:00 239
原创 hdoj3785
<br />#include <stdio.h><br />int main(int argc, char* argv[])<br />{<br /> int a[100001];<br /> int b[11];<br /> int n,m;<br /> int i,j,k;<br /> int max,save;<br /> <br /> scanf("%d %d",&n,&m);<br /> while( ! ( n == 0 && m == 0))<br /> {<br /> for(i=0;i<
2011-02-28 21:54:00 227
原创 hdoj3783
<br />#include <stdio.h><br />#include <string.h><br /><br />int main(int argc, char* argv[])<br />{<br /> char str[101];<br /> int z,o,j;<br /> char *p;<br /> scanf("%s",str);<br /> while(strcmp(str,"E") != 0)<br /> {<br /> p = str;<br /> z = o = j = 0;
2011-02-28 21:20:00 215
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人