①生成整数的对拍文件,每次生成10个数字。共生成十种 且数字范围在100内
//看看会不会爆int!数组会不会少了一维! //取物问题一定要小心先手胜利的条件 #include <bits/stdc++.h> using namespace std; #pragma comment(linker,"/STACK:102400000,102400000") #define LL long long #define ALL(a) a.begin(), a.end() #define pb push_back #define mk make_pair #define fi first #define se second #define haha printf("haha ") const int maxn = 10; LL h[maxn]; int main(){ ///freopen( ".in","r",stdin ); freopen( "input","w",stdout ); srand( time( NULL ) ); int t,n = 10 ; while( n-- ){ printf("10 "); for (int i = 1; i <= 10; i++) printf("%d ",abs(rand()) % 100 ); } return 0; }
②生成随机小数
//看看会不会爆int!数组会不会少了一维! //取物问题一定要小心先手胜利的条件 #include <bits/stdc++.h> using namespace std; #pragma comment(linker,"/STACK:102400000,102400000") #define LL long long #define ALL(a) a.begin(), a.end() #define pb push_back #define mk make_pair #define fi first #define se second #define haha printf("haha ") const int maxn = 10; LL h[maxn]; int main(){ ///freopen( ".in","r",stdin ); freopen( "input","w",stdout ); srand( time( NULL ) ); int t,n = 10 ; while( n-- ){ printf("10 "); for (int i = 1; i <= 10; i++) printf( "%.6lf ",rand()*1.0 / 100 ); } return 0; }
③生成字符
//看看会不会爆int!数组会不会少了一维! //取物问题一定要小心先手胜利的条件 #include <bits/stdc++.h> using namespace std; #pragma comment(linker,"/STACK:102400000,102400000") #define LL long long #define ALL(a) a.begin(), a.end() #define pb push_back #define mk make_pair #define fi first #define se second #define haha printf("haha ") const int maxn = 10; LL h[maxn]; int main(){ ///freopen( ".in","r",stdin ); freopen( "input","w",stdout ); srand( time( NULL ) ); int t,n = 10 ; while( n-- ){ printf("10 "); for (int i = 1; i <= 10; i++) printf( "%c ",rand() % 26 + 'A' ); } return 0; }