https://vjudge.net/problem/Gym-102680A/origin
https://vjudge.net/contest/396206#problem/A
The Bi-Cameral Progress Committee loves making progress by passing bills. Since the committee is determined to make as much progress as possible, all votes are required to be of unanimous approval of the bill at hand. That is, if the committee votes on whether to pass a bill, it will definitely be passed.
Because these committee members are all political science majors (instead of computer science majors), they much prefer reading the flavortext of unnecessarily convoluted problem statements to using logic or algebra, and assume you prefer the same. They could have asked you for the shortest path of a bill to touch each member given the position of all committee members. Or they could have asked you the maximum value of any passable combination of bills, given the total political capital of the committee and political cost and value of each potential bill. Or they could have asked whether there exists any bill whose text is of the complexity that can be read in polynomial time but cannot be written in polynomial time.
Instead, they need your help figuring out how many bills the committee will pass given the number of bills the committee will vote on. Help them figure out how many bills will be passed given the number of bills that will be voted on and the total number of french fries eaten since 1970.
Input
The input will contain two, space-separated integers: nn, the number of bills to be voted on this session, and ff, the total number of french fries eaten since 1970 (in billions of fries, rounded to the nearest integer).
0≤n≤990≤n≤99
0≤f≤200≤f≤20
Output
Output a single integer: the number of bills that will be passed this session.
Examples
61 19
61
36 10
36
水题
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include <vector>
#include <iterator>
#include <utility>
#include <sstream>
#include <limits>
#include <numeric>
#include <functional>
using namespace std;
#define gc getchar()
#define mem(a) memset(a,0,sizeof(a))
#define debug(x) cout<<"debug:"<<#x<<" = "<<x<<endl;
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
typedef char ch;
typedef double db;
const double PI=acos(-1.0);
const double eps=1e-6;
const int inf=0x3f3f3f3f;
//const int maxn=1e5+10;
const int maxn = 5010;
//const int maxm=100+10;
const int N=1e6+10;
const int mod=1e9+7;
int main()
{
int n , f;
cin >> n >> f;
cout << n;
return 0;
}