Cod sursa(job #1231710)
Utilizator | Macovei Bogdan BogdanMaco | Data | 21 septembrie 2014 13:20:16 |
---|---|---|---|
Problema | A+B | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <fstream>
using namespace std;
typedef struct nod
{
int nr;
nod *urm;
}NOD;
NOD *prim, *ultim;
void creare(NOD *&prim, NOD *&ultim)
{
ifstream f("adunare.in");
NOD *q;
for(int i=1;i<=2;++i)
{
q=new NOD;
f>>q->nr;
q->urm=NULL;
if(ultim)ultim->urm=q;
else prim=q;
ultim=q;
}
f.close();
}
int suma(NOD *prim)
{
NOD *q;
int S=0;
for(q=prim;q;q=q->urm)
S+=q->nr;
return S;
}
int main()
{
ofstream g("adunare.out");
creare(prim,ultim);
g<<suma(prim);
f.close();
g.close();
return 0;
}