1 条题解

  • 0
    @ 2025-10-10 15:45:59

    C++ :

    #include<bits/stdc++.h>
    using namespace std;
    
    void show(int n){
    	for(int i = 1;i <= n;i++){
    		cout<<"*";
    	}
    	cout<<endl;
    }
    
    int main(){
    	int a[110];
    	int n,i;
    	cin>>n;
    	for(i = 0;i < n;i++){
    		cin>>a[i];
    	} 
    	
    	for(i = 0;i < n;i++){
    		cout<<i+1<<":";
    		show(a[i]);
    	} 
    	
    	 
        return 0;
    }
    
    

    Pascal :

    var a:array[1..100000] of longint;
        n,i,j:longint;
    begin
    read(n);
    for i:=1 to n do
    read(a[i]);
    for i:=1 to n do
    begin
    write(i,':');
    for j:=1 to a[i] do
    write('*');
    writeln;
    end;
    end.
    

    Java :

    import java.util.Scanner;
    
    public class Main {
    	public static void main(String[] args) {
    		Scanner sc = new Scanner(System.in);
    		int n = sc.nextInt();
    		int[] a =new int[n];
    		for (int i =0;i<n;i++) {
    			a[i]=sc.nextInt();
    		}
    		for (int i =0;i<n;i++) {
    			System.out.print(i+1+":");
    			for (int j=1;j<=a[i];j++) {
    				System.out.print("*");
    			}
    			System.out.println();
    		}
    	}
    }
    
    

    Python :

    # 接收输入
    n = int(input())
    a = input().split()
    # 类型转换
    for i in range(0, n):
        a[i] = int(a[i])
        # 输出序号
        print('%d:' % (i + 1), end='')
        # 输出*号
        for j in range(1, 11):
            if a[i] == j:
                print('*' * j)
    
    • 1

    信息

    ID
    308
    时间
    1000ms
    内存
    256MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者