-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain_mapWeitht.cpp
1564 lines (1239 loc) · 39.4 KB
/
main_mapWeitht.cpp
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
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include <bits/stdc++.h>
#include <sys/mman.h>
#include <fcntl.h>
#include <unistd.h>
using namespace std;
int Graph[300000][50];
int *p[300000];
int Graph2[300000][50];
int *p2[300000];
bool id_is_recorded[300000]; //标记id是否被记录过
int valid_ids[300000]; //记录所有的合法id
int* valid_ids_ptr = valid_ids;
// 所有“出度数，入度数皆大于0，且出度数组中至少包含一个既有出度又有入度的节点”的集合，用于之后的DFS遍历。
int valid_Num=0; // 记录合法id数量
// 前后路径的转账金额比例上下限
int floor_rate=0.2;
int upper_rate=3;
// 带权有向图
map<int,map<int,int> > weight;
bool inPath1[300000];
bool inPath2[300000];
bool inPath3[300000];
bool inPath4[300000];
int inDegrees[300000];
int outDegrees[300000];
int path1[7];
int path2[7];
int path3[7];
int path4[7];
int *path_pointer1 = path1;
int *path_pointer2 = path2;
int *path_pointer3 = path3;
int *path_pointer4 = path4;
int ansCount1=0;
int ansCount2=0;
int ansCount3=0;
int ansCount4=0;
// circleSize1[0] 表示线程1中长度为3的环构成的总字符数，以此类推
int circleSize1[5]={0,0,0,0,0};
int circleSize2[5]={0,0,0,0,0};
int circleSize3[5]={0,0,0,0,0};
int circleSize4[5]={0,0,0,0,0};
int charSize[300000]; // 记录数字对应的char大小
char char_Int[300000][6]; //记录id对应的char数组
int inNeighborhoods1[300000];
int lastPoint1[300000];
int withLastOne1[300000];
int withLastSecond1[300000];
int inNeighborhoods2[300000];
int lastPoint2[300000];
int withLastOne2[300000];
int withLastSecond2[300000];
int inNeighborhoods3[300000];
int lastPoint3[300000];
int withLastOne3[300000];
int withLastSecond3[300000];
int inNeighborhoods4[300000];
int lastPoint4[300000];
int withLastOne4[300000];
int withLastSecond4[300000];
//int ans3[3*500000];
int ans31[3*500000];
int ans32[3*500000];
int ans33[3*500000];
int ans34[3*500000];
//int ans4[4*500000];
int ans41[4*500000];
int ans42[4*500000];
int ans43[4*500000];
int ans44[4*500000];
//int ans5[5*1000000];
int ans51[5*1000000];
int ans52[5*1000000];
int ans53[5*1000000];
int ans54[5*1000000];
//int ans6[6*2000000];
int ans61[6*2000000];
int ans62[6*2000000];
int ans63[6*2000000];
int ans64[6*2000000];
//int ans7[7*3000000];
int ans71[7*3000000];
int ans72[7*3000000];
int ans73[7*3000000];
int ans74[7*3000000];
int *ans1[]={ans31,ans41,ans51,ans61,ans71};
int *ans2[]={ans32,ans42,ans52,ans62,ans72};
int *ans3[]={ans33,ans43,ans53,ans63,ans73};
int *ans4[]={ans34,ans44,ans54,ans64,ans74};
int circleCount1[5]={0,0,0,0,0};
int circleCount2[5]={0,0,0,0,0};
int circleCount3[5]={0,0,0,0,0};
int circleCount4[5]={0,0,0,0,0};
// 输出指针
char* addr;
#define DEPTH_HIGH_LIMIT 7
#define DEPTH_LOW_LIMIT 3
//去除入度为0的id
void rm_indegree_eq_0(int cur_id){
for(int* sender_ptr=Graph[cur_id]; *sender_ptr; sender_ptr++){
int sender_id = *sender_ptr;
inDegrees[sender_id] = max(inDegrees[sender_id]-1, 0);
if(id_is_recorded[sender_id] && inDegrees[sender_id]==0){
id_is_recorded[sender_id] = false;
rm_indegree_eq_0(sender_id); //递归去除入度为0的点
}
}
}
//去除出度为0的id
void rm_oudegree_eq_0(int cur_id){
for(int* recver_ptr=Graph2[cur_id]; *recver_ptr; recver_ptr++){
int recver_id = *recver_ptr;
outDegrees[recver_id] = max(outDegrees[recver_id]-1, 0);
if(id_is_recorded[recver_id] && outDegrees[recver_id]==0){
id_is_recorded[recver_id] = false;
rm_oudegree_eq_0(recver_id); //递归去除入度为0的点
}
}
}
void change(int N){
int size = 0;
int n = N;
while(n){
char_Int[N][size++] = n%10 + '0';
n /= 10;
}
charSize[N] = size;
}
int char_num_of_int(int n){
int char_num = 0;
while(n){
char_num++;
n /= 10;
}
return char_num+1;
}
//写入带回车的数字
int write_with_enter( char* addr, int n ){
int char_cache[7], idx = 0;
int char_num = 0;
while(n){
char_cache[idx++] = n%10 + '0';
n /= 10;
}
char_num = idx;
while(idx){
*addr++ = char_cache[--idx];
}
*addr++ = '\n';
return char_num+1;
}
void markNeighborhoods1(int root,int current,int length){
int *it;
it=Graph2[current];
for(;*it!=0;it++){
if(*it<root||*it==root) continue;
if(inPath1[*it]) continue;
if(length==1){
lastPoint1[*it]=root;
inNeighborhoods1[*it]=root;
/*
if(root==2547){
cout<<"root:"<<*it<<lastPoint1[*it]<<endl;
}*/
}else if(length==2){
withLastOne1[*it]=root;
inNeighborhoods1[*it]=root;
}else{
withLastSecond1[*it]=root;
inNeighborhoods1[*it]=root;
continue;
}
inPath1[*it]=true;
markNeighborhoods1(root,*it,length+1);
inPath1[*it]=false;
}
}
void markNeighborhoods2(int root,int current,int length){
int *it;
it=Graph2[current];
for(;*it!=0;it++){
if(*it<root||*it==root) continue;
if(inPath2[*it]) continue;
if(length==1){
lastPoint2[*it]=root;
inNeighborhoods2[*it]=root;
}else if(length==2){
withLastOne2[*it]=root;
inNeighborhoods2[*it]=root;
}else{
withLastSecond2[*it]=root;
inNeighborhoods2[*it]=root;
continue;
}
inPath2[*it]=true;
markNeighborhoods2(root,*it,length+1);
inPath2[*it]=false;
}
}
void markNeighborhoods3(int root,int current,int length){
int *it;
it=Graph2[current];
for(;*it!=0;it++){
if(*it<root||*it==root) continue;
if(inPath3[*it]) continue;
if(length==1){
lastPoint3[*it]=root;
inNeighborhoods3[*it]=root;
}else if(length==2){
withLastOne3[*it]=root;
inNeighborhoods3[*it]=root;
}else{
withLastSecond3[*it]=root;
inNeighborhoods3[*it]=root;
continue;
}
inPath3[*it]=true;
markNeighborhoods3(root,*it,length+1);
inPath3[*it]=false;
}
}
void markNeighborhoods4(int root,int current,int length){
int *it;
it=Graph2[current];
for(;*it!=0;it++){
if(*it<root||*it==root) continue;
if(inPath4[*it]) continue;
if(length==1){
lastPoint4[*it]=root;
inNeighborhoods4[*it]=root;
}else if(length==2){
withLastOne4[*it]=root;
inNeighborhoods4[*it]=root;
}else{
withLastSecond4[*it]=root;
inNeighborhoods4[*it]=root;
continue;
}
inPath4[*it]=true;
markNeighborhoods4(root,*it,length+1);
inPath4[*it]=false;
}
}
void dfs1(int root,int current,int depth){
inPath1[current]=true;
*path_pointer1++ = current;
if(depth<DEPTH_HIGH_LIMIT){
int *it=Graph[current];
for(;*it!=0;it++){
if(*it<=root) continue;
if(inPath1[*it]) continue;
// 判断权重比例是否符合要求
if(depth>=2&&depth<=6){
// 两段路径：path1[depth-2]->current->*it
int lastWeight=weight[path1[depth-2]][current];
int currentWeight=weight[current][*it];
double result=(double)currentWeight/lastWeight;
if(result>3||result<0.2) continue;
}
if(depth>3&&inNeighborhoods1[*it]!=root) continue;
if(depth==5&&lastPoint1[*it]!=root&&withLastOne1[*it]!=root) continue;
if(depth==6&&lastPoint1[*it]!=root) continue;
if(depth>=2&&lastPoint1[*it]==root){
// 两段路径：current->*it->root
double currentResult=(double)weight[*it][root]/weight[current][*it];
// 两段路径：*it->root->path1[1]
double result=(double)weight[root][path1[1]]/weight[*it][root];
// 如果该环合法，则记录它
if(currentResult>=0.2&¤tResult<=3&&result>=0.2&&result<=3){
int* ans_ptr = ans1[depth-2] + (depth+1)*circleCount1[depth-2]; // 使用指针操作
int* path_ptr = path1;
for(int i=0;i<depth;i++){
*ans_ptr++ = *path_ptr++;
circleSize1[depth-2]+=charSize[path1[i]]+1;
}
circleSize1[depth-2]+=charSize[*it]+1;
*ans_ptr = *it;
ansCount1++;
circleCount1[depth-2]++;
// 构成5环但无法继续构成6,7环
if(depth==4&&withLastOne1[*it]!=root&&withLastSecond1[*it]!=root) continue;
// 构成6环但无法继续构成7环
if(depth==5&&withLastOne1[*it]!=root) continue;
if(depth==6) continue;
}
}
dfs1(root,*it,depth+1);
}
}
inPath1[current]=false;
path_pointer1--;
}
void dfs2(int root,int current,int depth){
inPath2[current]=true;
*path_pointer2++=current;
if(depth<DEPTH_HIGH_LIMIT){
int* it=Graph[current];
for(int* it=Graph[current]; *it!=0; it++){
if(*it<=root) continue;
if(inPath2[*it]) continue;
// 判断权重比例是否符合要求
if(depth>=2&&depth<=6){
// 两段路径：path2[depth-2]->current->*it
int lastWeight=weight[path2[depth-2]][current];
int currentWeight=weight[current][*it];
double result=(double)currentWeight/lastWeight;
if(result>3||result<0.2) continue;
}
if(depth>3&&inNeighborhoods2[*it]!=root) continue;
if(depth==5&&lastPoint2[*it]!=root&&withLastOne2[*it]!=root) continue;
if(depth==6&&lastPoint2[*it]!=root) continue;
if(depth>=2&&lastPoint2[*it]==root){
// 两段路径：current->*it->root
double currentResult=(double)weight[*it][root]/weight[current][*it];
// 两段路径：*it->root->path1[1]
double result=(double)weight[root][path2[1]]/weight[*it][root];
// 如果该环合法，则记录它
if(currentResult>=0.2&¤tResult<=3&&result>=0.2&&result<=3){
int* ans_ptr = ans2[depth-2] + (depth+1)*circleCount2[depth-2]; // 使用指针操作
int* path_ptr = path2;
for(int i=0;i<depth;i++){
*ans_ptr++ = *path_ptr++;
circleSize2[depth-2]+=charSize[path2[i]]+1;
}
circleSize2[depth-2]+=charSize[*it]+1;
*ans_ptr = *it;
ansCount2++;
circleCount2[depth-2]++;
// 构成5环但无法继续构成6,7环
if(depth==4&&withLastOne2[*it]!=root&&withLastSecond2[*it]!=root) continue;
// 构成6环但无法继续构成7环
if(depth==5&&withLastOne2[*it]!=root) continue;
if(depth==6) continue;
}
}
dfs2(root,*it,depth+1);
}
}
inPath2[current]=false;
path_pointer2--;
}
void dfs3(int root,int current,int depth){
inPath3[current]=true;
*path_pointer3++=current;
if(depth<DEPTH_HIGH_LIMIT){
for(int* it=Graph[current]; *it!=0; it++){
if(*it<=root) continue;
if(inPath3[*it]) continue;
// 判断权重比例是否符合要求
if(depth>=2&&depth<=6){
// 两段路径：path3[depth-2]->current->*it
int lastWeight=weight[path3[depth-2]][current];
int currentWeight=weight[current][*it];
double result=(double)currentWeight/lastWeight;
if(result>3||result<0.2) continue;
}
if(depth>3&&inNeighborhoods3[*it]!=root) continue;
if(depth==5&&lastPoint3[*it]!=root&&withLastOne3[*it]!=root) continue;
if(depth==6&&lastPoint3[*it]!=root) continue;
// 有成环的可能
if(depth>=2&&lastPoint3[*it]==root){
// 两段路径：current->*it->root
double currentResult=(double)weight[*it][root]/weight[current][*it];
// 两段路径：*it->root->path1[1]
double result=(double)weight[root][path3[1]]/weight[*it][root];
// 如果该环合法，则记录它
if(currentResult>=0.2&¤tResult<=3&&result>=0.2&&result<=3){
int* ans_ptr = ans3[depth-2] + (depth+1)*circleCount3[depth-2]; // 使用指针操作
int* path_ptr = path3;
for(int i=0;i<depth;i++){
*ans_ptr++ = *path_ptr++;
circleSize3[depth-2]+=charSize[path3[i]]+1;
}
circleSize3[depth-2]+=charSize[*it]+1;
*ans_ptr = *it;
ansCount3++;
circleCount3[depth-2]++;
// 构成5环但无法继续构成6,7环
if(depth==4&&withLastOne3[*it]!=root&&withLastSecond3[*it]!=root) continue;
// 构成6环但无法继续构成7环
if(depth==5&&withLastOne3[*it]!=root) continue;
if(depth==6) continue;
}
}
dfs3(root,*it,depth+1);
}
}
inPath3[current]=false;
path_pointer3--;
}
void dfs4(int root,int current,int depth){
inPath4[current]=true;
*path_pointer4++=current;
if(depth<DEPTH_HIGH_LIMIT){
for(int* it=Graph[current]; *it!=0; it++){
if(*it<=root) continue;
if(inPath4[*it]) continue;
// 判断权重比例是否符合要求
if(depth>=2&&depth<=6){
// 两段路径：path4[depth-2]->current->*it
int lastWeight=weight[path4[depth-2]][current];
int currentWeight=weight[current][*it];
double result=(double)currentWeight/lastWeight;
if(result>3||result<0.2) continue;
}
if(depth>3&&inNeighborhoods4[*it]!=root) continue;
if(depth==5&&lastPoint4[*it]!=root&&withLastOne4[*it]!=root) continue;
if(depth==6&&lastPoint4[*it]!=root) continue;
if(depth>=2&&lastPoint4[*it]==root){
// 两段路径：current->*it->root
double currentResult=(double)weight[*it][root]/weight[current][*it];
// 两段路径：*it->root->path1[1]
double result=(double)weight[root][path4[1]]/weight[*it][root];
// 如果该环合法，则记录它
if(currentResult>=0.2&¤tResult<=3&&result>=0.2&&result<=3){
int* ans_ptr = ans4[depth-2] + (depth+1)*circleCount4[depth-2]; // 使用指针操作
int* path_ptr = path4;
for(int i=0;i<depth;i++){
*ans_ptr++ = *path_ptr++;
circleSize4[depth-2]+=charSize[path4[i]]+1;
}
circleSize4[depth-2]+=charSize[*it]+1;
*ans_ptr = *it;
ansCount4++;
circleCount4[depth-2]++;
// 构成5环但无法继续构成6,7环
if(depth==4&&withLastOne4[*it]!=root&&withLastSecond4[*it]!=root) continue;
// 构成6环但无法继续构成7环
if(depth==5&&withLastOne4[*it]!=root) continue;
if(depth==6) continue;
}
}
dfs4(root,*it,depth+1);
}
}
inPath4[current]=false;
path_pointer4--;
}
void search_1(int* begin, int* end){
while(*begin!=*end){
int current = *begin++;
markNeighborhoods1(current, current,1);
dfs1(current,current,1);
}
}
void search_2(int* begin, int* end){
while(*begin!=*end){
int current = *begin++;
markNeighborhoods2(current, current,1);
dfs2(current,current,1);
}
}
void search_3(int* begin, int* end){
while(*begin!=*end){
int current = *begin++;
markNeighborhoods3(current, current,1);
dfs3(current,current,1);
}
}
void search_4(int* begin){
int rec_num = 0;
while(*begin){
int current = *begin++;
markNeighborhoods4(current, current,1);
dfs4(current,current,1);
}
}
void write_circle34(char *addr34){
/*----------------------长度为 3 ---------------------------*/
//写环ans31
int* num_ptr = ans31;
for(int i=0; i<circleCount1[0]; i++){
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = '\n';
num_ptr++;
}
//写环ans32
num_ptr = ans32;
for(int i=0; i<circleCount2[0]; i++){
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = '\n';
num_ptr++;
}
//写环ans33
num_ptr = ans33;
for(int i=0; i<circleCount3[0]; i++){
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = '\n';
num_ptr++;
}
//写环ans34
num_ptr = ans34;
for(int i=0; i<circleCount4[0]; i++){
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = '\n';
num_ptr++;
}
/*----------------------长度为 4 ---------------------------*/
//写环ans41
num_ptr = ans41;
for(int i=0; i<circleCount1[1]; i++){
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = '\n';
num_ptr++;
}
//写环ans42
num_ptr = ans42;
for(int i=0; i<circleCount2[1]; i++){
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = '\n';
num_ptr++;
}
//写环ans43
num_ptr = ans43;
for(int i=0; i<circleCount3[1]; i++){
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = '\n';
num_ptr++;
}
//写环ans44
num_ptr = ans44;
for(int i=0; i<circleCount4[1]; i++){
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr34++ = char_Int[*num_ptr][i];
}
*addr34++ = '\n';
num_ptr++;
}
}
void write_circle5(char *addr5){
/*----------------------长度为 5 ---------------------------*/
//写环ans51
int* num_ptr = ans51;
for(int i=0; i<circleCount1[2]; i++){
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = '\n';
num_ptr++;
}
//写环ans52
num_ptr = ans52;
for(int i=0; i<circleCount2[2]; i++){
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = '\n';
num_ptr++;
}
//写环ans53
num_ptr = ans53;
for(int i=0; i<circleCount3[2]; i++){
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = '\n';
num_ptr++;
}
//写环ans54
num_ptr = ans54;
for(int i=0; i<circleCount4[2]; i++){
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}
*addr5++ = ',';
num_ptr++;
for(int i=charSize[*num_ptr]-1; i>=0; i--){
*addr5++ = char_Int[*num_ptr][i];
}