# 0001, 2024-10-15 09:12:44, ---T (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int K,s,cnt = 0;
set<int> S;
cin >> K;
while(cin >> s){
S.insert(s);
}
for(auto const & a : S ){
for(auto const & b : S){
if(a + b == K){
cnt ++;
}}
}
cout << cnt;
} | # 0002, 2024-10-15 09:15:20, --TT (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int K,s,cnt = 0;
set<int> S;
cin >> K;
while(cin >> s){
S.insert(s);
}
for(auto const & a : S ){
for(auto const & b : S){
auto it1 = S.find(a);
auto it2 = S.find(b);
if(*it1 + *it2 == K){
cnt ++;
break;
}}
}
cout << cnt;
} | # 0003, 2024-10-15 09:23:51, ---T (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int K,s,cnt = 0;
set<int> S;
cin >> K;
while(cin >> s){
S.insert(s);
}
bool found = false;
for(auto const & a : S ){
for(auto const & b : S){
if(a + b == K){
found = true;
if(found){
cnt ++;
break;}
}
}
}
cout << cnt;
} | # 0004, 2024-10-15 09:27:49, ---- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int K,s,cnt = 0;
set<int> S;
cin >> K;
while(cin >> s){
S.insert(s);
}
auto a = S.find(s);
auto b = S.find (s);
for( auto& ch : S){
if(b != S.end()){
if(ch + *b == K ){
cnt++;
break;
}
}
}
cout << cnt;
} | # 0005, 2024-10-15 09:38:04, ---- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int K,s,cnt = 0;
set<int> S;
cin >> K;
while(cin >> s){
S.insert(s);
}
auto a = S.find(s);
for(auto p : S){
auto b = S.find(p);
if(b != S.end() && p + *b == K ){
cnt++;
}
}
std::cout << cnt;
} | # 0006, 2024-10-15 09:38:26, --TT (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int K,s,cnt = 0;
set<int> S;
cin >> K;
while(cin >> s){
S.insert(s);
for(auto p : S){
auto b = S.find(p);
if(b != S.end() && p + *b == K ){
cnt++;
}
}
}
std::cout << cnt;
} | # 0007, 2024-10-15 09:39:55, Compilation error (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int K,s,cnt = 0;
set<int> S;
cin >> K;
while(cin >> s){
S.insert(s);
}
for(auto p : S){
if(p + p == K){
auto b = S.find(p);}
if( p + *b == K ){
cnt++;
}
}
std::cout << cnt;
} | # 0008, 2024-10-15 09:44:49, PPTT (50%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int K,s,cnt = 0;
set<int> S;
cin >> K;
while(cin >> s){
S.insert(s);
}
for(auto const & a : S ){
for(auto const & b : S){
auto it1 = S.find(a);
auto it2 = S.find(b);
if(*it1 + *it2 == K){
cnt ++;
}}
}
cout << cnt/2;
} | # 0009, 2024-10-15 09:46:41, ---- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int K,s,cnt = 0;
set<int> S;
cin >> K;
while(cin >> s){
S.insert(s);
}
for(auto const & a : S ){
int sub = K -a;
auto it1 = S.find(sub);
if( it1 != S.end()){
cnt ++;
}}
cout << cnt;
} | # 0010, 2024-10-15 09:47:55, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int K,s,cnt = 0;
set<int> S;
cin >> K;
while(cin >> s){
S.insert(s);
}
for(auto const & a : S ){
int sub = K -a;
auto it1 = S.find(sub);
if( it1 != S.end()){
cnt ++;
}
}
cout << cnt/2;
} |
# 0011, 2024-10-15 09:21:27, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main ()
{
long long sum,x,c = 0;
cin>>sum;
set<long long> s;
while(cin>>x)
{
if(abs(x)<=sum)
{
s.insert(x);
}
}
for(auto n:s)
{
if(s.find(sum-n)!=s.end())
{
c++;
}
}
cout<<c;
return 0;
} | # 0012, 2024-10-15 09:22:57, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main ()
{
long long sum,x,c = 0;
cin>>sum;
set<long long> s;
while(cin>>x)
{
if(abs(x)<=sum)
{
s.insert(x);
}
}
for(auto n:s)
{
if(s.find(sum-n)!=s.end())
{
c++;
}
}
cout<<(c>>1);
return 0;
} | # 0013, 2024-10-15 09:34:45, -PPP (75%)
#include<bits/stdc++.h>
using namespace std;
int main ()
{
long long sum,x,c = 0,maxx = 0;
cin>>sum;
set<long long> s;
while(cin>>x)
{
if(abs(x)<=sum)
{
s.insert(x);
maxx = max(x,maxx);
}
}
bool chk[maxx+1];
memset(chk,false,maxx+1);
for(auto n:s)
{
chk[n] = true;
}
for(auto n:s)
{
if(chk[sum-n])
{
c++;
}
}
cout<<(c>>1);
return 0;
} | # 0014, 2024-10-15 09:36:37, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main ()
{
long long sum,x,c = 0,maxx = 0;
cin>>sum;
set<long long> s;
while(cin>>x)
{
if(abs(x)<=sum)
{
s.insert(x);
maxx = max(x,maxx);
}
}
bool chk[maxx+1];
memset(chk,false,maxx+1);
for(auto n:s)
{
chk[n] = true;
}
for(auto n:s)
{
if(chk[sum-n])
{
c++;
}
}
cout<<c;
return 0;
} | # 0015, 2024-10-15 09:37:42, -PPP (75%)
#include<bits/stdc++.h>
using namespace std;
int main ()
{
long long sum,x,c = 0,maxx = 0;
cin>>sum;
set<long long> s;
while(cin>>x)
{
if(abs(x)<=sum)
{
s.insert(x);
maxx = max(x,maxx);
}
}
bool chk[maxx+1];
memset(chk,false,sizeof(chk));
for(auto n:s)
{
chk[n] = true;
}
for(auto n:s)
{
if(chk[sum-n])
{
c++;
}
}
cout<<c/2;
return 0;
} | # 0016, 2024-10-15 09:38:28, -PPP (75%)
#include<bits/stdc++.h>
using namespace std;
int main ()
{
long long sum,x,c = 0,maxx = 1;
cin>>sum;
set<long long> s;
while(cin>>x)
{
if(abs(x)<=sum)
{
s.insert(x);
maxx = max(x,maxx);
}
}
bool chk[maxx+1];
memset(chk,false,sizeof(chk));
for(auto n:s)
{
chk[n] = true;
}
for(auto n:s)
{
if(chk[sum-n])
{
c++;
}
}
cout<<c/2;
return 0;
} | # 0017, 2024-10-15 09:41:16, -PPP (75%)
#include<bits/stdc++.h>
using namespace std;
int main ()
{
long long sum,x,c = 0,maxx = 1;
cin>>sum;
set<long long> s;
while(cin>>x)
{
if(abs(x)<=sum)
{
s.insert(x);
maxx = max(x,maxx);
}
}
bool chk[maxx+1];
for(long long i=0;i<=maxx;i++)
{
chk[i] = false;
}
for(auto n:s)
{
chk[n] = true;
}
for(auto n:s)
{
if(chk[sum-n])
{
c++;
}
}
cout<<c/2;
return 0;
} | # 0018, 2024-10-15 09:44:48, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main ()
{
long long sum,x,c = 0;
cin>>sum;
set<long long> s;
map<long long,bool> mp;
while(cin>>x)
{
if(abs(x)<=sum)
{
s.insert(x);
mp[x] = true;
}
}
for(auto n:s)
{
if(mp[sum-n])
{
c++;
}
}
cout<<(c>>1);
return 0;
} | # 0019, 2024-10-15 09:51:38, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main ()
{
long long sum,x,c = 0;
cin>>sum;
set<long long> s;
while(cin>>x)
{
if(abs(x)<=sum)
{
s.insert(x);
}
}
long long r = (s.size()>>1),i = 0;
set<long long>::iterator it = s.begin();
while(i<=r)
{
if(s.find(sum - *it)!=s.end())
{
c++;
}
i++;
it++;
}
cout<<c;
return 0;
} |
# 0020, 2024-10-15 09:15:53, Compilation error (0%)
#include <iostream>
#include <set>
#include <sstream>
int main() {
int amt;
std::cin >> amt;
std::vector<int> nums;
std::cin.ignore();
std::string inp;
std::getline(std::cin, inp);
std::stringstream stream(inp);
std::string tmp;
while (stream >> tmp) {
nums.push_back(std::stoi(tmp));
}
int cnt = 0;
for (int i = 0; i < nums.size(); ++i) {
for (int j = i; j < nums.size(); ++j) {
if (nums[i] + nums[j] == amt)
++cnt;
}
}
std::cout << cnt;
} | # 0021, 2024-10-15 09:16:07, -PPT (50%)
#include <iostream>
#include <sstream>
#include <vector>
int main() {
int amt;
std::cin >> amt;
std::vector<int> nums;
std::cin.ignore();
std::string inp;
std::getline(std::cin, inp);
std::stringstream stream(inp);
std::string tmp;
while (stream >> tmp) {
nums.push_back(std::stoi(tmp));
}
int cnt = 0;
for (int i = 0; i < nums.size(); ++i) {
for (int j = i; j < nums.size(); ++j) {
if (nums[i] + nums[j] == amt)
++cnt;
}
}
std::cout << cnt;
} | # 0022, 2024-10-15 09:16:34, ---T (0%)
#include <iostream>
#include <sstream>
#include <vector>
int main() {
int amt;
std::cin >> amt;
std::vector<int> nums;
std::cin.ignore();
std::string inp;
std::getline(std::cin, inp);
std::stringstream stream(inp);
std::string tmp;
while (stream >> tmp) {
nums.push_back(std::stoi(tmp));
}
int cnt = 0;
for (int i = 0; i < nums.size(); ++i) {
for (int j = 0; j < nums.size(); ++j) {
if (nums[i] + nums[j] == amt)
++cnt;
}
}
std::cout << cnt;
} | # 0023, 2024-10-15 09:17:48, -PPT (50%)
#include <iostream>
#include <sstream>
#include <vector>
int main() {
int amt;
std::cin >> amt;
std::vector<int> nums;
std::cin.ignore();
std::string inp;
std::getline(std::cin, inp);
std::stringstream stream(inp);
std::string tmp;
while (stream >> tmp) {
nums.push_back(std::stoi(tmp));
}
int cnt = 0;
for (int i = 0; i < nums.size(); ++i) {
for (int j = i; j < nums.size(); ++j) {
if ((nums[i] + nums[j]) == amt)
++cnt;
}
}
std::cout << cnt;
} | # 0024, 2024-10-15 09:19:20, PPPT (75%)
#include <iostream>
#include <sstream>
#include <vector>
int main() {
int amt;
std::cin >> amt;
std::vector<int> nums;
std::cin.ignore();
std::string inp;
std::getline(std::cin, inp);
std::stringstream stream(inp);
std::string tmp;
while (stream >> tmp) {
nums.push_back(std::stoi(tmp));
}
int cnt = 0;
for (int i = 0; i < nums.size(); ++i) {
for (int j = i + 1; j < nums.size(); ++j) {
if ((nums[i] + nums[j]) == amt)
++cnt;
}
}
std::cout << cnt;
} | # 0025, 2024-10-15 09:27:19, PTTT (25%)
#include <iostream>
#include <set>
#include <sstream>
int main() {
int amt;
std::cin >> amt;
std::set<int> nums;
std::cin.ignore();
std::string inp;
std::getline(std::cin, inp);
std::stringstream stream(inp);
std::string tmp;
bool haveZero = false;
while (stream >> tmp) {
int tmp_int = std::stoi(tmp);
if (tmp_int > amt) continue;
nums.insert(tmp_int);
if (tmp_int == 0)
haveZero = true;
}
int cnt = 0;
for (int i = 0; i < nums.size(); ++i) {
for (int j = i + 1; j < nums.size(); ++j) {
if ((*std::next(nums.begin(), i) + *std::next(nums.begin(), j)) == amt)
++cnt;
}
}
std::cout << cnt;
} | # 0026, 2024-10-15 09:29:19, PPPT (75%)
#include <iostream>
#include <sstream>
#include <vector>
int main() {
int amt;
std::cin >> amt;
std::vector<int> nums;
std::cin.ignore();
std::string inp;
std::getline(std::cin, inp);
std::stringstream stream(inp);
std::string tmp;
bool haveZero = false;
while (stream >> tmp) {
int tmp_int = std::stoi(tmp);
for (int i = 0; i < nums.size(); ++i)
if (nums[i] == tmp_int) continue;
if (tmp_int > amt) continue;
nums.push_back(tmp_int);
if (tmp_int == 0)
haveZero = true;
}
int cnt = 0;
for (int i = 0; i < nums.size(); ++i) {
for (int j = i + 1; j < nums.size(); ++j) {
if ((nums[i] + nums[j]) == amt)
++cnt;
}
}
std::cout << cnt;
} | # 0027, 2024-10-15 09:35:28, PPPP (100%)
#include <iostream>
#include <sstream>
#include <unordered_set>
int main() {
int amt;
std::cin >> amt;
std::unordered_set<int> nums;
std::unordered_set<int> seen_complements;
std::cin.ignore();
std::string inp;
std::getline(std::cin, inp);
std::stringstream stream(inp);
std::string tmp;
int cnt = 0;
while (stream >> tmp) {
int tmp_int = std::stoi(tmp);
if (tmp_int > amt) continue;
if (seen_complements.count(tmp_int))
++cnt;
seen_complements.insert(amt - tmp_int);
nums.insert(tmp_int);
}
std::cout << cnt;
} |
# 0028, 2024-10-15 09:10:43, Compilation error (0%)
#include<iostream>
#include<set>
using namespace ; std
int main(){
int K; cin>>K;
set<int> d;
int e;
while (cin >> e){
d.in
}
} | # 0029, 2024-10-15 09:15:33, Compilation error (0%)
#include<iostream>
#include<set>
using namespace ; std
int main(){
int K; cin>>K;
set<int> d;
int e;
while (cin >> e){
d.insert(e);
}
int c = 0;
for (int e : d){
if(d.find(K-e) != d.end())
++c;
}
cout << c/2;
} | # 0030, 2024-10-15 09:17:26, Compilation error (0%)
#include<iostream>
#include<set>
using namespace ; std
int main(){
int K; cin>>K;
set<int> d;
int e;
while (cin >> e){
d.insert(e);
}
int c = 0;
for (int e : d){
if(e >= K-e) break;
if(d.find(K-e) != d.end())
++c;
}
cout << c/2;
} | # 0031, 2024-10-15 09:18:17, ---- (0%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int K; cin>>K;
set<int> d;
int e;
while (cin >> e){
d.insert(e);
}
int c = 0;
for (int e : d){
if(e >= K-e) break;
if(d.find(K-e) != d.end())
++c;
}
cout << c/2;
} | # 0032, 2024-10-15 09:21:40, Compilation error (0%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int K; cin>>K;
vector<int> d;
int e;
while (cin >> e){
d.insert(e);
}
int c = 0;
for (int e : d){
//if(e >= K-e) break;
if(d.find(K-e) != d.end())
++c;
}
cout << c/2;
} | # 0033, 2024-10-15 09:22:41, Compilation error (0%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int K; cin>>K;
vector<int> d;
int e;
while (cin >> e){
d.insert(e);
}
int c = 0;
for (int e : d){
//if(e >= K-e) break;
if(d.find(K-e) != d.end())
++c;
}
cout << c/2;
} | # 0034, 2024-10-15 09:25:52, ---- (0%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int K; cin>>K;
set<int> d;
int e;
while (cin >> e){
d.insert(e);
}
int c = 0;
for (int e : d){
if(e >= K-e) break;
if(d.find(K-e) != d.end())
++c;
}
cout << c/2;
} | # 0035, 2024-10-15 09:37:23, PPPP (100%)
#include<iostream>
#include<set>
using namespace std;
int main() {
int K;
cin >> K; // Target sum
set<int> d;
int e;
// Reading input values and inserting into the set
while (cin >> e) {
d.insert(e);
}
int c = 0; // Pair count
for (int e : d) {
// If K-e exists and it's different from e (or if it's equal, there should be two of them)
if (e < K - e && d.find(K - e) != d.end()) {
++c;
}
}
cout << c << endl;
} |
# 0036, 2024-10-15 09:21:33, Compilation error (0%)
#include<bits++/stdc.h>
using namespace std;
int main() {
int n; cin >> n;
set<long long int> number;
int num;
while (cin >> num) {
number.insert(num);
}
int rep = 0;
for (int index:number) {
int delta = n-index;
if (number.find(delta) != number.end()) {
rep++;
}
}
cout >> rep;
} | # 0037, 2024-10-15 09:23:11, Compilation error (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
set<long long int> number;
int num;
while (cin >> num) {
number.insert(num);
}
int rep = 0;
for (int index:number) {
int delta = n-index;
if (number.find(delta) != number.end()) {
rep++;
}
}
cout >> rep;
} | # 0038, 2024-10-15 09:24:35, Compilation error (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
set<int> number;
int num;
while (cin >> num) {
number.insert(num);
}
int rep = 0;
for (int index:number) {
int delta = n-index;
if (number.find(delta) != number.end()) {
rep++;
}
}
cout >> rep;
} | # 0039, 2024-10-15 09:25:11, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
set<int> number;
int num;
while (cin >> num) {
number.insert(num);
}
int rep = 0;
for (int index:number) {
int delta = n-index;
if (number.find(delta) != number.end()) {
rep++;
}
}
cout << rep;
} | # 0040, 2024-10-15 09:26:17, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
set<int> number;
int num;
while (cin >> num) {
number.insert(num);
}
int rep = 0;
for (int index:number) {
int delta = abs(n-index);
if (number.find(delta) != number.end()) {
rep++;
}
}
cout << rep;
} | # 0041, 2024-10-15 09:29:23, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
set<int> number;
int num;
while (cin >> num) {
number.insert(num);
}
int rep = 0;
for (int index:number) {
int delta = abs(n-index);
if (number.find(delta) != number.end()) {
rep++;
}
number.insert(index);
}
cout << rep;
} | # 0042, 2024-10-15 09:31:04, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
set<int> number;
int num;
while (cin >> num) {
number.insert(num);
}
int rep = 0;
for (int index:number) {
int delta = abs(n-index);
if (number.find(delta) != number.end()) {
rep++;
}
}
cout << rep;
} | # 0043, 2024-10-15 09:31:58, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
set<int> number;
int num;
while (cin >> num) {
number.insert(num);
}
int rep = 0;
for (int index:number) {
int delta = abs(n-index);
if (number.find(delta) != number.end()) {
rep++;
}
}
cout << rep/2;
} |
# 0044, 2024-10-15 09:22:18, Compilation error (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int k; cin >> k;
set<int> allNum;
int num;
while(cin >> num) {
if(num <= k) {
allNum.insert(num);
}
}
int count = 0;
int numSize = allNum.size()-1;
for(int i = 0; i < numSize; ++i){
int diff = k - allNum[i];
if(allNum.find(diff) != allNum.end()) {
count++;
allNum.erase(diff);
numSize--;
}
}
cout << count; | # 0045, 2024-10-15 09:28:49, -PPP (75%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int k; cin >> k;
set<int> allNum;
int num;
while(cin >> num) {
if(num <= k) {
allNum.insert(num);
}
}
int count = 0;
int numSize = allNum.size()-1;
for(auto c : allNum){
int diff = k - c;
if(allNum.find(diff) != allNum.end()) {
count++;
allNum.erase(diff);
}
}
cout << count;
} | # 0046, 2024-10-15 09:30:30, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int k; cin >> k;
set<int> allNum;
int num;
while(cin >> num) {
if(num <= k) {
allNum.insert(num);
}
}
int count = 0;
int numSize = allNum.size()-1;
for(auto c : allNum){
int diff = k - c;
if(allNum.find(diff) != allNum.end()) {
count++;
//allNum.erase(diff);
}
}
cout << count/2;
} | # 0047, 2024-10-15 09:42:02, -PPP (75%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int k; cin >> k;
set<int> allNum;
int num;
while(cin >> num) {
if(num <= k) {
allNum.insert(num);
}
}
int count = 0;
int numSize = allNum.size();
for(auto c : allNum){
int diff = k - c;
if(allNum.find(diff) != allNum.end()) {
count++;
allNum.erase(diff);
}
}
cout << count;
} | # 0048, 2024-10-15 09:43:38, xxxx (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int k; cin >> k;
set<int> allNum;
int num;
while(cin >> num) {
if(num <= k) {
allNum.insert(num);
}
}
int count = 0;
int numSize = allNum.size();
for(auto c : allNum){
int diff = k - c;
allNum.erase(c);
if(allNum.find(diff) != allNum.end()) {
count++;
allNum.erase(diff);
}
allNum.insert(c);
}
cout << count;
} | # 0049, 2024-10-15 09:44:43, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int k; cin >> k;
set<int> allNum;
int num;
while(cin >> num) {
if(num <= k) {
allNum.insert(num);
}
}
int count = 0;
int numSize = allNum.size()-1;
for(auto c : allNum){
int diff = k - c;
if(allNum.find(diff) != allNum.end()) {
count++;
}
}
cout << count/2;
} | # 0050, 2024-10-15 09:50:07, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int k; cin >> k;
set<int> allNum;
int num;
while(cin >> num) {
if(num <= k) {
allNum.insert(num);
}
}
int count = 0;
set<int> copy(allNum);
for(auto c : allNum){
int diff = k - c;
copy.erase(c);
if(copy.find(diff) != copy.end()) {
count++;
allNum.erase(diff);
}
}
cout << count;
} |
# 0051, 2024-10-15 09:06:34, ---T (0%)
#include<iostream>
#include<vector>
#include<set>
using namespace std;
int main(){
int k; cin >> k;
int num;
set<int> s;
vector<int> v;
while(cin >> num) s.insert(num);
for(auto x : s) v.push_back(x);
for(int i=0;i<v.size();i++){
for(int j=i+1;j<v.size();j++){
if(v[i]+v[j] == k) cout << v[i] << "+" << v[j] << " = " << v[i]+v[j] << "\n";
}
}
return 0;
} | # 0052, 2024-10-15 09:07:39, ---T (0%)
#include<iostream>
#include<vector>
#include<set>
using namespace std;
int main(){
int k; cin >> k;
long long int num;
set<long long int> s;
vector<long long int> v;
while(cin >> num) s.insert(num);
for(auto x : s) v.push_back(x);
for(int i=0;i<v.size();i++){
for(int j=i+1;j<v.size();j++){
if(v[i]+v[j] == k) cout << v[i] << "+" << v[j] << " = " << v[i]+v[j] << "\n";
}
}
return 0;
} | # 0053, 2024-10-15 09:13:07, PPPT (75%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int k; cin >> k;
set<int> s;
int cnt=0,num;
while(cin >> num){
if(s.find(num) == s.end()){
for(auto x : s){
if(num+x == k) cnt++;
}
s.insert(num);
}
}
cout << cnt;
return 0;
} | # 0054, 2024-10-15 09:14:08, PPPT (75%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int k; cin >> k;
set<int> s;
int cnt=0,num;
while(cin >> num){
if(s.find(num) == s.end()){
for(auto x : s){
if(num+x > k) break;
if(num+x == k) cnt++;
}
s.insert(num);
}
}
cout << cnt;
return 0;
} | # 0055, 2024-10-15 09:23:43, PPPT (75%)
#include<iostream>
#include<vector>
#include<set>
using namespace std;
int main(){
int k; cin >> k;
vector<int> v;
set<int> s;
int cnt=0,num;
while(cin >> num) s.insert(num);
for(auto x : s) v.push_back(x);
for(int i=0;i<v.size();i++){
// cout << v[i] << " : ";
for(int j=i+1;j<v.size();j++){
// cout << v[j] << " ";
if(v[i]+v[j] > k) break;
if(v[i]+v[j] == k) cnt++;
}
// cout << "\n";
}
cout << cnt;
return 0;
} | # 0056, 2024-10-15 09:26:29, -PPP (75%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int k; cin >> k;
set<int> s;
int cnt=0,num;
while(cin >> num){
s.insert(num);
if(s.find(k-num) != s.end()) cnt++;
}
cout << cnt;
return 0;
} | # 0057, 2024-10-15 09:28:02, PPPP (100%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int k; cin >> k;
set<int> s;
int cnt=0,num;
while(cin >> num){
s.insert(num);
if(s.find(k-num) != s.end() && k-num != num) cnt++;
}
cout << cnt;
return 0;
} |
# 0058, 2024-10-15 09:15:37, Compilation error (0%)
#include <bits/stdc++.h>
using namepsace std;
int main(){
int k;
cin>> k;
set<int> num;
int input;
while (cin >> input){
if(input <= k)
{num.insert(input);}
}
int cnt = 0;
for (auto n : num) {
if(num.find(k-n) != num.end()) {
cnt++;
num.erase(n);
num.erase(k-n);
}
}
} | # 0059, 2024-10-15 09:16:07, xxxx (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int k;
cin>> k;
set<int> num;
int input;
while (cin >> input){
if(input <= k)
{num.insert(input);}
}
int cnt = 0;
for (auto n : num) {
if(num.find(k-n) != num.end()) {
cnt++;
num.erase(n);
num.erase(k-n);
}
}
} | # 0060, 2024-10-15 09:19:04, xxxx (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int k;
cin>> k;
set<int> num;
int input;
while (cin >> input){
if(input <= k)
{num.insert(input);}
}
int cnt = 0;
for (auto n : num) {
if(num.find(k-n) != num.end()) {
cnt++;
num.erase(n);
num.erase(k-n);
}
}
cout << cnt;
} | # 0061, 2024-10-15 09:20:57, ---- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int k;
cin>> k;
set<int> num,used;
int input;
while (cin >> input){
if(input <= k)
{num.insert(input);}
}
int cnt = 0;
for (auto n : num) {
if(num.find(k-n) != num.end() && used.find(n) != used.end()) {
cnt++;
used.insert(k-n);
}
}
cout << cnt;
} | # 0062, 2024-10-15 09:21:29, ---- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int k;
cin>> k;
set<int> num,used;
int input;
while (cin >> input){
if(input <= k)
{num.insert(input);}
}
int cnt = 0;
for (auto n : num) {
if(num.find(k-n) != num.end() && used.find(k-n) != used.end()) {
cnt++;
used.insert(k-n);
}
}
cout << cnt;
} | # 0063, 2024-10-15 09:36:03, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int k;
cin >> k;
set<int> num, used;
int input;
while (cin >> input)
{
if (input <= k)
{
num.insert(input);
}
}
int cnt = 0;
for (auto n : num)
{
if (num.find(k - n) != num.end() && used.find(n) == used.end())
{
cnt++;
used.insert(k - n);
used.insert(n);
}
}
cout << cnt;
} | # 0064, 2024-10-15 09:38:52, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int k;
cin >> k;
set<int> num, used;
int input;
while (cin >> input)
{
if (input <= k)
{
num.insert(input);
}
}
for (auto n : num)
{
if (num.find(k - n) != num.end() && used.find(n) == used.end())
{
used.insert(k - n);
used.insert(n);
}
}
cout << int(used.size() / 2);
} |
# 0065, 2024-10-15 09:12:56, Compilation error (0%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
set<ll> st;
int point,a;
cin >> point;
while<cin>>a){
if(a>=point)continue;
st.insert(a);
}
a =0;
for(auto &x:st){
if(st.find != st.end()){
a++;
}
}
cout << a;
} | # 0066, 2024-10-15 09:13:39, Compilation error (0%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
set<ll> st;
int point,a;
cin >> point;
while<cin>>a){
if(a>=point)continue;
st.insert(a);
}
a =0;
for(auto &x:st){
if(st.find(point-x) != st.end()){
a++;
}
}
cout << a;
} | # 0067, 2024-10-15 09:13:56, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
set<ll> st;
int point,a;
cin >> point;
while(cin>>a){
if(a>=point)continue;
st.insert(a);
}
a =0;
for(auto &x:st){
if(st.find(point-x) != st.end()){
a++;
}
}
cout << a;
} | # 0068, 2024-10-15 09:17:36, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
set<ll> st;
ll point,a;
cin >> point;
while(cin>>a){
if(a>=point)continue;
st.insert(a);
}
a =0;
for(auto &x:st){
if(st.find(point-x) != st.end()){
a++;
}
}
cout << a;
} | # 0069, 2024-10-15 09:18:26, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
set<ll> st;
ll point,a;
cin >> point;
while(cin>>a){
if(a>=point)continue;
st.insert(a);
}
a =0;
for(auto &x:st){
if(st.find(point-x) != st.end()){
a++;
}
}
cout << a;
} | # 0070, 2024-10-15 09:20:10, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
set<ll> st;
ll point = 0,a = 0;
cin >> point;
while(cin>>a){
if(a>=point)continue;
st.insert(a);
}
a =0;
for(auto &x:st){
if(st.find(point-x) != st.end()){
a++;
}
}
cout << a;
} | # 0071, 2024-10-15 09:23:10, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
set<ll> st;
ll point = 0,a = 0;
cin >> point;
while(cin>>a){
if(a>=point)continue;
st.insert(a);
}
a =0;
for(auto &x:st){
if(st.find(point-x) != st.end()){
a++;
}
}
cout << a/2;
} |
# 0072, 2024-10-15 09:08:49, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
set<int> num;
int value;
while(cin>>value){
num.insert(value);
}
for(int i = 0;i<num.size()/2;i++){
if(num.find(i)!=num.end() && num.find(n-i) != num.end()){
cout << i << "+" << n-i <<" = "<<n << endl;
}
}
} | # 0073, 2024-10-15 09:11:05, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
set<int> num;
int value;
while(cin>>value){
num.insert(value);
}
int counting = 0;
for(int i = 0;i<num.size()/2;i++){
if(num.find(i)!=num.end() && num.find(n-i) != num.end()){
counting +=1;
}
}
cout << counting<<endl;
for(int i = 0;i<num.size()/2;i++){
if(num.find(i)!=num.end() && num.find(n-i) != num.end()){
cout << i << "+" << n-i <<" = "<<n << endl;
}
}
} | # 0074, 2024-10-15 09:11:47, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
set<int> num;
int value;
while(cin>>value){
num.insert(value);
}
int counting = 0;
for(int i = 0;i<num.size()/2;i++){
if(num.find(i)!=num.end() && num.find(n-i) != num.end()){
counting +=1;
}
}
cout << counting<<endl;
for(int i = 0;i<num.size()/2;i++){
if(num.find(i)!=num.end() && num.find(n-i) != num.end()){
cout << i << "+" << n-i <<" = "<<n << endl;
}
}
} | # 0075, 2024-10-15 09:12:59, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
set<int> num;
int value;
while(cin>>value){
num.insert(value);
}
int counting = 0;
for(int i = 0;i<num.size()/2;i++){
if(num.find(i)!=num.end() && num.find(n-i) != num.end()){
counting +=1;
}
}
cout << counting<<endl;
/*
for(int i = 0;i<num.size()/2;i++){
if(num.find(i)!=num.end() && num.find(n-i) != num.end()){
cout << i << "+" << n-i <<" = "<<n << endl;
}
}
*/
} | # 0076, 2024-10-15 09:15:18, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n; cin >> n;
set<int> num;
long long int value;
while(cin>>value){
num.insert(value);
}
long long int counting = 0;
for(long long int i = 0;i<num.size()/2;i++){
if(num.find(i)!=num.end() && num.find(n-i) != num.end()){
counting +=1;
}
}
cout << counting<<endl;
/*
for(int i = 0;i<num.size()/2;i++){
if(num.find(i)!=num.end() && num.find(n-i) != num.end()){
cout << i << "+" << n-i <<" = "<<n << endl;
}
}
*/
} | # 0077, 2024-10-15 09:16:31, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n; cin >> n;
set<int> num;
long long int value;
while(cin>>value){
num.insert(value);
}
long long int counting = 0;
for(long long int i = 0;i<num.size()/2;i++){
if(num.find(i)!=num.end() && num.find(n-i) != num.end()){
counting +=1;
}
}
cout << counting<<endl;
for(int i = 0;i<num.size()/2;i++){
if(num.find(i)!=num.end() && num.find(n-i) != num.end()){
cout << i << "+" << n-i <<" = "<<n << endl;
}
}
} | # 0078, 2024-10-15 09:24:42, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n; cin >> n;
set<int> num;
long long int value;
while(cin>>value){
num.insert(value);
}
long long int counting = 0;
for(auto c : num){
if(num.find(n-c) != num.end()) counting += 1;
}
cout << counting/2<<endl;
/*
for(int i = 0;i<num.size()/2;i++){
if(num.find(i)!=num.end() && num.find(n-i) != num.end()){
cout << i << "+" << n-i <<" = "<<n << endl;
}
}
*/
} |
# 0079, 2024-10-15 09:14:07, PPPT (75%)
#include <iostream>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main() {
int Num, tmp;
int count = 0;
set<int> S;
cin >> Num;
while(cin >> tmp) {
int C = 0;
for(auto & a : S) {
int Sum = tmp;
Sum += a;
if(Sum == Num) {
C++;
count++;
break;
}
}
if(C == 0) {
if(tmp < Num) {
S.insert(tmp);
}
}
}
if(count != 0) {
cout<<count;
}
} | # 0080, 2024-10-15 09:15:03, PPPT (75%)
#include <iostream>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main() {
int Num, tmp;
int count = 0;
set<int> S;
cin >> Num;
while(cin >> tmp) {
int C = 0;
for(auto & a : S) {
int Sum = tmp;
Sum += a;
if(Sum == Num) {
C++;
count++;
break;
}
if(Sum > Num) {
break;
}
}
if(C == 0) {
if(tmp < Num) {
S.insert(tmp);
}
}
}
if(count != 0) {
cout<<count;
}
} | # 0081, 2024-10-15 09:18:00, PPPT (75%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int Num, tmp;
int count = 0;
set<int> S;
cin >> Num;
while(cin >> tmp) {
int C = 0;
for(auto & a : S) {
int Sum = tmp;
Sum += a;
if(Sum == Num) {
C++;
count++;
S.erase(a);
break;
}
}
if(C == 0) {
if(tmp < Num) {
S.insert(tmp);
}
}
}
if(count != 0) {
cout<<count;
}
} | # 0082, 2024-10-15 09:19:29, PPPT (75%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int Num, tmp;
int count = 0;
set<int> S;
cin >> Num;
while(cin >> tmp) {
if(tmp < Num) {
int C = 0;
for(auto & a : S) {
int Sum = tmp;
Sum += a;
if(Sum == Num) {
C++;
count++;
S.erase(a);
break;
}
}
if(C == 0) {
S.insert(tmp);
}
}
}
if(count != 0) {
cout<<count;
}
} | # 0083, 2024-10-15 09:24:51, PPPT (75%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int Num, tmp;
int count = 0;
set<int> S;
cin >> Num;
while(cin >> tmp) {
if(tmp < Num) {
int C = 0;
for(auto & a : S) {
int Sum = tmp + a;
if(Sum <= Num) {
if(Sum == Num) {
C++;
count++;
S.erase(a);
break;
}
}
}
if(C == 0) {
S.insert(tmp);
}
}
}
if(count != 0) {
cout << count;
}
} | # 0084, 2024-10-15 09:33:56, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int Num, tmp;
int count = 0;
set<int> S;
cin >> Num;
int Sum = 0;
while(cin >> tmp) {
if(tmp < Num) {
auto it = S.find(Num - tmp);
if(it == S.end()) {
S.insert(tmp);
}
else {
count++;
}
}
}
if(count != 0) {
cout << count;
}
} |
# 0085, 2024-10-15 09:30:11, PPPT (75%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
string input;
cin >> k;
vector<int> s;
while (cin >> input && input != "stop") {
s.push_back(stoi(input));
}
int count = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i+1; j < s.size(); j++) {
if ((s[i] + s[j]) == k) {
count++;
}
}
}
cout << count;
} | # 0086, 2024-10-15 09:30:21, PPPT (75%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
string input;
cin >> k;
vector<int> s;
while (cin >> input && input != "stop") {
s.push_back(stoi(input));
}
int count = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i+1; j < s.size(); j++) {
if ((s[i] + s[j]) == k) {
count++;
}
}
}
cout << count;
} | # 0087, 2024-10-15 09:30:56, PPPT (75%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
int input;
cin >> k;
vector<int> s;
while (cin >> input) {
s.push_back(input);
}
int count = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i+1; j < s.size(); j++) {
if ((s[i] + s[j]) == k) {
count++;
}
}
}
cout << count;
} | # 0088, 2024-10-15 09:32:24, PPPT (75%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long k, input;
cin >> k;
vector<long long> s;
while (cin >> input) {
s.push_back(input);
}
long long count = 0;
for (long long i = 0; i < s.size(); i++) {
for (long long j = i+1; j < s.size(); j++) {
if ((s[i] + s[j]) == k) {
count++;
}
}
}
cout << count;
} | # 0089, 2024-10-15 09:43:58, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long k, input;
cin >> k;
vector<long long> s;
while (cin >> input) {
s.push_back(input);
}
sort(s.begin(), s.end());
long long count = 0, start = 0, end = s.size()-1;
for (long long i = 0; i < s.size(); i++) {
if ((s[start] + s[end]) > k) {
end--;
}
else if ((s[start] + s[end]) < k) {
start++;
}
else {
count++;
start++;
}
}
cout << count;
} | # 0090, 2024-10-15 09:44:49, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long k, input;
cin >> k;
vector<long long> s;
while (cin >> input) {
s.push_back(input);
}
sort(s.begin(), s.end());
long long count = 0, start = 0, end = s.size()-1;
for (long long i = 0; i < s.size(); i++) {
if ((s[start] + s[end]) > k) {
end--;
}
else if ((s[start] + s[end]) < k) {
start++;
}
else if ((s[start] + s[end]) == k && start != end){
count++;
start++;
}
}
cout << count;
} |
# 0091, 2024-10-15 09:34:31, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, cnt = 0;
set <int> s;
cin >> n;
int input;
while(cin >> input)
{
s.insert(input);
}
for(auto i : s)
{
if((s.find(n-i) != s.end()))
{
cnt ++;
}
else continue;
}
cout << cnt/2;
return 0;
} | # 0092, 2024-10-15 09:35:58, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, cnt = 0;
set <int> s;
cin >> n;
int input;
while(cin >> input)
{
s.insert(input);
}
for(auto i : s)
{
if((s.find(n-i) != s.end()))
{
cnt ++;
s.erase(n-i);
}
else continue;
}
cout << cnt;
return 0;
} | # 0093, 2024-10-15 09:36:48, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, cnt = 0;
set <int> s;
cin >> n;
int input;
while(cin >> input)
{
s.insert(input);
}
for(auto i : s)
{
if((s.find(n-i) != s.end()))
{
cnt ++;
}
else continue;
}
cout << cnt/2;
return 0;
} | # 0094, 2024-10-15 09:39:56, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, cnt = 0;
set <int> s;
cin >> n;
int input;
while(cin >> input)
{
s.insert(input);
}
for(auto i : s)
{ if(s.size() == 1)break;
if((s.find(n-i) != s.end()))
{
cnt ++;
s.erase(n-i);
}
else continue;
}
cout << cnt;
return 0;
} | # 0095, 2024-10-15 09:40:31, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, cnt = 0;
set <int> s;
cin >> n;
int input;
while(cin >> input)
{
s.insert(input);
}
for(auto i : s)
{ if(n == 0)break;
if((s.find(n-i) != s.end()))
{
cnt ++;
s.erase(n-i);
}
else continue;
}
cout << cnt;
return 0;
} | # 0096, 2024-10-15 09:40:47, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, cnt = 0;
set <int> s;
cin >> n;
int input;
while(cin >> input)
{
s.insert(input);
}
for(auto i : s)
{
if((s.find(n-i) != s.end()))
{
cnt ++;
}
else continue;
}
cout << cnt/2;
return 0;
} |
# 0097, 2024-10-15 09:12:42, ---T (0%)
#include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> container;
int num, input, counter;
cin >> num;
while(cin >>input){
container.push_back(input);
}
for(int i = 0; i < container.size()-1; i++){
for(int j = i+1; j < container.size(); j++){
if(container[i] + container[j] == num){
counter++;
}
}
}
cout << counter;
} | # 0098, 2024-10-15 09:13:46, PPPT (75%)
#include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> container;
int num, input, counter = 0;
cin >> num;
while(cin >>input){
container.push_back(input);
}
for(int i = 0; i < container.size()-1; i++){
for(int j = i+1; j < container.size(); j++){
if(container[i] + container[j] == num){
counter++;
}
}
}
cout << counter;
} | # 0099, 2024-10-15 09:17:30, PPPT (75%)
#include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> container;
int num, input, counter = 0;
cin >> num;
while(cin >>input){
if(input >= 0){
container.push_back(input);
}
}
for(int i = 0; i < container.size()-1; i++){
for(int j = i+1; j < container.size(); j++){
if(container[i] + container[j] == num){
counter++;
}
}
}
cout << counter;
} | # 0100, 2024-10-15 09:21:56, PPPT (75%)
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main(){
vector<int> container;
int num, input, counter = 0;
cin >> num;
while(cin >> input){
for(auto c : container){
if(c + input == num){
counter++;
}
}
container.push_back(input);
}
cout << counter;
} | # 0101, 2024-10-15 09:25:50, PPPT (75%)
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main(){
vector<int> container;
int num, input, counter = 0;
cin >> num;
while(cin >> input){
if(input <= num){
for(auto c : container){
if(c + input == num){
counter++;
}
}
container.push_back(input);
}
}
cout << counter;
} | # 0102, 2024-10-15 09:42:49, PPPP (100%)
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
vector<int> container;
int num, input, counter = 0;
cin >> num;
while(cin >> input){
if(find(container.begin(), container.end(), num-input) != container.end()){
counter++;
}
container.push_back(input);
}
cout << counter;
} |
# 0103, 2024-10-15 09:18:01, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
set<int> a;
int k;
cin >> k;
int count = 0;
int l;
int result = 0;
while(cin >> l){
if(l > k){
count++;
continue;
}
if(count == 0){
a.insert(l);
count++;
continue;
}else{
for(int numbers : a){
// cout << "numbers : " << numbers << endl;
// cout << "l : " << l << endl;
if(l + numbers == k){
result += 1;
a.insert(l);
break;
}
}
}
}
count++;
cout << result;
} | # 0104, 2024-10-15 09:19:11, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
set<int> a;
int k;
cin >> k;
int count = 0;
int l;
int result = 0;
while(cin >> l){
if(l > k){
count++;
continue;
}
if(count == 0){
a.insert(l);
count++;
continue;
}else{
for(int numbers : a){
// cout << "numbers : " << numbers << endl;
// cout << "l : " << l << endl;
if(l + numbers == k){
result += 1;
a.insert(l);
break;
}
}
}
a.insert(l);
}
count++;
cout << result;
} | # 0105, 2024-10-15 09:20:09, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
set<int> a;
int k;
cin >> k;
int count = 0;
int l;
int result = 0;
while(cin >> l){
if(l > k){
count++;
continue;
}
if(count == 0){
a.insert(l);
count++;
continue;
}else{
for(int numbers : a){
if(l + numbers == k){
result += 1;
a.insert(l);
break;
}
}
}
a.insert(l);
}
count++;
cout << result;
} | # 0106, 2024-10-15 09:25:28, Compilation error (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
set<int> a;
int k;
cin >> k;
int count = 0;
int l;
int result = 0;
while(cin >> l){
if(l > k){
count++;
continue;
}
if(count == 0){
a.insert(l);
count++;
continue;
}else{
if(l <= k){
if(a.find(k-l) != a.end()){
result += 1;
count++;
a.insert(l);
continue;
}
}
}
a.insert(l);
}
count++; | # 0107, 2024-10-15 09:25:43, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
set<int> a;
int k;
cin >> k;
int count = 0;
int l;
int result = 0;
while(cin >> l){
if(l > k){
count++;
continue;
}
if(count == 0){
a.insert(l);
count++;
continue;
}else{
if(l <= k){
if(a.find(k-l) != a.end()){
result += 1;
count++;
a.insert(l);
continue;
}
}
}
a.insert(l);
}
count++;
cout << result;
} |
# 0108, 2024-10-15 09:19:23, -PPT (50%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k,n,c=0;
set<int> s;
cin>>k;
while(cin>>n){
s.insert(n);
}
for(auto i=s.begin();i!=s.lower_bound(k);i++){
for(auto j=i;j!=s.lower_bound(k);++j){
if(*i+*j==k){
c++;
}
}
}
cout<<c;
} | # 0109, 2024-10-15 09:30:12, ---- (0%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k,n,c=0;
set<int> s;
cin>>k;
while(cin>>n){
s.insert(n);
}
for(auto i=s.begin();i!=s.lower_bound(k);i++){
if(s.find(k-*i)!=s.end()) c++;
}
cout<<c;
} | # 0110, 2024-10-15 09:30:48, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k,n,c=0;
set<int> s;
cin>>k;
while(cin>>n){
s.insert(n);
}
for(auto i=s.begin();i!=s.lower_bound(k);i++){
if(s.find(k-*i)!=s.end()) c++;
}
cout<<c/2;
} | # 0111, 2024-10-15 09:38:54, PPPT (75%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k,n,c=0;
set<int> s;
cin>>k;
while(cin>>n){
s.insert(n);
}
for(auto i=s.begin();i!=s.lower_bound(k);i++){
for(auto j=i;j!=s.lower_bound(k);j++){
if(*i+*j>k) break;
if(*j!=*i){
if(*i+*j==k){
c++;
}
}
}
}
cout<<c;
} | # 0112, 2024-10-15 09:39:50, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k,n,c=0;
set<int> s;
cin>>k;
while(cin>>n){
s.insert(n);
}
for(auto i=s.begin();i!=s.lower_bound(k);i++){
if(s.find(k-*i)!=s.end()) c++;
}
cout<<c/2;
} |
# 0113, 2024-10-15 09:44:07, ---- (0%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int K;
cin >> K;
set<int> nums;
int num;
while (cin >> num){
nums.insert(num);
}
int counter = 0;
set<int> added;
for (auto n: nums){
if (nums.find(5 - n) != nums.end() && added.find(n) == added.end() && added.find(5 - n) == added.end()){
counter ++;
added.insert(n);
added.insert(5 - n);
}
}
cout << counter;
} | # 0114, 2024-10-15 09:44:13, ---- (0%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int K;
cin >> K;
set<int> nums;
int num;
while (cin >> num){
nums.insert(num);
}
int counter = 0;
set<int> added;
for (auto n: nums){
if (nums.find(5 - n) != nums.end() && added.find(n) == added.end() && added.find(5 - n) == added.end()){
counter ++;
added.insert(n);
added.insert(5 - n);
}
}
cout << counter;
} | # 0115, 2024-10-15 09:46:31, -PPP (75%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int K;
cin >> K;
set<int> nums;
int num;
while (cin >> num){
nums.insert(num);
}
int counter = 0;
set<int> added;
for (auto n: nums){
if (nums.find(K - n) != nums.end() && added.find(n) == added.end() && added.find(K - n) == added.end()){
counter ++;
added.insert(n);
added.insert(K - n);
}
}
cout << counter;
} | # 0116, 2024-10-15 09:46:41, -PPP (75%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int K;
cin >> K;
set<int> nums;
int num;
while (cin >> num){
nums.insert(num);
}
int counter = 0;
set<int> added;
for (auto n: nums){
if (nums.find(K - n) != nums.end() && added.find(n) == added.end() && added.find(K - n) == added.end()){
counter ++;
added.insert(n);
added.insert(K - n);
}
}
cout << counter;
} | # 0117, 2024-10-15 09:50:38, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int K;
cin >> K;
set<int> nums;
int num;
while (cin >> num){
nums.insert(num);
}
int counter = 0;
set<int> added;
for (auto n: nums){
if (nums.find(K - n) != nums.end() && added.find(n) == added.end() && added.find(K - n) == added.end()
&& n != K-n
){
counter ++;
added.insert(n);
added.insert(K - n);
}
}
cout << counter;
} |
# 0118, 2024-10-15 09:19:16, xxxx (0%)
#include<bits/stdc++.h>
using namespace std ;
int main(){
int Number ;
cin>>Number ;
int temp ;
set<int> S ;
while(cin>>temp){
S.insert(temp) ;
}
int count = 0 ;
set<pair<int,int>> res ;
for(auto number : S){
int another_number = Number - number ;
if(S.find(another_number) != S.end() && number != another_number){
res.insert(make_pair(min(number,another_number),max(number,another_number))) ;
S.erase(number) ;
S.erase(another_number) ;
count++ ;
}
}
//count
cout<<count<<endl ;
//check
// for(auto c : res){
// cout<<c.first<<"+"<<c.second<<" = "<<Number<<endl ;
// }
//check set
// for(auto c : S){
// cout<<c<<" " ;
// }
} | # 0119, 2024-10-15 09:20:08, xxxx (0%)
#include<bits/stdc++.h>
using namespace std ;
int main(){
int Number ;
cin>>Number ;
int temp ;
set<int> S ;
while(cin>>temp){
S.insert(temp) ;
}
int count = 0 ;
set<pair<int,int>> res ;
for(auto number : S){
int another_number = Number - number ;
if(S.find(another_number) != S.end() && number != another_number){
res.insert(make_pair(min(number,another_number),max(number,another_number))) ;
S.erase(number) ;
S.erase(another_number) ;
count++ ;
}
}
//count
cout<<count<<endl ;
//check
// for(auto c : res){
// cout<<c.first<<"+"<<c.second<<" = "<<Number<<endl ;
// }
//check set
// for(auto c : S){
// cout<<c<<" " ;
// }
} | # 0120, 2024-10-15 09:24:06, xxxx (0%)
#include<bits/stdc++.h>
using namespace std ;
int main(){
int Number ;
cin>>Number ;
int temp ;
set<int> S ;
while(cin>>temp){
S.insert(temp) ;
}
int count = 0 ;
for(auto number : S){
int another_number = Number - number ;
if(S.find(another_number) != S.end() && number != another_number){
S.erase(number) ;
S.erase(another_number) ;
count++ ;
}
}
cout<<count<<endl ;
} | # 0121, 2024-10-15 09:26:42, xxxx (0%)
#include<bits/stdc++.h>
using namespace std ;
int main(){
int Number ;
cin>>Number ;
int temp ;
set<int> S ;
while(cin>>temp){
if(temp <= Number){
S.insert(temp) ;
}
}
int count = 0 ;
for(auto number : S){
int another_number = Number - number ;
if(S.find(another_number) != S.end() && number != another_number){
S.erase(number) ;
S.erase(another_number) ;
count++ ;
}
}
cout<<count<<endl ;
// for(auto number : S){
// cout<<number<<" " ;
// }
} | # 0122, 2024-10-15 09:37:20, PPPP (100%)
#include<bits/stdc++.h>
using namespace std ;
int main(){
int Number ;
cin>>Number ;
int temp ;
set<int> S ;
int count = 0 ;
while(cin>>temp){
if(temp <= Number){
S.insert(temp) ;
}
int another = Number - temp ;
if(S.find(another) != S.end() && temp != another){
S.erase(another) ;
S.erase(temp) ;
count++ ;
}
}
cout<<count<<endl ;
} |
# 0123, 2024-10-15 09:32:47, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> v;
int x,cnt=0,sum;
cin>>sum;
while(cin>>x && x!=-1)v.push_back(x);
sort(v.begin(),v.end());
int l=0,r=v.size()-1;
for(int i=0;i<v.size();i++){
//cout<<v[l]<<" + "<<v[r]<<"\n";
if(v[l]+v[r]>sum)r--;
else if(v[l]+v[r]<sum)l++;
else if(v[l]+v[r]==sum){
cnt++;r--;
}
}
cout<<cnt;
} | # 0124, 2024-10-15 09:34:20, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> v;
int x,cnt=0,sum;
cin>>sum;
while(cin>>x && x!=-1)v.push_back(x);
sort(v.begin(),v.end());
int l=0,r=v.size()-1;
for(int i=0;i<v.size();i++){
//cout<<v[l]<<" + "<<v[r]<<"\n";
if(v[l]+v[r]>sum)r--;
else if(v[l]+v[r]<sum)l++;
else if(v[l]+v[r]==sum){
cnt++;l++;
}
}
cout<<cnt;
} | # 0125, 2024-10-15 09:34:29, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> v;
int x,cnt=0,sum;
cin>>sum;
while(cin>>x && x!=-1)v.push_back(x);
sort(v.begin(),v.end());
int l=0,r=v.size()-1;
for(int i=0;i<v.size();i++){
//cout<<v[l]<<" + "<<v[r]<<"\n";
if(v[l]+v[r]>sum)r--;
else if(v[l]+v[r]<sum)l++;
else if(v[l]+v[r]==sum){
cnt++;r--;
}
}
cout<<cnt;
} | # 0126, 2024-10-15 09:36:35, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> v;
int x,cnt=0,sum;
cin>>sum;
while(cin>>x && x!=-1)v.push_back(x);
sort(v.begin(),v.end());
int l=0,r=v.size()-1;
for(int i=0;i<v.size();i++){
if(v[l]+v[r]>sum)r--;
else if(v[l]+v[r]<sum)l++;
else if(v[l]+v[r]==sum && l!=r){
// cout<<v[l]<<" + "<<v[r]<<" = "<<v[l]+v[r]<<"\n";
cnt++;l++;
}
}
cout<<cnt;
} | # 0127, 2024-10-15 09:36:51, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> v;
int x,cnt=0,sum;
cin>>sum;
while(cin>>x)v.push_back(x);
sort(v.begin(),v.end());
int l=0,r=v.size()-1;
for(int i=0;i<v.size();i++){
if(v[l]+v[r]>sum)r--;
else if(v[l]+v[r]<sum)l++;
else if(v[l]+v[r]==sum && l!=r){
cnt++;l++;
}
}
cout<<cnt;
} |
# 0128, 2024-10-15 09:06:50, PPPP (100%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int n;cin>>n;
set<int> info;
int temp;
while(cin>>temp){
info.insert(temp);
}
int count=0;
for(auto &b:info){
if(info.find(n-b)!=info.end()){
count++;
}
}
cout<<count/2;
} | # 0129, 2024-10-15 09:08:25, -PPP (75%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int n;cin>>n;
set<int> info;
int temp;
while(cin>>temp){
info.insert(temp);
}
int count=0;
for(auto &b:info){
if(b>n-b) continue;
if(info.find(n-b)!=info.end()){
count++;
}
}
cout<<count;
} | # 0130, 2024-10-15 09:10:50, -PPP (75%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int n;cin>>n;
set<int> info;
int temp;
while(cin>>temp){
info.insert(temp);
}
int count=0;
for(auto &b:info){
if(b>n-b) break;;
if(info.find(n-b)!=info.end()){
count++;
}
}
cout<<count;
} | # 0131, 2024-10-15 09:12:13, -PPP (75%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int n;cin>>n;
set<int> info;
int temp;
while(cin>>temp){
info.insert(temp);
}
int count=0;
for(auto &b:info){
if(b>n-b) break;
if(info.find(n-b)!=info.end()){
count++;
}
}
cout<<count;
} | # 0132, 2024-10-15 09:17:52, PPPP (100%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int n;cin>>n;
set<int> info;
int temp;
while(cin>>temp){
info.insert(temp);
}
int count=0;
for(auto &b:info){
if(b>n-b) break;
if(info.find(n-b)!=info.end()&&n-b!=b){
count++;
}
}
cout<<count;
} |
# 0133, 2024-10-15 09:20:39, PPPT (75%)
#include<iostream>
#include<string>
#include<set>
using namespace std;
int main(){
int n;
set<int>s;
string a;
cin>>n;
cin.ignore();
getline(cin,a);
int t=0;
for(int i=0;i<=a.size();i++){
if(a[i]==' '||i==a.size()){
if(t<n)s.insert(t);
t=0;
}else{
t*=10;
t+=a[i]-'0';
}
}
int co=0;
auto it=s.begin();
for(it;it!=s.end();it++){
auto jt=it;
jt++;
for(jt;jt!=s.end();jt++){
if((*it) + (*jt)>n){
break;
}else if((*it) + (*jt)==n){
co++;
}
}
}
cout<<co;
} | # 0134, 2024-10-15 09:21:17, PPPT (75%)
#include<iostream>
#include<string>
#include<set>
using namespace std;
int main(){
int n;
set<int>s;
string a;
cin>>n;
cin.ignore();
getline(cin,a);
int t=0;
for(int i=0;i<=a.size();i++){
if(a[i]==' '||i==a.size()){
if(t<n)s.insert(t);
t=0;
}else{
t*=10;
t+=a[i]-'0';
}
}
int co=0;
auto it=s.begin();
for(it;it!=s.end();it++){
auto jt=it;
jt++;
for(jt;jt!=s.end();jt++){
if((*it) + (*jt)>n){
break;
}else if((*it) + (*jt)==n){
co++;
break;
}
}
}
cout<<co;
} | # 0135, 2024-10-15 09:27:58, PPPT (75%)
#include<iostream>
#include<string>
#include<set>
using namespace std;
int main(){
int n;
set<int>s;
string a;
cin>>n;
int t;
while(cin>>t){
if(t<n)s.insert(t);
}
int co=0;
auto it=s.begin();
for(it;it!=s.end();it++){
auto jt=it;
jt++;
for(jt;jt!=s.end();jt++){
if((*it) + (*jt)>n){
break;
}else if((*it) + (*jt)==n){
co++;
break;
}
}
}
cout<<co;
} | # 0136, 2024-10-15 09:32:31, PPPP (100%)
#include<iostream>
#include<string>
#include<set>
using namespace std;
int main(){
int n;
set<int>s;
string a;
cin>>n;
int t;
while(cin>>t){
if(t<n)s.insert(t);
}
int co=0;
auto it=s.begin();
for(it;it!=s.end();it++){
t=*it;
if(s.find(n-t)!=s.end()&&it!=s.find(n-t)){
co++;
s.erase(s.find(n-t));
}
}
cout<<co;
} | # 0137, 2024-10-15 09:33:27, PPPP (100%)
#include<iostream>
#include<string>
#include<set>
using namespace std;
int main(){
int n;
set<int>s;
string a;
cin>>n;
cin.ignore();
getline(cin,a);
int t=0;
for(int i=0;i<=a.size();i++){
if(a[i]==' '||i==a.size()){
if(t<n)s.insert(t);
t=0;
}else{
t*=10;
t+=a[i]-'0';
}
}
int co=0;
auto it=s.begin();
for(it;it!=s.end();it++){
t=*it;
if(s.find(n-t)!=s.end()&&it!=s.find(n-t)){
co++;
s.erase(s.find(n-t));
}
}
cout<<co;
} |
# 0138, 2024-10-15 09:28:56, PPPP (100%)
#include <iostream>
#include <set>
int main(int argc, char const *argv[])
{
int target;
std::cin >> target;
int num;
std::set<int> numList;
while (std::cin >> num)
{
numList.insert(num);
}
unsigned count = 0;
for (auto itr = numList.begin(); itr != numList.end();)
{
auto remainingItr = numList.find(target - *(itr));
if (remainingItr != numList.end() && itr != remainingItr)
{
count++;
numList.erase(remainingItr);
}
itr = numList.erase(itr);
}
std::cout << count << std::endl;
return 0;
} | # 0139, 2024-10-15 09:33:18, PPPP (100%)
#include <iostream>
#include <set>
int main(int argc, char const *argv[])
{
int target;
std::cin >> target;
int num;
std::set<int> numList;
while (std::cin >> num)
{
numList.insert(num);
}
unsigned count = 0;
for (auto itr = numList.begin(); itr != numList.end();)
{
auto remainingItr = numList.find(target - (*itr));
if (remainingItr != numList.end() && itr != remainingItr)
{
count++;
numList.erase(remainingItr);
}
itr++;
}
std::cout << count << std::endl;
return 0;
} | # 0140, 2024-10-15 09:33:36, PPPP (100%)
#include <iostream>
#include <set>
int main(int argc, char const *argv[])
{
int target;
std::cin >> target;
int num;
std::set<int> numList;
while (std::cin >> num)
{
numList.insert(num);
}
unsigned count = 0;
for (auto itr = numList.begin(); itr != numList.end(); itr++)
{
auto remainingItr = numList.find(target - (*itr));
if (remainingItr != numList.end() && itr != remainingItr)
{
count++;
numList.erase(remainingItr);
}
}
std::cout << count << std::endl;
return 0;
} | # 0141, 2024-10-15 09:36:52, PPPP (100%)
#include <iostream>
#include <set>
int main(int argc, char const *argv[])
{
int target;
std::cin >> target;
int num;
std::set<int> numList;
while (std::cin >> num)
{
numList.insert(num);
}
unsigned count = 0;
for (auto itr = numList.begin(); itr != numList.end(); itr++)
{
int remaining = target - (*itr);
if (remaining > (*itr))
{
if (numList.find(remaining) != numList.end())
{
count++;
}
}
}
std::cout << count << std::endl;
return 0;
} | # 0142, 2024-10-15 09:38:20, PPPP (100%)
#include <iostream>
#include <set>
int main(int argc, char const *argv[])
{
int target;
std::cin >> target;
int num;
std::set<int> numList;
while (std::cin >> num)
{
numList.insert(num);
}
unsigned count = 0;
for (auto itr = numList.begin(); itr != numList.end(); itr++)
{
int remaining = target - (*itr);
if (remaining > (*itr) && numList.find(remaining) != numList.end())
{
count++;
}
}
std::cout << count << std::endl;
return 0;
} |
# 0143, 2024-10-15 09:25:44, ---- (0%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m,cnt=0;
bool ck[5000]={0};
cin >> n;
vector<int> num;
while (cin >> m)
{
if (m < n && !ck)
{
num.push_back(m);
ck[m]=1;
}
}
sort(num.begin(), num.end());
for(int i=0;i<num.size();++i){
for(int j=0;j<num.size();++j){
if(num[i]+num[j]==n){
cnt++;
}
}
}
cout<<cnt;
} | # 0144, 2024-10-15 09:31:52, --xx (0%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m,cnt=0;
bool ck[5000]={0};
cin >> n;
vector<int> num;
while (cin >> m)
{
if (m <= n && !ck[m])
{
num.push_back(m);
ck[m]=1;
}
}
sort(num.begin(), num.end());
for(int i=0;i<num.size();++i){
for(int j=0;j<num.size();++j){
if(i==j){
continue;
}
if(num[i]+num[j]==n){
cnt++;
}
}
}
cout<<cnt;
} | # 0145, 2024-10-15 09:44:43, PPPT (75%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m, cnt = 0;
bool ck[1000000] = {0};
set<pair<int, int>> cb;
cin >> n;
vector<int> num;
while (cin >> m)
{
if (m <= n && !ck[m])
{
num.push_back(m);
ck[m] = 1;
}
}
for (int i = 0; i < num.size(); ++i)
{
for (int j = 0; j < num.size(); ++j)
{
if (num[i] + num[j] == n&&i!=j)
{
int a = min(num[i], num[j]);
int b = max(num[i], num[j]);
if (cb.find({a, b}) == cb.end())
{
cnt++;
cb.insert({a, b});
//cout<<num[i]<<" "<<num[j]<<endl;
}
}
}
}
cout << cnt;
} | # 0146, 2024-10-15 09:48:07, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m, cnt = 0;
unordered_set<int> num_set;
unordered_set<int> seen;
set<pair<int, int>> cb;
cin >> n;
while (cin >> m)
{
if (m <= n)
{
num_set.insert(m);
}
}
for (int val : num_set)
{
int complement = n - val;
if (complement != val && num_set.find(complement) != num_set.end())
{
int a = min(val, complement);
int b = max(val, complement);
if (cb.find({a, b}) == cb.end())
{
cnt++;
cb.insert({a, b});
}
}
}
cout << cnt;
} |
# 0147, 2024-10-15 09:29:59, PPTT (50%)
#include <bits/stdc++.h>
using namespace std;
int summinusitr(int i,int k,set<int> s2){
int a=0;
for(auto j:s2){
if(k-i == j){
a++;
}
else if(k-i < j){
break;
}
}
return a;
}
int main(){
int k,p,same=0;
cin>>k;
set<int> s1,s2;
while(cin>>p){
s1.insert(p);
s2.insert(p);
}
for(auto i:s1){
same+=summinusitr(i,k,s2);
}
cout<<same/2<<endl;
} | # 0148, 2024-10-15 09:30:06, PPTT (50%)
#include <bits/stdc++.h>
using namespace std;
int summinusitr(int i,int k,set<int> s2){
int a=0;
for(auto j:s2){
if(k-i == j){
a++;
}
else if(k-i < j){
break;
}
}
return a;
}
int main(){
int k,p,same=0;
cin>>k;
set<int> s1,s2;
while(cin>>p){
s1.insert(p);
s2.insert(p);
}
for(auto i:s1){
same+=summinusitr(i,k,s2);
}
cout<<same/2<<endl;
} | # 0149, 2024-10-15 09:41:59, ---- (0%)
#include <bits/stdc++.h>
using namespace std;
int summinusitr(int k,set<int> s1,set<int> s2){
int a=0;
auto i1 = s1.begin(), e1 = s1.end();
auto i2 = s2.begin(), e2 = s2.end();
i2++;
while(i1!=e1 && i2!=e2){
if(k-*i1 == *i2){
a++;
s2.erase(*i2);
i1++; i2++;
}
else if(k-*i1 < *i2 ){
i1++;
}
else if(k-*i1 > *i2){
i2++;
}
}
return a;
}
int main(){
int k,p,same=0;
cin>>k;
set<int> s1,s2;
while(cin>>p){
s1.insert(p);
s2.insert(p);
}
same+=summinusitr(k,s1,s2);
cout<<same<<endl;
} | # 0150, 2024-10-15 09:50:50, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int summinusitr(int k,set<int> s1,set<int> s2){
int a=0;
auto i1 = s1.begin(), e1 = s1.end();
auto i2 = s2.begin(), e2 = s2.end();
i2++;
while(i1!=e1){
if(s2.find(k-*i1) != s2.end()){
a++;
}
i1++;
}
return a;
}
int main(){
int k,p,same=0;
cin>>k;
set<int> s1,s2;
while(cin>>p){
s1.insert(p);
s2.insert(p);
}
same+=summinusitr(k,s1,s2);
cout<<same/2<<endl;
} |
# 0151, 2024-10-15 09:13:34, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int t,n;
cin>>t;
set<int> s;
while(cin>>n) {
s.insert(n);
}
int count = 0;
for(auto it = s.begin() ; it != s.end() ;) {
int e = *it;
int find = t-e;
if(s.count(t-e) && t-e != e) {
count++;
s.erase(find);
s.erase(it++);
continue;
}
it++;
}
cout<<count;
} | # 0152, 2024-10-15 09:33:34, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int t,n;
cin>>t;
set<int> s;
while(cin>>n) {
s.insert(n);
}
int count = 0;
for(auto it = s.begin() ; it != s.end() ;) {
int e = *it;
int find = t-e;
if(s.count(t-e) && t-e != e) {
count++;
s.erase(find);
continue;
}
it++;
}
cout<<count;
} | # 0153, 2024-10-15 09:33:51, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int t,n;
cin>>t;
set<int> s;
while(cin>>n) {
s.insert(n);
}
int count = 0;
for(auto it = s.begin() ; it != s.end() ; it++) {
int e = *it;
int find = t-e;
if(s.count(t-e) && t-e != e) {
count++;
s.erase(find);
continue;
}
}
cout<<count;
} | # 0154, 2024-10-15 09:34:24, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int t,n,count=0;
cin>>t;
set<int> s;
while(cin>>n) {
s.insert(n);
}
for(auto it = s.begin() ; it != s.end() ; it++) {
int e = *it;
int find = t-e;
if(s.count(t-e) && t-e != e) {
count++;
s.erase(find);
continue;
}
}
cout<<count;
} |
# 0155, 2024-10-15 09:37:59, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
set<int> S;
int k, s, count=0;
cin>>k;
while (cin>>s)
{
S.insert(s);
}
for (char s : S)
{
int ans=k-s;
if (S.find(ans)==S.end())
{
count++;
}
}
cout<<count;
} | # 0156, 2024-10-15 09:39:08, xxxx (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
set<int> S;
int k, s, count=0;
cin>>k;
while (cin>>s)
{
S.insert(s);
}
for (char s : S)
{
int ans=k-s;
if (S.find(ans)==S.end())
{
count++;
S.erase(s);
}
}
cout<<count;
} | # 0157, 2024-10-15 09:45:12, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
set<int> S;
int k, s, count=0;
cin>>k;
while (cin>>s)
{
S.insert(s);
}
for (auto s : S)
{
int ans=k-s;
if (S.find(ans)==S.end())
{
count++;
}
}
count/=2;
cout<<count;
} | # 0158, 2024-10-15 09:48:53, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
set<int> S;
int k, s, count=0;
cin>>k;
while (cin>>s)
{
S.insert(s);
}
for (auto s : S)
{
int ans=k-s;
if (S.find(ans)!=S.end())
{
count++;
}
}
count/=2;
cout<<count;
} |
# 0159, 2024-10-15 09:14:47, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;
cin>> k;
set<int> s;
for(int i=0, input; i<k; i++){
cin>> input;
s.insert(input);
}
int cnt=0;
for(auto e:s){
int f=k-e;
if(s.find(f)!=s.end()){
cnt++;
}
}
cout<< cnt;
return 0;
} | # 0160, 2024-10-15 09:20:59, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;
cin>> k;
set<int> s;
int input;
while(cin>> input){
s.insert(input);
}
int cnt=0;
for(auto itr=s.begin(), e=s.end(); itr!=e; itr++){
auto vl=*itr;
int f=k-vl;
if(s.find(f)!=e && s.find(f)!=itr){
cnt++;
}
}
cout<< cnt;
return 0;
} | # 0161, 2024-10-15 09:22:10, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;
cin>> k;
set<int> s;
int input;
while(cin>> input){
s.insert(input);
}
int cnt=0;
for(auto itr=s.begin(), e=s.end(); itr!=e; itr++){
auto vl=*itr;
int f=k-vl;
if(s.find(f)!=e && s.find(f)!=itr){
cnt++;
}
}
cout<< cnt/2;
return 0;
} | # 0162, 2024-10-15 09:26:51, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;
cin>> k;
set<int> s;
int input;
while(cin>> input){
s.insert(input);
}
int cnt=0;
for(auto e:s){
int f=k-e;
if(s.find(f)!=s.end() && f!=e){
cnt++;
}
}
cout<< cnt/2;
return 0;
} |
# 0163, 2024-10-15 09:21:50, -PPP (75%)
#include<iostream>
#include<map>
#include<set>
#include<vector>
using namespace std;
int main()
{
set<int> a;
map<int,int> c;
int b,n,k=0;
cin >> n;
while(cin >> b)
{
a.insert(b);
}
for(int j : a)
{
if(a.find(n-j) != a.end())
{
a.erase(n-j);
k++;
}
}
cout << k;
} | # 0164, 2024-10-15 09:24:14, PPPP (100%)
#include<iostream>
#include<map>
#include<set>
#include<vector>
using namespace std;
int main()
{
set<int> a;
vector<int> c;
int b,n,k=0;
cin >> n;
while(cin >> b)
{
a.insert(b);
}
for(int j : a)
{
if(a.find(n-j) != a.end() && n-j != j)
{
a.erase(n-j);
k++;
c.push_back(j);
}
}
cout << k;
} | # 0165, 2024-10-15 09:40:59, xxxx (0%)
#include<iostream>
#include<map>
#include<set>
#include<vector>
using namespace std;
int main()
{
set<int> a;
vector<int> c;
int b,n,k=0;
cin >> n;
while(cin >> b)
{
a.insert(b);
}
for(int j : a)
{
if(a.find(n-j) != a.end() && n-j != j)
{
a.erase(j);
k++;
c.push_back(j);
}
}
cout << k;
} | # 0166, 2024-10-15 09:41:09, PPPP (100%)
#include<iostream>
#include<map>
#include<set>
#include<vector>
using namespace std;
int main()
{
set<int> a;
vector<int> c;
int b,n,k=0;
cin >> n;
while(cin >> b)
{
a.insert(b);
}
for(int j : a)
{
if(a.find(n-j) != a.end() && n-j != j)
{
a.erase(n-j);
k++;
c.push_back(j);
}
}
cout << k;
} |
# 0167, 2024-10-15 09:16:07, PPPT (75%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int n; cin >>n;
set<int> value;
int tmp;
while (cin >> tmp)
{
value.insert(tmp);
}
int count = 0;
auto itr = value.begin();
while (itr != value.end())
{
auto itr2 = itr;
itr2++;
while (itr2 != value.end())
{
if((*itr)+(*itr2) == n){
count++;
}
itr2++;
}
itr++;
}
cout << count;
} | # 0168, 2024-10-15 09:16:19, PPPT (75%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int n; cin >>n;
set<int> value;
int tmp;
while (cin >> tmp)
{
value.insert(tmp);
}
int count = 0;
auto itr = value.begin();
while (itr != value.end())
{
auto itr2 = itr;
itr2++;
while (itr2 != value.end())
{
if((*itr)+(*itr2) == n){
count++;
}
itr2++;
}
itr++;
}
cout << count;
} | # 0169, 2024-10-15 09:24:17, P--- (25%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int n; cin >>n;
set<int> value;
int tmp;
while (cin >> tmp)
{
value.insert(tmp);
}
int count = 0;
auto itr = value.begin();
while (itr != value.end())
{
if(value.find(n-*itr) != value.end()){
count++;
}
itr++;
}
int print_value = (count % 2 != 0) ? (count/2) : ((count/2) + 1);
cout << print_value;
} | # 0170, 2024-10-15 09:28:55, PPPP (100%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int n; cin >>n;
set<int> value;
int tmp;
while (cin >> tmp)
{
value.insert(tmp);
}
int count = 0;
auto itr = value.begin();
while (itr != value.end())
{
if(value.find(n-(*itr)) != value.end() && value.find(n-(*itr)) != itr){
count++;
}
itr++;
}
int print_value = (count % 2 == 0) ? (count/2) : ((count/2) + 1);
if(count == 0) print_value = count;
cout << print_value;
} |
# 0171, 2024-10-15 09:40:43, ---T (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
set<int> All_NUM;
int input1;
while(cin >> input1){
if(input1 == -1){
break;
}
All_NUM.insert(input1);
}
vector<int> copyALL(All_NUM.begin(),All_NUM.end());
for(int i = 0 ;i < All_NUM.size();i++){
for(int j = i+1 ;j < All_NUM.size();j++){
if(copyALL[i] + copyALL[j] == k){
cout << copyALL[i] << "+" << copyALL[j] << " = " << k << endl;
}
}
}
} | # 0172, 2024-10-15 09:41:27, PPPT (75%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
set<int> All_NUM;
int input1;
while(cin >> input1){
if(input1 == -1){
break;
}
All_NUM.insert(input1);
}
vector<int> copyALL(All_NUM.begin(),All_NUM.end());
int cnt = 0;
for(int i = 0 ;i < All_NUM.size();i++){
for(int j = i+1 ;j < All_NUM.size();j++){
if(copyALL[i] + copyALL[j] == k){
//cout << copyALL[i] << "+" << copyALL[j] << " = " << k << endl;
cnt++;
}
}
}
cout << cnt;
} | # 0173, 2024-10-15 09:44:05, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
set<int> All_NUM;
int input1;
// Reading inputs into the set
while (cin >> input1) {
if (input1 == -1) {
break;
}
All_NUM.insert(input1);
}
unordered_set<int> seen;
int cnt = 0;
for (int num : All_NUM) {
if (seen.find(k - num) != seen.end()) {
cnt++;
}
seen.insert(num);
}
cout << cnt;
} | # 0174, 2024-10-15 09:45:06, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
set<int> All_NUM;
int input1;
while (cin >> input1) {
if (input1 == -1) {
break;
}
All_NUM.insert(input1);
}
unordered_set<int> seen;
int cnt = 0;
for (int num : All_NUM) {
if (seen.find(k - num) != seen.end()) {
cnt++;
}
seen.insert(num);
}
cout << cnt;
} |
# 0175, 2024-10-15 09:14:15, P--- (25%)
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
set<int> data;
int sum, d; cin >> sum;
while (cin >> d) {
data.insert(d);
}
int match = 0, count = 1;
int half = data.size() / 2;
for (auto e: data) {
count++; if (count == half) break;
if (data.find(sum - e) != data.end()) {
match++;
}
}
cout << match;
} | # 0176, 2024-10-15 09:21:33, -PPP (75%)
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
set<int> data;
int sum, d; cin >> sum;
while (cin >> d) {
data.insert(d);
}
int match = 0, count = 1;
set<int> data_copy = data;
int half = data.size() / 2;
for (auto e: data) {
if (1 == data_copy.erase(sum - e)) {
match++;
data_copy.erase(e);
}
}
cout << match;
} | # 0177, 2024-10-15 09:23:37, -PPP (75%)
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
set<int> data;
int sum, d; cin >> sum;
while (cin >> d) {
data.insert(d);
}
int match = 0;
set<int> data_copy = data;
for (auto e: data) {
if (1 == data_copy.erase(sum - e)) {
match++;
if (sum - e != e) {
data_copy.erase(e);
}
}
}
cout << match;
} | # 0178, 2024-10-15 09:30:27, PPPP (100%)
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
set<int> data1, data2;
int sum, d; cin >> sum;
while (cin >> d) {
if (d <= sum / 2) data1.insert(d);
else data2.insert(d);
}
int match = 0;
for (auto e: data1) {
if (data2.find(sum - e) != data2.end()) {
match++;
}
}
cout << match;
} |
# 0179, 2024-10-15 09:14:14, -PPP (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int sum,n; cin >> sum;
int count=0;
set<int> num;
while(cin >> n){
num.insert(n);
count += num.count(sum-n);
}
cout << count;
} | # 0180, 2024-10-15 09:14:57, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int sum,n;
cin >> sum;
int count=0;
set<int> num;
while(cin >> n){
count += num.count(sum-n);
num.insert(n);
}
cout << count;
} | # 0181, 2024-10-15 09:17:58, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int sum,n;
cin >> sum;
int count=0;
set<int> num;
while(cin >> n){
for(auto &c : num){
if(n+c == sum) count++;
}
num.insert(n);
}
cout << count;
} | # 0182, 2024-10-15 09:21:23, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int sum,n;
cin >> sum;
int count=0;
set<int> num;
while(cin >> n){
int dif = sum-n;
if(num.find(dif) != num.end()) count++;
num.insert(n);
}
cout << count;
} |
# 0183, 2024-10-15 09:18:41, -PTT (25%)
#include <iostream>
#include <set>
using namespace std;
int main()
{
set<int> all_nums;
set<set<int>> all_nums_sum;
int final_num, nums;
int total = 0;
cin >> final_num;
while (cin >> nums)
{
all_nums.insert(nums);
}
for (int i : all_nums)
{
for (int j : all_nums)
{
if (i + j == final_num)
{
// cout << i << " + " << j << " = " << final_num << endl;
for (set<int> s : all_nums_sum)
{
if (s.find(i) != s.end() && s.find(j) != s.end())
{
total--;
break;
}
}
set<int> temp;
temp.insert(i);
temp.insert(j);
all_nums_sum.insert(temp);
total++;
}
}
}
cout << total << endl;
} | # 0184, 2024-10-15 09:22:34, -PPT (50%)
#include <iostream>
#include <set>
using namespace std;
int main()
{
set<int> all_nums;
set<set<int>> all_nums_sum;
int final_num, nums;
int total = 0;
cin >> final_num;
while (cin >> nums)
{
all_nums.insert(nums);
}
for (int i : all_nums)
{
for (int j : all_nums)
{
if (i + j == final_num && all_nums_sum.find({i, j}) == all_nums_sum.end() && all_nums_sum.find({j, i}) == all_nums_sum.end())
{
total++;
all_nums_sum.insert({i, j});
}
}
}
cout << total << endl;
} | # 0185, 2024-10-15 09:23:26, -PPT (50%)
#include <iostream>
#include <set>
using namespace std;
int main()
{
set<int> all_nums;
set<set<int>> all_nums_sum;
int final_num, nums;
int total = 0;
cin >> final_num;
while (cin >> nums)
{
all_nums.insert(nums);
}
for (auto i : all_nums)
{
for (auto j : all_nums)
{
if (i + j == final_num)
{
set<int> temp;
temp.insert(i);
temp.insert(j);
all_nums_sum.insert(temp);
}
}
}
for (auto i : all_nums_sum)
{
total++;
}
cout << total << endl;
} | # 0186, 2024-10-15 09:28:14, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main()
{
set<int> all_nums;
set<set<int>> all_nums_sum;
int final_num, nums;
int total = 0;
cin >> final_num;
while (cin >> nums)
{
if (nums >= final_num)
{
continue;
}
all_nums.insert(nums);
}
for (auto x : all_nums){
if (all_nums.find(final_num - x) != all_nums.end() && final_num-x != x){
total++;
}
}
cout << total/2 << endl;
} |
# 0187, 2024-10-15 09:42:55, TTTT (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int k;
cin>>k;
set<int> s;
int inp;
while (cin>>inp) {
s.insert(inp);
}
int count=0;
for (auto i : s) {
if (i>=k-i) {
break;
}
if (s.find(k-i) != s.end()) {
count++;
}
}
cout<<count;
} | # 0188, 2024-10-15 09:44:28, TTTT (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int k;
cin>>k;
set<int> s;
int inp;
while (cin>>inp) {
s.insert(inp);
}
int count=0;
for (auto i : s) {
if (i>=k-i) {
break;
}
if (s.find(k-i) != s.end()) {
count++;
}
}
cout<<count;
} | # 0189, 2024-10-15 09:49:46, ---- (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int k;
cin>>k;
set<int> s;
int inp;
while (cin>>inp) {
s.insert(inp);
}
int count=0;
for (auto i : s) {
if (i>=k-i) {
break;
}
if (s.find(k-i) != s.end()) {
count++;
}
}
} | # 0190, 2024-10-15 09:50:07, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int k;
cin>>k;
set<int> s;
int inp;
while (cin>>inp) {
s.insert(inp);
}
int count=0;
for (auto i : s) {
if (i>=k-i) {
break;
}
if (s.find(k-i) != s.end()) {
count++;
}
}
cout<<count;
} |
# 0191, 2024-10-15 09:32:31, ---- (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
cin >> K; cin.ignore();
set<int> sets;
while (cin >> N)
{
sets.insert(N);
}
int T, C;
for (const auto &i : sets)
{
T = K - i;
if (sets.find(T) != sets.end())
{
C++;
}
}
cout << C/2 << endl;
} | # 0192, 2024-10-15 09:36:19, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
cin >> K;
set<int> sets;
while (cin >> N) {
sets.insert(N);
}
int C = 0;
set<int> suc;
for (const auto &i : sets) {
int T = K - i;
if (sets.find(T) != sets.end() && suc.find(T) == suc.end()) {
C++;
suc.insert(i);
}
}
cout << C << endl;
} | # 0193, 2024-10-15 09:43:46, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
cin >> K;
set<int> sets;
while (cin >> N) {
sets.insert(N);
}
int C = 0;
set<int> suc;
for (const auto &i : sets) {
int T = K - i;
if (sets.find(T) != sets.end() && suc.find(T) == suc.end()) {
C++;
suc.insert(T);
suc.insert(i);
}
}
cout << C << endl;
} | # 0194, 2024-10-15 09:47:10, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
cin >> K;
set<int> sets;
while (cin >> N) {
sets.insert(N);
}
int C = 0;
for (const auto &i : sets) {
int T = K - i;
if (sets.find(T) != sets.end() && i != T) {
C++;
sets.erase(T);
}
}
cout << C << endl;
} |
# 0195, 2024-10-15 09:46:10, ---- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long long k, num;
cin >> k;
int cnt=0;
set <long long> s;
while(cin >> num){
if(s.find(k-num) != s.end()){
cnt++;
}
}
cout << cnt;
return 0;
} | # 0196, 2024-10-15 09:47:14, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long long k, num;
cin >> k;
int cnt=0;
set <long long> s;
while(cin >> num){
s.insert(num);
if(s.find(k-num) != s.end()){
cnt++;
}
}
cout << cnt;
return 0;
} | # 0197, 2024-10-15 09:47:41, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long long k, num;
cin >> k;
long long cnt=0;
set <long long> s;
while(cin >> num){
s.insert(num);
if(s.find(k-num) != s.end()){
cnt++;
}
}
cout << cnt;
return 0;
} | # 0198, 2024-10-15 09:49:17, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main(){
long long k, num;
cin >> k;
int cnt=0;
set <long long> s;
while(cin >> num){
if(s.find(k-num) != s.end()){
// cout << num << ' ' << k-num;
cnt++;
} s.insert(num);
}
cout << cnt;
return 0;
} |
# 0199, 2024-10-15 09:15:08, ---- (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int K,input;
cin >> K;
set<int> s;
set<int>::iterator itr;
set<int>::iterator it;
while(cin >> input) {
s.insert(input);
}
int diff = 0;
int count = 0;
for (itr = s.begin(); itr != s.end() && *itr < K; ++itr){
diff = K - *itr;
it = s.find(diff);
if (it != s.end()) {
count++;
}
}
cout << count << endl;
} | # 0200, 2024-10-15 09:17:16, -PPP (75%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int K,input;
cin >> K;
set<int> s;
set<int>::iterator itr;
set<int>::iterator it;
while(cin >> input) {
s.insert(input);
}
int diff = 0;
int count = 0;
for (itr = s.begin(); itr != s.end() && *itr < K/2+1; ++itr){
diff = K - *itr;
it = s.find(diff);
if (it != s.end()) {
count++;
}
}
cout << count << endl;
} | # 0201, 2024-10-15 09:19:29, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int K,input;
cin >> K;
set<int> s;
set<int>::iterator itr;
set<int>::iterator it;
while(cin >> input) {
s.insert(input);
}
int diff = 0;
int count = 0;
for (itr = s.begin(); itr != s.end() && *itr < K/2+1; ++itr){
int check = *itr;
diff = K - *itr;
it = s.find(diff);
if (it != s.end() && *it != *itr) {
count++;
}
}
cout << count << endl;
} | # 0202, 2024-10-15 09:21:42, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int K,input;
cin >> K;
set<int> s;
set<int>::iterator itr;
set<int>::iterator it;
while(cin >> input) {
s.insert(input);
}
int diff = 0;
int count = 0;
for (itr = s.begin(); itr != s.end() && *itr <= K/2; ++itr){
int check = *itr;
diff = K - *itr;
it = s.find(diff);
if (it != s.end() && *it != *itr) {
count++;
}
}
cout << count << endl;
} |
# 0203, 2024-10-15 09:21:46, PPPT (75%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k ;
vector<int> s;
vector<pair<int,int>> sum;
cin >> k;
while(cin >> n){
if(n > k)continue;
s.push_back(n);
}
for(int i = 0 ; i < s.size() ; i++){
for(int j = i + 1 ; j < s.size() ; j++){
if(s[i]+s[j] == k)sum.push_back(make_pair(s[i],s[j]));
}
}
cout << sum.size();
} | # 0204, 2024-10-15 09:23:28, PPPT (75%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k ;
vector<int> s;
vector<pair<int,int>> sum;
cin >> k;
while(cin >> n){
if(n >= k)continue;
s.push_back(n);
}
for(int i = 0 ; i < s.size() ; i++){
for(int j = i + 1 ; j < s.size() ; j++){
if(s[i]+s[j] == k)sum.push_back(make_pair(s[i],s[j]));
}
}
cout << sum.size();
} | # 0205, 2024-10-15 09:29:17, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k ;
set<int> s;
int sum = 0;
cin >> k;
while(cin >> n){
if(n > k)continue;
s.insert(n);
}
for(auto &x:s){
if(s.find(k-x) != s.end()){
sum++;
}
}
cout << sum/2;
} |
# 0206, 2024-10-15 09:17:53, ---- (0%)
#include <iostream>
#include <set>
using namespace std ;
int main() {
int k ;
cin >> k ;
set<int> set_s ;
int s ;
while (cin >> s) {
set_s.insert(s) ;
}
int tok = 0 ;
set<int> rep = {} ;
for (int a : set_s) {
tok = k - a ;
rep.insert(a) ;
// เจอในเซท s แต่ไม่เจอในเซทซ้ำ
if ((set_s.find(tok) != set_s.end()) && (rep.find(tok) == rep.end())) {
cout << a << "+" << tok << " = " << k << endl ;
}
}
} | # 0207, 2024-10-15 09:18:21, ---- (0%)
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <utility>
#include <tuple>
#include <map>
#include <set>
using namespace std ;
int main() {
int k ;
cin >> k ;
set<int> set_s ;
int s ;
while (cin >> s) {
set_s.insert(s) ;
}
int tok = 0 ;
set<int> rep = {} ;
for (int a : set_s) {
tok = k - a ;
rep.insert(a) ;
// เจอในเซท s แต่ไม่เจอในเซทซ้ำ
if ((set_s.find(tok) != set_s.end()) && (rep.find(tok) == rep.end())) {
cout << a << "+" << tok << " = " << k << endl ;
}
}
} | # 0208, 2024-10-15 09:21:42, PPPP (100%)
#include <iostream>
#include <set>
using namespace std ;
int main() {
int k ;
cin >> k ;
set<int> set_s ;
int s ;
while (cin >> s) {
set_s.insert(s) ;
}
int tok = 0 ; int i = 0 ;
set<int> rep = {} ;
for (int a : set_s) {
tok = k - a ;
rep.insert(a) ;
// เจอในเซท s แต่ไม่เจอในเซทซ้ำ
if ((set_s.find(tok) != set_s.end()) && (rep.find(tok) == rep.end())) {
i++ ;
}
}
cout << i ;
} |
# 0209, 2024-10-15 09:34:32, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,tod,total,c=0,stop=0;
set<int> num={};
cin>>total;
while(cin>>n){
num.insert({n,0});
}
for(auto i:num){
tod=total-i;
if(num.find(tod)!=num.end()){
c++;
}
}
c=c/2;
cout<<c<<endl;
for(auto i:num){
if(stop==c)break;
tod=total-i;
if(tod==0)continue;
if(num.find(tod)!=num.end()){
cout<<i<<"+"<<tod<<" = "<<total<<endl;
stop++;
}
}
return 0;
} | # 0210, 2024-10-15 09:35:31, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,tod,total,c=0,stop=0;
set<int> num={};
cin>>total;
while(cin>>n){
num.insert({n,0});
}
for(auto i:num){
tod=total-i;
if(num.find(tod)!=num.end()){
c++;
}
}
c=c/2;
cout<<c<<endl;
for(auto i:num){
if(stop==c)break;
tod=total-i;
if(tod==0||i==0)continue;
if(num.find(tod)!=num.end()){
cout<<i<<"+"<<tod<<" = "<<total<<endl;
stop++;
}
}
return 0;
} | # 0211, 2024-10-15 09:36:15, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,tod,total,c=0,stop=0;
set<int> num={};
cin>>total;
while(cin>>n){
num.insert({n,0});
}
for(auto i:num){
tod=total-i;
if(num.find(tod)!=num.end()){
c++;
}
}
c=c/2;
cout<<c;
/*for(auto i:num){
if(stop==c)break;
tod=total-i;
if(tod==0||i==0)continue;
if(num.find(tod)!=num.end()){
cout<<i<<"+"<<tod<<" = "<<total<<endl;
stop++;
}
}*/
return 0;
} |
# 0212, 2024-10-15 09:33:06, PPPP (100%)
#include<iostream>
#include<set>
using namespace std ;
int main()
{
int value ; cin >> value ;
int num ;
set<int> number ;
while(cin >> num) {
number.insert(num) ;
}
set<int> number_temp = number ;
int count = 0 ;
for(auto n : number) {
if(number_temp.find(value - n) != number_temp.end() && ((value - n) != n)) {
count++ ;
number_temp.erase(n) ;
}
}
cout << count ;
} | # 0213, 2024-10-15 09:37:29, ---- (0%)
#include<iostream>
#include<set>
using namespace std ;
int main()
{
int value ; cin >> value ;
int num ;
set<int> number ;
while(cin >> num) {
number.insert(num) ;
}
int count = 0 ;
for(auto n : number) {
if(number.find(value - n) != number.end() && ((value - n) != n)) {
count++ ;
}
}
cout << count ;
} | # 0214, 2024-10-15 09:38:28, PPPP (100%)
#include<iostream>
#include<set>
using namespace std ;
int main()
{
int value ; cin >> value ;
int num ;
set<int> number ;
while(cin >> num) {
number.insert(num) ;
}
set<int> number_temp = number ;
int count = 0 ;
for(auto n : number) {
if(number_temp.find(value - n) != number_temp.end() && ((value - n) != n)) {
count++ ;
number_temp.erase(n) ;
}
}
cout << count ;
} |
# 0215, 2024-10-15 09:17:38, P--- (25%)
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plpll;
typedef pair<ll, plpll> plplpll;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll maxn = 5e5 + 5;
void mains() {
ll n;
cin >> n;
vector<ll> vec;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
vec.push_back(x);
}
sort(vec.begin(), vec.end());
ll cnt = 0;
for (auto e : vec) {
cnt += binary_search(vec.begin(), vec.end(), n - e);
}
cout << cnt / 2 << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t = 1;
// cin >> t;
while (t--) {
mains();
}
return 0;
} | # 0216, 2024-10-15 09:20:38, Compilation error (0%)
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plpll;
typedef pair<ll, plpll> plplpll;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll maxn = 5e5 + 5;
void mains() {
ll n;
cin >> n;
vector<ll> vec;
while (cin >> x) {
vec.push_back(x);
}
sort(vec.begin(), vec.end());
ll cnt = 0;
for (auto e : vec) {
cnt += binary_search(vec.begin(), vec.end(), n - e);
}
cout << cnt / 2 << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t = 1;
// cin >> t;
while (t--) {
mains();
}
return 0;
} | # 0217, 2024-10-15 09:20:50, PPPP (100%)
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plpll;
typedef pair<ll, plpll> plplpll;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll maxn = 5e5 + 5;
void mains() {
ll n;
cin >> n;
vector<ll> vec;
ll x;
while (cin >> x) {
vec.push_back(x);
}
sort(vec.begin(), vec.end());
ll cnt = 0;
for (auto e : vec) {
cnt += binary_search(vec.begin(), vec.end(), n - e);
}
cout << cnt / 2 << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t = 1;
// cin >> t;
while (t--) {
mains();
}
return 0;
} |
# 0218, 2024-10-15 09:05:18, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
set<int> s;
int main(){
int cnt =0 ;
int n;
cin>>n;
int num;
while (cin>>num)
{
s.insert(num);
if(s.count(n-num)){
cnt++;
}
}
cout<<cnt;
} | # 0219, 2024-10-15 09:05:54, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
set<int> s;
int main(){
int cnt =0 ;
long long n;
cin>>n;
long long num;
while (cin>>num)
{
s.insert(num);
if(s.count(n-num)){
cnt++;
}
}
cout<<cnt;
} | # 0220, 2024-10-15 09:07:38, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
set<int> s;
int main(){
int cnt =0 ;
long long n;
cin>>n;
long long num;
while (cin>>num)
{
if(s.count(n-num)){
cnt++;
}
s.insert(num);
}
cout<<cnt;
} |
# 0221, 2024-10-15 09:44:33, PPPT (75%)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int a;
cin >> a;
int c;
vector<int> b;
vector<int> temp;
while (cin >> c) {
b.push_back(c);
}
sort(b.begin(), b.end());
for (int i = 0; i < b.size(); i++) {
if (b[i] < a) {
temp.push_back(b[i]);
}
}
int count = 0;
for (int i = 0; i < b.size(); i++) {
int target = a - b[i];
if (find(b.begin() + i + 1, b.end(), target) != b.end()) {
count++;
}
}
cout << count << endl;
return 0;
} | # 0222, 2024-10-15 09:50:01, PPPT (75%)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int a;
cin >> a;
int c;
vector<int> b;
vector<int> temp;
while (cin >> c) {
b.push_back(c);
}
sort(b.begin(), b.end());
int count = 0;
for (int i = 0; i < b.size(); i++) {
int target = a - b[i];
if ((find(b.begin() + i + 1, b.end(), target) != b.end())&&target>=0) {
count++;
}
}
cout << count << endl;
return 0;
} | # 0223, 2024-10-15 09:51:09, PPPP (100%)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int a;
cin >> a;
int c;
vector<int> b;
vector<int> temp;
while (cin >> c) {
b.push_back(c);
}
sort(b.begin(), b.end());
for (int i = 0; i < b.size(); i++) {
if (b[i] < a) {
temp.push_back(b[i]);
}
}
int count = 0;
for (int i = 0; i < temp.size(); i++) {
int target = a - temp[i];
if ((find(temp.begin() + i + 1, temp.end(), target) != temp.end())&&target>=0) {
count++;
}
}
cout << count << endl;
return 0;
} |
# 0224, 2024-10-15 09:24:52, -P-T (25%)
#include <iostream>
#include <vector>
using namespace std;
int findPairsWithSum(const vector<int>& arr, int K) {
int count = 0;
// ลูปค้นหาคู่ที่ผลรวมเท่ากับ K
for (int i = 0; i < arr.size(); i++) {
for (int j = i + 1; j < arr.size(); j++) {
if (arr[i] + arr[j] == K) {
count++;
}
}
}
return count;
}
int main() {
int K, n;
// รับจำนวนเต็ม K
cin >> K;
// รับจำนวนสมาชิกของชุดข้อมูล
cin >> n;
vector<int> arr(n);
// รับข้อมูลเข้า
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
// ค้นหาจำนวนคู่ที่มีผลรวมเท่ากับ K
int result = findPairsWithSum(arr, K);
// แสดงผลลัพธ์
cout << result << endl;
return 0;
} | # 0225, 2024-10-15 09:26:27, Compilation error (0%)
#include <iostream>
#include <unordered_set>
using namespace std;
int findPairsWithSum(const vector<int>& arr, int K) {
unordered_set<int> seen;
int count = 0;
// ลูปตรวจหาคู่ที่ผลรวมเท่ากับ K
for (int num : arr) {
int target = K - num;
// หาก target อยู่ในชุดที่เคยเจอมาแล้ว ก็เป็นคู่ที่เราต้องการ
if (seen.find(target) != seen.end()) {
count++;
}
// เพิ่มเลขปัจจุบันลงในชุด
seen.insert(num);
}
return count;
}
int main() {
int K, n;
// รับค่า K และจำนวนสมาชิกของชุดข้อมูล
cin >> K;
cin >> n;
vector<int> arr(n);
// รับข้อมูลเข้า
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
// ค้นหาจำนวนคู่ที่มีผลรวมเท่ากับ K
int result = findPairsWithSum(arr, K);
// แสดงผลลัพธ์
cout << result << endl;
return 0;
} | # 0226, 2024-10-15 09:28:53, PPPP (100%)
#include <iostream>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int K;
cin >> K; // รับค่าของ K
// รับข้อมูลชุด S
vector<int> S;
int num;
while (cin >> num) {
S.push_back(num);
}
unordered_set<int> seen; // ใช้ในการเก็บตัวเลขที่เคยเจอ
int count = 0;
// วนลูปเพื่อหาคู่ที่ผลรวมเท่ากับ K
for (int i = 0; i < S.size(); i++) {
int target = K - S[i]; // ค่าที่เราต้องการให้เป็นคู่กับ S[i]
if (seen.find(target) != seen.end()) {
// ถ้าค่า target เคยเจอแล้ว แสดงว่าเราเจอคู่
count++;
}
// เก็บค่า S[i] ลงใน set เพื่อใช้ในการตรวจสอบคู่ถัดไป
seen.insert(S[i]);
}
// แสดงผลลัพธ์
cout << count << endl;
return 0;
} |
# 0227, 2024-10-15 09:10:30, ---- (0%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int n;
cin >> n;
set<int> k;
int c = 0;
int a;
while(cin >> a ){
k.insert(a);
if(k.find(n-a) != k.end()){
c++;
}
}
} | # 0228, 2024-10-15 09:11:47, -PPP (75%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int n;
cin >> n;
set<int> k;
int c = 0;
int a;
while(cin >> a ){
k.insert(a);
if(k.find(n-a) != k.end()){
c++;
}
}
cout << c << endl;
} | # 0229, 2024-10-15 09:12:57, PPPP (100%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int n;
cin >> n;
set<int> k;
int c = 0;
int a;
while(cin >> a ){
k.insert(a);
if(n > a && n != a + a){
if(k.find(n-a) != k.end()){
c++;
}
}
}
cout << c << endl;
} |
# 0230, 2024-10-15 09:15:58, -P-- (25%)
#include <iostream>
#include <unordered_set>
#include <vector>
using namespace std;
int countPairsWithSum(const vector<int>& S, int K) {
unordered_set<int> seen;
int count = 0;
for (int num : S) {
int target = K - num;
if (seen.find(target) != seen.end()) {
count++;
}
seen.insert(num);
}
return count;
}
int main() {
int K, n;
cin >> K;
cin >> n;
vector<int> S(n);
for (int i = 0; i < n; i++) {
cin >> S[i];
}
int result = countPairsWithSum(S, K);
cout << result << endl;
return 0;
} | # 0231, 2024-10-15 09:22:01, PPPP (100%)
#include <iostream>
#include <unordered_set>
#include <vector>
using namespace std;
int countPairsWithSum(const vector<int>& S, int K) {
unordered_set<int> seen;
int count = 0;
for (int num : S) {
int target = K - num;
if (seen.find(target) != seen.end()) {
count++;
}
seen.insert(num);
}
return count;
}
int main() {
int K;
cin >> K;
vector<int> S;
int num;
while (cin >> num) {
S.push_back(num);
}
int result = countPairsWithSum(S, K);
cout << result << endl;
return 0;
} | # 0232, 2024-10-15 09:24:51, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int check(const vector<int>& S, int K) {
unordered_set<int> seen;
int count = 0;
for (int num : S) {
int focus = K - num;
if (seen.find(focus) != seen.end()) {
count++;
}
seen.insert(num);
}
return count;
}
int main() {
int K;
cin >> K;
vector<int> S;
int num;
while (cin >> num) {
S.push_back(num);
}
int result = check(S, K);
cout << result << endl;
return 0;
} |
# 0233, 2024-10-15 09:18:57, ---- (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
set<int> s;
int e;
int total;
cin >> total;
while(cin >> e){
if(e <= total){
s.insert(e);
}
}
int check=0;
int ans=0;
auto itr = s.begin();
for(int i : s){
if (s.find(total-*itr) != s.end()){
ans++;
}
}
cout << ans;
/*for (int e : s){
cout << e << ' ';
}*/
} | # 0234, 2024-10-15 09:23:36, ---- (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
set<int> s;
int e;
int total;
cin >> total;
while(cin >> e){
if(e <= total){
s.insert(e);
}
}
int check=0;
int ans=0;
auto itr = s.begin();
for(int i : s){
if (s.find(total-i) != s.end() && s.find(i) != s.end()){
cout << total-i << " : " << ans << endl;
ans++;
}
}
cout << ans/2;
/*for (int e : s){
cout << e << ' ';
}*/
} | # 0235, 2024-10-15 09:24:16, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main() {
set<int> s;
int e;
int total;
cin >> total;
while(cin >> e){
if(e <= total){
s.insert(e);
}
}
int check=0;
int ans=0;
auto itr = s.begin();
for(int i : s){
if (s.find(total-i) != s.end() && s.find(i) != s.end()){
//cout << total-i << " : " << ans << endl;
ans++;
}
}
cout << ans/2;
/*for (int e : s){
cout << e << ' ';
}*/
} |
# 0236, 2024-10-15 09:11:36, TTTT (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,x,res = 0;
cin >> n;
unordered_map<int,int> mp;
for(int i=0;i<=n;i++){
cin >> x;
if(mp[n-x]){
res++;
mp[n-x]--;
}
mp[x]++;
}
cout << res;
} | # 0237, 2024-10-15 09:12:42, TTTT (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,x,res = 0;
cin >> n;
unordered_map<int,int> mp;
for(int i=0;i<=n;i++){
cin >> x;
if(mp[n-x]){
res++;
mp[n-x]--;
}
mp[x]++;
}
cout << res;
} | # 0238, 2024-10-15 09:13:26, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,x,res = 0;
cin >> n;
unordered_map<int,int> mp;
for(int i=0;i<=n;i++){
cin >> x;
if(mp[n-x]){
res++;
mp[n-x]--;
}
mp[x]++;
}
cout << res;
} |
# 0239, 2024-10-15 09:33:35, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int countPairsWithSum(const set<int>& s, int k) {
unordered_map<int, int> frequency;
int pairCount = 0;
for (int num : s) {
int complement = k - num;
if (frequency[complement] > 0) {
pairCount += frequency[complement];
}
frequency[num]++;
}
return pairCount;
}
int main() {
int k;
cin >> k;
set<int> s;
int x;
while (cin >> x)
{
s.insert(x);
}
int result = countPairsWithSum(s, k);
cout << result;
return 0;
} | # 0240, 2024-10-15 09:35:28, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int countPairsWithSum(const set<int>& s, int k) {
unordered_set<int> seen;
int pairCount = 0;
for (int num : s) {
int complement = k - num;
if (seen.find(complement) != seen.end()) {
pairCount++;
}
seen.insert(num);
}
return pairCount;
}
int main() {
int k;
cin >> k;
set<int> s;
int x;
while (cin >> x) {
s.insert(x);
}
int result = countPairsWithSum(s, k);
cout << result << endl;
return 0;
} |
# 0241, 2024-10-15 09:16:00, PPPT (75%)
#include "bits/stdc++.h"
using namespace std;
int main(){
set <int> s;
int n; cin >> n;
int val;
while(cin >> val){
s.insert(val);
}
int sum = 0;
for (auto it1 = s.begin(); it1 != s.end(); ++it1) {
for (auto it2 = next(it1); it2 != s.end(); ++it2) {
if (*it1 + *it2 > n) break;
if (*it1 + *it2 == n) sum++;
}
}
cout << sum;
} | # 0242, 2024-10-15 09:16:59, PPPP (100%)
#include "bits/stdc++.h"
using namespace std;
int main(){
set <int> s;
int n; cin >> n;
int val,sum=0;
while(cin >> val){
sum += s.count(n-val);
s.insert(val);
}
cout << sum;
} |
# 0243, 2024-10-15 09:38:29, ---- (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
double k , input ;
int count = 0 ;
cin >> k ;
set<double> num ;
while (cin >> input) {
num.insert(input) ;
}
for (double e : num) {
if (e < k/2) {
if (num.find(k-e) != num.end()) {
count++ ;
} else break ;
}
}
cout << count ;
} | # 0244, 2024-10-15 09:40:11, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main() {
double k , input ;
int count = 0 ;
cin >> k ;
set<double> num ;
while (cin >> input) {
num.insert(input) ;
}
for (double e : num) {
if (e < k/2) {
if (num.find(k-e) != num.end()) {
count++ ;
}
} else break ;
}
cout << count ;
} |
# 0245, 2024-10-15 09:22:14, PPPT (75%)
#include <iostream>
#include <set>
using namespace std;
int main()
{
set<int> num;
int sum,inp,c=0;
cin >> sum;
while(cin >> inp)
{
num.insert(inp);
}
auto itrA = num.begin();
for (int i = 0; i < num.size(); i++)
{
auto itrB = itrA;
for (int j = i; j < num.size(); j++)
{
if(*itrA + *itrB == sum && itrA != itrB)
{
c++;
break;
}
itrB++;
}
itrA++;
}
cout << c;
return 0;
} | # 0246, 2024-10-15 09:31:35, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main()
{
set<int> num;
int sum,inp,c=0;
cin >> sum;
while(cin >> inp)
{
num.insert(inp);
}
auto itrA = num.begin();
for (int i = 0; i < num.size(); i++)
{
int diff = (sum - *itrA);
if(num.find(diff) != num.end()) c++;
itrA++;
}
cout << c/2;
return 0;
} |
# 0247, 2024-10-15 09:27:54, -PPP (75%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int K;
cin >> K;
int n;
set<int> S;
int count = 0;
while (cin >> n) {
S.insert(n);
}
while (S.size() != 0) {
auto e = S.begin();
int m = K-(*e);
if (S.find(m) != S.end()) {
count++;
S.erase(e);
S.erase(m);
} else {
S.erase(e);
}
}
cout << count << endl;
} | # 0248, 2024-10-15 09:32:21, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int K;
cin >> K;
int n;
set<int> S;
int count = 0;
while (cin >> n) {
S.insert(n);
}
while (S.size() != 0) {
auto e = S.begin();
int m = K-(*e);
S.erase(e);
if (S.find(m) != S.end()) {
count++;
S.erase(m);
}
}
cout << count << endl;
} |
# 0249, 2024-10-15 09:18:16, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main(int argc, const char **argv) {
set<int> arr;
int target;
cin >> target;
int tmp;
while (cin >> tmp)
arr.insert(tmp);
int cnt = 0;
for (auto &n : arr) {
int comp = target - n;
if (arr.find(comp) != arr.end()) cnt++;
}
cout << (cnt >> 1);
return 0;
} | # 0250, 2024-10-15 09:19:19, PPPP (100%)
#include <iostream>
#include <unordered_set>
using namespace std;
int main(int argc, const char **argv) {
unordered_set<int> arr;
int target;
cin >> target;
int tmp;
while (cin >> tmp)
arr.insert(tmp);
int cnt = 0;
for (auto &n : arr) {
int comp = target - n;
if (arr.find(comp) != arr.end()) cnt++;
}
cout << (cnt >> 1);
return 0;
} |
# 0251, 2024-10-15 09:13:50, -PPP (75%)
#include <vector>
#include <iostream>
#include <string>
#include <set>
#include <algorithm>
using namespace std;
int main(){
long count = 0;
set<long> n;
long k ;
long x;
cin>>k;
while(cin>>x){
n.insert(x);
}
auto s =n.begin();
auto e = --n.end();
while(s != e){
auto asd = *s+*e;
if(asd==k){
count++;
s++;
}else if(asd>k){
e--;
}else if(
asd<k
){
s++;
}
}
if((*s+*e)==k)count++;
cout<<count;
return 0;
} | # 0252, 2024-10-15 09:16:05, PPPP (100%)
#include <vector>
#include <iostream>
#include <string>
#include <set>
#include <algorithm>
using namespace std;
int main(){
long count = 0;
set<long> n;
long k ;
long x;
cin>>k;
while(cin>>x){
n.insert(x);
}
auto s =n.begin();
auto e = --n.end();
while(s != e){
auto asd = *s+*e;
if(asd==k){
count++;
s++;
}else if(asd>k){
e--;
}else if(
asd<k
){
s++;
}
}
cout<<count;
return 0;
} |
# 0253, 2024-10-15 09:17:39, PPPT (75%)
#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <vector>
#include <map>
using namespace std;
bool check(set<int>* num, int f){
for(const auto&i:*num){
if(i==f){
return true;
}
if(i>f){
break;
}
}
return false;
}
int main(){
int k;
cin>>k;
set<int> num;
int a;
while(cin>>a){
if(a<=k){
num.insert(a);
}
}
int count=0;
for (auto&l:num) {
if(check(&num,k-l)){
count++;
}
}
cout<<count/2;
} | # 0254, 2024-10-15 09:20:38, PPPP (100%)
#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <vector>
#include <map>
using namespace std;
/*bool check(set<int>* num, int f){
for(const auto&i:*num){
if(i==f){
return true;
}
if(i>f){
break;
}
}
return false;
}*/
int main(){
int k;
cin>>k;
set<int> num;
int a;
while(cin>>a){
if(a<=k){
num.insert(a);
}
}
int count=0;
for (auto&l:num) {
if(num.find(k-l)!=num.end()){
count++;
}
}
cout<<count/2;
} |
# 0255, 2024-10-15 09:20:12, PPPT (75%)
#include <iostream>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long long k;
cin >> k;
vector<long long> num;
long long n;
while(cin >> n) {
if(n < k) {
num.push_back(n);
}
}
sort(num.begin(),num.end());
long long count = 0;
long long s = num.size();
for(long long i = 0;i < s;i++) {
for(long long j = (s-1);j > i;j--) {
if(num[i] + num[j] == k) {
count += 1;
}
}
}
cout << count;
} | # 0256, 2024-10-15 09:22:53, PPPP (100%)
#include <iostream>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long long k;
cin >> k;
vector<long long> num;
long long n;
while(cin >> n) {
if(n < k) {
num.push_back(n);
}
}
sort(num.begin(),num.end());
long long count = 0;
long long s = num.size();
long long left = 0, right = s - 1;
while (left < right) {
long long sum = num[left] + num[right];
if (sum == k) {
count++;
left++;
right--;
} else if (sum < k) {
left++;
} else {
right--;
}
}
cout << count;
} |
# 0257, 2024-10-15 09:39:10, -PPP (75%)
#include<iostream>
#include<set>
int main (){
int a = 0 ;
std::cin >> a ;
std::set<int> b = {} ;
int c = 0 ;
while( std::cin >> c ){
b.insert( c ) ;
}
int count = 0 ;
for ( auto x = b.begin() ; x != b.end() ; x++ ){
int y = a - *x ;
if ( b.find( y ) != b.end() ){
count++ ;
b.erase( y ) ;
}else{
continue ;
}
}
std::cout << count ;
} | # 0258, 2024-10-15 09:46:49, PPPP (100%)
#include<iostream>
#include<set>
int main (){
int a = 0 ;
std::cin >> a ;
std::set<int> b = {} ;
int c = 0 ;
while( std::cin >> c ){
b.insert( c ) ;
}
int count = 0 ;
for ( auto x = b.begin() ; x != b.end() ; x++ ){
int y = a - *x ;
if ( y == *x ){
continue;
}
if ( b.find( y ) != b.end() ){
count++ ;
b.erase( y ) ;
}else{
continue ;
}
}
std::cout << count ;
} |
# 0259, 2024-10-15 09:08:54, PPPP (100%)
#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(){
set<int> input;
int k;
cin >> k;
int in;
while(cin >> in){
if(in == -1)
break;
input.insert(in);
}
int count = 0;
for(auto x : input){
if(input.find(k - x) != input.end() && x <= k)
count++;
}
cout << count / 2;
} | # 0260, 2024-10-15 09:15:11, PPPP (100%)
#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(){
set<int> input;
int k;
cin >> k;
int in;
while(cin >> in){
input.insert(in);
}
int count = 0;
for(auto x : input){
if(input.find(k - x) != input.end() && x <= k)
count++;
}
cout << count / 2;
} |
# 0261, 2024-10-15 09:10:30, ---x (0%)
#include <iostream>
#include <unordered_set>
using namespace std;
int main() {
int k;
cin >> k;
cin.ignore();
string txt;
getline(cin, txt);
unordered_set<int> set;
string n = "";
int count = 0;
for(char &c: txt) {
if(c != ' ') {
n += c;
}
else {
int num = stoi(n);
if(set.find(num) != set.end()) {
count++;
}
else {
set.emplace(k - num);
n = "";
}
}
}
int num = stoi(n);
if(set.find(num) != set.end()) count++;
cout << count << '\n';
return 0;
} | # 0262, 2024-10-15 09:11:30, PPPP (100%)
#include <iostream>
#include <unordered_set>
using namespace std;
int main() {
int k;
cin >> k;
cin.ignore();
string txt;
getline(cin, txt);
unordered_set<int> set;
string n = "";
int count = 0;
for(char &c: txt) {
if(c != ' ') {
n += c;
}
else {
int num = stoi(n);
if(set.find(num) != set.end()) {
count++;
}
else {
set.emplace(k - num);
}
n = "";
}
}
int num = stoi(n);
if(set.find(num) != set.end()) count++;
cout << count << '\n';
return 0;
} |
# 0263, 2024-10-15 09:25:27, PPPP (100%)
#include<set>
#include<vector>
#include<iostream>
using namespace std;
int main(){
int n,input;
set<int> S;
int sum=0;
cin>>n;
while(cin>>input){
sum += S.count(n-input);
S.insert(input);
}
cout<<sum;
} | # 0264, 2024-10-15 09:39:29, PPPP (100%)
#include<set>
#include<vector>
#include<iostream>
using namespace std;
int main(){
int n,input;
set<int> S;
int sum=0;
cin>>n;
while(cin>>input){
//sum += S.count(n-input);
S.insert(input);
}
for(auto x:S){
sum+=S.count(n-x);
}
cout<<sum/2;
} |
# 0265, 2024-10-15 09:37:21, ---- (0%)
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main(){
map<string,vector<string>> c;
vector<string> seq;
string name,type;
while(cin >> name >> type){
if(!c.count(type)){
c[type] = {};
seq.push_back(type);
}
c[type].push_back(name);
}
for(auto type : seq){
cout << type << ": ";
for(auto name : c[type]){
cout << name << " ";
}
cout << endl;
}
} | # 0266, 2024-10-15 09:37:41, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int K,n;
cin >> K;
set <int> s;
int c=0;
while(cin >> n){
c+=s.count(K-n);
s.insert(n);
}
cout << c;
} |
# 0267, 2024-10-15 09:31:08, Compilation error (0%)
#include<iostream>
#include<set>
using namespace std;
int main()
{
int sum;
cin>>sum;
set<int> s;
set<tuple<int,int>> ans;
int in;
int c=0;
while(cin>>in) s.insert(in);
for(auto e : s)
{
if(e>= sum-e) break;
if(s.find(sum-e) != s.end())
c++;
}
cout<<c;
} | # 0268, 2024-10-15 09:32:23, PPPP (100%)
#include<iostream>
#include<set>
using namespace std;
int main()
{
int sum;
cin>>sum;
set<int> s;
int in;
int c=0;
while(cin>>in) s.insert(in);
for(auto e : s)
{
if(e>= sum-e) break;
if(s.find(sum-e) != s.end())
c++;
}
cout<<c;
} |
# 0269, 2024-10-15 09:09:50, -PPP (75%)
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
set<int> s;
int in, cnt = 0;
while(cin >> in) {
s.insert(in);
}
for(auto it : s) {
if(it > n/2) break;
if(s.find(n-it) != s.end()) cnt++;
}
cout << cnt;
return 0;
} | # 0270, 2024-10-15 09:11:43, PPPP (100%)
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
set<int> s;
int in, cnt = 0;
while(cin >> in) {
s.insert(in);
}
for(auto it : s) {
if(it > n/2) break;
if(s.find(n-it) != s.end() && n-it != it) cnt++;
}
cout << cnt;
return 0;
} |
# 0271, 2024-10-15 09:27:38, ---- (0%)
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(){
//n+m=sum
set<int> s, s_more, s_less;
int sum,n,m;
cin>>sum;
while(cin>>n){
m=sum-n;
if(s.find(m)!=s.end()){
if(n>m){
s_more.insert(n);
s_less.insert(m);
}
else{
s_more.insert(m);
s_less.insert(n);
}
}
s.insert(n);
}
auto more = s_more.begin();
auto less = s_less.begin();
cout<<s_less.size()<<endl;
while(less!=s_less.end()){
cout<<*less<<"+"<<*more<<"="<<sum<<endl;
less++;
more++;
}
} | # 0272, 2024-10-15 09:28:25, PPPP (100%)
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(){
//n+m=sum
set<int> s, s_more, s_less;
int sum,n,m;
cin>>sum;
while(cin>>n){
m=sum-n;
if(s.find(m)!=s.end()){
if(n>m){
s_more.insert(n);
s_less.insert(m);
}
else{
s_more.insert(m);
s_less.insert(n);
}
}
s.insert(n);
}
auto more = s_more.begin();
auto less = s_less.begin();
cout<<s_less.size()<<endl;
} |
# 0273, 2024-10-15 09:14:47, Compilation error (0%) . | # 0274, 2024-10-15 09:43:06, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
void testprint(set<int> s){
for(auto c : s){
cout << c << " ";
}
}
int main(){
int k;
cin >> k;
cin.ignore();
string line;
getline(cin,line);
string num = "";
set<int> s;
int count = 0;
line += " ";
for(auto c : line){
if(c != ' '){
num += c;
}else{
int n = stoi(num);
if(s.find(n) == s.end()){
s.insert(k-n);
}else{
count++;
//cout << count << endl;
}
num = "";
}
}
cout << count;
} |
# 0275, 2024-10-15 09:14:39, -PPP (75%)
#include<bits/stdc++.h>
using namespace std ;
int main(){
int k ;
cin >> k;
int x ;
set<int> set ;
int count = 0 ;
while (cin >> x ){
set.insert(x);
}
for(int i = 0 ; i <= k/2 ;i++){
if( set.find(i) != set.end() && set.find(k-i) != set.end() ){
count++ ;
}
}
cout << count ;
} | # 0276, 2024-10-15 09:17:18, PPPP (100%)
#include<bits/stdc++.h>
using namespace std ;
int main(){
int k ;
cin >> k;
int x ;
set<int> set ;
int count = 0 ;
while (cin >> x ){
set.insert(x);
}
for(int i = 0 ; i <= k/2 ;i++){
if( set.find(i) != set.end() && set.find(k-i) != set.end() && set.find(i) != set.find(k-i)){
count++ ;
}
}
cout << count ;
} |
# 0277, 2024-10-15 09:31:50, ---- (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int input;
set<int> data;
while (cin >> input){
data.insert(input);
}
for (auto a : data){
if (data.find(n - a) != data.end() && a < n - a){
cout << a << "+" << n - a << " = " << n << endl;
}
}
} | # 0278, 2024-10-15 09:33:34, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int input , count = 0;
set<int> data;
while (cin >> input){
data.insert(input);
}
for (auto a : data){
if (data.find(n - a) != data.end() && a < n - a){
++count;
}
}
cout << count;
} |
# 0279, 2024-10-15 09:44:23, Compilation error (0%)
```c++
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> v;
int x,cnt=0,sum;
cin>>sum;
while(cin>>x)v.push_back(x);
sort(v.begin(),v.end());
int l=0,r=v.size()-1;
for(int i=0;i<v.size();i++){
if(v[l]+v[r]>sum)r--;
else if(v[l]+v[r]<sum)l++;
else if(v[l]+v[r]==sum && l!=r){
cnt++;l++;
}
}
cout<<cnt;
}
``` | # 0280, 2024-10-15 09:45:45, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> v;
int x,cnt=0,sum;
cin>>sum;
while(cin>>x)v.push_back(x);
sort(v.begin(),v.end());
int l=0,r=v.size()-1;
for(int i=0;i<v.size();i++){
if(v[l]+v[r]>sum)r--;
else if(v[l]+v[r]<sum)l++;
else if(v[l]+v[r]==sum && l!=r){
cnt++;l++;
}
}
cout<<cnt;
} |
# 0281, 2024-10-15 09:14:13, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
set<int> s;
int sum,x,count=0;
cin >> sum;
while(cin >> x){
if(x<=sum){
s.insert(x);
}
}
set<int>::iterator it1;
set<int>::iterator it2;
for(it1=s.begin();it1!=s.end();it1++){
for(it2=--s.end();it2!=--s.begin();it2--){
if(*it1+*it2==sum){
count++;
}
}
}
cout << count/2;
} | # 0282, 2024-10-15 09:22:46, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
set<int> s;
int i,j,target,x,count=0;
cin >> target;
while(cin >> x){
s.insert(x);
}
set<int>::iterator it;
for(it=s.begin();it!=s.end();it++){
if(s.find(target-*it)!=s.end()){
count++;
}
}
cout << count/2;
} |
# 0283, 2024-10-15 09:40:30, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main(){
set<long long int> number;
long long int sumnum,initnum,i,item=0;
cin >> sumnum;
while (cin >> initnum) {
if(initnum<=sumnum){
number.insert(initnum);
}
}
for(auto i : number){
if(number.find(sumnum-i)!=number.end()){
item++;
}
}
cout << item/2 ;
} | # 0284, 2024-10-15 09:40:49, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main(){
set<long long int> number;
long long int sumnum,initnum,i,item=0;
cin >> sumnum;
while (cin >> initnum) {
if(initnum<=sumnum){
number.insert(initnum);
}
}
for(auto i : number){
if(number.find(sumnum-i)!=number.end()){
item++;
}
}
cout << item/2 ;
return 0;
} |
# 0285, 2024-10-15 09:39:03, PPPP (100%)
#include <iostream>
#include <set>
#include <map>
using namespace std;
set<int> s;
map<int, int> m;
int main(){
int k;
cin >> k;
int x;
while(cin >> x){
s.insert(x);
}
for(int a : s){
m[a] = a;
}
int cnt = 0;
for(auto a : m){
int carry = k-a.first;
if(m.find(carry)!=m.end()) cnt++;
}
cout << cnt/2;
} | # 0286, 2024-10-15 09:40:59, ---- (0%)
#include <iostream>
#include <set>
#include <map>
using namespace std;
set<int> s;
map<int, int> m;
int main(){
int k;
cin >> k;
int x;
while(cin >> x) s.insert(x);
for(int a : s) m[a] = a;
int cnt = 0;
for(auto a : m){
int carry = k-a.first;
if(m[carry]) cnt++;
}
cout << cnt/2;
} |
# 0287, 2024-10-15 09:12:09, PPPT (75%)
#include <iostream>
#include <set>
using namespace std;
int main()
{
int sum;
int input;
set<int> number;
set<int> temp;
cin >> sum;
while(cin >> input)
{
if(input < sum)
{
number.insert(input);
}
}
int count = 0;
temp = number;
/*for(int s : number)
{
cout << s << endl;
}*/
for(int s : temp)
{
for(int g : number)
{
if(s+g == sum)
{
++count;
}
}
}
cout << count/2;
} | # 0288, 2024-10-15 09:14:07, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main()
{
int sum;
int input;
set<int> number;
set<int> temp;
cin >> sum;
while(cin >> input)
{
if(input < sum)
{
number.insert(input);
}
}
int count = 0;
temp = number;
/*for(int s : number)
{
cout << s << endl;
}*/
for(int s : temp)
{
if(temp.find(sum-s)!= temp.end())
++count;
/*for(int g : number)
{
if(s+g == sum)
{
++count;
}
}*/
}
cout << count/2;
} |
# 0289, 2024-10-15 09:27:42, ---- (0%)
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
set<int> s; //set to search
vector<int> num;
vector<int> v; //store int that find its pair
int target,n;
cin >> target;
while (cin >> n) {
s.insert(n);
}
for (auto e:s) {
if (e>target/2) continue;
if (target%2==0){
if (s.find(target-e)!=s.end()&&e!=target/2) v.push_back(e);
}
else if (s.find(target-e)!=s.end()) v.push_back(e);
}
if (v.size()!=0) {
for (int i=0;i<v.size();i++) {
cout << v[i] << "+" << target-v[i] << " = " << target << endl;
}
}
else cout << 0;
} | # 0290, 2024-10-15 09:28:47, PPPP (100%)
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
set<int> s; //set to search
vector<int> v; //store int that find its pair
int target,n;
cin >> target;
while (cin >> n) {
s.insert(n);
}
for (auto e:s) {
if (e>target/2) continue;
if (target%2==0){
if (s.find(target-e)!=s.end()&&e!=target/2) v.push_back(e);
}
else if (s.find(target-e)!=s.end()) v.push_back(e);
}
// if (v.size()!=0) {
// for (int i=0;i<v.size();i++) {
// cout << v[i] << "+" << target-v[i] << " = " << target << endl;
// }
// }
// else cout << 0;
cout << v.size();
} |
# 0291, 2024-10-15 09:23:30, PPPT (75%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int sum;
cin >> sum;
set<int> lesserHalf, greaterHalf;
int input;
while (cin >> input) {
if (input < (sum/2)) {
lesserHalf.insert(input);
} else if (input > (sum/2)) {
greaterHalf.insert(input);
}
}
int pair_count = 0;
for (auto num : lesserHalf) {
for (auto num2 : greaterHalf) {
if (num + num2 > sum) {break;}
else if (num + num2 == sum) {pair_count++;}
}
}
cout << pair_count << endl;
} | # 0292, 2024-10-15 09:45:22, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int sum;
cin >> sum;
set<int> lesserHalf, greaterHalf;
int input;
while (cin >> input) {
if (input < (sum/2.0)) {
lesserHalf.insert(input);
} else if (input >= (sum/2.0)) {
greaterHalf.insert(input);
} /*else if (input == (sum/2)) {
} */
}
int pair_count = 0;
for (auto num : lesserHalf) {
if (greaterHalf.find(sum - num) != greaterHalf.end()) {
++pair_count;
}
}
cout << pair_count << endl;
} |
# 0293, 2024-10-15 09:25:45, P-P- (50%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int sum,n,total = 0,temp;
cin >> sum;
set <int> num;
while (cin >> n){
num.insert(n);
}
for (auto c: num) {
temp = sum - c;
if (num.find(temp) != num.end() && temp != c) {
total += 1;
}
if (c >= sum/2) break;
}
cout << total;
} | # 0294, 2024-10-15 09:27:03, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int sum,n,total = 0,temp;
cin >> sum;
set <int> num;
while (cin >> n){
num.insert(n);
}
for (auto c: num) {
temp = sum - c;
if (num.find(temp) != num.end() && temp != c) {
total += 1;
}
}
cout << total/2;
} |
# 0295, 2024-10-15 09:26:53, ---- (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, cnt; cin >> n;
set <int> number;
while (cin >> m) {
int dif = n - m;
if (number.find(dif) != number.end()) cnt++;
number.insert(m);
}
cout << cnt;
} | # 0296, 2024-10-15 09:27:39, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, cnt = 0 ; cin >> n;
set <int> number;
while (cin >> m) {
int dif = n - m;
if (number.find(dif) != number.end()) cnt++;
number.insert(m);
}
cout << cnt;
} |
# 0297, 2024-10-15 09:11:12, PPPP (100%)
#include <iostream>
#include <cmath>
#include <set>
using namespace std;
int main(){
int target,cnt=0;
cin>>target;
set<int> mem;
int tmp;
while(cin>>tmp){
mem.insert(tmp);
}
for(auto i : mem){
int now = target - i;
bool found = mem.find(now) != mem.end() ? true : false;
if(found){
cnt++;
}
}
cout<<ceil(cnt/2);
return 0;
} | # 0298, 2024-10-15 09:13:08, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int target,cnt=0;
cin>>target;
set<int> mem;
int tmp;
while(cin>>tmp){
mem.insert(tmp);
}
for(auto i : mem){
int now = target - i;
bool found = mem.find(now) != mem.end() ? true : false;
if(found){
cnt++;
}
}
cout<<cnt/2;
return 0;
} |
# 0299, 2024-10-15 09:19:16, ---- (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
set<int> s;
int n,d,count;
cin >> n;
while (cin >> d)
{
s.insert(d);
}
for (auto &q : s) if(s.find(n-q) != s.end()) count++;
cout << count/2;
} | # 0300, 2024-10-15 09:19:49, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main() {
set<int> s;
int n,d,count = 0;
cin >> n;
while (cin >> d)
{
s.insert(d);
}
for (auto &q : s) if(s.find(n-q) != s.end()) count++;
cout << count/2;
} |
# 0301, 2024-10-15 09:24:25, -PPP (75%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k,var;
cin >> k;
set<int> s;
while(cin >> var){
s.insert(var);
}
int count=0;
for(auto it=s.begin(); it!=s.end(); it++){
var=*it;
if(s.find(k-var)!=s.end()){
// cout << var << "+" << k-var << " = " << k << endl;
count++;
s.erase(s.find(k-var));
}
}
cout << count;
} | # 0302, 2024-10-15 09:25:57, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k,var;
cin >> k;
set<int> s;
while(cin >> var){
s.insert(var);
}
int count=0;
for(auto it=s.begin(); it!=s.end(); it++){
var=*it;
if(s.find(k-var)!=s.end()&&s.find(k-var)!=it){
// cout << var << "+" << k-var << " = " << k << endl;
count++;
s.erase(s.find(k-var));
}
}
cout << count;
} |
# 0303, 2024-10-15 09:43:56, PPPP (100%)
#include <iostream>
#include <set>
#include <utility>
int main(){
int k,n,count = 0;
std::set<int> Set;
std::set<std::pair<int,int>> Pair;
std::cin >> k;
while(std::cin >> n){
if(Set.find(k - n) != Set.end()){
count++;
}
Set.insert(n);
if(std::cin.peek() == '\n'){
break;
}
}
std::cout << count;
return 0;
} |
# 0304, 2024-10-15 09:03:07, PPPP (100%)
#include<iostream>
#include<set>
#include<string>
using namespace std;
int main(){
int K,result=0;
set<int> S;
string s,temp="";
cin>>K;
cin.ignore();
getline(cin,s);
for(int i=0;i<s.length();i++){
if(s[i]!=' '||i==s.length()-1){
temp.push_back(s[i]);
}else{
S.insert(stoi(temp));
temp.clear();
}
}
S.insert(stoi(temp));
for(int i:S){
if(K-i<=i){
break;
}else{
if(S.find(K-i)!=S.end()){
result++;
}
}
}
cout<<result;
} |
# 0305, 2024-10-15 09:18:09, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
set<int> s;
int n,x,cnt=0;
cin>>n;
while(cin>>x) s.insert(x);
for(auto &i:s) if(s.find(n-i)!=s.end()&&n-i!=i) cnt++;
cout<<cnt/2;
} |
# 0306, 2024-10-15 09:15:08, PPPP (100%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int n =0,m=0;
cin >> n;
set<int> b; //input
set<pair<int,int>> s; //pair output
while(cin >>m){
if(m<=n)b.insert(m); //รับแต่ตัวที่ไม่เกิน
}
for(auto c = b.begin();c!=b.end();++c){
if(b.find(n-(*c)) != b.end()){
// cout << (*c) << " " << n-(*c) << endl;
s.insert(make_pair((*c),n-(*c)));
}
}
cout << s.size()/2 << endl;
} |
# 0307, 2024-10-15 09:18:36, PPPP (100%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int k; cin>>k;
int count=0;
set<int> collection;
int e;
int lookfor;
while(cin>>e){
collection.insert(e);
}
for(int i : collection){
lookfor=k-i;
if(collection.find(lookfor) != collection.end()){
count+=1;
}
}
cout<<count/2;
} |
# 0308, 2024-10-15 09:17:16, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int ans = 0;
int k;cin >> k;
set<int> s;
int n;
while(cin >> n){
s.insert(n);
}
int a = 1;
int b = k-1;
for(int i = 0;i < (k/2)+1;i++){
if(a != b){
if(s.find(a) != s.end()){
if(s.find(b) != s.end()){
ans++;
}
}
a++;
b--;
}
}
cout << ans;
} |
# 0309, 2024-10-15 09:16:54, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int k;
cin >> k;
set<int> s;
int n;
while(cin >> n)
{
if(n <= k)
{
s.insert(n);
}
}
int sum = 0;
for(auto e : s)
{
if(s.find(k-e) != s.end())
{
//cout << e << endl;
sum++;
}
}
cout << sum/2 << endl;
return 0;
} |
# 0310, 2024-10-15 09:05:00, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;
cin>>k;
set<int> s;
int x,count=0;
while (cin>>x){
count +=s.count(k-x);
s.insert(x);
}
cout<<count;
} |
# 0311, 2024-10-15 09:09:14, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int n;
cin >> n;
set<int> found;
int x, result = 0;
while(cin >> x){
int thePair = n - x;
if(found.count(thePair)){
result++;
}
found.insert(x);
}
cout << result;
} |
# 0312, 2024-10-15 09:43:17, PPPP (100%)
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;
int main(){
int n; cin >> n;
set<int> num;
int input;
while(cin >> input){
num.insert(input);
}
int count = 0;
for (int e : num){
if (num.find(n-e) != num.end()){
count++;
}
}
cout << count/2;
} |
# 0313, 2024-10-15 09:07:07, PPPP (100%)
#include<bits/stdc++.h>
#define endl "\n"
using namespace std;
int main(){
int k,n,cnt=0;
cin >> k;
set<int> s;
while(cin >> n){
s.insert(n);
}
for(int n:s){
if(n>=k-n){
break;
}
if(s.find(k-n)!=s.end()){
cnt++;
}
}
cout << cnt;
} |
# 0314, 2024-10-15 09:33:20, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k;cin>>k;
set<int>all;
int n;
int count=0;
while (cin>>n){
all.insert(n);
}
for (auto e:all){
if(all.find(k-e)!=all.end()){
count++;
}
}
cout <<count/2;
} |
# 0315, 2024-10-15 09:17:34, PPPP (100%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int k;
cin >> k;
set<int> d;
int e;
while(cin >> e){
d.insert(e);
}
int c=0;
for(auto e : d){
if(d.find(k-e) != d.end()) ++c;
}
cout << c/2;
} |
# 0316, 2024-10-15 09:38:14, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main(){
set <int> s;
int n,t;
cin >> t;
set <int> s2;
while(cin >> n){
if(n < t){
s.insert(n);
}
}
int cnt = 0;
for(auto e:s){
if(s.find(t-e) != s.end()){
cnt++;
}
}
cout << cnt/2;
} |
# 0317, 2024-10-15 09:29:57, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int K;
cin >> K;
set<int> S;
int num;
while (cin >> num) {
S.insert(num);
}
int count = 0;
for (auto it = S.begin(); it != S.end(); ) {
int x = *it;
int pairValue = K - x;
if (S.find(pairValue) != S.end() && pairValue != x) {
count++;
S.erase(it++);
S.erase(pairValue);
} else {
++it;
}
}
cout << count << endl;
return 0;
} |
# 0318, 2024-10-15 09:44:55, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> v;
int x,cnt=0,sum;
cin>>sum;
while(cin>>x)v.push_back(x);
sort(v.begin(),v.end());
int l=0,r=v.size()-1;
for(int i=0;i<v.size();i++){
if(v[l]+v[r]>sum)r--;
else if(v[l]+v[r]<sum)l++;
else if(v[l]+v[r]==sum && l!=r){
cnt++;l++;
}
}
cout<<cnt;
} |
# 0319, 2024-10-15 09:19:14, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
set<int> line;
while (cin >> b) {
line.insert(b);
}
int sum = 0;
for (auto c : line) {
int k = a - c;
if (line.find(k) != line.end()) {
sum += 1;
}
}
cout << sum / 2;
} |
# 0320, 2024-10-15 09:24:09, PPPP (100%)
#include <iostream>
#include <set>
long long sumToFind;
long long num;
std::set<int> Set;
long long counter = 0;
int main()
{
std::cin >> sumToFind;
while (std::cin >> num)
{
if (num <= sumToFind)
{
Set.insert(num);
}
}
for (auto x : Set)
{
if (Set.find(sumToFind - x) != Set.end() && sumToFind - x != x)
{
counter++;
}
}
std::cout << counter/2;
} |
# 0321, 2024-10-15 09:26:00, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main(){
set<int> s;
int n; cin >> n;
int x;
while(cin >> x){
s.insert(x);
}
int size = s.size();
int count = 0;
int ans = 0;
auto e = s.end();
e--;
// for(auto a : s) cout << a << ' ';
// cout << '\n';
// cout << *s.begin() << ' ' << *e << '\n';
for(auto st=s.begin();st != s.end();){
// cout << *st << ' ' << *e << '\n';
if(*st >= *e) break;
if(*st + *e > n){
e--;
}
else if(*st + *e < n){
st++;
}
else if(*st + *e == n){
// cout << "equal" << '\n';
ans+=1;
// cout << ans << '\n';
st++;
e--;
}
count++;
}
cout << ans;
} |
# 0322, 2024-10-15 09:28:48, PPPP (100%)
#include<iostream>
#include<set>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int k,num,cnt=0;
cin>>k;
set<int> vec;
while(cin>>num){
vec.insert(num);
}
for(int e:vec){
if(e >=k-e) break;
if(vec.find(k-e) != vec.end()) cnt++; //if found
}
cout<<cnt;
} |
# 0323, 2024-10-15 09:38:42, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vt vector
#define pb push_back
#define sz(x) (int)x.size()
#define arr_sz(x) (int)sizeof(x)/size(x[0])
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll k; cin >> k;
cin.ignore();
string input; getline(cin,input);
stringstream ss(input);
string token;
set<ll> value;
while(getline(ss,token, ' ')){
value.insert(stoll(token));
}
ll cnt=0;
for(auto t:value){
//found
if(value.find(k-t) != value.end()) cnt++;
}
cout << cnt/2;
return 0;
} |
# 0324, 2024-10-15 09:51:07, PPPP (100%)
#include <iostream>
#include <set>
using namespace std ;
int main (){
int k; cin>>k;
set <int> list;
while(cin){
int num;
cin>> num;
list.insert(num);
}
int count = 0;
int temp1,temp2;
set <int> current;
for (auto e : list){
if (list.find(abs(k-e)) != list.end() && e != abs(k-e)&& k-e != k && k>=e && current.find(e) == current.end() ){
count++;
current.insert(e);
current.insert(k-e);
}
}
cout << count;
} |
# 0325, 2024-10-15 09:28:33, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main () {
set<int> numbers,used;
int k,num;
cin >> k;
while (cin >> num) {
numbers.insert(num);
}
int count=0;
for (int e:numbers) {
int n=k-e;
if (numbers.find(n)!=numbers.end()&&used.find(n)==used.end()) {
count++;
}
used.insert(n);
}
cout << count/2 << endl;
} |
# 0326, 2024-10-15 09:12:45, PPPP (100%)
#include<iostream>
#include<set>
using namespace std;
int main()
{
int k,input,total=0;
set<int> sinput;
cin>>k;
while (cin>>input)
{
sinput.insert(input);
}
for(int i : sinput)
{
if(sinput.find(k-i)!=sinput.end()&&k-i!=i)
{
++total;
}
}
cout<<total/2;
return 0;
} |
# 0327, 2024-10-15 09:16:29, PPPP (100%)
#include<iostream>
#include<set>
using namespace std;
int main () {
int s;
cin >> s;
set<int> a;
int n;
while (cin >> n) {
a.insert(n);
}
int c = 0;
for (int n : a) {
if (a.find(s-n) != a.end()) {
c++;
}
}
cout << c/2;
} |
# 0328, 2024-10-15 09:17:50, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int n, x, cnt=0;
cin >> n;
set<int> s;
while (cin >> x){
cnt += s.count(n-x);
s.insert(x);
}
cout << cnt;
return 0;
} |
# 0329, 2024-10-15 09:24:35, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
using vll=vector<ll>;
using vpl=vector<pll>;
using vstr=vector<string>;
using sll=set<ll>;
using spl=set<pll>;
using qll=queue<ll>;
ll INF=1e18;
#define PI 3.14159265
ll MOD=1e9+7;
string kval;
ll k;
string s;
sll v;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
getline(cin,kval);
k=stoi(kval);
getline(cin,s);
string dummy="";
for(ll i=0;i<(ll)(s.size());i++){
if(s[i]!=' '){
dummy += s[i];
}
else{
//cout << dummy << '\n';
v.insert(stoi(dummy));
dummy="";
}
}
v.insert(stoi(dummy));
ll c=0;
for(auto x:v){
if(v.find(k-x)!=v.end()){
c++;
}
}
cout << c/2 << '\n';
return 0;
} |
# 0330, 2024-10-15 09:21:56, PPPP (100%)
#include <iostream>
#include <vector>
#include <unordered_set>
#include <sstream>
using namespace std;
int main()
{
int K, num;
cin >> K;
cin.ignore();
string line;
getline(cin, line);
stringstream ss(line);
vector<int> nums;
while (ss >> num)
{
nums.push_back(num);
}
unordered_set<int> seen;
unordered_set<string> counted;
int count = 0;
for (int i = 0; i < nums.size(); i++)
{
int complement = K - nums[i];
if (seen.count(complement))
{
int a = min(nums[i], complement);
int b = max(nums[i], complement);
string key = to_string(a) + "," + to_string(b);
if (!counted.count(key))
{
count++;
counted.insert(key);
}
}
seen.insert(nums[i]);
}
cout << count << endl;
} |
# 0331, 2024-10-15 09:43:15, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> v;
int x,cnt=0,sum;
cin>>sum;
while(cin>>x)v.push_back(x);
sort(v.begin(),v.end());
int l=0,r=v.size()-1;
for(int i=0;i<v.size();i++){
if(v[l]+v[r]>sum)r--;
else if(v[l]+v[r]<sum)l++;
else if(v[l]+v[r]==sum && l!=r){
cnt++;l++;
}
}
cout<<cnt;
} |
# 0332, 2024-10-15 09:28:03, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
set<int> numlist;
int input;
while (cin >> input) {
numlist.insert(input);
}
set<int>::iterator backBorder;
for (set<int>::iterator i = numlist.begin(); i != numlist.end(); i++)
{
if (*i >= n) break;
else backBorder = i;
}
set<int>::iterator frontBorder = numlist.begin();
int ans = 0;
while (*frontBorder < *backBorder)
{
if (*frontBorder + *backBorder > n)
{
backBorder--;
}
else if (*frontBorder + *backBorder < n)
{
frontBorder++;
}
else
{
frontBorder++;
backBorder--;
ans++;
}
}
cout << ans;
return 0;
} |
# 0333, 2024-10-15 09:14:33, PPPP (100%)
#include <iostream>
#include <string>
#include <vector>
#include <set>
using namespace std;
int main()
{
int num;
cin >> num;
set<int> p;
int m;
while (cin >> m)
{
p.insert(m);
}
int l = 0;
for (auto e : p)
{
if (p.find(num - e) != p.end())
{
l++;
}
}
cout << l / 2;
} |
# 0334, 2024-10-15 09:40:25, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int K;
cin >> K;
set<int> seen;
int num, pairCount = 0;
while (cin >> num) {
int complement = K - num;
if (seen.find(complement) != seen.end()) {
pairCount++;
}
seen.insert(num);
}
cout << pairCount << std::endl;
return 0;
} |
# 0335, 2024-10-15 09:24:16, PPPP (100%)
#include <iostream>
#include <set>
#include <string>
#include <sstream>
using namespace std;
int main () {
long long k;
cin >> k;
cin.ignore();
string s;
getline(cin,s);
stringstream each(s);
string num;
set <long long> allnum;
while (each>>num) {
long long a = stoll(num);
allnum.insert(a);
}
long long count = 0;
for (auto itr = allnum.begin();itr != allnum.end();itr++) {
long long soulmate = k-(*itr);
if(allnum.find(soulmate)!=allnum.end()) {
count++;
}
}
cout << count/2;
} |
# 0336, 2024-10-15 09:25:03, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
// int main()
// {
// vector<long long> v ;
// int m,n;
// cin>>m;
// while(cin>>n){
// v.push_back(n);
// }
// sort(v.begin(), v.end());
// if()
// for(int i=0;i<v.size();i++){
// for(int j=0;j<v.size();j++){
// }
// }
// for( auto e:v){
// cout<<e;
// }
// }
int main()
{
int n;
cin>>n;
int count=0;
set<int> kep;
int e;
int chek;
while(cin>>e){
kep.insert(e);
}
for( int i: kep){
chek=n-i;
if(kep.find(chek) != kep.end()){
count++;
}
}
cout<<count/2;
} |
# 0337, 2024-10-15 09:11:39, PPPP (100%)
#include <map>
#include <set>
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int k; cin >> k;
int x;
int output = 0;
set<int> nums, req, out;
while(cin>>x){
if(x<k){
nums.insert(x);
req.insert(k-x);
//cout << "insert: " << x << " req : " << k-x << endl;
}
}
set_intersection(nums.begin(),nums.end()
,req.begin(),req.end(), inserter(out,out.begin()));
output = out.size()/2;
cout << output;
} |
# 0338, 2024-10-15 09:12:44, PPPP (100%)
#include<iostream>
#include<set>
#include<string>
using namespace std;
int main(){
set<int> dat;
int K; cin >> K;
int raw_dat;
// Many input
while(cin >> raw_dat){
dat.insert(raw_dat);
}
// Find Number
int cnt = 0, numFind = 0;
for(auto e: dat){
numFind = K-e;
if(dat.find(numFind) !=dat.end()){
cnt++;
}
}
cnt/=2;
cout << cnt;
return 0;
} |
# 0339, 2024-10-15 09:22:16, PPPP (100%)
#include <iostream>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int K;
cin >> K;
unordered_set<int> numbers;
vector<int> inputNumbers;
int num;
while (cin >> num) {
inputNumbers.push_back(num);
}
int pairCount = 0;
unordered_set<int> seenNumbers;
for (int n : inputNumbers) {
int complement = K - n;
if (seenNumbers.find(complement) != seenNumbers.end()) {
pairCount++;
}
seenNumbers.insert(n);
}
cout << pairCount << endl;
return 0;
} |
# 0340, 2024-10-15 09:41:49, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
set<int> a;
int sum;
cin>>sum;
int temp;
int c=0;
while(cin>>temp)
{
a.insert(temp);
}
for(auto x:a)
{
if(a.find(sum-x)!=a.end())
{
c++;
}
}
cout<<c/2;
} |
# 0341, 2024-10-15 09:23:09, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
set<int>num;
int s,k,cnt=0;
cin >> k;
while(cin >> s)
{
num.insert(s);
}
for(auto i:num)
{
if(num.find(k-i)!=num.end() && i!=k-i)
{
++cnt;
num.erase(k-i);
}
}
cout << cnt;
} |
# 0342, 2024-10-15 09:10:57, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main() {
int sum, n, count = 0;
cin >> sum;
set<int> list;
while(cin>>n){
list.insert(n);
}
for(auto itr = list.begin() ; itr != list.end() ; itr++){
if(list.find(sum - *itr) != list.end()) count++;
}
cout << count/2;
} |
# 0343, 2024-10-15 09:20:44, PPPP (100%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int sum;
cin >> sum;
set <int> s;
int a;
while (cin >> a) {
s.insert(a);
}
int temp, co = 0;
auto itr = s.begin();
while (itr != s.end()) {
temp = sum - *itr;
if (s.find(temp) != s.end() && temp != *itr) {
co++;
itr = s.erase(itr);
}
itr++;
}
cout << co;
} |
# 0344, 2024-10-15 09:27:17, PPPP (100%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int k;
cin>>k;
int num;
set<int> ans;
int count = 0;
while(cin>>num){
int target = k-num;
if(ans.find(target) != ans.end()){
count++;
}
ans.insert(num);
}
cout<<count;
} |
# 0345, 2024-10-15 09:27:54, PPPP (100%)
#include<iostream>
#include<set>
using namespace std;
int main()
{
int n,x,cnt=0;
cin >> n;
set<int> s;
while(cin >> x)
{
cnt += s.count(n-x);
s.insert(x);
}
cout << cnt;
} |
# 0346, 2024-10-15 09:17:53, PPPP (100%)
#include <bits/stdc++.h>
using namespace std ;
int main() {
int sum ; cin >> sum ;
int input, count = 0 ;
set<int> s, output ;
while(cin >> input) {
s.insert(input) ;
}
for(int e : s) {
if(s.find(sum - e) != s.end()) {
output.insert(*s.find(e)) ;
}
}
cout << output.size() / 2 ;
} |
# 0347, 2024-10-15 09:44:24, PPPP (100%)
#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
int main() {
// vector<int> data;
int nums;
set<int> data;
cin >> nums;
int count = 0;
cin.ignore();
string line;
getline(cin, line);
stringstream ss(line);
int a;
while (ss >> a) {
data.insert(a);
}
for (int intt : data) {
if (data.find(nums - intt) != data.end() && nums - intt != intt) {
data.erase(nums - intt);
count++;
}
}
cout << count << endl;
// sort(data.begin(), data.end());
// vector<int> less;
// vector<int> more;
// pair<int, int> pair = {-1, -1};
// vector<int> data2;
// for (int i = 0; i < data.size(); i++) {
// for (int j = i; j < data.size(); j++) {
// if (data[i] + data[j] == nums) {
// count += 1;
// pair = data[j];
// break;
// }
// }
// if (pair.first > 0) {
// break;
// }
// }
// for (int i = 0; i < data.size(); i++) {
// if (data[i] < pair) {
// data2.push_back(data[i]);
// }
// }
// if (pair > 0) {
// for (int i = 0; i < data.size(); i++) {
// for (int j = 0; j < data2.size(); j++) {
// if (data[i] + data2[j] == nums) {
// count++;
// }
// }
// }
// }
} |
# 0348, 2024-10-15 09:40:37, PPPP (100%)
#include <iostream>
#include <set>
using namespace std ;
int main (){
int k; cin>>k;
set <int> list;
while(cin){
int num;
cin>> num;
list.insert(num);
}
int count = 0;
// for (auto e : list){
// // if (list.find(abs(k-e)) != list.end()){
// // count++;
// // }
// cout << e << " " ;
// }
// cout<< endl;
int temp1,temp2;
set <int> current;
for (auto e : list){
if (list.find(abs(k-e)) != list.end() && e != abs(k-e)&& k-e != k && k>=e && current.find(e) == current.end() ){
count++;
current.insert(e);
current.insert(k-e);
// cout<< e<<" "<< count << endl;
}
// cout << e << " " << abs(k- e) << " " <<endl;
}
cout << count;
} |
# 0349, 2024-10-15 09:39:28, PPPP (100%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k;
cin >> k;
int n;
set<int> s;
while(cin >> n){
s.insert(n);
}
auto b = s.begin(), e = s.end();
e--;
int a = 0;
while(b != e){
if(k - *b > *e) b++;
else if(*b + *e != k){
e--;
}
else if(*b + *e == k){
a++;
b++;
}
}
cout << a;
} |
# 0350, 2024-10-15 09:39:37, PPPP (100%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int tar,a,sum=0;
cin>>tar;
set<int>num;
while(cin>>a){
if(num.count(tar-a))sum++;
num.insert(a);
}
cout<<sum;
} |
# 0351, 2024-10-15 09:08:24, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;cin>>k;
vector<int> v;
int elm;
while(cin>>elm){
v.push_back(elm);
}
int count =0;
for(int i=0;i<v.size();i++){
for(int j=i+1;j<v.size();j++){
if(v[i]+v[j]==k){
count++;
}
}
}
cout<<count;
} | # 0352, 2024-10-15 09:09:58, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;cin>>k;
vector<int> v;
int elm;
while(cin>>elm){
if(elm>k){
continue;
}
v.push_back(elm);
}
int count =0;
for(int i=0;i<v.size();i++){
for(int j=i+1;j<v.size();j++){
if(v[i]+v[j]==k){
count++;
}
}
}
cout<<count;
} | # 0353, 2024-10-15 09:20:07, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;cin>>k;
vector<int> s;
int elm;
while(cin>>elm){
if(elm>k){
continue;
}
s.push_back(elm);
}
sort(s.begin(),s.end());
int count =0;
for(int i=0;i<s.size();i++){
for(int j=i+1;j<s.size();j++){
if(s[i]+s[j]>k){
break;
}
if(s[i]+s[j]==k){
count++;
}
}
}
cout<<count;
} | # 0354, 2024-10-15 09:23:29, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;cin>>k;
vector<int> even;
vector<int> odd;
int elm;
while(cin>>elm){
if(elm>k){
continue;
}
if(elm%2==0){
even.push_back(elm);
}
else{
odd.push_back(elm);
}
}
int count =0;
if(k%2==1){
for(int i=0;i<even.size();i++){
for(int j=0;j<odd.size();j++){
if(even[i]+odd[j]==k){
count++;
}
}
}
}
else{
for(int i=0;i<even.size();i++){
for(int j=i+1;j<even.size();j++){
if(even[i]+even[j]==k){
count++;
}
}
}
for(int i=0;i<odd.size();i++){
for(int j=i+1;j<odd.size();j++){
if(odd[i]+odd[j]==k){
count++;
}
}
}
}
cout<<count;
} | # 0355, 2024-10-15 09:25:57, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;cin>>k;
vector<int> even;
vector<int> odd;
int elm;
while(cin>>elm){
if(elm>k){
continue;
}
if(elm%2==0){
even.push_back(elm);
}
else{
odd.push_back(elm);
}
}
sort(even.begin(),even.end());
sort(odd.begin(),odd.end());
int count =0;
if(k%2==1){
for(int i=0;i<even.size();i++){
for(int j=0;j<odd.size();j++){
if(even[i]+odd[j]>k){
continue;
}
if(even[i]+odd[j]==k){
count++;
}
}
}
}
else{
for(int i=0;i<even.size();i++){
for(int j=i+1;j<even.size();j++){
if(even[i]+even[j]>k){
continue;
}
if(even[i]+even[j]==k){
count++;
}
}
}
for(int i=0;i<odd.size();i++){
for(int j=i+1;j<odd.size();j++){
if(odd[i]+odd[j]>k){
continue;
}
if(odd[i]+odd[j]==k){
count++;
}
}
}
}
cout<<count;
} | # 0356, 2024-10-15 09:35:31, -PPT (50%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;cin>>k;
set<int> s;
set<int> clean;
int elm;
while(cin>>elm){
if(elm>k){
continue;
}
if(elm<=k/2){
clean.insert(elm);
}
s.insert(elm);
}
int count =0;
for(auto i : clean){
if(find(s.begin(),s.end(),k-i)!=s.end()){
count++;
}
}
cout<<count;
} | # 0357, 2024-10-15 09:37:07, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;cin>>k;
set<int> s;
set<int> clean;
int elm;
while(cin>>elm){
if(elm>k){
continue;
}
if(elm<=k/2){
clean.insert(elm);
}
else{
s.insert(elm);
}
}
int count =0;
for(auto i : clean){
if(find(s.begin(),s.end(),k-i)!=s.end()){
count++;
}
}
cout<<count;
} | # 0358, 2024-10-15 09:41:12, -PPT (50%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;cin>>k;
set<int> s;
int elm;
int count=0;
while(cin>>elm){
s.insert(elm);
if(find(s.begin(),s.end(),k-elm)!=s.end()){
count++;
}
}
cout<<count;
} | # 0359, 2024-10-15 09:43:03, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;cin>>k;
set<int> s;
int elm;
int count=0;
while(cin>>elm){
if(find(s.begin(),s.end(),k-elm)!=s.end()){
count++;
s.erase(k-elm);
}
else{
s.insert(elm);
}
}
cout<<count;
} | # 0360, 2024-10-15 09:45:51, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;cin>>k;
set<int> s;
int elm;
int count=0;
while(cin>>elm){
if(elm>k){
continue;
}
if(find(s.begin(),s.end(),k-elm)!=s.end()){
count++;
s.erase(k-elm);
}
else{
s.insert(elm);
}
}
cout<<count;
} | # 0361, 2024-10-15 09:46:53, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;cin>>k;
set<int> s;
int elm;
int count=0;
while(cin>>elm){
if(elm>k){
continue;
}
if(find(s.begin(),s.end(),k-elm)!=s.end()){
count++;
}
else{
s.insert(elm);
}
}
cout<<count;
} |
# 0362, 2024-10-15 09:07:21, TTTT (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
set<int> s;
set<pair<int,int>> ans;
for(int i = 0;i < n;i++) {
int x; cin >> x;
s.insert(x);
if (abs(n - x) == s.find() && !ans.find({ abs(n - x),x }) && !ans.find({ x,abs(n - x) })) {
ans.insert({x,abs(n-x)});
}
}
cout << ans.size();
return 0;
} | # 0363, 2024-10-15 09:07:26, Compilation error (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
set<int> s;
set<pair<int,int>> ans;
for(int i = 0;i < n;i++) {
int x; cin >> x;
s.insert(x);
if (abs(n - x) == s.find() && !ans.find({ abs(n - x),x }) && !ans.find({ x,abs(n - x) })) {
ans.insert({x,abs(n-x)});
}
}
cout << ans.size();
return 0;
} | # 0364, 2024-10-15 09:12:13, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
set<int> s;
set<pair<int,int>> ans;
for(int i = 0;i < n;i++) {
int x; cin >> x;
s.insert(x);
pair<int, int> a = { abs(n - x),x };
pair<int, int> b = { x,abs(n - x) };
if (s.find(n - x) != s.end() && ans.find(a) == ans.end() && ans.find(b) == ans.end()) {
ans.insert({x,abs(n-x)});
}
}
cout << ans.size();
return 0;
} | # 0365, 2024-10-15 09:13:02, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
set<int> s;
set<pair<int,int>> ans;
for(int i = 0;i < n;i++) {
int x; cin >> x;
s.insert(x);
pair<int, int> a = { abs(n - x),x };
pair<int, int> b = { x,abs(n - x) };
if (s.find(n - x) != s.end() && ans.find(a) == ans.end() && ans.find(b) == ans.end()) {
ans.insert({x,abs(n-x)});
}
}
cout << ans.size();
return 0;
} | # 0366, 2024-10-15 09:19:13, xPPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
set<int> s; int cnt = 0;
for(int i = 0;i < n;i++) {
int x; cin >> x;
s.insert(x);
if (s.find(abs(n - x)) != s.end()) {
cnt++;
auto it1 = s.find(abs(n - x));
auto it2 = s.find(x);
s.erase(it1);
s.erase(it2);
}
}
cout << cnt;
return 0;
} | # 0367, 2024-10-15 09:21:19, x--- (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
set<int> s; int cnt = 0;
for(int i = 0;i <= n;i++) {
int x; cin >> x;
s.insert(x);
if (s.find(abs(n - x)) != s.end()) {
cout << x <<" " << n-x << endl;
cnt++;
auto it1 = s.find(abs(n - x));
auto it2 = s.find(x);
s.erase(it1);
s.erase(it2);
}
}
cout << cnt;
return 0;
} | # 0368, 2024-10-15 09:22:04, xPPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
set<int> s; int cnt = 0;
for(int i = 0;i <= n;i++) {
int x; cin >> x;
s.insert(x);
if (s.find(abs(n - x)) != s.end()) {
cnt++;
auto it1 = s.find(abs(n - x));
auto it2 = s.find(x);
s.erase(it1);
s.erase(it2);
}
}
cout << cnt;
return 0;
} | # 0369, 2024-10-15 09:23:38, x--- (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
set<int> s; int cnt = 0;
for(int i = 0;i <= n;i++) {
int x; cin >> x;
s.insert(x);
if (s.find(abs(n - x)) != s.end() && abs(n-x) <= x) {
// cout << x <<" " << abs(n-x) << endl;
cnt++;
auto it1 = s.find(abs(n - x));
auto it2 = s.find(x);
s.erase(it1);
s.erase(it2);
}
}
cout << cnt;
return 0;
} |
# 0370, 2024-10-15 09:21:53, -PPT (50%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k;
cin>>k;
set<int> s;
int num;
//int p=0;
while(cin>>num){
//p++;
s.insert(num);
//if(p==16)break;
}
int cnt=0;
auto itr=s.begin(),end=s.end();
for(auto i=itr;i!=end;i++){
//cout<<*i<<endl;
for(auto e=i;e!=end;e++){
if((*i)+(*e)==k) {
cnt++;
//cout<<*i<<"+"<<*e<<endl;
}
}
}
cout<<cnt<<endl;
} | # 0371, 2024-10-15 09:25:08, PPPT (75%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k;
cin>>k;
set<int> s;
int num;
//int p=0;
while(cin>>num){
//p++;
s.insert(num);
//if(p==16)break;
}
int cnt=0;
auto itr=s.begin(),end=s.end();
for(auto i=itr;i!=end;i++){
//cout<<*i<<endl;
for(auto e=i;e!=end;e++){
if(((*i)+(*e)==k)&&((*i)!=(*e))) {
cnt++;
//cout<<*i<<"+"<<*e<<endl;
}
}
}
//cout<<"999"<<endl;
cout<<cnt<<endl;
} | # 0372, 2024-10-15 09:27:29, xxxx (0%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k;
cin>>k;
set<int> s;
int num;
//int p=0;
while(cin>>num){
//p++;
s.insert(num);
//if(p==16)break;
}
int cnt=0;
auto itr=s.begin(),end=s.end();
for(auto i=itr;i!=end;i++){
//cout<<*i<<endl;
for(auto e=i;e!=end;e++){
if(((*i)+(*e)==k)&&((*i)!=(*e))) {
cnt++;
s.erase(i);
s.erase(e);
//cout<<*i<<"+"<<*e<<endl;
}
}
}
//cout<<"999"<<endl;
cout<<cnt<<endl;
} | # 0373, 2024-10-15 09:28:31, PPPT (75%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k;
cin>>k;
set<int> s;
int num;
//int p=0;
while(cin>>num){
//p++;
s.insert(num);
//if(p==16)break;
}
int cnt=0;
auto itr=s.begin(),end=s.end();
for(auto i=itr;i!=end;i++){
//cout<<*i<<endl;
for(auto e=i;e!=end;e++){
if(((*i)+(*e)==k)&&((*i)!=(*e))) {
cnt++;
break;
// s.erase(i);
// s.erase(e);
//cout<<*i<<"+"<<*e<<endl;
}
}
}
//cout<<"999"<<endl;
cout<<cnt<<endl;
} | # 0374, 2024-10-15 09:33:34, xxxx (0%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k;
cin>>k;
set<int> s;
int num;
//int p=0;
while(cin>>num){
//p++;
s.insert(num);
//if(p==16)break;
}
int cnt=0;
//auto itr=s.begin(),end=s.end();
for(auto i=s.begin();i!=s.end();i++){
//cout<<*i<<endl;
for(auto e=i;e!=s.end();e++){
if(((*i)+(*e)==k)&&((*i)!=(*e))) {
cnt++;
cout<<*i<<"+"<<*e<<endl;
s.erase(i);
s.erase(e);
break;
}
}
}
// for(auto i=s.begin();i!=s.end();i++){
// cout<<*i<<",";
// }
// cout<<"999"<<endl;
cout<<cnt<<endl;
} | # 0375, 2024-10-15 09:33:55, xxxx (0%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k;
cin>>k;
set<int> s;
int num;
//int p=0;
while(cin>>num){
//p++;
s.insert(num);
//if(p==16)break;
}
int cnt=0;
//auto itr=s.begin(),end=s.end();
for(auto i=s.begin();i!=s.end();i++){
//cout<<*i<<endl;
for(auto e=i;e!=s.end();e++){
if(((*i)+(*e)==k)&&((*i)!=(*e))) {
cnt++;
//cout<<*i<<"+"<<*e<<endl;
s.erase(i);
s.erase(e);
break;
}
}
}
// for(auto i=s.begin();i!=s.end();i++){
// cout<<*i<<",";
// }
// cout<<"999"<<endl;
cout<<cnt<<endl;
} | # 0376, 2024-10-15 09:34:10, xxxx (0%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k;
cin>>k;
set<int> s;
int num;
//int p=0;
while(cin>>num){
//p++;
s.insert(num);
//if(p==16)break;
}
int cnt=0;
//auto itr=s.begin(),end=s.end();
for(auto i=s.begin();i!=s.end();i++){
//cout<<*i<<endl;
for(auto e=i;e!=s.end();e++){
if(((*i)+(*e)==k)&&((*i)!=(*e))) {
cnt++;
//cout<<*i<<"+"<<*e<<endl;
s.erase(i);
s.erase(e);
break;
}
}
}
// for(auto i=s.begin();i!=s.end();i++){
// cout<<*i<<",";
// }
// cout<<"999"<<endl;
cout<<cnt<<endl;
} | # 0377, 2024-10-15 09:45:38, xxxx (0%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int k;
cin>>k;
set<int> s;
int num;
//int p=0;
while(cin>>num){
//p++;
s.insert(num);
//if(p==16)break;
}
int cnt=0;
//auto itr=s.begin(),end=s.end();
// for(auto i=s.begin();i!=s.end();i++){
// cout<<*i<<",";
// }
for(auto i=s.begin();i!=s.end();i++){
//cout<<*i<<endl;
for(auto e=i;e!=s.end();e++){
if(((*i)+(*e)==k)&&((*i)!=(*e))) {
cnt++;
//cout<<*i<<"+"<<*e<<endl;
s.erase(i);
s.erase(e);
break;
}
}
}
// for(auto i=s.begin();i!=s.end();i++){
// cout<<*i<<",";
// }
// cout<<"999"<<endl;
cout<<cnt<<endl;
} |
# 0378, 2024-10-15 09:16:57, -PPT (50%)
#include<iostream>
#include<set>
#include<vector>
using namespace std;
int main()
{
vector<int> check_num;
int num;
cin>>num;
int n;
int check = 0;
while(cin>>n)
{
check_num.push_back(n);
check ++;
}
// 2 1 3 5 9 4
set<pair<int,int>> all_set;
int ans = 0;
// auto start = check_num.begin(),end = check_num.end();
for(auto i=0;i<check;i++)
{
for(auto j=i;j<check;j++)
{
if((check_num[i] + check_num[j] == num))
{
all_set.insert({check_num[i],check_num[j]});
}
}
}
cout<<all_set.size();
} | # 0379, 2024-10-15 09:18:02, -PPT (50%)
#include<iostream>
#include<set>
#include<vector>
using namespace std;
int main()
{
vector<int> check_num;
int num;
cin>>num;
int n;
int check = 0;
while(cin>>n)
{
check_num.push_back(n);
check ++;
}
// 2 1 3 5 9 4
set<pair<int,int>> all_set;
int ans = 0;
// auto start = check_num.begin(),end = check_num.end();
for(auto i=0;i<=check;i++)
{
for(auto j=i;j<=check;j++)
{
if((check_num[i] + check_num[j] == num))
{
all_set.insert({check_num[i],check_num[j]});
}
}
}
cout<<all_set.size();
} | # 0380, 2024-10-15 09:21:51, PPPT (75%)
#include<iostream>
#include<set>
#include<vector>
using namespace std;
int main()
{
vector<int> check_num;
int num;
cin>>num;
int n;
int check = 0;
while(cin>>n)
{
check_num.push_back(n);
check ++;
}
// 2 1 3 5 9 4
set<pair<int,int>> all_set;
int ans = 0;
// auto start = check_num.begin(),end = check_num.end();
for(auto i=0;i<check;i++)
{
for(auto j=i;j<check;j++)
{
if((check_num[i] + check_num[j] == num) && (i!=j))
{
// cout<<check_num[i]<<' '<<i<<check_num[j]<<' '<<j<<endl;
all_set.insert({check_num[i],check_num[j]});
}
}
}
cout<<all_set.size();
} | # 0381, 2024-10-15 09:31:21, PPPT (75%)
#include<iostream>
#include<set>
using namespace std;
int main()
{
set<int> num;
set<pair<int,int>> check;
int n;
// 1,2
bool CIN = 0;
int NUM;
cin>>NUM;
while(cin>>n)
{
if(CIN == 0)
{
num.insert(n);
CIN = 1;
continue;
}
num.insert(n);
for(auto a : num)
{
if(a != n && a + n == NUM)
{
check.insert({n,a});
}
}
}
// for(auto a : check)
// {
// cout<<a.first<<' '<<a.second<<endl;
// }
cout<<check.size();
} | # 0382, 2024-10-15 09:32:58, PPPT (75%)
#include<iostream>
#include<set>
using namespace std;
int main()
{
set<int> num;
set<pair<int,int>> check;
int n;
// 1,2
bool CIN = 0;
int NUM;
cin>>NUM;
while(cin>>n)
{
if(CIN == 0)
{
num.insert(n);
CIN = 1;
continue;
}
num.insert(n);
for(auto a : num)
{
if(a + n > NUM)
{
break;
}
else if(a != n && a + n == NUM)
{
check.insert({n,a});
}
}
}
// for(auto a : check)
// {
// cout<<a.first<<' '<<a.second<<endl;
// }
cout<<check.size();
} | # 0383, 2024-10-15 09:37:16, PPPT (75%)
#include<iostream>
#include<set>
using namespace std;
int main()
{
set<int> num;
set<pair<int,int>> check;
int n;
// 1 2 5 3 1 4 7
// 1
bool CIN = 0;
int NUM;
cin>>NUM;
while(cin>>n)
{
if(CIN == 0)
{
num.insert(n);
CIN = 1;
continue;
}
if(n > NUM)
{
continue;
}
num.insert(n);
for(auto a : num)
{
if(a + n > NUM)
{
break;
}
else if(a != n && a + n == NUM)
{
check.insert({n,a});
}
}
}
// for(auto a : check)
// {
// cout<<a.first<<' '<<a.second<<endl;
// }
cout<<check.size();
} | # 0384, 2024-10-15 09:51:47, PPPT (75%)
#include<iostream>
#include<set>
using namespace std;
int main()
{
set<int> num;
set<pair<int,int>> check;
int n;
// 1 2 3 4 5 7
// 1
bool CIN = 0;
int NUM;
cin>>NUM;
while(cin>>n)
{
num.insert(n);
// if(CIN == 0)
// {
// num.insert(n);
// CIN = 1;
// continue;
// }
// if(n > NUM)
// {
// continue;
// }
// num.insert(n);
// for(auto a : num)
// {
// if(a + n > NUM)
// {
// break;
// }
// else if(a != n && a + n == NUM)
// {
// check.insert({n,a});
// }
// }
}
for(auto a : num)
{
if(a > NUM)
{
num.erase(a);
}
}
for(auto a : num)
{
}
// 4
// 1 2 3 4 5 7
/*
|
v
1 2 3
3 2 1
*/
for(auto a : num)
{
for(auto b : num)
{
if(a + b > NUM)break;
else if(a < b && a + b == NUM)
{
check.insert({a,b});
// num.erase(a);
// num.erase(b);
}
}
}
cout<<check.size();
} |
# 0385, 2024-10-15 09:20:02, ---- (0%)
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
int main(){
int k ,in;
std::string inS;
std::cin >> k ;
std::vector<int> to_check ;
long out = 0;
while(std::cin >> inS ){
if(inS == "x")break;
in = stol(inS);
if(in>=k){
}else{
to_check.push_back(in);
}
}
for(int i = 0 ; i < to_check.size() ; i++){
int start = to_check[i];
auto posi = find(to_check.begin() , to_check.end() , (k-start));
if(posi == to_check.end()){
to_check.erase(to_check.begin());
}else{
to_check.erase(to_check.begin());
to_check.erase(posi);
out++;
i=0;
}
}
std::cout << out <<std::endl;
} | # 0386, 2024-10-15 09:25:37, ---T (0%)
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
int main(){
int k ,in;
std::string inS;
std::cin >> k ;
std::vector<int> to_check ;
long out = 0;
while(std::cin >> inS ){
if(inS == "x")break;
in = stol(inS);
if(in>=k){
}else{
to_check.push_back(in);
}
}
for(int i = 0 ; i < to_check.size() ; i++){
int start = to_check[i];
// std::cout << start <<std::endl;
auto posi = find(to_check.begin() , to_check.end() , (k-start));
if(posi == to_check.end()){
to_check.erase(to_check.begin());
}else{
// std::cout << * to_check.begin() << " " << * posi <<std::endl;
to_check[i]= 0;
* posi = 0;
out++;
}
}
std::cout << out <<std::endl;
} | # 0387, 2024-10-15 09:29:42, ---T (0%)
#include <iostream>
#include <vector>
#include <sstream>
#include <algorithm>
using namespace std;
int main(){
int k ,in;
std::string inS;
std::cin >> k ;
std::vector<int> to_check ;
long out = 0;
std::cin.ignore();
getline(std::cin , inS);
istringstream hi(inS);
std::string word;
while(hi >> word ){
in = stol(word);
if(in<k){
to_check.push_back(in);
}
}
// for(int i : to_check){
// std::cout << i <<std::endl;
// }
for(int i = 0 ; i < to_check.size() ; i++){
int start = to_check[i];
// std::cout << start <<std::endl;
auto posi = find(to_check.begin() , to_check.end() , (k-start));
if(posi == to_check.end()){
to_check.erase(to_check.begin());
}else{
// std::cout << * to_check.begin() << " " << * posi <<std::endl;
to_check[i]= 0;
* posi = 0;
out++;
}
}
std::cout << out <<std::endl;
} | # 0388, 2024-10-15 09:35:41, -PPT (50%)
#include <iostream>
#include <vector>
#include <sstream>
#include <algorithm>
using namespace std;
int main(){
long k ,in;
std::string inS;
std::cin >> k ;
std::vector<int> to_check ;
long out = 0;
std::cin.ignore();
getline(std::cin , inS);
istringstream hi(inS);
std::string word;
while(hi >> word ){
in = stol(word);
if(in<k){
to_check.push_back(in);
}
}
// for(int i : to_check){
// std::cout << i <<std::endl;
// }
for(int i = 0 ; i < to_check.size() ; i++){
long start = to_check[i];
// std::cout << start <<std::endl;
auto posi = find(to_check.begin() , to_check.end() , (k-start));
if(posi == to_check.end()){
to_check[i] = 0;
}else{
// std::cout << to_check[i] << " " << * posi <<std::endl;
to_check[i]= 0;
* posi = 0;
out++;
}
// for(int i : to_check){
// std::cout << i <<std::endl;
// }
// cout <<endl;
}
std::cout << out <<std::endl;
} | # 0389, 2024-10-15 09:37:58, PPPT (75%)
#include <iostream>
#include <vector>
#include <sstream>
#include <algorithm>
using namespace std;
int main(){
long k ,in;
std::string inS;
std::cin >> k ;
std::vector<int> to_check ;
long out = 0;
std::cin.ignore();
getline(std::cin , inS);
istringstream hi(inS);
std::string word;
while(hi >> word ){
in = stol(word);
if(in<k){
to_check.push_back(in);
}
}
// for(int i : to_check){
// std::cout << i <<std::endl;
// }
for(int i = 0 ; i < to_check.size() ; i++){
long start = to_check[i];
to_check[i] = 0;
// std::cout << start <<std::endl;
auto posi = find(to_check.begin() , to_check.end() , (k-start));
if(posi == to_check.end()){
to_check[i] = 0;
}else{
// std::cout << to_check[i] << " " << * posi <<std::endl;
to_check[i]= 0;
* posi = 0;
out++;
}
// for(int i : to_check){
// std::cout << i <<std::endl;
// }
// cout <<endl;
}
std::cout << out <<std::endl;
} | # 0390, 2024-10-15 09:40:01, PPPT (75%)
#include <iostream>
#include <vector>
#include <sstream>
#include <algorithm>
using namespace std;
int main(){
long k ,in;
std::string inS;
std::cin >> k ;
std::vector<int> to_check ;
long out = 0;
std::cin.ignore();
getline(std::cin , inS);
istringstream hi(inS);
std::string word;
while(hi >> word ){
in = stol(word);
if(in<k){
to_check.push_back(in);
}
}
// for(int i : to_check){
// std::cout << i <<std::endl;
// }
sort(to_check.begin() , to_check.end());
for(int i = 0 ; i < to_check.size() ; i++){
long start = to_check[i];
to_check[i] = 0;
// std::cout << start <<std::endl;
auto posi = find(to_check.begin() , to_check.end() , (k-start));
if(posi == to_check.end()){
to_check[i] = 0;
}else{
// std::cout << to_check[i] << " " << * posi <<std::endl;
to_check[i]= 0;
* posi = 0;
out++;
}
// for(int i : to_check){
// std::cout << i <<std::endl;
// }
// cout <<endl;
}
std::cout << out <<std::endl;
} | # 0391, 2024-10-15 09:50:05, P--T (25%)
#include <iostream>
#include <vector>
#include <sstream>
#include <algorithm>
using namespace std;
int main(){
long k ,in;
std::string inS;
std::cin >> k ;
std::vector<int> to_check ;
long out = 0;
std::cin.ignore();
getline(std::cin , inS);
istringstream hi(inS);
std::string word;
while(hi >> word ){
in = stol(word);
if(in<k){
to_check.push_back(in);
}
}
// for(int i : to_check){
// std::cout << i <<std::endl;
// }
sort(to_check.begin() , to_check.end());
int n = to_check.size();
for(int i = 0 ; i < n ; i++){
long start = to_check[i];
to_check[i] = 0;
// std::cout << start <<std::endl;
auto posi = find(to_check.begin() , to_check.end() , (k-start));
if(posi == to_check.end()){
to_check[i] = 0;
}else{
// std::cout << to_check[i] << " " << * posi <<std::endl;
to_check[i]= 0;
* posi = 0;
out++;
n-=2;
}
// for(int i : to_check){
// std::cout << i <<std::endl;
// }
// cout <<endl;
}
std::cout << out <<std::endl;
} |
# 0392, 2024-10-15 09:20:34, ---T (0%)
#include<iostream>
#include<set>
#include<vector>
#include<algorithm>
#include<tuple>
using namespace std;
int main() {
int k; cin >> k;
set<int> sumk;
int s;
while(cin >> s) {
if(s < k) sumk.insert(s);
}
for(auto e : sumk) {
for(auto l : sumk) {
if(l != e && e + l == k && e < l) {
cout << e << '+' << l << " = " << k << endl;
break;
}
}
}
} | # 0393, 2024-10-15 09:22:19, PPPT (75%)
#include<iostream>
#include<set>
#include<vector>
#include<algorithm>
#include<tuple>
using namespace std;
int main() {
int k; cin >> k;
set<int> sumk;
int s;
while(cin >> s) {
if(s < k) sumk.insert(s);
}
int count = 0;
for(auto e : sumk) {
for(auto l : sumk) {
if(l != e && e + l == k && e < l) {
count++;
break;
}
}
}
cout << count;
} | # 0394, 2024-10-15 09:31:05, PPPT (75%)
#include<iostream>
#include<set>
using namespace std;
int main() {
int k; cin >> k;
set<int> sumkodd,sumkeven;
int s;
while(cin >> s) {
if(s < k) {
if(s % 2 == 0) sumkeven.insert(s);
else if(s % 2 != 0) sumkodd.insert(s);
}
}
int count = 0;
if(k % 2 == 0) {
for(auto e : sumkeven) {
for(auto l : sumkeven) {
if(l != e && l + e == k && e < l) count++;
}
}
for(auto e : sumkodd) {
for(auto l : sumkodd) {
if(l != e && l + e == k && e < l) count++;
}
}
} else {
for(auto e : sumkodd) {
for(auto l : sumkeven) {
if(l + e == k) count++;
}
}
}
cout << count;
} | # 0395, 2024-10-15 09:32:32, PPPT (75%)
#include<iostream>
#include<set>
using namespace std;
int main() {
int k; cin >> k;
set<int> sumkodd,sumkeven;
int s;
while(cin >> s) {
if(s < k) {
if(s % 2 == 0) sumkeven.insert(s);
else if(s % 2 != 0) sumkodd.insert(s);
}
}
int count = 0;
if(k % 2 == 0) {
for(auto e : sumkeven) {
for(auto l : sumkeven) {
if(l != e && l + e == k && e < l) {
count++;
break;
}
}
}
for(auto e : sumkodd) {
for(auto l : sumkodd) {
if(l != e && l + e == k && e < l) {
count++;
break;
}
}
}
} else {
for(auto e : sumkodd) {
for(auto l : sumkeven) {
if(l + e == k) {
count++;
break;
}
}
}
}
cout << count;
} | # 0396, 2024-10-15 09:38:23, PPPT (75%)
#include<iostream>
#include<set>
using namespace std;
int main() {
int k; cin >> k;
set<int> sumkodd,sumkeven;
int s;
while(cin >> s) {
if(s < k) {
if(s % 2 == 0) sumkeven.insert(s);
else if(s % 2 != 0) sumkodd.insert(s);
}
}
int count = 0;
if(k % 2 == 0) {
for(auto e : sumkeven) {
for(auto itr = --sumkeven.end(); itr != --sumkeven.begin();itr--) {
if((*itr) != e && (*itr) + e == k && e < (*itr)) {
count++;
break;
}
}
}
for(auto e : sumkodd) {
for(auto itr = --sumkodd.end(); itr != --sumkodd.begin();itr--) {
if((*itr) != e && (*itr) + e == k && e < (*itr)) {
count++;
break;
}
}
}
} else {
for(auto e : sumkodd) {
for(auto itr = --sumkeven.end(); itr != --sumkeven.begin();itr--) {
if((*itr) + e == k) {
count++;
break;
}
}
}
}
cout << count;
} | # 0397, 2024-10-15 09:38:39, PPPT (75%)
#include<iostream>
#include<set>
using namespace std;
int main() {
int k; cin >> k;
set<int> sumkodd,sumkeven;
int s;
while(cin >> s) {
if(s < k) {
if(s % 2 == 0) sumkeven.insert(s);
else if(s % 2 != 0) sumkodd.insert(s);
}
}
int count = 0;
if(k % 2 == 0) {
for(auto e : sumkeven) {
for(auto itr = --sumkeven.end(); itr != --sumkeven.begin();itr--) {
if((*itr) != e && (*itr) + e == k && e < (*itr)) {
count++;
break;
}
}
}
for(auto e : sumkodd) {
for(auto itr = --sumkodd.end(); itr != --sumkodd.begin();itr--) {
if((*itr) != e && (*itr) + e == k && e < (*itr)) {
count++;
break;
}
}
}
} else {
for(auto e : sumkodd) {
for(auto itr = --sumkeven.end(); itr != --sumkeven.begin();itr--) {
if((*itr) + e == k) {
count++;
break;
}
}
}
}
cout << count;
} | # 0398, 2024-10-15 09:43:23, PPPT (75%)
#include<iostream>
#include<set>
using namespace std;
int main() {
int k; cin >> k;
set<int> sumkodd,sumkeven;
int s;
while(cin >> s) {
if(s < k) {
if(s % 2 == 0) sumkeven.insert(s);
else if(s % 2 != 0) sumkodd.insert(s);
}
}
int count = 0;
if(k % 2 == 0) {
for(auto e : sumkeven) {
for(auto itr = --sumkeven.end(); itr != --sumkeven.begin();itr--) {
if((*itr) != e && (*itr) + e == k && e < (*itr)) {
count++;
break;
} else if((*itr) + e < k) break;
}
}
for(auto e : sumkodd) {
for(auto itr = --sumkodd.end(); itr != --sumkodd.begin();itr--) {
if((*itr) != e && (*itr) + e == k && e < (*itr)) {
count++;
break;
} else if((*itr) + e < k) break;
}
}
} else {
for(auto e : sumkodd) {
for(auto itr = --sumkeven.end(); itr != --sumkeven.begin();itr--) {
if((*itr) + e == k) {
count++;
break;
} else if((*itr) + e < k) break;
}
}
}
cout << count;
} |
# 0399, 2024-10-15 09:39:08, -PPT (50%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int K;
cin>>K;
set<int> num;
int c;
while (cin>>c)
{
num.insert(c);
}
int count=0;
for (auto itr = num.begin(), end=num.end(); itr !=end; itr++)
{
for (auto i = itr; i != end;)
{
i++;
if (*(i)+*(itr)==K)
{
count++;
}
}
}
cout << count << endl;
} | # 0400, 2024-10-15 09:39:27, PPPT (75%)
#include <iostream>
#include <vector>
using namespace std;
int main(){
int K;
cin>>K;
vector<int> num;
int c;
while (cin>>c)
{
num.push_back(c);
}
int count=0;
for (int i = 0; i < num.size(); i++)
{
for (int j = i+1; j < num.size(); j++)
{
if (num[i]+num[j]==K)
{
count++;
}
}
}
cout << count << endl;
} | # 0401, 2024-10-15 09:39:35, PPPT (75%)
#include <iostream>
#include <vector>
using namespace std;
int main(){
int K;
cin>>K;
vector<int> num;
int c;
while (cin>>c)
{
num.push_back(c);
}
int count=0;
for (int i = 0; i < num.size(); i++)
{
for (int j = i+1; j < num.size(); j++)
{
if (num[i]+num[j]==K)
{
count++;
}
}
}
cout << count << endl;
} | # 0402, 2024-10-15 09:41:31, PPPT (75%)
#include <iostream>
#include <vector>
using namespace std;
int main(){
int K;
cin>>K;
vector<int> num;
int c;
while (cin>>c)
{
num.push_back(c);
}
int count=0;
for (int i = 0; i < num.size(); i++)
{
for (int j = i+1; j < num.size(); j++)
{
if (num[i]+num[j]==K)
{
count++;
}
}
}
cout << count << endl;
} | # 0403, 2024-10-15 09:48:24, PPPT (75%)
#include <iostream>
#include <vector>
using namespace std;
int main(){
int K;
cin>>K;
vector<int> num;
int c;
while (cin>>c)
{
if (c>K)
{
continue;
}
num.push_back(c);
}
int count=0;
for (int i = 0; i < num.size(); i++)
{
for (int j = i+1; j < num.size(); j++)
{
if (num[i]+num[j]==K)
{
count++;
}
}
}
cout << count << endl;
} | # 0404, 2024-10-15 09:49:27, PPPT (75%)
#include <iostream>
#include <vector>
using namespace std;
int main(){
int K;
cin>>K;
vector<int> num;
int c;
while (cin>>c)
{
if (c>K)
{
continue;
}
for (auto a : num)
{
if (a==c)
{
continue;
}
}
num.push_back(c);
}
int count=0;
for (int i = 0; i < num.size(); i++)
{
for (int j = i+1; j < num.size(); j++)
{
if (num[i]+num[j]==K)
{
count++;
}
}
}
cout << count << endl;
} |
# 0405, 2024-10-15 09:25:14, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> n;
int k,in,cnt=0;
cin>>k;
while(cin>>in){
n.push_back(in);
}
for(int i=0;i<n.size();i++){
for(int j=i;j<n.size();j++){
if(j==i) continue;
if(n[i]+n[j]==k) cnt++;
}
}
cout<<cnt;
return 0;
} | # 0406, 2024-10-15 09:25:25, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> n;
int k,in,cnt=0;
cin>>k;
while(cin>>in){
n.push_back(in);
}
for(int i=0;i<n.size();i++){
for(int j=i;j<n.size();j++){
if(j==i) continue;
if(n[i]+n[j]==k) cnt++;
}
}
cout<<cnt;
return 0;
} | # 0407, 2024-10-15 09:25:54, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> n;
int k,in,cnt=0;
cin>>k;
while(cin>>in){
n.push_back(in);
}
for(int i=0;i<n.size();i++){
for(int j=i+1;j<n.size();j++){
if(n[i]+n[j]==k) cnt++;
}
}
cout<<cnt;
return 0;
} | # 0408, 2024-10-15 09:27:24, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> n;
int k,in,cnt=0;
cin>>k;
while(cin>>in){
n.push_back(in);
}
for(int i=0;i<n.size();i++){
if(n[i]>=k) continue;
for(int j=i+1;j<n.size();j++){
if(n[i]+n[j]==k) cnt++;
}
}
cout<<cnt;
return 0;
} | # 0409, 2024-10-15 09:29:07, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> n;
int k,in,cnt=0;
cin>>k;
while(cin>>in){
if(in>=k) continue;
n.push_back(in);
}
for(int i=0;i<n.size();i++){
for(int j=i+1;j<n.size();j++){
if(n[i]+n[j]==k) cnt++;
}
}
cout<<cnt;
return 0;
} | # 0410, 2024-10-15 09:30:22, PPPT (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> n;
int k,in,cnt=0;
cin>>k;
while(cin>>in){
if(in>=k) continue;
else n.push_back(in);
}
for(int i=0;i<n.size();i++){
for(int j=i+1;j<n.size();j++){
if(n[i]+n[j]==k) cnt++;
}
}
cout<<cnt;
return 0;
} |
# 0411, 2024-10-15 09:38:35, ---- (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int K;
string LongS;
set<int> P;
cin >> K;
cin.ignore();
getline(cin, LongS);
stringstream ss(LongS);
string token;
while (ss >> token) {
P.insert(stoi(token));
}
int count = 0;
for (auto it = P.begin(); it != P.end();) {
int val = *it;
if (P.find(val - K) != P.end()) {
P.erase(val - K);
it = P.erase(it);
count++;
}
++it;
}
cout << count << endl;
return 0;
} | # 0412, 2024-10-15 09:45:51, ---- (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int K;
string LongS;
set<int> P;
cin >> K;
cin.ignore();
getline(cin, LongS);
stringstream ss(LongS);
string token;
while (ss >> token) {
P.insert(stoi(token));
}
int count = 0;
for (const auto& Fnum : P) {
if (P.find(Fnum - K) != P.end()) {
count++;
}
}
cout << count << endl;
return 0;
} | # 0413, 2024-10-15 09:49:53, -PPP (75%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int K;
string LongS;
set<int> P;
cin >> K;
cin.ignore();
getline(cin, LongS);
stringstream ss(LongS);
string token;
while (ss >> token) {
P.insert(stoi(token));
}
int count = 0;
for (const auto& Fnum : P) {
if (P.find(K - Fnum) != P.end()) {
count++;
P.erase(P.find(K-Fnum));
}
}
cout << count << endl;
return 0;
} |
# 0414, 2024-10-15 09:45:22, PPPT (75%)
#include<iostream>
#include<string>
int main(){
int re=0;
std::string in1,in2;
std::cin>>re;
std::cin>>in1;
std::getline(std::cin,in2);
std::string in = in1+in2+' ';
int inn[100000];
int c=0;
std::string pre;
for(int i=0;i<in.size();i++)
{
if(in[i]==' '){
inn[c]=stoi(pre);
pre="";
c++;
}
else{
pre+=in[i];
}
}
//std::cout<<c;
int pr=0;
for(int i=0;i<c;i++)
{
for(int j=i+1;j<c;j++)
{
if(inn[i]+inn[j]==re)pr++;
}
}
std::cout<<pr;
} | # 0415, 2024-10-15 09:45:32, PPPT (75%)
#include<iostream>
#include<string>
int main(){
int re=0;
std::string in1,in2;
std::cin>>re;
std::cin>>in1;
std::getline(std::cin,in2);
std::string in = in1+in2+' ';
int inn[100000];
int c=0;
std::string pre;
for(int i=0;i<in.size();i++)
{
if(in[i]==' '){
inn[c]=stoi(pre);
pre="";
c++;
}
else{
pre+=in[i];
}
}
//std::cout<<c;
int pr=0;
for(int i=0;i<c;i++)
{
for(int j=i+1;j<c;j++)
{
if(inn[i]+inn[j]==re)pr++;
}
}
std::cout<<pr;
} | # 0416, 2024-10-15 09:47:03, PPPT (75%)
#include<iostream>
#include<string>
int main(){
int re=0;
std::string in1,in2;
std::cin>>re;
std::cin>>in1;
std::getline(std::cin,in2);
std::string in = in1+in2+' ';
int inn[100000];
int c=0;
std::string pre;
for(int i=0;i<in.size();i++)
{
if(in[i]==' '){
if(stoi(pre)<=re)
{
inn[c]=stoi(pre);
c++;
}
pre="";
}
else{
pre+=in[i];
}
}
//std::cout<<c;
int pr=0;
for(int i=0;i<c;i++)
{
for(int j=i+1;j<c;j++)
{
if(inn[i]+inn[j]==re)pr++;
}
}
std::cout<<pr;
} |
# 0417, 2024-10-15 09:34:35, PPPT (75%)
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
int main(){
int n;
string s;
vector<int> vec;
cin >> n;
cin.ignore();
getline(cin, s);
stringstream ss(s);
int num;
while (ss >> num) {
vec.push_back(num);
}
int count = 0;
for (int i = 0; i < vec.size(); i++){
for (int j = i + 1; j < vec.size(); j++){
int diff = vec[i] + vec[j];
// cout << vec[i] << " + " << vec[j] << " = " << diff << " " << n << endl;
if (diff == n){
count++;
}
}
}
cout << count << endl;
} | # 0418, 2024-10-15 09:37:10, PPPT (75%)
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
int main(){
long long n;
string s;
vector<long long> vec;
cin >> n;
cin.ignore();
getline(cin, s);
stringstream ss(s);
long long num;
while (ss >> num) {
vec.push_back(num);
}
long long count = 0;
for (long long i = 0; i < vec.size(); i++){
for (long long j = i + 1; j < vec.size(); j++){
long long diff = vec[i] + vec[j];
// cout << vec[i] << " + " << vec[j] << " = " << diff << " " << n << endl;
if (diff == n){
count++;
}
}
}
cout << count << endl;
} |
# 0419, 2024-10-15 09:44:18, -PPP (75%)
#include<bits/stdc++.h>
using namespace std;
int out(set<int> &s, int k){
auto f=s.begin();
auto l=s.end();
int p, count=0;
for(auto e : s){
p=k-e;
if(p>0){
if(s.find(p) != s.end()){
count++;
}
}
}
return count-count/2;
}
int main(){
int k;
int n;
set<int> s1;
cin >> k;
while(cin >> n){
s1.insert(n);
}
int c=out(s1, k);
cout << c;
} | # 0420, 2024-10-15 09:48:09, -PPP (75%)
#include<bits/stdc++.h>
using namespace std;
int out(set<int> &s, int k){
auto f=s.begin();
auto l=s.end();
int p, count=0;
for(auto e : s){
p=k-e;
if(p>0){
if(s.find(p) != s.end()){
count++;
}
}
}
return count-count/2;
}
int main(){
int k;
int n;
set<int> s1;
cin >> k;
while(cin >> n){
s1.insert(n);
}
int c=out(s1, k);
if(c==1){
c-=1;
}
cout << c;
} |
# 0421, 2024-10-15 09:15:44, PPPT (75%)
#include <iostream>
#include <set>
using namespace std;
int main() {
set<int> numbers1, numbers2;
int K,num,count=0;
cin >> K;
while(cin >> num) {
if(num*2 <= K) numbers1.insert(num);
else numbers2.insert(num);
}
for(auto n: numbers1) {
for(auto N: numbers2) {
if(n+N == K) {
count++;
break;
}
}
}
cout << count;
} | # 0422, 2024-10-15 09:17:08, PPPT (75%)
#include <iostream>
#include <set>
using namespace std;
int main() {
set<int> numbers1, numbers2;
int K,num,count=0;
cin >> K;
while(cin >> num) {
if(num*2 <= K) numbers1.insert(num);
else numbers2.insert(num);
}
for(auto n: numbers1) {
for(auto N: numbers2) {
if(N>K) break;
if(n+N == K) {
count++;
break;
}
}
}
cout << count;
} |
# 0423, 2024-10-15 09:34:33, ---- (0%)
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
int K;
vector<int> v = {};
string line;
cin >> K; cin.ignore();
getline(cin, line);
int pos = 0;
for (int i = 0; i < line.length(); i++){
if (line[i] == ' ' || i == line.length()-1){
int input = 0;
input = stoi(line.substr(pos,i));
v.push_back(input);
pos = i;
}
}
} | # 0424, 2024-10-15 09:38:40, PPPT (75%)
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
int K;
vector<int> v = {};
string line;
cin >> K; cin.ignore();
getline(cin, line);
int pos = 0;
for (int i = 0; i < line.length(); i++){
if (line[i] == ' ' || i == line.length()-1){
int input = 0;
input = stoi(line.substr(pos,i));
v.push_back(input);
pos = i;
}
}
int counter = 0;
for (int i = 0; i < v.size(); i++){
for (int j = 0; j < v.size(); j++){
if (v[i]+v[j] == K){
counter++;
}
}
}
counter /= 2;
cout << counter;
} |
# 0425, 2024-10-15 09:25:20, ---- (0%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k,count=0; cin >> k;
int number,size;
set<int> all_number;
while(cin >> number){
if(number < k){
all_number.insert(number);
}
}
auto itr = all_number.begin();
size = all_number.size();
if(size%2==0){size-=1;}
for(int i = 0; i <= size/2; i++){
if(all_number.find(k-*itr) != all_number.end()){count++;}
itr++;
}
cout << count;
return 0;
} | # 0426, 2024-10-15 09:47:38, -PPP (75%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k,count=0; cin >> k;
int number;
set<int> all_number;
set<int> for_count;
while(cin >> number){
all_number.insert(number);
}
auto itr = all_number.begin();
while(for_count.size() != all_number.size()){
if(for_count.find(*itr) == for_count.end()){
if(all_number.find(k-*itr) != all_number.end()){count++; for_count.insert(k-*itr);}
}
for_count.insert(*itr);
itr++;
}
cout << count;
return 0;
} |
# 0427, 2024-10-15 09:22:54, PPPT (75%)
#include<iostream>
#include<set>
using namespace std;
int main(){
set<int> s;
int k,in,count=0;
cin>>k;
while (cin>>in){
s.insert(in);
}
for(auto i=s.begin();i!=s.end();i++){
for(auto j=i;j!=s.end();j++){
if(i!=j)
if(*i+*j == k) count++;
}
}
cout<<count;
} |
# 0428, 2024-10-15 09:48:05, PPPT (75%)
#include <bits/stdc++.h>
using namespace std;
int main ()
{
vector <int> all_num ;
int want ,num , many = 0 ;
cin >> want ;
while (cin >> num)
{
if (num < want)
{
all_num.emplace_back(num) ;
}
}
for (int i = 0 ; i < all_num.size() - 1 ; i++)
{
for ( int x = i+1 ; x < all_num.size() ; x++)
{
if (all_num[i] + all_num[x] == want)
{
many ++ ;
}
}
}
cout << many ;
return 0 ;
} |
# 0429, 2024-10-15 09:44:48, PPPT (75%)
#include<iostream>
#include<vector>
using namespace std;
int main() {
int k;
cin >> k;
int s1;
int times=0;
vector<int>s;
while(cin>>s1){
s.push_back(s1);
}
for(int i=0 ; i<s.size() ; i++) {
for(int j=i+1 ; j<s.size() ; j++) {
if((s[j]<=k) && (s[i]<=k)) {
if((s[i]+s[j])==k) {
times++;
}
}
}
}
cout << times;
} |
# 0430, 2024-10-15 09:31:04, PPPT (75%)
#include<iostream>
#include<set>
using namespace std;
int main(){
int k;
cin >> k;
int s;
set<int> set_s;
while(cin >> s){
if(s<k)
set_s.insert(s);
}
int count=0;
while(set_s.size()>=2){
if(set_s.size()<2)
break;
auto itr1=set_s.begin();
auto itr2=set_s.begin();
itr2++;
while(1){
if(*itr1+*itr2==k){
count++;
set_s.erase(itr1);
set_s.erase(itr2);
break;
}
else{
if(itr2!=set_s.end())
itr2++;
else{
set_s.erase(itr1);
break;
}
}
}
}
cout << count;
} |
# 0431, 2024-10-15 09:37:35, PPPT (75%)
#include <iostream>
#include <vector>
using namespace std;
int main() {
int k;
cin >> k;
vector<int> allno;
int input;
while (cin >> input) {
allno.push_back(input);
}
int count = 0;
// วนลูปไล่บวกเลขในเวกเตอร์
for (int i = 0; i < allno.size(); i++) {
for (int j = i + 1; j < allno.size(); j++) {
int sum = allno[i] + allno[j];
if (sum == k) {
// cout << "yes: " << allno[i] << " + " << allno[j] << " = " << k << endl;
count++;
}
}
}
cout << count;
return 0;
} |
# 0432, 2024-10-15 09:29:18, PPPT (75%)
#include<iostream>
#include<set>
#include<string>
#include<algorithm>
using namespace std;
int main(){
set<int> num;
int k;cin>>k;
string n,tmp="";
cin.ignore();
getline(cin,n);
for(int i=0;i<n.length();i++ ){
if(n[i]!=' '){
tmp+=n[i];
}else{
if(tmp!=""){num.insert(stoi(tmp));tmp="";}
}
}if(tmp!=""){num.insert(stoi(tmp));tmp="";}
// for(auto c:num){
// cout<<c<<" ";
// }
int cnt=0;
set<int>::iterator it,jt;
for(it=num.begin();it!=num.end();it++){
for(jt=it;jt!=num.end();jt++){
if(*it!=*jt && *it+*jt==k){
cnt++;
// cout<<*it<<" + "<<*jt<<" = "<<*it+*jt;
}
}
}
cout<<cnt;
return 0;
} |
# 0433, 2024-10-15 09:22:22, Compilation error (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int ans=0;
int k;cin >> k;
set<int,greater <int> > s;
int temp;
while(cin >> temp){
s.insert(temp);
}
for(auto i = s.begin;i<=s.end();i++){
for(auto j=i;j<=s.end();j++){
if(k-*i==j)ans++;
}
}
} | # 0434, 2024-10-15 09:29:04, Compilation error (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int ans=0;
int k;cin >> k;
set<int,greater <int> > s;
int temp;
while(cin >> temp){
s.insert(temp);
}
for(auto i = s.begin;i!=s.end();i++){
for(auto j=i;j!=s.end();j++){
if(k-*i == *j)ans++;
}
}
} | # 0435, 2024-10-15 09:39:37, ---- (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int ans=0;
int k;cin >> k;
set<int,greater <int> > s;
int temp;
while(cin >> temp){
s.insert(temp);
}
for(auto i = s.begin();i!=s.end();i++){
for(auto j=i;j!=s.end();j++){
if(k- *i == *j)ans++;
}
}
} | # 0436, 2024-10-15 09:43:12, ---- (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int ans=0;
int k;cin >> k;
set<int> s;
int temp;
while(cin >> temp){
s.insert(temp);
}
for(auto i = s.begin();i!=s.end();i++){
for(auto j=i;j!=s.end();j++){
if(k- *i == *j)ans++;
}
}
} | # 0437, 2024-10-15 09:46:08, Compilation error (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int ans=0;
int k;cin >> k;
set<int> s;
int temp;
while(cin >> temp){
s.insert(temp);
}
for(auto i = s.begin();i!=s.end();i++){
for(auto j=i+1;j!=s.end();j++){
if(k - *i == *j)ans++;
}
}
} | # 0438, 2024-10-15 09:46:19, ---- (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int ans=0;
int k;cin >> k;
set<int> s;
int temp;
while(cin >> temp){
s.insert(temp);
}
for(auto i = s.begin();i!=s.end();i++){
for(auto j=i;j!=s.end();j++){
if(k - *i == *j)ans++;
}
}
} | # 0439, 2024-10-15 09:50:32, -PPT (50%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int ans=0;
int k;cin >> k;
set<int> s;
int temp;
while(cin >> temp){
s.insert(temp);
}
for(auto i = s.begin();i!=s.end();i++){
for(auto j=i;j!=s.end();j++){
if(k - *i == *j)ans++;
}
}
cout << ans;
} | # 0440, 2024-10-15 09:51:24, T--T (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int ans=0;
int k;cin >> k;
set<int> s;
int temp;
while(cin >> temp){
s.insert(temp);
}
for(auto i = s.begin();i!=s.end();i++){
for(auto j=i;j!=s.end();j++){
j++;
if(k - *i == *j)ans++;
}
}
cout << ans;
} | # 0441, 2024-10-15 09:51:44, -PPT (50%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int ans=0;
int k;cin >> k;
set<int> s;
int temp;
while(cin >> temp){
s.insert(temp);
}
for(auto i = s.begin();i!=s.end();i++){
for(auto j=i;j!=s.end();j++){
if(k - *i == *j)ans++;
}
}
cout << ans;
} |
# 0442, 2024-10-15 09:34:21, --TT (0%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
map<int,int> nm;
int n,tmp,idx = 0;
cin>>n;
while(cin>>tmp)
{
nm[idx] = tmp;
idx++;
}
for (int i=0; i<idx; i++)
{
for (int j=i+1; j<nm[i]; j++)
{
if(nm[i] + nm[j] == n)
{
cout<<nm[i]<<"+"<<nm[j]<<" = "<<n<<endl;
}
}
}
} | # 0443, 2024-10-15 09:35:05, --TT (0%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
map<int,int> nm;
int n,tmp,idx = 0;
cin>>n;
while(cin>>tmp)
{
nm[idx] = tmp;
idx++;
}
for (int i=0; i<idx; i++)
{
for (int j=i+1; j<idx; j++)
{
if(nm[i] + nm[j] == n)
{
cout<<nm[i]<<"+"<<nm[j]<<" = "<<n<<endl;
}
}
}
} | # 0444, 2024-10-15 09:47:10, --Tx (0%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
map<int,int> nm;
int n,tmp,idx = 0,arr[10000];
cin>>n;
while(cin>>tmp)
{
// cin >>tmp;
arr[idx] = tmp;
idx++;
}
sort(arr,arr+idx);
for(int i=0;i<idx;i++)
{
nm[i] = arr[i];
}
for (int i=0; i<idx; i++)
{
for (int j=i+1; j<idx; j++)
{
if(nm[i] + nm[j] == n&&nm[j]<=n)
{
cout<<nm[i]<<"+"<<nm[j]<<" = "<<n<<endl;
}
}
}
} | # 0445, 2024-10-15 09:47:21, --Tx (0%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
map<int,int> nm;
int n,tmp,idx = 0,arr[10000];
cin>>n;
while(cin>>tmp)
{
// cin >>tmp;
arr[idx] = tmp;
idx++;
}
sort(arr,arr+idx);
for(int i=0;i<idx;i++)
{
nm[i] = arr[i];
}
for (int i=0; i<idx; i++)
{
for (int j=i+1; j<idx; j++)
{
if(nm[i] + nm[j] == n&&nm[j]<=n)
{
cout<<nm[i]<<"+"<<nm[j]<<" = "<<n<<endl;
}
}
}
} | # 0446, 2024-10-15 09:50:01, --Tx (0%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
map<int,int> nm;
int n,tmp,idx = 0,arr[10000];
cin>>n;
// int tmm = 16;
while(cin>>tmp)
{
// cin >>tmp;
arr[idx] = tmp;
idx++;
}
sort(arr,arr+idx);
for(int i=0;i<idx;i++)
{
nm[i] = arr[i];
}
for (int i=0; i<idx; i++)
{
for (int j=i+1; j<idx; j++)
{
if(nm[i] + nm[j] == n)
{
cout<<nm[i]<<"+"<<nm[j]<<" = "<<n<<endl;
}
if(nm[j]>n) break;
}
if(nm[i]>n) break;
}
} | # 0447, 2024-10-15 09:51:54, PPTx (50%)
#include <bits/stdc++.h>
using namespace std;
int main()
{
map<int,int> nm;
int n,tmp,idx = 0,arr[10000];
cin>>n;
// int tmm = 6;
while(cin>>tmp)
{
// cin >>tmp;
arr[idx] = tmp;
idx++;
}
sort(arr,arr+idx);
for(int i=0;i<idx;i++)
{
nm[i] = arr[i];
}
int ans=0;
for (int i=0; i<idx; i++)
{
for (int j=i+1; j<idx; j++)
{
if(nm[i] + nm[j] == n)
{
ans++;
}
if(nm[j]>n) break;
}
if(nm[i]>n) break;
}
cout <<ans;
} |
# 0448, 2024-10-15 09:32:31, -PPT (50%)
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;
cin>>k;
int ans = 0;
set<int> in;
int In;
while(cin>>In){
in.insert(In);
}
for(auto n = in.begin(); n != in.end(); n++){
for(auto m=n; m != in.end();m++){
if(*m + *n == k){
ans++;
}
}
}
cout<<ans;
return 0;
} |
# 0449, 2024-10-15 09:29:53, --TT (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int k;
string x,y;
set<int> s;
bool found;
cin >> k;
cin.ignore();
while(getline(cin,x)){
x += " ";
for(int i=0;i<x.size();i++){
if(x[i]==' '){
s.insert(stoi(y));
y="";
}
else{
y+=x[i];
}
}
if(x.empty())break;
}
do {
found = false;
for (auto it1 = s.begin(); it1 != s.end(); ++it1) {
for (auto it2 = next(it1); it2 != s.end(); ++it2) {
if (*it1 + *it2 == k) {
cout << *it1 << " + " << *it2 << " = " << k << endl;
s.erase(it1);
s.erase(it2);
found = true;
break;
}
}
if (found) break;
}
} while (found);
} | # 0450, 2024-10-15 09:32:43, --TT (0%)
#include <bits/stdc++.h>
using namespace std;
int main(){
int k;
string x,y;
set<int> s;
bool found;
cin >> k;
cin.ignore();
getline(cin,x);
x += " ";
for(int i=0;i<x.size();i++){
if(x[i]==' '){
s.insert(stoi(y));
y="";
}
else{
y+=x[i];
}
}
do {
found = false;
for (auto it1 = s.begin(); it1 != s.end(); ++it1) {
for (auto it2 = next(it1); it2 != s.end(); ++it2) {
if (*it1 + *it2 == k) {
cout << *it1 << " + " << *it2 << " = " << k << endl;
s.erase(it1);
s.erase(it2);
found = true;
break;
}
}
if (found) break;
}
} while (found);
//for(auto e:s)cout << e << " ";
} | # 0451, 2024-10-15 09:35:41, xxxx (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
string x, y;
unordered_set<int> s;
cin >> k;
cin.ignore();
getline(cin, x);
x += " ";
for (int i = 0; i < x.size(); i++) {
if (x[i] == ' ') {
s.insert(stoi(y));
y = "";
} else {
y += x[i];
}
}
unordered_set<int> seen;
for (int num : s) {
int complement = k - num;
if (seen.find(complement) != seen.end()) {
cout << num << " + " << complement << " = " << k << endl;
s.erase(num);
s.erase(complement);
}
seen.insert(num);
}
cout << "Set หลังจากลบ: ";
for (int num : s) {
cout << num << " ";
}
cout << endl;
return 0;
} | # 0452, 2024-10-15 09:36:29, xxxx (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
string x, y;
unordered_set<int> s;
cin >> k;
cin.ignore();
getline(cin, x);
x += " ";
for (int i = 0; i < x.size(); i++) {
if (x[i] == ' ') {
s.insert(stoi(y));
y = "";
} else {
y += x[i];
}
}
unordered_set<int> seen;
for (int num : s) {
int complement = k - num;
if (seen.find(complement) != seen.end()) {
cout << num << " + " << complement << " = " << k << endl;
s.erase(num);
s.erase(complement);
}
seen.insert(num);
}
} |
# 0453, 2024-10-15 09:20:45, xxxx (0%)
#include <bits/stdc++.h>
using namespace std;
main(){
int k,tmp,cnt=0;
string a;
set<int> s;
cin >> k;
cin.ignore();
getline(cin,a);
for(int i=0;i<a.length();i++){
if(isblank(a[i])) {
s.insert(stoi(a.substr(0,i)));
a.erase(0,i+1);
i=0;
}
if(i+1==a.length()) s.insert(stoi(a));
}
for(auto i : s){
tmp = k-i;
if(s.find(tmp)!=s.end()){
cnt++;
s.erase(tmp);
s.erase(i);
}
}
cout << cnt;
} | # 0454, 2024-10-15 09:26:07, xxxx (0%)
#include <bits/stdc++.h>
using namespace std;
main(){
int k,tmp,cnt=0;
string a;
set<int> s;
cin >> k;
cin.ignore();
getline(cin,a);
for(int i=0;i<a.length();i++){
if(isblank(a[i])) {
s.insert(stoi(a.substr(0,i)));
a.erase(0,i+1);
i=0;
}
if(i+1==a.length()) s.insert(stoi(a));
}
for(int i : s){
tmp = k-i;
if(s.find(tmp)!=s.end()&&tmp!=i){
cnt++;
s.erase(tmp);
s.erase(i);
}
}
cout << cnt;
} | # 0455, 2024-10-15 09:40:20, xxxx (0%)
#include <bits/stdc++.h>
using namespace std;
main(){
int k,tmp,cnt=0;
string a;
set<int> s;
cin >> k;
cin.ignore();
getline(cin,a);
for(int i=0;i<a.length();i++){
if(isblank(a[i])) {
s.insert(stoi(a.substr(0,i)));
a.erase(0,i+1);
i=0;
}
if(i+1==a.length()) s.insert(stoi(a));
}
for(int i : s){
tmp = k-i;
s.erase(i);
if(s.find(tmp)!=s.end()&&tmp!=i){
cnt++;
s.erase(tmp);
}
}
cout << cnt;
} |
# 0456, 2024-10-15 09:39:54, ---- (0%)
#include <iostream>
#include <set>
using namespace std ;
int main() {
set<int> num ;
int sum , cnt = 0 , now = 0 ;
cin >> sum ;
int x ;
while(cin >> x) {
cin >> x ;
num.insert(x) ;
}
for(auto itr = num.begin() ; itr != num.end() ; itr++) {
now += *itr ;
if(now == sum) {
cnt++ ;
now = 0 ;
}
}
cout << cnt ;
return 0 ;
} | # 0457, 2024-10-15 09:47:00, ---- (0%)
#include <iostream>
#include <set>
using namespace std ;
int main() {
set<int> num ;
int sum , cnt = 0 ;
cin >> sum ;
int x ;
while(cin >> x) {
num.insert(x) ;
}
for(auto itr1 = num.begin() ; itr1 != num.end() ; itr1++) {
int now = *itr1 ;
for(auto itr2 = itr1 ; itr2 != num.end() ; itr2++) {
now += *itr2 ;
if(now == sum) {
cnt++ ;
}
if(now > sum) {
break ;
}
}
}
cout << cnt ;
return 0 ;
} | # 0458, 2024-10-15 09:48:27, ---- (0%)
#include <iostream>
#include <set>
using namespace std ;
int main() {
set<int> num ;
int sum , cnt = 0 ;
cin >> sum ;
int x ;
while(cin >> x) {
num.insert(x) ;
}
for(auto itr1 = num.begin() ; itr1 != num.end() ; itr1++) {
int now = 0 ;
for(auto itr2 = itr1 ; itr2 != num.end() ; itr2++) {
now += *itr2 ;
if(now == sum) {
cnt++ ;
}
if(now > sum) {
break ;
}
}
}
cout << cnt ;
return 0 ;
} |
# 0459, 2024-10-15 09:40:14, Compilation error (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int k;
set<int> s;
cin >> k >> s;
bool count = false;
for (int i=0; i<s; i++;) {
if (s[0] + s[i] == k) {
count = true;
}
}
} | # 0460, 2024-10-15 09:41:13, Compilation error (0%)
#include <iostream>
#include <set>
using namespace std;
int main() {
int k;
set<int> s;
cin >> k >> s;
int count = 0;
for (int i=0; i<s; i++;) {
if (s[0] + s[i] == k) {
count += 1;
}
}
} |
# 0461, 2024-10-15 09:37:06, Compilation error (0%)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
minn=INT_MAX;
cin >> n;
set<int>s;
int tmp;
while(cin>>tmp)
{
s.insert(tmp);
if (tmp>n)
{
minn=min(tmp,minn);
}
}
for(int i = 0 ; i < s.size() ; i++)
{
if (s[i]==minn)
{
break;
}
for (int j = i+1 ; j < s.size(); j++)
}
}
} |
# 0462, 2024-10-15 09:29:34, ---- (0%)
#include<iostream>
using namespace std;
int main()
{
} |
# 0463, 2024-10-15 09:51:54, ---- (0%)
#include <iostream>
#include <set>
using namespace std;
int main(){
int K;
cin >> K;
int x;
while(cin >> x){
}
} |
# 0464, 2024-10-15 09:46:21, ---- (0%)
#include <iostream>
using namespace std;
int main(){
cout << "Hello World";
} |
# 0465, 2024-10-15 09:41:57, ---- (0%)
#include<iostream>
using namespace std;
int main(){
cout<<"HELLO WORLD";
} |
# 0466, 2024-10-15 09:10:41, ---- (0%)
#include <iostream>
using namespace std;
int main () {
} |
# 0467, 2024-10-15 09:49:44, Compilation error (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int result = 0;
cin >> n;
set<int> s;
int num;
while (cin >> num) {
s.insert(num);
}
int test = n;
for (auto itr = s.begin(); itr != s.end(); itr++) {
test -= *itr;
if (s.find(test) != s.end())
}
} |
# 0468, 2024-10-15 09:50:27, Compilation error (0%)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int result = 0;
cin >> n;
set<int> s;
int num;
while (cin >> num) {
s.insert(num);
}
int test = n;
for (auto itr = s.begin(); itr != s.end(); itr++) {
test -= *itr;
if (s.find(test) != s.end())
}
} |
# 0469, 2024-10-15 09:47:00, ---- (0%)
#include<iostream>
using namespace std;
int main(){
cout<<"Hi";
return 0;
} |
# 0470, 2024-10-15 09:51:48, Compilation error (0%)
#include <bits/stdc++.h>
using namspace std;
int main(){
set<int> s;
int n, k;
cin >> k;
int count = 0;
while(cin >> n){
s.insert(n);
}
for(auto e=s.begin(); ){
if()
}
}
1 2 3 4 5 9 |