update

TNFSH-Programming-Contest · Sep 22, 2024 · 411d986 · 411d986
1 parent 3d0d15f
commit 411d986
Show file tree

Hide file tree

Showing 3 changed files with 6 additions and 3 deletions.
diff --git a/pD/gen/gen.cpp b/pD/gen/gen.cpp
@@ -2,7 +2,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 inline long long int randomint(){
-	return pow(10.,rnd.next(1.,17.));
+	return pow(10.,rnd.next(1.,18.));
 }
 int main(int argc, char* argv[]){
 	registerGen(argc, argv, 1);
@@ -12,11 +12,12 @@ int main(int argc, char* argv[]){
 	else if(subtask==2)c=(idx%2?rnd.next(1,100):rnd.next(100000,1000000));
 	else if(subtask==3||subtask==4)c=1e18;
 	else c=(idx%4==1?rnd.next(1,100):idx%4==2?rnd.next(100000,1000000):idx%4==3?rnd.next(1000000000LL,10000000000LL):rnd.next((long long int)1e12,(long long int)1e13));
+	cout<<n<<' '<<c<<'\n';
 	for(int i=0;i<n;i++){
 		if(subtask==3)cout<<1<<" \n"[i==n-1];
 		else cout<<(idx%3==1?rnd.next(100,1000):idx%3==2?rnd.next(100000,1000000):rnd.next(100000000,1000000000))<<" \n"[i==n-1];
 	}
 	for(int i=0;i<n;i++){
-		cout<<(idx%5==1?rnd.next(100,1000):idx%5==2?rnd.next(10000000,100000000):idx%5==3?rnd.next(100000000000,1000000000000):idx%5==4?(long long int)1e17:randomint())<<" \n"[i==n-1];
+		cout<<(idx%5==1?rnd.next(100,1000):idx%5==2?rnd.next(10000000,100000000):idx%5==3?rnd.next(1000000000000,10000000000000):idx%5==4?(long long int)1e18:randomint())<<" \n"[i==n-1];
 	}
 }
diff --git a/pD/gen/test.in b/pD/gen/test.in
diff --git a/pD/statement/index.md b/pD/statement/index.md
@@ -30,7 +30,7 @@ Angus 在菜寮種的菜可以平均劃分為 $n$ 個區域種植不同的蔬菜
  - $1\le n\le 10^6$
  - $0\le c\le 10^{18}$
  - $1\le a_i\le 10^9$
- - $1\le v_i\le 10^{17}$
+ - $1\le v_i\le 10^{18}$
 
 ## 子任務
 \subtasks