OJ Board

Code: Select all

/*Removed Code */

Code: Select all

import java.util.ArrayList;
import java.util.Scanner;
import java.util.TreeMap;


class cd {
	public cd(){
		
	}
	
	public static void main(String args[]){
        cd c = new cd();
		ArrayList<Long> answer = new ArrayList<Long>();
		TreeMap <Long,Integer> map = new TreeMap<Long,Integer>();
		Scanner sc = new Scanner (System.in);
		int jack=0,jill=0;
		long num=0;
		Long index= 0L;
		jack = sc.nextInt();
		jill = sc.nextInt();
		while(jack!=0|jill!=0){
			num=0;
			index=0L;
			for(int i=0;i<jack;i++){
				index = sc.nextLong();
				if(map.get(index)==null)
					map.put(index, 1);
				else{
					int t = map.get(index)+1;
					map.put(index, t);
				}
			}
			for(int j=0;j<jill;j++){
				index = sc.nextLong();
				if(map.get(index)!=null&&map.get(index)==1)
					num = num+1;
				else if(map.get(index)!=null&&map.get(index)>1){
					num = num + map.get(index);
					map.put(index, 1);
				}
			}
			answer.add(num);
			jack = sc.nextInt();
			jill = sc.nextInt(); 
		}
		for(int i=0;i<answer.size();i++)
			System.out.println(answer.get(i));
	}
	
}

Code: Select all

#include <cstdio>
#include <vector>
#include <iostream>
using namespace std;

int main()
{
	long long n,m;
	while(scanf("%lld %lld",&n,&m)==2)
	{
		 vector <long long> jak, jill;
		if(n==0 && m==0) break;
		long long JA, JI;
		
		for(long long i=0 ; i<n ; i++)
		{
			scanf("%lld",&JA);
			jak.push_back(JA);
		}

		for(long long i=0 ; i<m ; i++)
		{
			scanf("%lld",&JI);
			jill.push_back(JI);
		}
		long long temp=0,sell=0;
		
		if(m>n)
		{
				for(long long i=0 ; i<jill.size() ; i++)
				{
						temp=jill[i];
						for(long long j=0 ; j<jak.size() ; j++)
						{
								if(jak[j]==temp)
								{
										sell++;
								}
								else if(temp>jak[j]) break;
						}
						if(jill[i]>jak[n-1])  break;
				}
		}
		else
		{				
				for(long long i=0 ; i<jak.size() ; i++)
				{
						temp=jak[i];
						for(long long j=0 ; j<jill.size() ; j++)
						{
								if(jill[j]==temp)
								{
										sell++;
								}
								else if(temp>jill[j]) break;
						}
						if(jak[i]>jill[m-1])  break;
				}
		}
		
		printf("%lld\n",sell);
	}
	return 0;	
}

Code: Select all

    #include <cstdio>
    #include <vector>
    #include <iostream>
    using namespace std;

    int main()
    {
       long long n,m;
       while(scanf("%lld %lld",&n,&m)==2)
       {
           vector <long long> jak, jill;
          if(n==0 && m==0) break;
          long long JA, JI;
          
          for(long long i=0 ; i<n ; i++)
          {
             scanf("%lld",&JA);
             jak.push_back(JA);
          }

          for(long long i=0 ; i<m ; i++)
          {
             scanf("%lld",&JI);
             jill.push_back(JI);
          }
          long long sjak=jak.size(), sjil=jill.size();
          long long temp=0,sell=0;
          
          if(m>n)
          {
                for(long long i=0 ; i<sjil ; i++)
                {
                      temp=jill[i];
                      for(long long j=0 ; j<sjak ; j++)
                      {
                            if(jak[j]==temp)
                            {
                                  sell++;
                            }
                            else if(jak[j]>temp) break;
                      }
                      if(jill[i]>jak[n-1])  break;
                }
          }
          else
          {            
                for(long long i=0 ; i<jak.size() ; i++)
                {
                      temp=jak[i];
                      for(long long j=0 ; j<jill.size() ; j++)
                      {
                            if(jill[j]==temp)
                            {
                                  sell++;
                            }
                            else if(jill[j]>temp) break;
                      }
                      if(jak[i]>jill[m-1])  break;
                }
          }
          
          printf("%lld\n",sell);
       }
       return 0;   
    }

Code: Select all

3 3
1
2
3
1
2
4
10 10
2
4
6
8
10
12
14
16
18
20
1
3
5
7
9
11
13
15
17
19
10 10
2
4
6
8
10
12
14
16
18
20
2
4
6
8
10
12
14
16
18
20
10 10
2
5
6
9
10
13
14
17
18
21
2
4
6
8
10
12
14
16
18
20
0 0

Code: Select all

2
0
10
5

Code: Select all

#include<iostream>
#include<cstdio>
#include<map>

using namespace std;
int main()
{
    //freopen("11849in.txt","r",stdin);
    long long int n,m,i,j,count;
     int x;
    map<long int,int>mp;

    while(cin>>n>>m && !(n==0 && m==0))
    {
        mp.clear();
        count=0;
        for(i=0;i<n;i++){cin>>x;mp[x]=1;}
        for(i=0;i<m;i++){cin>>x;if(mp[x]==1)count++;}
        cout<<count<<endl;
    }

}

Code: Select all

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <vector>
#include <stack>
#include <string>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#define pb push_back
#define MAX 1000000
using namespace std;
int main()
{ long long int n,m;
while(scanf("%lld %lld",&n,&m)&& (n ||m))
{ int a,val=0;
map <int,int> check;
for(long long int i=1;i<=n;i++)
{
scanf("%d",&a);
check[a]=1;
}
for(long long int i=1;i<=m;i++)
{
scanf("%d",&a);
if(check[a]==1)
val++;

}
cout<<val<<endl;
}

return 0;
}

Code: Select all

#include<stdio.h>
removed after AC