/*斐那波切数列*/
#include<iostream>
using namespace std;int fun(int k)
{
int fei = 1;
if (k == 1 || k == 2)
return fei;
else
{
return fun(k - 1) + fun(k - 2);
}
}
int main()
{
int k;
cin >> k;
cout << fun(k);
return 0;
}
/*输出第n小的质数*/
#include<iostream>
using namespace std;
bool is_Prime(int k)
{
if (k < 2)
return 0;
else if(k==2)
return 1;
else
{
for (int i = 2;i < (k/2+1);i++)
{
if (k%i == 0)
return 0;
}
return 1;
}
}
const long long int num = 1000;
int main()
{
int k;
cin >> k;
int a[10000] = {0};
int j = 0;
for (int i = 0;i < num;i++)
{
if (is_Prime(i))
a[j++] = i;
}
cout << a[k-1] << endl;
}
/*输入包含多组测试组的数据对a b,输出a+b*/
#include<iostream>
using namespace std;
int main()
{
int a, b,j=0;
int c[100];
while (cin >> a >> b)
{
c[j++] = a + b;
}
for (int i = 0;i < j;i++)
cout << c[i] << endl;
}