计算2的10次方

#include<iostream>
int main (){
//;ogival objects of type int 
int value =2;
int pow =10;
int result =1;
//repeat caaulation of result untill cnt is equal to pow
for (int cnt =0;cnt !=pow; cnt ++)
    result *=value ;//result =result*value
    std::cout <<value
              <<"raised to the power of "
              <<pow<<":\t"
              <<result<<std::endl;
    return 0;          

}