题目1006：ZOJ问题(递推规律)

题目链接：http://ac.jobdu.com/problem.php?pid=1006

详解链接：https://github.com/zpfbuaa/JobduInCPlusPlus

参考代码：

//
//  1006 ZOJ问题.cpp
//  Jobdu
//
//  Created by PengFei_Zheng on 28/04/2017.
//  Copyright © 2017 PengFei_Zheng. All rights reserved.
//

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <cmath>
#define MAX_SIZE 1001

using namespace std;

string str;

bool judge(){
    int idxZ = - ;
    int idxJ = - ;
    bool zoj = true;
    int len = (int)str.size();
    for(int i =  ; i < len ; i++){
        if(str[i]=='z' && idxZ == -){
            idxZ = i;
        }
        else if(str[i]=='j' && idxJ == -){
            idxJ = i;
        }
        else if(str[i]!='o'){
            zoj = false;
        }
    }
    int a = idxZ;
    int b = idxJ - idxZ -;
    int c = len -  - idxJ;
    if(zoj && idxZ != - && idxJ != - && (idxZ + < idxJ) && a*b==c){
        return true;
    }
    else return false;
}
int main(){
    while(cin>>str){
        if(judge()){
            printf("Accepted\n");
        }
        else{
            printf("Wrong Answer\n");
        }
    }
}
/**************************************************************
    Problem: 1006
    User: zpfbuaa
    Language: C++
    Result: Accepted
    Time:60 ms
    Memory:1520 kb
****************************************************************/