-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFactorial4T.java
More file actions
263 lines (253 loc) · 6.72 KB
/
Factorial4T.java
File metadata and controls
263 lines (253 loc) · 6.72 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
//package OOPEuler;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Collections;
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.File;
import java.math.BigInteger;
public class Factorial4T{
FactorialT t1;
FactorialT t2;
FactorialT t3;
FactorialT t4;
FactorialT t5;
FactorialT t6;
FactorialT t7;
FactorialT t8;
String archivo="archivo.txt";
int finale;
public Factorial4T(int finale){
this.finale=finale;
int abs=finale;
int inicio=1;
boolean mod0=(abs%8==0)?true:false;
int part=abs/8;
int ph=part;
int add=0;
if(!mod0){
add=abs-(part*8);
part+=add;
}
t1=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
inicio+=ph+add;
part+=ph;
t2=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
inicio+=ph;
part+=ph;
t3=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
inicio+=ph;
part+=ph;
t4=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
inicio+=ph;
part+=ph;
t5=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
inicio+=ph;
part+=ph;
t6=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
inicio+=ph;
part+=ph;
t7=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
inicio+=ph;
part+=ph;
t8=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
//System.out.println(part+" "+ph+" "+inicio);
//if(part==finale){
//System.out.println("Exito empresarial");
//}else{
//System.out.println("Error en este pedo");
//}
}
public Factorial4T(int inicio,int finale){
int abs=finale-inicio+1;
boolean mod0=(abs%8==0)?true:false;
int part=abs/8;
int ph=part;
int add=0;
if(!mod0){
add=abs-(part*8);
part+=add;
}
t1=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
inicio+=ph+add;
part+=ph;
t2=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
inicio+=ph;
part+=ph;
t3=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
inicio+=ph;
part+=ph;
t4=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
inicio+=ph;
part+=ph;
t5=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
inicio+=ph;
part+=ph;
t6=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
inicio+=ph;
part+=ph;
t7=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
inicio+=ph;
part+=ph;
t8=new FactorialT(inicio,part);
System.out.println(part+" "+ph+" "+inicio);
if(part==finale){
System.out.println("Exito empresarial");
}else{
System.out.println("Error en este pedo");
}
}
public BigInteger startOp() throws InterruptedException{
long it=System.currentTimeMillis();
t1.start();
t2.start();
t3.start();
t4.start();
t5.start();
t6.start();
t7.start();
t8.start();
t8.join();
t7.join();
t6.join();
t5.join();
t4.join();
t3.join();
t2.join();
t1.join();
System.out.println("En un tiempo de: "+(System.currentTimeMillis()-it)/1000);
it= System.currentTimeMillis();
//res = t1.resP.multiply(t2.resP.multiply(t3.resP.multiply(t4.resP)));
BigInteger res = t1.resP.multiply(t2.resP.multiply(t3.resP.multiply(t4.resP.multiply(t5.resP))));
res= res.multiply(t6.resP.multiply(t7.resP.multiply(t8.resP)));
/*
try{
BufferedWriter archivoW= new BufferedWriter(new FileWriter(archivo));
archivoW.write(res.toString());
archivoW.newLine();
archivoW.close();
}catch(IOException ioe){
System.out.println( "Fallo al escribir");
}
*/
return res;
}
public static BigInteger solve(int finale){
if(finale==0){
return BigInteger.ONE;
}else if(finale<101){
BigInteger resTmp=BigInteger.ONE;
BigInteger curr=BigInteger.ONE;
//finale++;
for(int i=0;i<finale;i++){
resTmp=curr.multiply(resTmp);
curr=curr.add(BigInteger.ONE);
}
return resTmp;
}
Factorial4T solver=new Factorial4T(finale);
try{
return solver.startOp();
}catch(InterruptedException ie){
}
return BigInteger.ONE;
}
public static void main(String args[]){
/*Factorial4T try1=new Factorial4T(1,1000000);
//Factorial4T try1=new Factorial4T(1,9);
try{
try1.startOp();
}catch(InterruptedException ie){
System.out.println("Error");
}*/
System.out.println(Factorial4T.solve(1000000));
}
}
class FactorialT extends Thread{
private int inicio;
private long finale;
private BigInteger curr;
BigInteger resP=BigInteger.ONE;
static BigInteger res=BigInteger.ONE;
public FactorialT (int inicio,int finale){
//System.out.print( finale+",");
int tmp= finale/10000;
finale++;
this.inicio=inicio;
this.finale=finale;
curr=new BigInteger(Integer.toString(inicio));
}
public void run(){
BigInteger tenT= new BigInteger("10000");
for(;inicio<finale;inicio++){
//System.out.println(curr.toString());
resP=curr.multiply(resP);
curr=curr.add(BigInteger.ONE);
}
//System.out.println("Multiplicado en "+this.getId());
}
public static BigInteger getRes(){
return res;
}
/*public static void main(String[] args) throws InterruptedException{
String archivo="archivo.txt";
try{
Scanner reader=new Scanner(new File(archivo));
}catch(FileNotFoundException fnfe){
}
System.out.println("Este programa calcula el factorial de 1,000,000 con programacion dinamica");
LinkedList<BigInteger> pd=new LinkedList<BigInteger>();
long it= System.currentTimeMillis();
BigInteger res;
//System.out.println( new BigInteger("1000000").bitLength());
FactorialT t1= new FactorialT(1,250000);
FactorialT t2= new FactorialT(250001,500000);
FactorialT t3= new FactorialT(500001,750000);
FactorialT t4= new FactorialT(750001,1000000);
t1.start();
t2.start();
t3.start();
t4.start();
t5.start();
t6.start();
t7.start();
t8.start();
t8.join();
t7.join();
t6.join();
t5.join();
t4.join();
t3.join();
t2.join();
t1.join();
Collections.sort(pd);
System.out.println("En un tiempo de: "+(System.currentTimeMillis()-it)/1000);
it= System.currentTimeMillis();
res = t1.resP.multiply(t2.resP.multiply(t3.resP.multiply(t4.resP.multiply(t5.resP))));
res= res.multiply(t6.resP.multiply(t7.resP.multiply(t8.resP)));
try{
BufferedWriter archivoW= new BufferedWriter(new FileWriter(archivo));
archivoW.write(res.toString());
archivoW.newLine();
archivoW.close();
}catch(IOException ioe){
System.out.println( "Fallo al escribir");
}*/
}