Codeforces Round #229

 1 #include<iostream>
 2 #include<string.h>
 3 #include<set>
 4 using namespace std;
 5 
 6 set<int>s1,s2;
 7 
 8 int main()
 9 {
10     int n,a,b;
11     while(cin>>n)
12     {
13         s1.clear();
14         s2.clear();
15         while(n--)
16         {
17             cin>>a>>b;
18             s1.insert(a);
19             s2.insert(b);
20         }
21         int mm=s1.size();
22         int nn=s2.size();
23         cout<<min(mm,nn)<<endl;
24     }
25     return 0;
26 }

 1 #include<iostream>
 2 #include<string.h>
 3 #include<set>
 4 #include<stdio.h>
 5 using namespace std;
 6 
 7 long long int a[100001],b[100001];
 8 
 9 int main()
10 {
11     long long int n,i;
12     while(cin>>n)
13     {
14         for(i=0;i<n;i++)
15             cin>>a[i];
16         for(i=0;i<n;i++)
17             cin>>b[i];
18         long long int sum=0;
19         for(i=0;i<n;i++)
20         {
21             if(a[i]+a[i]<b[i]||b[i]==1)
22                 sum-=1;
23             else
24             {
25                 long long int mm=b[i]/2;
26                 long long int nn=b[i]-mm;
27                 sum+=mm*nn;
28             }
29         }
30         cout<<sum<<endl;
31     }
32     return 0;
33 }