#include

using namespace std;

double fun(double x, long n){

if(n==1)

return x;

else{

return x*fun(x, n-1);

}

}

int main(){

double x; // x是一个实数

long n;// n是一个正整数，故n>=1

cin >> x >> n;

cout << fun(x,n) << endl;

return 0;

}

#include

#define N 53

using namespace std;

int fanpai(int a[], int i){

if(a[i] == 1)

a[i] = 0;

else

a[i] = 1;

}

int main(){

int a[N];

int i, j, count;

for(i=1; i < N; i++) // 设置正面朝上的牌为1

a[i]=1;// 朝下的为0

for(i=2; i < N; i++){

for(j=i; j < N; j++){

if(j%i == 0)

fanpai(a, j);

}

}

count = 0;

for(i=1; i < N; i++)

if(a[i] == 1)

++count;

cout << count << endl;

return 0;

}

#include

#include

#include

#include

using namespace std;

int su(int a){ //判断素数

int i;

for(i=2; i <= sqrt(a); i++){

if(a%i == 0)

return 0;

}

return 1;

}

int main(){

int i, a[300], su_num=0, count=0, max1, max2;

FILE *fp;

if((fp = fopen("prime.txt","w+"))==NULL){

printf("cannot open this file\n");

exit(0);

}

for(i = 2; i <=300; i++)

if(su(i) == 1){

a[su_num]=i;

fprintf(fp,"%d\n",i);//写入文件

su_num++;

}

fclose(fp);

for(i = 0; i < su_num-1; i++)

if(a[i+1]-a[i] == 2){

count++;

max2 = a[i+1];

max1 = a[i];

}

cout << count << endl; // 有多少对双胞胎数

cout << max2 << ' ' << max1 << endl; // 最大的一对双胞胎数

return 0;

}