Submission #22464079


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i,a,b) for(int i=a;i<b;i++)
 
#define pb                push_back
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))
 
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
//const int num=1e9+1;
 
//******Debugging
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
 
ll n;
vector<vector<ll>>dp;
//******maths
const int mod=1e9+7;
inline ll add(ll x, ll y){ x += y; if(x >= mod) x -= mod; return x;}
inline ll sub(ll x, ll y){ x -= y; if(x < 0) x += mod; return x;}
inline ll mul(ll x, ll y){ return (x * 1ll * y) % mod;}
 

const int num=5e5+5;
char l[num],r[num];
vector<pair<ll,ll>>ans;
map<char,vector<ll>>a,b;
ll binomialCoeff(ll n, ll k)
{
    ll C[k + 1];
    memset(C, 0, sizeof(C));
 
    C[0] = 1; 
 
    for (ll i = 1; i <= n; i++) {
        for (ll j = min(i, k); j > 0; j--)
            C[j] = C[j] + C[j - 1];
    }
    return C[k];
}
void solve(int io)
{
	ll n;
	cin>>n;
	vector<ll>v(n);
	rep(i,0,n)
	cin>>v[i];
	vector<ll>cnt(200);
	for(auto i:v){
		cnt[i%200]++;
	}
	ll ans=0;
	for(auto i:cnt){
		if(i>1){
			ans=ans+i*(i-1)/2;
		}
	}
	cout<<ans<<endl;
}
 
 
int main()
{
	IOS
	using namespace std::chrono;
//	sieve();
	auto startTime=high_resolution_clock::now();
	ll test=1;
//	cin>>test;
	rep(i,0,test){
		solve(i+1);
	}
	auto endTime=high_resolution_clock::now();
	auto duration=duration_cast<seconds>(endTime-startTime);
//	cout<<"Time : "<<duration.count()<<endl;
	
	
}

Submission Info

Submission Time
Task C - Ringo's Favorite Numbers 2
User aman1045
Language C++ (GCC 9.2.1)
Score 300
Code Size 2722 Byte
Status AC
Exec Time 35 ms
Memory 4812 KiB

Compile Error

./Main.cpp: In function ‘void solve(int)’:
./Main.cpp:68:16: warning: unused parameter ‘io’ [-Wunused-parameter]
   68 | void solve(int io)
      |            ~~~~^~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 26
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All extest_01.txt, extest_02.txt, extest_03.txt, extest_04.txt, extest_05.txt, sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt
Case Name Status Exec Time Memory
extest_01.txt AC 35 ms 4744 KiB
extest_02.txt AC 27 ms 4740 KiB
extest_03.txt AC 23 ms 4668 KiB
extest_04.txt AC 23 ms 4664 KiB
extest_05.txt AC 29 ms 4812 KiB
sample_01.txt AC 2 ms 3612 KiB
sample_02.txt AC 2 ms 3504 KiB
sample_03.txt AC 2 ms 3656 KiB
test_01.txt AC 3 ms 3652 KiB
test_02.txt AC 5 ms 3656 KiB
test_03.txt AC 2 ms 3580 KiB
test_04.txt AC 3 ms 3516 KiB
test_05.txt AC 2 ms 3560 KiB
test_06.txt AC 2 ms 3620 KiB
test_07.txt AC 3 ms 3628 KiB
test_08.txt AC 2 ms 3648 KiB
test_09.txt AC 31 ms 4248 KiB
test_10.txt AC 3 ms 3620 KiB
test_11.txt AC 20 ms 3676 KiB
test_12.txt AC 30 ms 4484 KiB
test_13.txt AC 18 ms 4288 KiB
test_14.txt AC 2 ms 3600 KiB
test_15.txt AC 33 ms 4732 KiB
test_16.txt AC 30 ms 4720 KiB
test_17.txt AC 23 ms 4744 KiB
test_18.txt AC 31 ms 4744 KiB