1week

Git

풀이

1. 경로의 개수

#include <iostream>
#define ll long long
using namespace std;

ll n = 0;

int main() {

	ll result = 1;

	cin >> n;

	for (int i = 0; i < n; i++)
	{
		ll a;
		cin >> a;
		result *= a;
	}

	cout << result;

	return 0;
}

2. 동명이인

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

int num = 0;
string name;
int result = 0;

int main()
{
	cin >> num >> name;

	for (int i = 0; i < num; i++)
	{
		string temp;
		cin >> temp;

		if (temp.find(name)!=string::npos)
		{
			result++;
		}
	}

	cout << result;

}

3. 최장 맨해튼 거리

#include <bits/stdc++.h>
using namespace std;

int num[4];
int result;


int main() {
	for (int i = 0; i < 4; i++)
	{
		cin >> num[i];
	}

	do {
		int temp = 0;
		temp = abs(num[0] - num[2]) + abs(num[1] - num[3]);
		if (result < temp)
		{
			result = temp;
		}
	} while (next_permutation(num, num + 4));

	cout << result;
}

4. 소수 찾기

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

int num;
long long result;

int A[1000000];
vector<int>prime;


int main()
{
	cin.tie(0); cout.tie(0);
	ios::sync_with_stdio(0);

	cin >> num;

	for (int i = 0; i < num; i++)
	{
		A[i] = i + 1;
	}

	for (int i = 2; i <= num; i++)
	{
		int count = 0;
		if (i == 2)
		{
			prime.push_back(i);
			continue;
		}
		for (int j = 2; j < i; j++)
		{
			if (i%j == 0)count++;
		}
		if (count == 0)
		{
			prime.push_back(i);
		}
	}
	cout << prime.size();

	return 0;
}