几道水题(gym101502a,gym101502b,gym

#include <iostream> 
#include <cstring> 
#include <cmath> 
#include <algorithm> 
#include <vector>
#include <list>
#include <string>
#include <queue>
#define mst(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn=1e6+5;
int ()
{
    ll t;
    cin>>t;
    while(t--)
    {
        double y;double x;
        cin>>y>>x;
        double ans=y/(1+(x/100.0));
        printf("%.0lfn",ans);
    }
    return 0;
}

#include <iostream> 
#include <cstring> 
#include <cmath> 
#include <algorithm> 
#include <vector>
#include <list>
#include <string>
#include <queue>
#include <set>
#include <map>
#define mst(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn=1e5+5;
ll col[maxn];
int ()
{
    ll t;
    scanf("%lld",&t);
    while(t--)
    {    
        map<ll,ll> rows;        
        rows.erase(rows.begin(),rows.end());
        ll n;
        scanf("%lld",&n);
        for(ll i=1;i<=n;i++){
            ll row;
            scanf("%lld",&row);
            rows[row]++;
            scanf("%lld",&col[i]);
        }
        ll sum=0;
        for(ll i=1;i<=n;i++)
            sum+=rows[col[i]];
        printf("%lldn",sum);
    }
    return 0;
}

#include <iostream> 
#include <cstring> 
#include <cmath> 
#include <algorithm> 
#include <vector>
#include <list>
#include <string>
#include <queue>
#define mst(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn=1e6+5;
int ()
{
    int t;
    cin>>t;
    while(t--)
    {    
        int kit=0;
        int living=0;
        int bed=0;
        string str;
        int n;cin>>n;
        while(n--)
        {
            cin>>str;
            if(str[0]=='k')
                kit++;
            else if(str[0]=='b')
                bed++;
            else if(str[0]=='l')
                living++;
        }
        int ans=min(kit,min(bed/2,living));
        cout<<ans<<endl;
    }
    return 0;
}

#include <iostream> 
#include <cstring> 
#include <cmath> 
#include <algorithm> 
#include <vector>
#include <list>
#include <string>
#include <queue>
#define mst(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn=1e6+5;
int ()
{
    int t;
    cin>>t;
    while(t--)
    {
        ll n;double m;
        cin>>n>>m;
        ll tmp;ll sum=0;
        for(int i=1;i<=n;i++)
        {
            cin>>tmp;
            sum+=tmp>=50?1:0;
        }
        double success=ceil(m*n);
        if(sum>=success)
            printf("YESn");
        else
            printf("NOn");
    }
    return 0;
}