Mai intai trebuie sa te autentifici.
Cod sursa(job #3278640)
Utilizator | Data | 20 februarie 2025 12:52:59 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.74 kb |
#include <fstream>
#include <iostream>
#include <vector>
#include <unordered_map>
#include <queue>
#include <bitset>
#include <string>
using namespace std;
ifstream fin("sponsor.in");
ofstream fout("sponsor.out");
unordered_map<string, int> M;
vector<string> sol = {"IF","OI","LN","AI","MO","PR","IM","AA","DT","DC","EA","IF"};
int main()
{
int task, n;
fin >> task >> n;
fin.get();
for (int i = 1; i <= n; i++)
{
string s;
getline(fin, s);
string aux;
aux += s[0];
aux += s.back();
M[aux]++;
}
int p = 1;
for (auto it : sol)
if (M[it])
p *= M[it], M[it] = 0;
if (task == 1)
fout << p;
return 0;
}