Mai intai trebuie sa te autentifici.
Cod sursa(job #2607407)
Utilizator | Data | 29 aprilie 2020 18:16:01 | |
---|---|---|---|
Problema | Arbore partial de cost minim | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("preordine1.in");
ofstream f2("preordine1.out");
int numbers[1005], i, nr = 0, st[1005], cred[1005];
int main()
{
while(f >> numbers[i]){
i++;
nr++;
}
return 0;
}