Untitled
user_5668965
c_cpp
a year ago
509 B
12
Indexable
#include <iostream>
#include <stdio.h>
#include <string>
#include <memory.h>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <time.h>
#include <assert.h>
#include <cmath>
#include <stack>
#include <string.h>
#include <sstream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main()
{
set<int> s;
for(int i=0;i<6;++i){
int x;
cin>>x;
s.insert(x);
}
if(s.size()==4)
puts("4");
else
puts("6");
return 0;
}Editor is loading...
Leave a Comment