Cod sursa(job #1561886)
Utilizator | Data | 4 ianuarie 2016 17:29:19 | |
---|---|---|---|
Problema | A+B | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
char a[400][400];
int m,n,k,l,p=0,max=0,v,i,j;
ifstream f("woo.in");
f>>n;
for (i=0;i<n;i++)
f>>a[i];
f.close();
p=0;
for (i=0;i<n;i++)
{
while(a[i]==a[j])
{
p++;
k++; l++;
}
if (p>max)
max=p;
}
}
cout<<p<<endl;
return 0;
}