#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>
using namespace std;
<span id="more-737"></span>
#define PB push_back
#define MP make_pair
#define REP(i,n) for(i=0;i<(n);++i)
#define FOR(i,l,h) for(i=(l);i<=(h);++i)
#define FORD(i,h,l) for(i=(h);i>=(l);--i)
#define let(a,b) typeof(b) a(b)
#define all(a) a.begin(),a.end()
#define forall(a,b) for (let(a,b.begin());a!=b.end();++a)
#define forrall(a,b) for (let(a,b.rbegin());a!=b.rend();++a)
#define contains(a,b) (find(all(a),b)!=a.end())
#define fi(n) for (int i=0;i<(n);++i)
#define fj(n) for (int j=0;j<(n);++j)
#define fk(n) for (int k=0;k<(n);++k)
#define gsort(a,b) sort(a,b,greater<typeof(*a)>());
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<double> VD;
typedef __int64 LL;
typedef pair<int,int> PII;
typedef vector<int> vi;
typedef vector<string> vs;
typedef istringstream iss;
typedef ostringstream oss;
template<class T> inline T gcd(T a,T b)//NOTES:gcd(
{if(a<0)return gcd(-a,b);if(b<0)return gcd(a,-b);return (b==0)?a:gcd(b,a%b);}
template<class T> inline T lcm(T a,T b)//NOTES:lcm(
{if(a<0)return lcm(-a,b);if(b<0)return lcm(a,-b);return a*(b/gcd(a,b));}
template<class T> inline T euclide(T a,T b,T &x,T &y)//NOTES:euclide(
{if(a<0){T d=euclide(-a,b,x,y);x=-x;return d;}
if(b<0){T d=euclide(a,-b,x,y);y=-y;return d;}
if(b==0){x=1;y=0;return a;}else{T d=euclide(b,a%b,x,y);T t=x;x=y;y=t-(a/b)*y;return d;}}
template<class T> inline vector<pair<T,int> > factorize(T n)//NOTES:factorize(
{vector<pair<T,int> > R;for (T i=2;n>1;){if (n%i==0){int C=0;for (;n%i==0;C++,n/=i);R.push_back(make_pair(i,C));}
i++;if (i>n/i) i=n;}if (n>1) R.push_back(make_pair(n,1));return R;}
template<class T> inline bool isPrimeNumber(T n)//NOTES:isPrimeNumber(
{if(n<=1)return false;for (T i=2;i*i<=n;i++) if (n%i==0) return false;return true;}
template<class T> inline T eularFunction(T n)//NOTES:eularFunction(
{vector<pair<T,int> > R=factorize(n);T r=n;for (int i=0;i<R.size();i++)r=r/R[i].first*(R[i].first-1);return r;}
bool isUpperCase(char c){return c>='A' && c<='Z';}//NOTES:isUpperCase
bool isLowerCase(char c){return c>='a' && c<='z';}//NOTES:isLowerCase
bool isLetter(char c){return c>='A' && c<='Z' || c>='a' && c<='z';}//NOTES:isLetter
bool isDigit(char c){return c>='0' && c<='9';}//NOTES:isDigit
double dist(double x1,double y1,double x2,double y2){return sqrt(sqr(x1-x2)+sqr(y1-y2));}//NOTES:dist(
double distR(double x1,double y1,double x2,double y2){return sqr(x1-x2)+sqr(y1-y2);}//NOTES:distR(
template<class T> void stoa(string s,int &n,T A[]){n=0;istringstream sin(s);for(T v;sin>>v;A[n++]=v);}//NOTES:stoa(
template<class T> void atos(int n,T A[],string &s){ostringstream sout;for(int i=0;i<n;i++){if(i>0)sout<<' ';sout<<A[i];}s=sout.str();}//NOTES:atos(
template<class T> void atov(int n,T A[],vector<T> &vi){vi.clear();for (int i=0;i<n;i++) vi.push_back(A[i]);}//NOTES:atov(
template<class T> void vtoa(vector<T> vi,int &n,T A[]){n=vi.size();for (int i=0;i<n;i++)A[i]=vi[i];}//NOTES:vtoa(
template<class T> void stov(string s,vector<T> &vi){vi.clear();istringstream sin(s);for(T v;sin>>v;vi.push_bakc(v));}//NOTES:stov(
template<class T> void vtos(vector<T> vi,string &s){ostringstream sout;for (int i=0;i<vi.size();i++){if(i>0)sout<<' ';sout<<vi[i];}s=sout.str();}
template<typename T> inline string str(const T &t){oss s;s<<t;return s.str();}
template<typename T> inline LL Int(const T &t){stringstream s;s<<t;LL r;s>>r;return r;}
template<typename T> inline double Double(const T &t){stringstream s;s<<t;double r;s>>r;return r;}
template<typename T> inline int size(const T &t) {return t.size();}
template<class T,class U> T cast(U x){ostringstream os; os<<x; T res; istringstream is(os.str()); is>>res; return res;}
inline string tolower(string s){fi(size(s)) s[i]=tolower(s[i]);return s;}
inline string toupper(string s){fi(size(s)) s[i]=toupper(s[i]);return s;}
//数据生成程序样例
//以A + B problem 为例
#include <map>
#include <set>
#include <time.h>
#include <cmath>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <iostream>
#include <fstream>
#include <algorithm>
#define MAX 2000005
using namespace std;
FILE *fin;
FILE *fout;
struct point
{
double x,y;
}po[100007];
int Rand(int x)
{
int t=x,sum=0;
while (t>0)
{
sum+=rand()%t;
t-=32767;
}
return sum;
}
int solve()//a+b范例
{
int a=Rand(1000);
int b=Rand(1000);
fprintf(fin,"%d %d\n",a,b);
fprintf(fout,"%d\n",a+b);
return 0;
}
void creatinputdata()
{
string name,num,last,dataname;
int T=0;
while (T<10)
{
name="data";
num=T+'0';
last=".in";
dataname="D:\\"+name+num+last;//D:\\data%d.in
fin=fopen(dataname.c_str(),"w");//输入文件部分,默认路径D盘根目录
name="data";
num=T+'0';
last=".out";
dataname="D:\\"+name+num+last;//D:\\data%d.out
fout=fopen(dataname.c_str(),"w");//输出文件部分,默认路径D盘根目录
solve();
T++;
}
}
int main()
{
srand(time(0));
creatinputdata();
return 0;
}
或
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
//测试数据组数
#define N 10
int main ()
{
//测试数据临时存放目录
char datapath[256] = "D:\\";
//标程产生的可执行程序
char runexe[256] = "F:\\aplusb.exe";//文件名必须为aplusb
char datain[512], dataout[512];
int i;
//初始化rand的起始值
srand ((unsigned)time (NULL));
for (i = 0; i < N; i++)
{
sprintf (datain, "%s\\data%d.in", datapath, i);
sprintf (dataout, "%s\\data%d.out", datapath, i);
//生成测试数据输入
freopen (datain, "w", stdout);
printf ("%d %d\n", rand() % 10, rand() % 10);
//生成测试数据输出
freopen (datain, "r", stdin);
freopen (dataout, "w", stdout);
system (runexe);
}
}