HDU简单题第四波2090——2099

题意：都是中文题目，不再赘述。

HDU 2090

Code：

#include <iostream>
#include <cstdio>
using namespace std;

int main()
{
    char a[50];
    double num,price,sum = 0;
    while(scanf("%s",a) != EOF)
    {
        cin>>num>>price;
        sum +=num*price;
    }
    printf("%.1lf\n",sum);
    return 0;
}

HDU 2091

Code：

#include <iostream>
using namespace std;

int main()
{
    char a; int n, k = 0;
    while(cin>>a && a != '@')
    {
        cin>>n;
        if(k != 0) cout<<endl;
        for(int i = 1; i < n; i++)
        {
            if(i == 1)
            {for(int j = 1; j <= n-i; j++) cout<<' '; cout<<a; cout<<endl;}
            else
            {
                for(int j = 1; j <= n-i; j++) cout<<' '; cout<<a;
                for(int k = 1; k <= 2*i-3; k++) cout<<' '; cout<<a;cout<<endl;
            }
        }
        for(int i = 1; i<=2*n-1; i++) cout<<a;
        cout<<endl; k++;
    }
    return 0;
}

HDU 2092

Code：

#include <iostream>
#include <cmath>
using namespace std;

int main()
{
    int n,m;
    while(cin>>n>>m && n+m)
    {
        int flag = 0;
        int k = (int)abs((double)m);
        for(int i = -k; i <= k; i++)
        {
            if((n-i)*i == m) 
            { flag = 1; break; }            
        }
        if(flag == 0) cout<<"No"<<endl;
        else cout<<"Yes"<<endl;
    }
    return 0;
}

HDU 2094

Code：

#include <iostream>
#include <string>
#include <set>
using namespace std;

int main()
{
    string a,b;
    int n;
    while(cin>>n && n)
    {
       set<string> total,lost;
       while(n--)
       {
           cin>>a>>b;
           total.insert(a);
           total.insert(b);
           lost.insert(b);
       }
       if(total.size() == lost.size()+1)
            cout<<"Yes"<<endl;
       else  cout<<"No"<<endl;
    }
    return 0;
}

HDU 2096

Code:

#include <iostream>
using namespace std;

int main()
{
    int T,A,B;
    cin>>T;
    while(T--)
    {
        cin>>A>>B;
        A = A%100;
        B = B%100;
        int result = A+B;
        cout<<result%100<<endl;
    }
    return 0;
}

HDU 2097

Code:

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

int vis[10000];
int system(int N,int R)
{
    int a[20];
    int i = 0,flag = 0;
    while(N)
    {
        a[i] = N%R;
        N =N/R; i++;
    }
    for(int j = i-1; j >= 0; j--)
    flag += a[j];
    return flag;
}

void init()
{
    int a,b,c;
    memset(vis,0,sizeof(vis));
    for(int i = 1000; i <= 9999; i++)
    {
        a = system(i,10);
        b = system(i,12);
        c = system(i,16);
        if(a == b && a == c && b == c) vis[i] = 1;
    }
}

int main()
{
    int n;
    init();
    while(scanf("%d",&n) != EOF && n)
    {
        if(vis[n]) printf("%d is a Sky Number.\n",n);
        else   printf("%d is not a Sky Number.\n",n);
    }
    return 0;
}

HDU 2098

COde:

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

int prime[10000],vis[10000];
void isprime()
{
	int c = 0,num = 0;
	memset(vis,0,sizeof(vis));
    memset(prime,0,sizeof(prime));
	for(int i = 2; i <= 10000; i++) if(!vis[i])
	{
	    prime[i] = i;
	    for(int j = i*i; j <= 10000; j += i) vis[j] = 1;
	}
}

int main()
{
    int n,temp;
    isprime();
    while(scanf("%d",&n) != EOF && n)
    {
        temp = 0;
       for(int i = 2; i <= n/2; i++)
        {
            if(prime[i] && prime[n-i] && prime[i] + prime[n-i] == n)
             { if(i != n-i) temp++; }
        }
        printf("%d\n",temp);
    }
    return 0;
}

HDU 2099

Code:

#include <iostream>
using namespace std;

int main()
{
    int a,b;
    while(cin>>a>>b && a+b)
    {
        int low[10],len = 0;;
        for(int i = 0; i< 100; i++)
            if((i+a*100)%b == 0) low[len++] =  i;
        for(int j = 0; j < len-1; j++)
        {
            if(low[j] <10) cout<<"0"<<low[j]<<" ";
            else cout<<low[j]<<" ";
        }
        if(low[len-1] < 10) cout<<"0"<<low[len-1]<<endl;
        else cout<<low[len-1]<<endl;
    }
    return 0;
}