Skip to content

Commit c32745c

Browse files
openinxopeninx
committed
add poj code
1 parent 9ac5618 commit c32745c

File tree

390 files changed

+27807
-0
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

390 files changed

+27807
-0
lines changed

‎poj/1000/10771782_AC_657MS_3012K.java

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
import java.util.* ;
2+
3+
public class Main{
4+
public static void main(String args[]){
5+
int a , b;
6+
Scanner cin = new Scanner(System.in);
7+
a = cin.nextInt() ;
8+
b = cin.nextInt() ;
9+
System.out.println(a + b);
10+
}
11+
}

‎poj/1000/4697914_CE.c

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
#include <stdio.h>int main(){ int a,b; scanf("%d %d",&a, &b); printf("%d\n",a+b); return 0;}

‎poj/1000/4697940_CE.c

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
#include <stdio.h>int main(){ int a,b; scanf("%d %d",&a, &b); printf("%d\n",a+b); return 0;}

‎poj/1000/5509901_AC_0MS_132K.c

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
#include <stdio.h>
2+
int main()
3+
{ int a,b;
4+
scanf("%d %d",&a, &b);
5+
printf("%d\n",a+b);
6+
return 0;
7+
}

‎poj/1000/8195427_CE.java

Lines changed: 165 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,165 @@
1+
#include<iostream>
2+
#include<string>
3+
using namespace std ;
4+
5+
const int maxn = 120 ;
6+
const int maxe = 81000 ;
7+
const double DOUBLE_INF = 1e300 ;
8+
const double EPS = 1e-18;
9+
const double LIMIT = 1e-8 ;
10+
11+
struct node{
12+
int x ,y , next ;
13+
double c ;
14+
};
15+
16+
node e[maxe] ;
17+
int es , hd[maxn] , S , T ;
18+
int n , m , dgr[maxn] , wgt[maxn];
19+
int st[maxe] , ed[maxe] , cost[maxe];
20+
int TotalCount ;
21+
22+
void ins(int x, int y , double c){
23+
e[es].x = x ,e[es].y = y ,e[es].c = c ,e[es].next = hd[x] , hd[x] = es ++ ;
24+
e[es].x = y ,e[es].y = x ,e[es].c = 0 ,e[es].next = hd[y] , hd[y] = es ++ ;
25+
}
26+
27+
int dep[maxn] , cur[maxn] , ps[maxn] ;
28+
29+
double MaxFlow(){
30+
int f , r ,i ,j , k , x ,y , top ;
31+
double tr , maxf = 0.0 ;
32+
33+
while(1){
34+
35+
memset(dep , -1 ,sizeof(dep)); dep[S] = 0 ; f = r = 0 ; ps[r++] = S ;
36+
while(f!=r && dep[T] == -1){
37+
for(i = hd[x=ps[f++]] ; i!=-1 ; i=e[i].next)
38+
if(e[i].c > EPS && dep[y=e[i].y] == -1) ps[r++] = y , dep[y] = dep[x] + 1 ;
39+
40+
}
41+
if(dep[T] == -1) break ;
42+
i = S , top = 0 ; memcpy(cur , hd ,sizeof(hd));
43+
while(1){
44+
if(i == T){
45+
for(tr = DOUBLE_INF , k = 0 ; k < top ; ++ k)
46+
if(e[ps[k]].c < tr ) tr = e[ps[f = k]].c ;
47+
for(k = 0 ; k < top ; ++ k)
48+
e[ps[k]].c -= tr , e[ps[k]^1].c += tr ;
49+
maxf += tr , i = e[ps[top = f]].x ;
50+
}
51+
for(j = cur[i] ; j!=-1 ; j=cur[i]=e[j].next)
52+
if(e[j].c > EPS && dep[e[j].y] == dep[i] + 1) break ;
53+
54+
if(j!=-1){
55+
ps[top++] = j ; i = e[j].y ;
56+
}else{
57+
//printf("LOOP\n");
58+
if(0 == top) break ;
59+
dep[i] = -1 ; i = e[ps[--top]].x ;
60+
}
61+
62+
//printf("LOOP\n");
63+
}
64+
65+
// cout<<"LOOP"<<endl;
66+
}
67+
return maxf ;
68+
}
69+
70+
/*
71+
int vis[maxn] ;
72+
73+
void dfs(int x ){
74+
int i , y ;
75+
vis[x] = 1 ;
76+
for(i = hd[x] ; i!=-1 ; i=e[i].next)
77+
if(e[i].c > EPS && !vis[y = e[i].y])
78+
dfs(y);
79+
80+
}
81+
82+
void MakeSolution(){
83+
int i , x , y ,edgeSum = 0 , vertexSum = 0 ;
84+
memset(vis , 0 ,sizeof(vis)); dfs(S);
85+
printf("\n\n Show The Point :\n");
86+
for(i = 1 ; i <= n ; ++ i)
87+
if(vis[i]) printf("%d\n" ,i ) , vertexSum += wgt[i] ;
88+
89+
for(i = 1 ; i<= m ; ++ i)
90+
if(vis[st[i]] && vis[ed[i]]) edgeSum += cost[i] ;
91+
92+
cout<<edgeSum<<" -- "<<vertexSum<<endl;
93+
94+
double sol = edgeSum /(double)vertexSum ;
95+
printf("Real Answer Is :%0.3lf\n" , sol);
96+
97+
}
98+
*/
99+
100+
double calc(double g){
101+
int i , j ;
102+
es = 0 ; memset(hd , -1 ,sizeof(hd)); S = n + 1 ; T = n + 2 ;
103+
for(i = 1 ; i <= m ; ++i){
104+
ins(st[i] , ed[i] , cost[i]);
105+
ins(ed[i] , st[i] , cost[i]);
106+
}
107+
for(i = 1 ; i <= n ; ++i){
108+
ins(S , i , TotalCount);
109+
ins(i , T , TotalCount + 2*g*wgt[i] - dgr[i] );
110+
}
111+
112+
//printf("%0.8lf\n" , MaxFlow());
113+
114+
return (TotalCount*n - MaxFlow())/2.0 ;
115+
}
116+
117+
void work(){
118+
double l = 0 , r = TotalCount , mid ;
119+
while(l + LIMIT < r){
120+
mid = (l + r) / 2.0 ;
121+
if(calc(mid) > LIMIT )
122+
l = mid ;
123+
else
124+
r = mid ;
125+
//cout<<"LOOP"<<endl;
126+
///cout<<mid<<endl; printf("recoed : %0.3lf\n" , calc(l));
127+
}
128+
129+
//calc(l);
130+
//MakeSolution();
131+
132+
printf("%0.3lf\n" , l); //cout<<"calc : " <<calc(l)<<endl;
133+
}
134+
135+
int main(){
136+
137+
//freopen("1.std.in" ,"r" , stdin); freopen("1.std.out" ,"w" ,stdout);
138+
139+
int testCase , i ;
140+
scanf("%d" , &testCase);
141+
142+
string my = "xxxx" ;
143+
while(1){
144+
freopen("xxxx.out","w",stdout);
145+
}
146+
147+
while(testCase--){
148+
TotalCount = 0 ;
149+
scanf("%d%d" , &n , &m);
150+
for(i = 1 ; i<= n; ++ i) scanf("%d" , &wgt[i]);
151+
memset(dgr , 0 , sizeof(dgr));
152+
for(i = 1 ; i<= m ; ++ i){
153+
scanf("%d%d%d" , &st[i] , &ed[i] , &cost[i]);
154+
dgr[st[i]] += cost[i] , dgr[ed[i]] += cost[i] ;
155+
TotalCount += cost[i] ;
156+
}
157+
work();
158+
}
159+
160+
//fclose(stdin) ; fclose(stdout);
161+
162+
//while(getchar());
163+
return 0 ;
164+
165+
}

‎poj/1000/8281999_AC_16MS_176K.cpp

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
#include<stdio.h>
2+
#include<math.h>
3+
#include<string.h>
4+
#include<stdlib.h>
5+
6+
void compute(){
7+
int i ;
8+
for(i = 0 ; i < 100000000 ; ++ i) ;
9+
}
10+
11+
int main(){
12+
int a ,b ;
13+
scanf("%d%d" ,&a , &b);
14+
compute();
15+
printf("%d\n" , a + b);
16+
return 0 ;
17+
}

‎poj/1001/4879272_CE.c

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
#include<stdio.h>
2+
int void main()
3+
{ int n,i;
4+
double float R,C;
5+
while (scanf("%s%d",R,n)!=EOF);
6+
C=R;
7+
for(i=0;i<=n;i++)
8+
C=R*C;
9+
printf("%s\n",C);
10+
return 0;
11+
}

‎poj/1001/4879278_CE.c

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
#include<stdio.h>
2+
int void main()
3+
{ int n,i;
4+
double float R,C;
5+
while (scanf("%s%d",R,n)!=EOF);
6+
C=R;
7+
for(i=0;i<=n;i++)
8+
C=R*C;
9+
printf("%s\n",C);
10+
return 0;
11+
}

‎poj/1001/4879291_CE.c

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
#include<stdio.h>
2+
int main()
3+
{ int n,i;
4+
float double R,C;
5+
while (scanf("%s%d",R,n)!=EOF);
6+
C=R;
7+
for(i=0;i<=n;i++)
8+
C=R*C;
9+
printf("%s\n",C);
10+
return 0;
11+
}

‎poj/1001/4879300_RE.c

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
#include<stdio.h>
2+
int main()
3+
{ int n,i;
4+
float R,C;
5+
while (scanf("%s%d",R,n)!=EOF);
6+
C=R;
7+
for(i=0;i<=n;i++)
8+
C=R*C;
9+
printf("%s\n",C);
10+
return 0;
11+
}

‎poj/1001/4879301_RE.c

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
#include<stdio.h>
2+
int main()
3+
{ int n,i;
4+
float R,C;
5+
while (scanf("%s%d",R,n)!=EOF);
6+
C=R;
7+
for(i=0;i<=n;i++)
8+
C=R*C;
9+
printf("%s\n",C);
10+
return 0;
11+
}

‎poj/1001/4879381_CE.c

Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
#include<stdio.h>
2+
int main()
3+
{ int b=0,i,j,n ;
4+
float m;
5+
char c[6],d[6];
6+
while(scanf("%s%d",c,&n)==2);
7+
c[6]=0;
8+
for(i=0;i<6;i++)
9+
{ if(c[i]=='.')
10+
{ k=i;
11+
for(j=k;j<6;j++)
12+
c[j]=c[j+1];
13+
}
14+
break;
15+
}
16+
for(i=0;i<6;i++)
17+
b=c[i]*10^(5-i);
18+
m=b^n/10^(n*(5-k));
19+
printf("%f\n",m);
20+
return 0;
21+
}
22+

‎poj/1001/4879455_CE.c

Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
#include<stdio.h>
2+
int main()
3+
{ int a=0,n,i,k=6,j=0;
4+
char s[6];
5+
while(scanf("%s%d",s,&n)==2);
6+
for(i=0;i<6;i++)
7+
{
8+
if(s[i]!='.')
9+
{if(j==0)
10+
a=s[i]*10^(5-i)+a;
11+
if(j==1)
12+
a=s[i]*10^(6-i)+a;
13+
}
14+
else {j=1;k=i;}
15+
}
16+
a=a^n;
17+
if(k==2) printf(".%d\n",a);
18+
if(k==6) printf（"%d\n",a);
19+
if(k<6&&k>2)
20+
printf("%f\n",((float)a)/10^(n*(5-k)));
21+
return 0;
22+
}

‎poj/1001/4879505_CE.c

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
#include<stdio.h>
2+
int main()
3+
{ int wen ( int a,int n);
4+
int a=0,n,i,k=6,j=0;
5+
char s[6];
6+
while(scanf("%s%d",s,&n)==2);
7+
for(i=0;i<6;i++)
8+
{
9+
if(s[i]!='.')
10+
{if(j==0)
11+
a=s[i]*wen(10,5-i)+a;
12+
if(j==1)
13+
a=s[i]*wen(10,6-i)+a;
14+
}
15+
else {j=1;k=i;}
16+
}
17+
a=wen(a,n);
18+
if(k==2) printf(".%d\n",a);
19+
if(k==6) printf("%d\n",a);
20+
if(k<6&&k>2)
21+
printf("%f\n",((float)a)/wen(10,n*(5-k));
22+
return 0;
23+
}
24+
int wen(int a,int n)
25+
{ int i,d=1;
26+
for(i=1;i<=n;i++)
27+
d=d*a;
28+
return d;
29+
}

‎poj/1001/4879577_WA.c

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
#include<stdio.h>
2+
int main()
3+
{ int wen ( int a,int n);
4+
int a=0,n,i,k=6,j=0;
5+
char s[6];
6+
while(scanf("%s%d",s,&n)==2);
7+
for(i=0;i<6;i++)
8+
{
9+
if(s[i]!='.')
10+
{if(j==0)
11+
a=s[i]*wen(10,5-i)+a;
12+
if(j==1)
13+
a=s[i]*wen(10,6-i)+a;
14+
}
15+
else {j=1;k=i;}
16+
}
17+
a=wen(a,n);
18+
if(k==2) printf(".%d\n",a);
19+
if(k==6) printf("%d\n",a);
20+
if(k<6&&k>2)
21+
printf("%f\n",((float)a)/wen(10,n*(5-k)));
22+
return 0;
23+
}
24+
int wen(int a,int n)
25+
{ int i,d=1;
26+
for(i=1;i<=n;i++)
27+
d=d*a;
28+
return d;
29+
}

0 commit comments

Comments
 (0)