-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathD.cpp
More file actions
52 lines (52 loc) · 1.06 KB
/
D.cpp
File metadata and controls
52 lines (52 loc) · 1.06 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include<bits/stdc++.h>
#define vi vector<int>
#define mp map<int,int>
#define ump unordered_map <int,int>
#define ll long long int
#define pb push_back
#define mod 1000000007
#define int long long
#define loop(i,x,n) for(int i=x;i<n;i++)
#define rloop(i,n) for(int i=n-1;i>=0;i--)
#define test int t; cin>>t; while(t--)
using namespace std;
/*************************************************************************************************/
void solve()
{
int n,ans=0,x=0;
cin>>n;
int a[n],b[n];
loop(i,0,n)
cin>>a[i];
loop(i,0,n)
cin>>b[i];
long double d;
map<long double,int> m;
loop(i,0,n)
{
if(a[i]==0)
{
if(b[i]==0)
x++;
continue;
}
d=(long double)b[i]/a[i];
m[d]++;
ans=max(ans,m[d]);
}
// for(auto &it:m)
// {
// m[it.first]+=x;
// ans=max(ans,m[it.first]);
// }
cout<<ans+x;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
//test
solve();
return 0;
}