ProjectEuler/P112.cpp at master · AbhishekYMCA/ProjectEuler · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include<iostream>
#include<fstream>
#include<string>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<algorithm>
#include<math.h>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<iomanip>
#define MAXN 10000000
#define MOD 10000000000
#define LL long long
#define eps 1e-8
#define inf 0x3f3f3f3f
using namespace std;

bool isBouncy(int n)
{
    bool incre = false, decre = false;
    int pre = n % 10;
    n /= 10;
    while(n)
    {
        if(n % 10 < pre)
            incre = true;
        else if(n % 10 > pre)
            decre = true;
        pre = n % 10;
        n /= 10;
        if(incre && decre)
            return true;
    }
    return false;
}

int main()
{
    clock_t start = clock();
    int b = 0;
    for(int i = 100; ; i++)
    {
        if(isBouncy(i))
            b++;
        if(b * 100  == i * 99)
        {
            printf("%d\n", i);
            break;
        }
    }
    printf( "time cost: %lf", ( double )( clock() - start ) / CLOCKS_PER_SEC );
    return 0;
}