POJ 2390 解题报告

/*
ID: thestor1
LANG: C++
TASK: poj2390
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cassert>

using namespace std;

int main()
{
int R, M, Y;
scanf("%d%d%d", &R, &M, &Y);
printf("%d\n", (int)(M * pow(1 + R / 100.0, Y)));
return 0;
}