本文整理汇总了C++中judge函数的典型用法代码示例。如果您正苦于以下问题：C++ judge函数的具体用法？C++ judge怎么用？C++ judge使用的例子？那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。
在下文中一共展示了judge函数的15个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: main
int main(void){
int i,B,temp;
char newx[30],num[10];
freopen("palsquare.in","r",stdin);
freopen("palsquare.out","w",stdout);
scanf("%d",&B);
for(i=1;i<=300;i++){
temp = i*i;
ttoB(num,i,B);
reverse(num);
ttoB(newx,i*i,B);
if(judge(newx))
printf("%s %s\n",num,newx);
}
return 0;
}示例2: log
/**
* Start virtual judger
*/
void VirtualJudger::run() {
log("Judger started");
initHandShake();
while (true) {
socket->receiveFile(tmpfilename);
Bott * bott = new Bott(tmpfilename);
log((string) "Received a new task, problem: " + bott->Getvid() + ".");
string result_filename = Bott::RESULTS_DIRECTORY +
intToString(bott->Getrunid());
if (bott->Gettype() == NEED_JUDGE) {
// Currently for vjudge, only NEED_JUDGE is supported
try {
if (bott->Getsrc().length() < MIN_SOURCE_LENGTH) {
// source code too short, may cause problem in remote OJ, such as PKU
bott->Setout_filename(result_filename);
generateSpecialResult(bott, "Compile Error");
bott->Setce_info("Source code too short, minimum length: " +
intToString(MIN_SOURCE_LENGTH));
bott->save();
} else {
judge(bott, result_filename);
}
} catch (Exception & e) {
// Exception occurs, set to Judge Error
log((string) "Judge error! Reason: " + e.what());
// reuse bott file
bott->Setout_filename(result_filename);
generateSpecialResult(bott, "Judge Error");
bott->save();
} catch (exception & e) {
// Exception occurs, set to Judge Error
log((string) "Judge error! Reason: " + e.what());
// reuse bott file
bott->Setout_filename(result_filename);
generateSpecialResult(bott, "Judge Error");
bott->save();
}
delete bott;
} else {
delete bott;
throw Exception("Type not supported.");
}
socket->sendFile(result_filename);
}
}示例3: judge
void judge(int n){
if (n == 1){
isbvalid = true;
return ;
}
int i;
for(i = 1; i <= 100; ++i){
if (record[i] == 0 && n % i == 0){
n /= i;
record[i] = 1;
judge(n);
n *= i;
record[i] = 0;
}
}
}示例4: main
int main () {
scanf("%s%d", s, &n);
len = strlen(s);
if (n >= len) {
printf("%d\n", (n + len) / 2 * 2);
} else {
for (int i = len; i >= 0; i--) {
if (judge(i)) {
printf("%d\n", i*2);
break;
}
}
}
return 0;
}示例5: main
int main()
{
for( char s[ 99 ]; gets( s ); )
{
int use[ 99 ] = { 0 }, size = 0;
for( int i = 0; s[ i ]; ++i )
if( isdigit( s[ i ] ) )
use[ size++ ] = s[ i ] - '0';
else if( s[ i ] == 'X' )
use[ size++ ] = 10;
for( int i = 0; s[ i ]; ++i )
if( !isspace( s[ i ] ) )
putchar( s[ i ] );
printf( " is %scorrect.\n", size == 10 && judge( use )? "" : "in" );
}
}示例6: main
int main(void)
{
int judge(int , int );//函数声明
int n, m, i, j, num;//声明语句
scanf("%d %d", &m, &n);//输入第一个数字以及测试数据的长度
for (i = n + 1; i <= n + m; i++)//从n+1开始测试m个数据
{
for (num = 0, j = 2; j <= 10; j++)//循环判断是否是双重以上的回文数
num += judge(i, j);//函数调用
if (num >= 2)//如果num能够累加到2以上，则输出被判断数字
printf("%d\n", i);
}
return 0;
}示例7: main
int main(void)
{
char input_c[100];
printf("Pls input the char input_c\n");
scanf("%s",input_c);
printf("U input the char is %s\n",input_c);
if(judge(input_c) == 1)
printf("Yes,U input is plalindrome~!!!!\n");
else
printf("No,U input is not the plalindrome~!!!!\n");
return 0;
}示例8: main
long long main()
{
long long t,i,k;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&m,&n);
mul();
k=judge();
printf("%d/",n/k);
printf("%d",ans[ans[0]]);
for(i=ans[0]-1;i>=1;i--)
printf("%02d",ans[i]);
printf("\n");
}
return 0;
}示例9: main
int main(void) //메인 함수
{
BOOL isEndloop = 0;
printf("enter a number (3 - 7): ");
scanf("%d",&size);
/*사용자로부터 크기를 입력받는다.
범위(MINP: 3 - MAXP: 7)을 벗어나면
최소크기 MINP: 3으로 고정*/
if(!(MINP<=size && size<=MAXP)) size=MINP;//입력된 크기가 3보다 작거나 7보다 크면, 최소인 3으로 출력
printf("Press ESC to exit.\n");
printf("Left(4, A), Right(6, D), Down(2, X), Up(8, W)\n");
// initilize the game
init();
// play
while(!isEndloop) {
int i,j;
/*
judge()함수가 1을 리턴할 때까지
사용자로부터 키를 입력받아(_getch())
퍼즐 조각을 움직이면서 게임 진행
*/
move(_getch());
isEndloop = judge();
//draw each puzzle
for(i=0;i<size;i++) {
for(j=0;j<size;j++) {
draw_piece(i,j);
}
}
}
// exit the game
gotoxy(0, size*3+1 + OFFSET);
printf("Done!\n\n");
return 0;
}示例10: query
void registerDialog::on_registerbtn_2_clicked()
{
QString name = ui->userline_2->text();
QString id = ui->idline->text();
QString pwd = ui->pwdline->text();
QString repwd = ui->repwd_2->text();
QString yanzheng = ui->yanzhengline_2->text();
// qDebug()<<name<<"\n"<<id<<"\n"<<pwd<<"\n"<<repwd<<"\n"<<yanzheng;
QSqlDatabase db = QSqlDatabase::database("logconnect");
QSqlQuery query(db);
query.prepare("select Id from user where user.Id = ?");
query.addBindValue(id);
query.exec();
query.next();
//qDebug()<<query.value(0).toString();
//如果在数据库中查询的Id不存在
QString selectID = query.value(0).toString();
if(id == selectID && id != "" && selectID != "")//说明帐号已存在
{
QMessageBox::warning(this,"警告", "帐号已存在",
QMessageBox::Cancel);
}else if(pwd != repwd && pwd != "" && repwd != "" )//两次密码不一致
{
QMessageBox::warning(this, "错误", "两次密码输入不一致",
QMessageBox::Cancel);
}else if(yanzheng != ui->yanzheng->text() && yanzheng != "")//验证码不正确
{
QMessageBox::warning(this, "错误", "验证码输入不正确",
QMessageBox::Cancel);
}else{
if(judge()){//检验是否为空
query.prepare("insert into user values(?, ?, ?)");
query.addBindValue(id);
query.addBindValue(pwd);
query.addBindValue(name);
query.exec();
//query.exec("insert into user values('1', '2' , '3')");
QMessageBox::warning(this, "提示", "注册成功", QMessageBox::Ok);
// this->accept();
//关闭当前窗口
this->close();
}
}
}示例11: main
void main()
{
int i,j,a,d,n,tmp;
int sum=0;
while(scanf("%d%d%d",&a,&d,&n)!=EOF)
{
j=0;
if(a==0&&d==0&&n==0)
break;
for(i=1;i<=n;j++)
{
tmp =a+d*j;
if(judge(tmp))
i++;
}
printf("%d\n",a+d*(j-1));
}
}示例12: main
int main()
{
char str1[10],str2[10];
memset(head.next,0,sizeof(head.next));
head.id=-1;
while(~scanf("%s %s\n",str1,str2))
{
// printf("%s %s\n",str1,str2);
int s1=find(str1),s2=find(str2);
// printf("%d %d\n",s1,s2);
if(!deg[s1]) father[s1]=s1;
if(!deg[s2]) father[s2]=s2;
++deg[s1],++deg[s2];
together(s1,s2);
}
judge();
return 0;
}示例13: get_ans
void get_ans()
{
for(ll i=3;i<=50;i++)
{
for(ll j=2;j<=i-1;j++)
{
for(ll k=1;k<=j-1;k++)
{
if(judge(a[i],a[j],a[k]))
{
return ;
}
}
}
}
puts("-1 -1 -1");
return ;
}示例14: find
void find()
{
for(int i=3; i<=50; i++)
{
for(int j=2; j<i; j++)
{
for(int k=1; k<j; k++)
{
if(judge(a[i],a[j],a[k]))
{
return;
}
}
}
}
printf("-1 -1 -1\n");
return;
}示例15: main
int main()
{
int n_test;
scanf("%d", &n_test);
scanf("%lld%lld%lld%lld%lld", &a1, &b1, &c1, &d1, &k);
scanf("%lld%lld%lld%lld%lld", &a2, &b2, &c2, &d2, &m);
scanf("%lld%lld%lld%lld%lld", &a3, &b3, &c3, &d3, &x);
int ans = 0;
while(n_test --)
{
ans += judge();
k = ((a1 * k) % d1 * k + b1 * k + c1) % d1 + 20;
m = ((a2 * m) % d2 * m + b2 * m + c2) % d2 + 20;
x = ((a3 * x) % d3 * x + b3 * x + c3) % d3 + 20;
}
printf("%d\n", ans);
}