2017南工软件ACM集训队选拔赛第一场

A    空心菱形

#include<stdio.h>
int main()
{
	int n;
	scanf("%d",&n);//n为奇数 
	
		//打印空心菱形上半个 
		for(int i=1;i<=n/2;i++)//行 
		{
			for(int j=1;j<=(n-(i*2-1))/2;j++) printf(" ");
			for(int j=1;j<=i*2-1;j++) 
			{//控制空心 
				if(j==1||j==i*2-1) printf("*");
				else printf(" ");
			}
			printf("\n");
		}
		for(int i=1;i<=n;i++)
		{//控制最中间 
			if(i==1||i==n) printf("*");
			else printf(" "); 
		}printf("\n");
		//打印空心菱形下半个 
		for(int i=n/2;i>=1;i--)//行 
		{
			for(int j=1;j<=(n-(i*2-1))/2;j++) printf(" ");
			for(int j=1;j<=i*2-1;j++)
			{//控制空心 
				if(j==1||j==i*2-1) printf("*");
				else printf(" ");
			}
			printf("\n");
		}
	
	return 0;
}

B    LH and GXT

#include<cstdio>
int main()
{
	long long a, b;
	scanf("%lld%lld", &a, &b);
	printf("%lld\n", a + b);
 } 

C    01字符串

    #include <iostream>
    #include <string>
    #include <cstdio>
    using namespace std;
    int main()
    {
        int n , _;
        string str;
        cin >> _;
        while (_ --) {
            cin >> n;
            cin >> str;
            if(str.length() == 1) {
                printf("1 1 1\n");
                continue;
            }
            int ans = 1, p = 1;
            for (int i = 0; i < str.length(); i ++) {
                int pos = i, t = 0;
                while (pos < str.length() &&str[pos++] != '0') {
                    t ++;
                }
                if(t >= ans) {
                    ans = t;p = i;
                }
            }
            printf("%d %d %d\n",p + 1 , p + ans, ans);
        }
    }

D    马老师的问题

#include<bits/stdc++.h>
using namespace std;
int main()
{
	string s;
	while(cin>>s)
	{
		int num_4396=0,num_Clearlove7=0;
		for(int i=0;i<s.length();i++)
		{
			if(s[i]=='4'||s[i]=='3'||s[i]=='9'||s[i]=='6')
			{
				num_4396++;
			}
			if(s[i]=='C'||s[i]=='l'||s[i]=='e'||s[i]=='a'||s[i]=='r'||s[i]=='l'||s[i]=='o'||s[i]=='v'||s[i]=='e'||s[i]=='7')
			{
				num_Clearlove7++;
			}
		}
		printf("%d %d\n",num_4396,num_Clearlove7);
	}
	return 0;
}

E    签到+1s

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		int MAX=-99999;
		for(int i=0;i<n;i++)
		{
			int t;scanf("%d",&t);
			if(t>MAX) MAX=t;
		}
		printf("%d\n",MAX);
	}
	return 0;
} 

F    因子个数

#include <stdio.h>
int main()
{
	int n;
	scanf("%d",&n);
	int sum = 0;
	for(int i = 1 ; i <= n ; i++)
	{
		if( n % i ==0 )
		{
			sum++;
		}
	}
	if(sum%2 ==0)
	{
		puts("even");
	}
	else 
	{
		puts("odd");
	}
}

G    小鸣同学拆零件

#include <iostream>
#include <string>
 
using namespace std;
 
int main()
{
	string str;
 
	while (cin >> str) {
        for (int i = 0; i < str.length(); i ++) {
            for (int j = i; j < str.length(); j ++) {
                for (int k = i; k <= j ; k ++) {
                    cout << str[k];
                }cout << endl;
 
            }
        }
	}
}

H    MQG的抉择（续）

#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
struct node
{
    int dj,zl;
}edg[1005];
bool cmp(node a,node b)
{
    return a.dj<b.dj;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        double p;
        scanf("%lf%d",&p,&n);
        memset(edg,0,sizeof(edg));
        for(int i = 0 ; i <n;i++)
        {
            scanf("%d%d",&edg[i].dj,&edg[i].zl);
        }
        sort(edg,edg+n,cmp);
        double ans = 0 ;
        for(int i = 0 ; i < n ;i++)
        {
            if(edg[i].dj*edg[i].zl<=p)
            {
                p=p- (edg[i].dj*edg[i].zl);
                ans+=edg[i].zl;
            }
            else 
            {
                ans+=p/edg[i].dj;
                break;
            }
        }
        printf("%.2lf\n",ans);
    }
}

I    召唤师峡谷的金融危机

#include <stdio.h>
#include <algorithm>
using namespace std;
struct node
{
	int x,id;
}edg[10000];
bool cmp(node a,node b)
{
	if(a.x != b.x)
	{
		return a.x<b.x;
	}
	else 
	{
		return a.id<b.id;
	} 
}
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		int t;
		for(int i = 0 ; i < n;i++)
		{
			scanf("%d",&t);
			edg[i].x = t;
			edg[i].id = i;
		}
		sort(edg,edg+n,cmp);
		for(int i = 0 ; i < n; i ++)
		{
			printf("%d ",edg[i].id+1);
		}
		puts("");
	}
}

J    到底有多二

    #include <stdio.h>
    int judge(int n)
    {
    	int i = 2;
    	int ans=0;
    	while(n)
    	{
    		if(n%i==0)
    		{
    			ans++;
    			n = n/i;
    		}
    		else 
    		{
    			return ans;
    		}
    	}
    	return ans;
    }
    int main()
    {
    	int t;
    	scanf("%d",&t);
    	while(t--)
    	{
    		int n;
    		scanf("%d",&n);
    		printf("%d\n",judge(n));
    	}
    }