[乱搞] BZOJ 2296 [POJ Challenge] 随机种子

#include<cstdio>
#include<cstdlib>
using namespace std;
typedef long long ll;

inline char nc()
{
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}

inline void read(ll &x)
{
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const ll Base=9876543210000000;

int main()
{
ll Q,num;
freopen("t.in","r",stdin);
freopen("t.out","w",stdout);
read(Q);
while (Q--)
{
read(num);
if (!num)
printf("-1\n");
else
printf("%lld\n",Base+(num-Base%num));
}
return 0;
}