第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-562 线性运算

#include<stdio.h>
#include<stdlib.h>
int main()
{
  int n;
  scanf("%d",&n);
  int a[n][n];
  int b[n][1];
  int i,j;
  for(i=0;i<n;i++)
  {
    for(j=0;j<n;j++)
    {
      scanf("%d",&a[i][j]);
    }
  }
  for(i=0;i<n;i++)
  {
    for(j=0;j<1;j++)
    {
      scanf("%d",&b[i][j]);
    }
  }
//  return 0;
     int c[n][1];
     for(i=0;i<n;i++)
     {
      for(j=0;j<1;j++)
      {
        c[i][j]=0;
    }
  }
  for(i=0;i<n;i++)
  {
    for(j=0;j<n;j++)
    {
        c[i][0]+=a[i][j]*b[j][0];
    }
  }
  for(i=0;i<n;i++)
  {
    for(j=0;j<1;j++)
    {
      printf("%d",c[i][j]);
    }
    printf("\n");
  }
  return 0;
}

#include  <algorithm>
#include  <ctime>
#include  <cmath>
#include  <iomanip>
#include  <cstring>
#include  <vector>
#include  <stack>
#include  <map>
#include  <string>
#include  <iostream>
using namespace std;
int main()
{
  int n,A[101][101],X[101][1],c[101][1]={0};
  cin>>n;
  for(int i=0;i<n;i++)
  {
    for(int j=0;j<n;j++)
    {
      cin>>A[i][j];
    }
  }
  for(int i=0;i<n;i++)
  {
    cin>>X[i][0];
  }
  for(int i=0;i<n;i++)
  {
    for(int j=0;j<n;j++)
    {
      c[i][0]+=A[i][j]*X[j][0];
    }
  }
  for(int i=0;i<n;i++)
  {
    cout<<c[i][0]<<endl;
  }
  return  0;
}

import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
    static final int INF = 0x3f3f3f3f;
    static final long LNF = 0x3f3f3f3f3f3f3f3fL;
    public static void main(String[] args) throws IOException {
        initReader();
        int n=nextInt();
        long[][]arr=new long[n][n];
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                arr[i][j]=nextInt();
            }
        }
        long[]brr=new long[n];
        for(int i=0;i<n;i++)brr[i]=nextInt();
        long[]sum=new long[n];
        for(int i=0;i<n;i++){
                for(int k=0;k<n;k++){
                    sum[i]+=arr[i][k]*brr[k];
            }
        }
        for(int i=0;i<n;i++)pw.println(sum[i]);
        pw.close();
    }
    /***************************************************************************************/
    static BufferedReader reader;
    static StringTokenizer tokenizer;
    static PrintWriter pw;
    public static void initReader() throws IOException {
        reader = new BufferedReader(new InputStreamReader(System.in));
        tokenizer = new StringTokenizer("");
        pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    }
    public static boolean hasNext() {
        try {
            while (!tokenizer.hasMoreTokens()) {
                tokenizer = new StringTokenizer(reader.readLine());
            }
        } catch (Exception e) {
            return false;
        }
        return true;
    }
    public static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }
    public static String nextLine() {
        try {
            return reader.readLine();
        } catch (Exception e) {
            return null;
        }
    }
    public static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }
    public static long nextLong() throws IOException {
        return Long.parseLong(next());
    }
    public static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
    public static char nextChar() throws IOException {
        return next().charAt(0);
    }
}

n = int(input())
A = [[] for j in range(n)]
AX = [0 for i in range(n)]
X=[]
for i in range(n):
    A[i] = list(map(int, input().split()))
for i in range(n):
    X.append(int(input()))
for i in range(n):
    for j in range(n):
        AX[i] += A[i][j] * X[j]
for i in AX:
    print(i)