Cod sursa(job #385088)
| Utilizator | Data | 22 ianuarie 2010 08:03:09 | |
|---|---|---|---|
| Problema | A+B | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | lucrare_xi_d | Marime | 0.46 kb |
#include<iostream.h>
#include<fstream.h>
int i,n,f;
int MAX=0;
ifstream f("date.in");
int main (){
struct abonat{
double factura;
char nume[20];
char tel[20];
} v[100];
int char num[20];
f>>n;
for(i=1;i<=n;i++){
f>>v[i].nume>>v[i].tel>>v[i].factura;
//cout<<v[i].tel;
}
//for(i=1;i<=n;i++){
//f>>v[i].tel;
// cout<<v[i].nume;
}
//MAX=v[i].factura;
//for(i=1;i<=n;i++)
//if(v[1].factura<v[2].factura)
return 0;
}