Cod sursa(job #2345258)
Utilizator | Todasca Daniel SqueekDaniel | Data | 16 februarie 2019 01:57:56 |
---|---|---|---|
Problema | Descompuneri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <bits/stdc++.h>
#define llg long long
#define MAXDIV 10505
#define MAXN 4205
llg N, K, NDiv, Div[MAXDIV];
int DP[MAXN][MAXN];
std::unordered_map <llg, int> Map;
std::ifstream In ("desc.in");
std::ofstream Out("desc.out");
void Citire() {
In >> N >> K;
}
void Rezolvare() {
for (llg div=1; div*div <= N; ++div)
if (N%div == 0) {
if (div != 1)
Div[++NDiv] = div;
if (div != N/div)
Div[++NDiv] = N/div;
} std::sort(Div+1, Div+NDiv+1);
}
int main()
{
Citire();
Rezolvare();
return 0;
}