CCC 2009 S1 Cool Numbers

    1#include <bits/stdc++.h>
    2 
    3using namespace std;
    4 
    5int main(){
    6    vector<int> vec;
    7    for(int i = 0;; i++){
    8        int range = pow(i, 6);
    9        if(range > 1e8) break;
    10         vec.push_back(range);
    11    }
    12    int a, b;
    13    cin >> a >> b;
    14    int cnt, l, r;
    15    l = lower_bound(vec.begin(), vec.end(), a) - vec.begin();
    16    r = upper_bound(vec.begin(), vec.end(), b) - vec.begin();
    17    cnt = r - l;
    18    cout << cnt << endl;
    19}
    20//faster solution using scanf
    21/*
    22#include <stdio.h>
    23#include <math.h>
    24 
    25int main()
    26{
    27	int a,b;
    28	scanf("%d",&a);
    29	scanf("%d",&b);
    30 
    31	int i = 0;
    32	int count = 0;
    33	while (pow(i,6) <= b) {
    34		if (pow(i,6) >= a) count++;
    35		i++;
    36	}
    37 
    38	printf("%d\n",count);
    39 
    40	return 0;
    41}*/
    42