text
stringlengths 49
983k
|
|---|
#include<iostream>
using namespace std;
void hoandoi(int &c,int &b)
{
int t=c;c=b;b=t;
}
int main(){
int n,*a,d=0,min;
cin>>n;
a=new int[n];
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n-1;i++)
{
min=i;
for(int j=i+1;j<n;j++){
if(a[j]<a[min]){
min=j;
}
}
if(min!=i){
hoandoi(a[i],a[min]);
d++;}
}
for(int i=0;i<n;i++)
{cout<<a[i];
if(i<n-1)
cout<<" ";
}
cout << endl << d << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(void)
{
int n, a[100], num = 0;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> a[i];
}
for(int i = 0; i < n; i++) {
int minj = i;
for(int j = i; j < n; j++) {
if(a[j] < a[minj]){
minj = j;
}
}
if(i != minj){
num++;
swap(a[i], a[minj]);
}
cout << a[i] << (i == n - 1 ? "\n" : " ");
}
cout << num << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n,i,j,count=0,min;
cin>>n;
int a[n];
for (i=0;i<n;i++)cin>>a[i];
for (i=0;i<n;i++){
min=i;
for (j=i;j<n;j++){
if (a[j]<a[min])min=j;
}
swap(a[i],a[min]);
count+=(min!=i);
}
for (i=0;i<n;i++){
if (i)cout<<' ';
cout<<a[i];
}
cout<<endl;
cout<<count<<endl;
}
|
#include <iostream>
using namespace std;
int main(){
int n,x,a[101] = {},minj,count = 0;
cin >> n;
for(int i = 0;i < n;i++){
cin >> x;
a[i] = x;
}
for(int i = 0;i < n;i++){
minj = i;
for(int j = i;j < n;j++){
if(a[j] < a[minj]){
minj = j;
}
}
swap(a[i],a[minj]);
if(i != minj){
count++;
}
}
for(int i = 0;i < n;i++){
if(i != n-1)cout << a[i] << " ";
else cout << a[i] <<endl;
}
cout << count << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin>>n;
int A[n];
for(int i=0;i<n;i++) cin>>A[i];
int ans=0;
for(int i=0;i<n;i++){
int minj=i;
for(int j=i;j<n;j++){
if(A[j]<A[minj]){
minj=j;
}
}
if(i!=minj){
swap(A[i],A[minj]);
ans++;
}
}
for(int i=0;i<n;i++) cout<<A[i]<<" \n"[i==n-1];
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
int cnt=0;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n-1;i++)
{
int idx=i;
for(int j=i;j<n;j++)
if(a[j]<a[idx])
idx=j;
cnt+=i!=idx;
swap(a[i],a[idx]);
}
for(int i=0;i<n;i++)
{
if(i)
cout<<" ";
cout<<a[i];
}
cout<<"\n";
cout<<cnt<<endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<utility>
using namespace std;
int main() {
int n, a[100],count=0;
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) {
int MIN = i;
for (int j = i; j < n; j++) {
if (a[j] < a[MIN]) {
MIN = j;
}
}
if (i != MIN) {
swap(a[i], a[MIN]);
count++;
}
}
for (int i = 0; i < n; i++) {
if (i != 0)cout << " ";
cout << a[i];
}
cout << endl << count << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n,a[100],i,j,m,t,c;
for(cin>>n,i=0;i<n;cin>>a[i],++i);
for(c=0,i=0;i<n;++i){
m=i;
for(j=i;j<n;++j){
if(a[j]<a[m]){
m=j;
}
}
t=a[i];
a[i]=a[m];
a[m]=t;
if(i-m)++c;
}
for(i=0;i<n;cout<<(i?" ":"")<<a[i],++i);
cout<<endl<<c<<endl;
return 0;
}
|
#include<stdio.h>
int main(){
int minj,i,j,a=0,count=0;
int N,A[100],c=0;
scanf("%d",&N);
for(i=0;i<N;i++){
scanf("%d",&A[i]);
}
for(i=0;i<=N-1;i++){
minj=i;
for(j=i;j<=N-1;j++){
if(A[j]<A[minj]){
minj=j;
c=1;
}
}
a=A[i];
A[i]=A[minj];
A[minj]=a;
if(c==1){
count++;
c=0;
}
}
for(i=0;i<N-1;i++){
printf("%d ",A[i]);
}
printf("%d\n",A[N-1]);
printf("%d\n",count);
return 0;
}
|
#include<iostream>
#include<vector>
#define rep(i, s, n) for (int i=(s); i<(n); i++)
using namespace std;
int main() {
int n; cin>>n;
vector<int> a(n);
rep(i, 0, n) cin>>a[i];
int cnt=0;
rep(i, 0, n) {
int minj=i;
rep(j, i, n) {
if (a[minj]>a[j]) minj=j;
}
swap(a[i], a[minj]);
if (i!=minj) cnt++;
}
rep(i, 0, n-1) cout<<a[i]<<" ";
cout<<a[n-1]<<endl;
cout<<cnt<<endl;
return 0;
}
|
#include<cstdio>
#include<iostream>
using namespace std;
int selectionSort(int A[],int N){
int i,j,t,sw=0,minj;
for(i=0;i<N-1;i++){
minj=i;
for(j=i;j<N;j++){
if(A[j]<A[minj]) minj=j;
}
t=A[i];A[i]=A[minj];A[minj]=t;
if(i!=minj) sw++;
}
return sw;
}
int main(){
int A[100],N,i,sw;
scanf("%d",&N);
for(i=0;i<N;i++) scanf("%d",&A[i]);
sw=selectionSort(A,N);
for(i=0;i<N;i++){
if(i>0) printf(" ");
printf("%d",A[i]);
}
printf("\n");
printf("%d\n",sw);
return 0;
}
|
#include <algorithm>
#include <cstdio>
static const size_t N_MAX = 100;
int main() {
size_t N;
int A[N_MAX];
scanf("%zu", &N);
for (size_t i = 0; i < N; i++)
scanf("%d", &A[i]);
int c = 0;
for (size_t i = 0; i < N - 1; i++) {
auto m = std::min_element(A + i, A + N);
if (A[i] != *m) {
std::swap(A[i], *m);
c++;
}
}
for (size_t i = 0; i < N - 1; i++)
printf("%d ", A[i]);
printf("%d\n", A[N-1]);
printf("%d\n", c);
return 0;
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN=105;
int a[MAXN];
int main () {
int n,cnt=0;
scanf ("%d",&n);
for (int i=0;i<n;i++) {
scanf ("%d",&a[i]);
}
for (int i=0;i<n;i++) {
int mn=i;
for (int j=i+1;j<n;j++) {
if (a[j]<a[mn]) mn=j;
}
if (mn!=i) {
swap (a[mn],a[i]);
cnt++;
}
}
printf ("%d",a[0]);
for (int i=1;i<n;i++) {
printf (" %d",a[i]);
}
printf ("\n%d\n",cnt);
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n,a[100];
int min,tmp,sum=0;
cin >> n;
for(int i=0; i<n; i++)
cin >> a[i];
for(int i=0; i<n; i++){
min = i;
for(int j=i; j<n; j++){
if(a[j] < a[min])
min = j;
}
if(min!=i){
tmp = a[i];
a[i] = a[min];
a[min] = tmp;
sum++;
}
}
cout << a[0];
for(int i=1; i<n; i++)
cout << ' ' <<a[i];
cout << endl << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define lp(n) for(int i = 0; i < n; i++)
#define lpp(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main() {
int a[100];
int n, c=0;
cin >> n;
lp(n) cin >> a[i];
int minj;
lp(n) {
minj = i;
for(int j = i; j <= n-1; j++) {
if(a[j] < a[minj]) minj = j;
}
if(i != minj) c++;
swap(a[i], a[minj]);
}
lp(n) {
cout << a[i] << ((i == n-1) ? "\n" : " ");
}
cout << c << endl;
return 0;
}
|
#include <iostream>
using namespace std;
static const int MAX = 100;
int main(void)
{
int N, A[MAX];
int minj, count = 0;
cin >> N;
for(int i=0;i<N;i++) cin >> A[i];
for(int i=0;i<N;i++){
minj = i;
for(int j=i+1;j<N;j++){
if (A[minj] > A[j]){
minj = j;
}
}
if (i != minj){
swap(A[i], A[minj]);
count++;
}
}
for(int i=0;i<N;i++){
if (i > 0) cout << " ";
cout << A[i];
}
cout << endl;
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,sw=0;
cin>>n;
int A[n];
for(int i=0;i<n;i++){
cin>>A[i];
}
for(int i=0;i<n-1;i++){
int minj=i;
for(int j=i+1;j<n;j++){
if(A[minj]>A[j]){
minj=j;
}
}
if(minj!=i){
swap(A[minj],A[i]);
sw++;
}
}
for(int i=0;i<n;i++){
if(i){cout << " ";}
cout << A[i];
}
cout << endl<<sw<<endl;
}
|
#include<iostream>
#include <string>
#include <utility>
using namespace std;
int N,A[100],ans=0;
int main(){
cin>>N;
for(int f=0;f<N;f++)cin>>A[f];
for(int i=0;i<N-1;i++){
int minj = i;
for(int j=i+1;j<N;j++){
if (A[j] < A[minj]){
minj = j;}}
swap(A[i],A[minj]);
if(A[i]!=A[minj])ans++;}
for(int i=0;i<N-1;i++)cout<<A[i]<<" ";
cout<<A[N-1]<<endl<<ans<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int N, A[100],count=0;
cin >> N;
for (int i = 0;i < N;i++) { cin >> A[i]; }
for (int i = 0;i < N;i++) {
int minj = i;
for (int j = i;j < N;j++) {
if (A[j] < A[minj])
minj = j;
}
if (minj != i) {
int x = A[i];
A[i] = A[minj];
A[minj] = x;
count++;
}
}
for (int i = 0;i < N-1;i++) { cout << A[i] << " "; }
cout << A[N - 1] << endl;
cout << count << endl;
}
|
#include<cstdio>
int main() {
int i, j, n, minj, tmp, a[100], count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
minj = i;
for (j = i; j < n; j++) {
if (a[j] < a[minj])minj = j;
}
if (a[i] != a[minj]) {
count++;
}
tmp = a[i];
a[i] = a[minj];
a[minj] = tmp;
}
printf("%d", a[0]);
for (i = 1; i < n; i++) {
printf(" %d", a[i]);
}
printf("\n%d\n", count);
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a[100],n;
cin>>n;
for(int i=0; i<n; i++){
cin>>a[i];
}
int sw = 0;
for(int i=0; i<n ; i++){
int minj = i;
for(int j=i; j<n; j++){
if(a[minj]>a[j]){
minj = j;
}
}
if(i != minj){
swap(a[i],a[minj]);
sw++;
}
}
for(int i=0; i<n ; i++){
if(i) cout<<" ";
cout<<a[i];
}
cout<<endl;
cout<<sw<<endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(void){
int n,cnt=0;
cin >> n;
vector<int>v(n);
for(int i=0;i<n;i++)cin >> v[i];
for(int i=0;i<n;i++){
int id=i;
for(int j=i;j<n;j++){
if(v[id]>v[j])id=j;
}
if(i!=id)cnt++,swap(v[i],v[id]);
}
for(int i=0;i<n;i++)cout << v[i] << (i<n-1?" ":"\n");
cout << cnt << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int minj,n,count=0;
cin >> n;
vector<int> a(n);
for(int i=0;i<n;i++)
cin >> a.at(i);
for(int i=0;i<n;i++){
minj = i;
for(int j=i;j<n;j++){
if(a[j]<a[minj])
minj = j;
}
if(a[i]!=a[minj])
count++;
swap(a[i], a[minj]);
}
for(int k=0;k<n-1;k++)
cout << a[k] << " ";
cout << a[n-1] << endl;
cout << count << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int i,j,a[100],n,minj,count=0;
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
}
for(i=0;i<n;i++){
minj=i;
for(j=i;j<n;j++)if(a[j]<a[minj])minj=j;
if(i!=minj){
swap(a[i],a[minj]);
count++;
}
}
for(i=0;i<n;i++){
if(i==n-1)cout<<a[i];
else cout<<a[i]<<" ";
}
cout<<endl;
cout<<count<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n,temp,cnt,minj;
while(cin >> n){
int k=0;
int a[n];
while(k!=n){
cin >> a[k];
k++;
}
cnt=0;
for(int i=0;i<n;i++){
minj =i;
for(int j=i;j<n;j++){
if(a[minj]>a[j]) minj =j;
}
if(minj!=i){
temp=a[minj];
a[minj]=a[i];
a[i]=temp;
cnt++;
}
}
int l=0;
while(l!=n-1){
cout << a[l] << " ";
l++;
}
cout << a[n-1]<< endl;
cout << cnt << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int a[100];
cin>>n;
int t,ans=0;
int min=10000000;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
{
min=i;
for(int j=i;j<n;j++)
if(a[j]<a[min])
min=j;
t=a[i];
a[i]=a[min];
a[min]=t;
if(i!=min)
ans++;
}
for(int i=0;i<n-1;i++)
cout<<a[i]<<' ';
cout<<a[n-1]<<endl;
cout<<ans<<endl;
}
|
#include<stdio.h>
int main(){
int a,i,minj,A[100],c,count,j;
scanf("%d",&a);
for(i=0;i<a;i++)scanf("%d",&A[i]);
for (i=0;i<a;i++){
minj = i;
for (j=i;j<=a-1;j++){
if (A[j] < A[minj]){
minj = j;
}
}
if(minj!=i){
c=A[i];
A[i]=A[minj];
A[minj]=c;
count++;
}
}
for(i=0;i<a;i++){
if(i!=a-1)printf("%d ",A[i]);
else printf("%d\n%d\n",A[i],count);
}
}
|
//By Vlgd
#include<bits/stdc++.h>
using namespace std;
int A[100];
int main(){
int n,cnt=0;scanf("%d",&n);
for (int i=0;i<n;i++) scanf("%d",&A[i]);
for (int i=0;i<n;i++){
int minj=i;
for (int j=i;j<n;j++) if (A[minj]>A[j]) minj=j;
if (minj!=i){
swap(A[i],A[minj]);
cnt++;
}
}
for (int i=0;i<n;i++){
printf("%d",A[i]);
if (i==n-1) printf("\n");
else printf(" ");
}
printf("%d\n",cnt);
}
|
#include<iostream>
using namespace std;
const int MAX = 100;
int A[MAX];
int N;
int main()
{
cin >> N;
for (int i = 0; i < N; ++i) cin >> A[i];
int minj;
int cnt = 0;
for (int i = 0; i < N; ++i)
{
minj = i;
for (int j = i + 1; j < N; ++j)
{
if (A[j] < A[minj]) minj = j;
}
if (i != minj)
{
swap(A[i], A[minj]);
cnt++;
}
}
for (int i = 0; i < N; ++i)
{
if (i) cout << ' ';
cout << A[i];
}
cout << endl;
cout << cnt << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
int N, A[100];
cin >> N;
for (int i = 0; i < N; i++) cin >> A[i];
int count = 0;
for (int i = 0; i < N; i++) {
int minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
if (i != minj) {
swap(A[i], A[minj]);
count++;
}
}
cout << A[0];
for (int i = 1; i < N; i++) {
cout << " " << A[i];
}
cout << endl << count << endl;
}
|
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
int main()
{
int n, c = 0;
cin >> n;
vector<int> v(n);
for (int &x: v)
cin >> x;
for (auto i = v.begin(), e = v.end(); i != e - 1; i++) {
auto min = i, j = i;
for (; j != e; j++)
if (*j < *min)
min = j;
if (i != min)
swap(*i, *min), c++;
}
for (int &x: v)
cout << (&x == &v[0] ? "" : " ") << x;
cout << endl << c << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main(){
int n;cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++)cin>>v[i];
int ans=0;
for(int i=0;i<n;i++){
int minj=i;
for(int j=i;j<n;j++){
if(v[j]<v[minj]){
minj=j;
}
}
if(v[i]!=v[minj])swap(v[i],v[minj]),ans++;
}
for(int i=0;i<n;i++){
if(i)cout<<" ";
cout<<v[i];
}
cout<<endl<<ans<<endl;
}
|
#include<iostream>
using namespace std;
int main()
{
int n,A[100],flag = 0;
cin>>n;
for(int i=0 ; i<n ; i++)
{
cin>>A[i];
}
for(int i=0 ; i<n ; i++)
{
int minJ = i;
for(int j=i+1 ; j<n ; j++)
{
if(A[j] < A[minJ])
{
minJ = j;
}
}
if(minJ != i) flag++;
int temp = A[i];
A[i] = A[minJ];
A[minJ] = temp;
}
for(int i=0 ; i<n ; i++)
{
cout<<A[i];
if(i != n-1)
{
cout<<" ";
}
}
cout<<endl<<flag<<endl;
}
|
#include<stdio.h>
int main(){
int A[100], n, i, j, t, sw = 0, mini;
scanf("%d", &n);
for ( i = 0; i < n; i++ ) scanf("%d", &A[i]);
for ( i = 0; i < n; i++ ){
mini = i;
for ( j = i; j < n; j++ ){
if ( A[j] < A[mini] ) mini = j;
}
t = A[i]; A[i] = A[mini]; A[mini] = t;
if ( i != mini ) sw++;
}
for ( i = 0; i < n; i++ ){
if (i) printf(" ");
printf("%d", A[i]);
}
printf("\n");
printf("%d\n", sw);
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int i=0;
int N;
cin >> N;
int A[N];
for(int i=0;i<N;i++){
cin >> A[i];
}
int count=0;
for(int i=0;i<N;i++){
int minj=i;
for(int j=i;j<N;j++){
if(A[minj] > A[j]){
minj=j;
}
}
if(i!=minj){
int temp = A[i];
A[i] = A[minj];
A[minj]=temp;
count++;
}
}
for(int i=0;i<N;i++){
cout << A[i];
if(i != N-1)
cout << " ";
}
cout << endl << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,cnt=0;
cin >> n;
int a[n];
for(int i=0;i<n;i++) cin >> a[i];
for(int i=0;i<n;i++){
int minj = i;
for(int j=i+1;j<n;j++){
if(a[j]<a[minj]) minj = j;
}
if(minj!=i){
swap(a[minj],a[i]);
cnt++;
}
}
for(int i=0;i<n-1;i++) cout << a[i] << " ";
cout <<a[n-1] << endl;
cout << cnt << endl;
}
|
#include <iostream>
#include <utility>
using namespace std;
int main(){
int cnt=0;
int n; cin >> n;
int a[n];
for(int i=0;i<n;i++) cin >> a[i];
for(int i=0;i<n;i++){
int minj=i;
for(int j=i;j<n;j++){
if(a[j]<a[minj]) minj=j;
}
if(i!=minj) cnt++;
swap(a[i],a[minj]);
}
for(int i=0;i<n;i++){
if(i==n-1) cout << a[n-1] << endl;
else cout << a[i] << " ";
}
cout << cnt << endl;
}
|
#include <iostream>
using namespace std;
int main(){
int a[100], n, minj, tmp, num;
num = 0;
cin >> n;
for (int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < n - 1; i++){
minj = i;
for (int j = i + 1; j < n; j++){
if (a[j] < a[minj]){
minj = j;
}
}if(minj != i){
tmp = a[i];
a[i] = a[minj];
a[minj] = tmp;
num++;
}
}
cout << a[0];
for(int i = 1; i < n; i++){
cout << " " << a[i];
}
cout << "\n" << num << endl;
}
|
#include<iostream>
#include<utility>
using namespace std;
int main(){
int N, a[100], t=0;
cin >> N;
for(int i=0 ; i<N ; i++) cin >> a[i];
for(int i=0 ; i<N ; i++){
int minj = i;
for(int j=i ; j<N ; j++){
if(a[j]<a[minj]) minj=j;
}
swap(a[i], a[minj]);
if(i!=minj) t++;
}
for(int i=0 ; i < N-1 ; i++) cout << a[i] << " ";
cout << a[N-1] << endl;
cout << t << endl;
return 0;
}
|
#include<stdio.h>
void swap(int *a,int *b,int *c){
int temp=*a;
*a=*b;
*b=temp;
(*c)++;
}
int main(){
int i,n,j,k,count=0,flag;
int a[101];
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
for(i=0;i<n-1;i++){
int min=a[i];
for(j=i+1;j<n;j++){
if(min>a[j]){
min=a[j];
flag=j;
}
}
if(min<a[i])
swap(&a[i],&a[flag],&count);
}
for(i=0;i<n-1;i++){
printf("%d ",a[i]);
}
printf("%d\n",a[i]);
printf("%d\n",count);
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,cnt=0;
cin>>n;
int a[101];
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
int maxi=i;
for(int j=i+1;j<n;j++){
if(a[j]<a[maxi]){
maxi=j;
}
}
if(maxi!=i){
cnt++;
swap(a[maxi],a[i]);
}
}
for(int i=0;i<n;i++){
if(i==n-1){
cout<<a[i]<<endl;
}else{
cout<<a[i]<<" ";
}
}
cout<<cnt<<endl;
return 0;
}
|
#include <cstdio>
#include <string>
using namespace std;
int main(){
string mark = "SHCD";
bool card[4][13] = { 0 };
int n;
scanf("%d", &n);
for(int i = 0; i < n; ++i){
char c;
int t;
scanf(" %c %d", &c, &t);
card[mark.find(c)][t - 1] = true;
}
for(int i = 0; i < 4; ++i){
for(int j = 0; j < 13; ++j){
if(!card[i][j]){
printf("%c %d\n", mark[i], j + 1);
}
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void){
int card[4][13]={0};
char mark[4] = {'S','H','C','D'};
int num;
int a,b;
char m;
cin>>num;
for(int i=0;i<num;i++){
cin>>m>>b;
for(int j=0;j<4;j++){
if(m==mark[j]){
a=j;
break;
}
}
card[a][b-1]++;
}
for(int i=0;i<4;i++){
for(int j=0;j<13;j++){
if(card[i][j]==0)
cout<<mark[i]<<" "<<j+1<<endl;
}
}
return 0;
}
|
#include <cstdio>
int main() {
int n;
int card[52] = { 0 };
scanf(" %d", &n);
for (int i = 0; i < n; ++i) {
char c;
int a;
scanf(" %c %d", &c, &a);
if (c == 'S') card[a - 1] = 1;
else if (c == 'H') card[a - 1 + 13] = 1;
else if (c == 'C') card[a - 1 + 26] = 1;
else if (c == 'D') card[a - 1 + 39] = 1;
}
for (int i = 0; i < 52; ++i) {
if (card[i] == 0) {
if (i < 13) printf("S ");
else if (i < 26) printf("H ");
else if (i < 39) printf("C ");
else if (i < 52) printf("D ");
printf("%d\n", i % 13 + 1);
}
}
return 0;
}
|
// AOJ ITP 1_6_B
#include<cstdio>
#include<string>
#define rep(i,a) for( int i = 0; i != (a); ++i )
const std::string suit = "SHCD";
bool used[52];
int main()
{
int n;
scanf( "%d", &n );
rep( i, n )
{
char ch[2];
int r;
scanf( "%s%d", ch, &r );
used[suit.find( *ch )*13+r-1] = true;
}
rep( i, 52 )
if( !used[i] )
printf( "%c %d\n", suit[i/13], i%13+1 );
return 0;
}
|
#include<iostream>
using namespace std;
int n,arr[53];
int main() {
cin>>n;
for(int i =1; i<=n; i++) {
int t;
char c;
cin>>c>>t;
if(c=='S')
arr[t]++;
else if(c=='H')
arr[t+13]++;
else if(c=='C')
arr[t+26]++;
else
arr[t+39]++;
}
for(int i=1; i<=52; i++) {
if(arr[i]==0) {
if(i<=13)
cout<<"S "<<i<<endl;
else if(i<=26)
cout<<"H "<<i-13<<endl;
else if(i<=39)
cout<<"C "<<i-26<<endl;
else
cout<<"D "<<i-39<<endl;
}
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<vector<bool>> v(4, vector<bool>(13));
while(n--){
char c;
int a;
cin >> c >> a;
int index = c == 'S' ? 0 : c == 'H' ? 1 : c == 'C' ? 2 : 3;
v[index][--a] = true;
}
for(int i = 0; i < 4; i++) for(int j = 0; j < 13; j++) if(!v[i][j]) cout << "SHCD"[i] << ' ' << j + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const vector<char> m = {'S', 'H', 'C', 'D'};
signed main() {
int n;
cin >> n;
char c;
int num;
map<char, vector<bool>> a;
for (int i = 0; i < 4; ++i) {
a[m[i]].resize(13);
}
for (int i = 0; i < n; ++i) {
cin >> c >> num;
a[c][num - 1] = true;
}
for (int mark = 0; mark < 4; ++mark) {
for (int i = 0; i < 13; ++i) {
if (!a[m[mark]][i]) {
cout << m[mark] << ' ' << i + 1 << endl;
}
}
}
}
|
#include <iostream>
using namespace std;
int main() {
int has[4][13] = {0};
int n, r;
char s;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s >> r;
has[(s == 'H') + (s == 'C') * 2 + (s == 'D') * 3][r - 1] = 1;
}
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 13; ++j) {
if (!has[i][j]) {
cout << "SHCD"[i] << ' ' << (j + 1) << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
int a[4][14];
int main()
{
int n, b;
char c;
char s[] = "SHCD";
std::cin >> n;
for (int i = 0; i < n; i++)
{
std::cin >> c >> b;
if (c == 'S')
a[0][b]++;
else if (c == 'H')
a[1][b]++;
else if (c == 'C')
a[2][b]++;
else
a[3][b]++;
}
for (int i = 0; i < 4; i++)
{
for (int j = 1; j <= 13; j++)
{
if (!a[i][j])
{
std::cout << s[i] << " " << j << std::endl;
}
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int cards[4][13]={0};
int n;
cin>>n;
for(int i=0;i<n;i++){
char a;
int b;
cin>>a>>b;
if(a=='S')cards[0][b-1]++;
else if(a=='H')cards[1][b-1]++;
else if(a=='C')cards[2][b-1]++;
else if(a=='D')cards[3][b-1]++;
}
for(int i=0;i<4;i++){
for(int j=0;j<13;j++){
if(cards[i][j]==0){
if(i==0)cout<<"S "<<j+1<<endl;
if(i==1)cout<<"H "<<j+1<<endl;
if(i==2)cout<<"C "<<j+1<<endl;
if(i==3)cout<<"D "<<j+1<<endl;
}
}
}
}
|
#include<iostream>
using namespace std;
int main(){
int n,i,j,k,H,S,D,C,y;
char x,ch;
cin>>n;
bool cards[4][13]={false};
for(i=0;i<n;i++){
cin>>x>>y;
if(x=='S'){
cards[0][y-1]=true;
}
else if(x=='H'){
cards[1][y-1]=true;
}
else if(x=='C'){
cards[2][y-1]=true;
}
else if(x=='D'){
cards[3][y-1]=true;
}
}
for(j=0;j<4;j++){
for(k=0;k<13;k++){
if(cards[j][k]==false){
switch(j){
case 0:ch='S';break;
case 1:ch='H';break;
case 2:ch='C';break;
case 3:ch='D';break;
}
cout<<ch<<" "<<k+1<<endl;
}
}
}
return 0;
}
|
#include <iostream>
#include <cstdio>
int main(){
int n,i,j,num;
int a[4][13]={0};
char c;
std::cin>>n;
for(i=0;i<n;i++){
std::cin>>c>>num;
if(c=='S')
a[0][num-1]=1;
if(c=='H')
a[1][num-1]=1;
if(c=='C')
a[2][num-1]=1;
if(c=='D')
a[3][num-1]=1;
}
for(i=0;i<4;i++){
for(j=0;j<13;j++){
if(a[i][j]==0){
if(i==0) std::cout<<"S "<<j+1<<std::endl;
if(i==1) std::cout<<"H "<<j+1<<std::endl;
if(i==2) std::cout<<"C "<<j+1<<std::endl;
if(i==3) std::cout<<"D "<<j+1<<std::endl;
}
}
}
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
int n;
char suits[4] = { 'S', 'H', 'C', 'D' };
bool d[4][13] = { false };
cin >> n;
for (int i = 0; i < n; i++)
{
char mark;
int A;
cin >> mark >> A;
if (mark == suits[0]) d[0][A - 1] = true;
else if (mark == suits[1]) d[1][A - 1] = true;
else if (mark == suits[2]) d[2][A - 1] = true;
else if (mark == suits[3]) d[3][A - 1] = true;
}
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 13; j++)
{
if (d[i][j] == false) cout << suits[i] << " " << j + 1 << "\n";
}
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
static const string mark[4] = {"S", "H", "C", "D"};
int main(void) {
int n;
cin >> n;
int card[4][13] = {};
string a;
int b;
for(int i=0;i<n;i++) {
cin >> a >> b;
if(a == "S") card[0][b-1] = 1;
else if(a == "H") card[1][b-1] = 1;
else if(a == "C") card[2][b-1] = 1;
else if(a == "D") card[3][b-1] = 1;
}
for(int i=0;i<4;i++) {
for(int j=0;j<13;j++) {
if(card[i][j] == 0) {
cout << mark[i] << " " << j+1 << endl;
}
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, t[52], f;
char s[52], suit[4] = { 'S','H','C','D' };
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i] >> t[i];
}
for (int i = 0; i < 4; i++) {
for (int j = 1; j <= 13; j++) {
f = 1;
for (int k = 0; k < n; k++) {
if (s[k] == suit[i] && t[k] == j) {
f = 0;
}
}
if (f == 1) {
cout << suit[i] << " " << j << "\n";
}
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void)
{
int n; //??????????????°
int num;
char mark;
char marks[4] = {'S', 'H', 'C', 'D'};
int cards[4][13] = {0};
cin >> n;
for(int i = 0; i < n; i++){
cin >> mark >> num;
for(int j = 0; j < 4; j++){
if(mark == marks[j]){
cards[j][num-1] = 1;
break;
}
}
}
for(int i = 0; i < 4; i++){
for(int j = 0; j < 13; j++){
if(!cards[i][j] == 1){
cout << marks[i] << " " << j+1 << "\n";
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n; cin>>n;
map<pair<char,ll>,bool> mp;
rep(i,n){
char c; ll a;
cin>>c>>a;
mp[make_pair(c,a)]=true;
}
char im[]={'S','H','C','D'};
map<char,ll> ans;
rep(i,4)rep(j,13){
if(!mp[{im[i],j+1}]) cout<<im[i]<<" "<<j+1<<endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int x,n,i,c[4][13]={0},j;
char m;
cin>>n;
for(i=1;i<=n;i++){
cin>>m>>x;
if(m=='S'){
c[0][x-1]=1;
}else if(m=='H'){
c[1][x-1]=1;
}else if(m=='C'){
c[2][x-1]=1;
}else if(m=='D'){
c[3][x-1]=1;
}
}
for(i=0;i<4;i++){
for(j=0;j<13;j++){
if(c[i][j]==0){
if(i==0){
cout<<"S "<<j+1<<endl;
}else if(i==1){
cout<<"H "<<j+1<<endl;
}else if(i==2){
cout<<"C "<<j+1<<endl;
}else{
cout<<"D "<<j+1<<endl;
}
}
}
}
return 0;
}
|
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<vector<bool>> cards(4,vector<bool>(13));
string SHCD="SHCD";
for(int i=0;i<n;i++)
{
char shcd;
int num;
cin >> shcd >> num;
cards.at(SHCD.find(shcd)).at(num-1)=true;
}
for(int i=0;i<4;i++)
{
for(int j=0;j<13;j++)
{
if(!cards.at(i).at(j))cout << SHCD.at(i) << " " << j+1 << endl;
}
}
}
|
#include <iostream>
using namespace std;
int suitIndex(char c)
{ return "00230001000000000000000000"[c-'A'] - '0'; }
int main()
{
int n; cin >> n;
bool cards[52] = {0};
char s;
int card;
while(n-- && cin >> s >> card)
cards[suitIndex(s)*13 + card-1] = true;
for(card=0; card<52; ++card)
if(!cards[card])
cout << "SHCD"[card/13] << ' ' << card%13+1 << '\n';
return 0;
}
|
#include <iostream>
#include <array>
#include <map>
int main(int argc, char const* argv[])
{
int n;
std::map<char,std::array<bool,13>> card;
std::array<char,4> marks{'S','H','C','D'};
for (auto&& m : marks) {
for (int i = 0; i < 13; i++) {
card[m][i] = true;
}
}
std::cin >> n;
for (int i = 0; i < n; i++) {
char mark;
int rank;
std::cin >> mark >> rank;
card[mark][rank-1] = false;
}
for (auto&& m : marks) {
for (int i = 0; i < 13; i++) {
if (card[m][i])
std::cout << m << " " << i+1 << std::endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
bool c[4][13] = {};
for (int i=0; i<n; i++) {
char m;
int r;
cin >> m >> r;
c[m=='S'?0 : m=='H'?1 : m=='C'?2 : 3][r-1] = true;
}
for (int i=0; i<4; i++) {
for (int j=0; j<13; j++) {
if (!c[i][j])
cout << (i==0?'S' : i==1?'H' : i==2?'C' : 'D') << " " << j+1 << endl;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
int a[4][14];
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
char c;int p;
cin>>c>>p;
if(c=='S'){
a[0][p]=1;
}
if(c=='H'){
a[1][p]=1;
}
if(c=='C'){
a[2][p]=1;
}
if(c=='D'){
a[3][p]=1;
}
}
for(int i=0;i<4;i++){
for(int j=1;j<=13;j++){
if(a[i][j]==0){
if(i==0){
cout<<"S "<<j<<endl;
}
if(i==1){
cout<<"H "<<j<<endl;
}
if(i==2){
cout<<"C "<<j<<endl;
}
if(i==3){
cout<<"D "<<j<<endl;
}
}
}
}
return 0;
}
|
#include <iostream>
#include <map>
using namespace std;
int main()
{
map<char, int> CtoI;
CtoI['S'] = 0;
CtoI['H'] = 1;
CtoI['C'] = 2;
CtoI['D'] = 3;
map<int, char> ItoC;
ItoC[0] = 'S';
ItoC[1] = 'H';
ItoC[2] = 'C';
ItoC[3] = 'D';
int N, I;
char C;
bool card[52];
for(int i = 0; i < 52; ++i)
{
card[i] = true;
}
cin >> N;
for(int i = 0; i < N; ++i)
{
cin >> C >> I;
card[CtoI[C] * 13 + I - 1] = false;
}
for(int i = 0; i < 52; ++i)
{
if(card[i])
{
cout << ItoC[i / 13] << " " << i % 13 + 1 << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<pair<char, int>, char> m;
char suits[] = {'S', 'H', 'C', 'D'};
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
char suit;
int rank;
for(int i=0;i<n;++i) {
cin >> suit >> rank;
m[make_pair(suit,rank)] = 'X';
}
for(int i=0;i<4;++i)
for(int j=1;j<=13;++j)
if(m[make_pair(suits[i],j)]!='X')
cout << suits[i] << ' ' << j << '\n';
return 0;
} // br1
|
#include<stdio.h>
#include<iostream>
using namespace std;
struct Y
{
char s;
int b;
int t=0;
};
int main(){
int i,j,n,ad;
Y d,f[52];
for(i=0;i<4;i++){
for(j=0;j<13;j++){
ad=i*13+j;
if(i==0)
f[ad].s='S';
else if(i==1)
f[ad].s='H';
else if(i==2)
f[ad].s='C';
else
f[ad].s='D';
f[ad].b=j+1;
}
}
scanf("%d",&n);
for(i=0;i<n;i++){
scanf( "%c" ,&d.s ) ;
scanf("%c %d",&d.s,&d.b);
for(j=0;j<52;j++){
if(d.b==f[j].b&&d.s==f[j].s){
f[j].t=1;
}
}
}
for(i=0;i<52;i++){
if(f[i].t==0){
printf("%c %d\n",f[i].s,f[i].b);
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
bool m[4][13]={};
int n;
cin>>n;
for(int i=0;i<n;++i){
int a;
char c;
cin>>c>>a;
--a;
if(c=='S') m[0][a]=1;
else if(c=='H') m[1][a]=1;
else if(c=='C') m[2][a]=1;
else m[3][a]=1;
}
for(int i=0;i<13;++i) if(!m[0][i]) cout<<"S "<<i+1<<endl;
for(int i=0;i<13;++i) if(!m[1][i]) cout<<"H "<<i+1<<endl;
for(int i=0;i<13;++i) if(!m[2][i]) cout<<"C "<<i+1<<endl;
for(int i=0;i<13;++i) if(!m[3][i]) cout<<"D "<<i+1<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,num,c[4][13]={};
string mark;
cin>>n;
for(int i=0;i<n;i++){
cin>>mark>>num;
if(mark == "S") c[0][num-1]=1;
if(mark == "H") c[1][num-1]=1;
if(mark == "C") c[2][num-1]=1;
if(mark == "D") c[3][num-1]=1;
}
string str[4]={"S","H","C","D"};
for(int i=0;i<4;i++){
for(int j=0;j<13;j++){
if(c[i][j]==1) continue;
cout<<str[i]<<" "<<j+1<<endl;
}
}
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main(){
int num,n,c,i,k;
char s[5];
int data[4][14]={0};
char mark[]="SHCD";
scanf("%d",&num);
for(i=0;i<num;i++){
scanf("%s",s);
scanf("%d",&n);
if(strcmp(s,"S")==0)c=0;
else if(strcmp(s,"H")==0)c=1;
else if(strcmp(s,"C")==0)c=2;
else c=3;
data[c][n]++;
}
for(i=0;i<4;i++){
for(k=1;k<14;k++){
if(!data[i][k])printf("%c %d\n",mark[i],k);
}
}
return 0;
}
|
#include <cstdio>
char ss[]="SHCD";
void outputcard(int c){
printf("%c %d\n",ss[c/13],c%13+1);
};
int inputcard(){
char suit[3];
int num,base;
scanf("%s %d",suit,&num);
if (suit[0]=='S') base=0;
if (suit[0]=='H') base=13;
if (suit[0]=='C') base=26;
if (suit[0]=='D') base=39;
return base+num-1;
};
int main(){
int i,n,found[52];
for(i=0;i<52;i++) found[i]=0;
scanf("%d",&n);
for(i=0;i<n;i++) found[inputcard()]=1;
for(i=0;i<52;i++)
if (found[i]==0) outputcard(i);
};
|
#include <stdio.h>
int main() {
int n, i;
int a[52] = {0};
scanf("%d", &n); getchar();
for(i = 0; i < n; i++) {
char c;
int b, num;
scanf("%c %d", &c, &num); getchar();
if(c == 'S') b = 0;
else if (c == 'H') b = 1;
else if (c == 'C') b = 2;
else b = 3;
a[b * 13 + num-1] = 1;
}
for(i = 0; i < 52; i++) {
if(!a[i]) {
if(i / 13 == 0) {
printf("S ");
} else if(i / 13 == 1) {
printf("H ");
} else if(i / 13 == 2) {
printf("C ");
} else {
printf("D ");
}
printf("%d\n", i % 13 + 1);
}
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int x,i,j,num;
char a,mark[4]={'S','H','C','D'};
bool all[4][13]={};
cin>>x;
for(i=0;i<x;i++){
cin>>a>>num;
switch(a){
case'S':
all[0][num-1]=true;
break;
case'H':
all[1][num-1]=true;
break;
case'C':
all[2][num-1]=true;
break;
case'D':
all[3][num-1]=true;
break;
}
}
for(i=0;i<4;i++){
for(j=0;j<13;j++){
if(all[i][j]==false){
cout<<mark[i]<<" "<<j+1<<endl;
}
}
}
return 0;
}
|
#include<iostream>
using namespace std;
int main() {
int N, d, s[66] = { 0 };
char C;
cin >> N;
while(N--){
cin >> C >> d;
if (C == 'S')s[d] = 1;
if (C == 'H')s[d+13] = 1;
if (C == 'C')s[d+26] = 1;
if (C == 'D')s[d+39] = 1;
}
for (int i = 1; i <= 52; i++) {
if (s[i]==0) {
if (i < 14)cout << "S " << i << endl;
else if (i < 27)cout << "H " << i-13 << endl;
else if (i < 40)cout << "C " << i-26 << endl;
else cout << "D " << i-39 << endl;
}
} return 0;
}
|
#include<stdio.h>
int n;
int data[4][14];//S,H,C,D
char str[10]="SHCD";
void proc(){
for(int i=0;i<4;i++){
char c=str[i];
for(int j=1;j<=13;j++){
if(!data[i][j])
printf("%c %d\n",c,j);
}
}
}
void inp(){
scanf("%d",&n);
for(int i=0;i<n;i++){
char tmp[10];int x;
scanf("%s%d",tmp,&x);
for(int j=0;j<4;j++){
if(str[j]==tmp[0]){
data[j][x]=1;
break;
}
}
}
}
int main(){
inp();
proc();
return 0;
}
|
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n;
map<string,int> cards;
string suit[] = {"S","H","C","D"};
cin >> n;cin.ignore();
for(int i=0;i<n;i++) {
string str;
getline(cin,str);
cards[str] = 1;
}
for(int i=0;i<4;i++)
{
for(int j=0;j<13;j++)
{
string str = suit[i] + " " + to_string(j+1);
if(cards[str] == 0)
cout << str << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
char c[n];
int a[n];
for(int i=0;i<n;i++)
cin >> c[i] >> a[i];
char x[52];
int y[52];
for(int i=0;i<13;i++)
{
x[i]='S';y[i]=i+1;
x[i+13*1]='H';y[i+13*1]=i+1;
x[i+13*2]='C';y[i+13*2]=i+1;
x[i+13*3]='D';y[i+13*3]=i+1;
}
for(int i=0;i<52;i++)
{
int k=0;
for(int j=0;j<n;j++)
{
if(x[i]==c[j]&&y[i]==a[j])
k++;
}
if(k==0) cout << x[i] << " " << y[i] << endl;
}
return 0;
}
|
#include<iostream>
#include<utility>
#include<vector>
#include<set>
using namespace std ;
int main(){
int n ; cin >> n ;
set<pair<char,int>> card ;
for(int i=0;i<n;i++){
pair<char,int> sub ;
cin >> sub.first >> sub.second ;
card.insert(sub) ;
}
vector<char> mark = {'S','H','C','D'} ;
for(int i=0;i<4;i++){
for(int j=0;j<13;j++){
pair<char,int> sub = make_pair(mark.at(i),j+1) ;
if(!card.count(sub)) cout << mark.at(i) << " " << j+1 << endl ;
}
}
}
|
#include<iostream>
using namespace std;
int main()
{
const char sort_list[5] = "SHCD";
int n;
char sort;
int num;
bool card[4][13] = { false };
cin >> n;
for (int i = 0; i < n; i++) {
cin >> sort >> num;
for (int i = 0; i < 4; i++)
if (sort == sort_list[i]) card[i][num-1] = true;
}
for (int i = 0; i < 4; i++)
for (int j = 0; j < 13; j++)
if (!card[i][j]) cout << sort_list[i] << " " << j+1 << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int card[4][13]={};
for(int i=0;i<n;i++){
string suit;
int num;
cin>>suit>>num;
if(suit == "S") card[0][num-1] =1;
if(suit == "H") card[1][num-1] =1;
if(suit == "C") card[2][num-1] =1;
if(suit == "D") card[3][num-1] =1;
}
string str[4] = {"S","H","C","D"};
for(int i=0;i<4;i++){
for(int j=0;j<13;j++){
if(card[i][j] == 1) continue;
cout<<str[i]<<" "<<j+1<<endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
bool A[4][14];
for(int i=0;i<4;i++)
for(int j=1;j<14;j++)A[i][j]=false;
while(N--){
char c;
int n;
cin>>c>>n;
if(c=='S')A[0][n]=true;
else if(c=='H')A[1][n]=true;
else if(c=='C')A[2][n]=true;
else A[3][n]=true;
}
string S="SHCD";
for(int i=0;i<4;i++)
for(int j=1;j<=13;j++)
if(!A[i][j])cout<<S[i]<<' '<<j<<'\n';
}
|
#include <iostream>
using namespace std;
int main(){
int n;
char suits[4]={'S','H','C','D'};
char suit;
int num;
int cards[4][13]={{}};
cin >> n;
for(int i=0; i<n; i++){
cin >> suit >> num;
if(suit=='S') cards[0][num-1]=1;
else if(suit=='H') cards[1][num-1]=1;
else if(suit=='C') cards[2][num-1]=1;
else if(suit=='D') cards[3][num-1]=1;
}
for(int i=0; i<4; i++){
for(int j=0; j<13; j++){
if(cards[i][j]==0){
cout << suits[i] << " " << j+1 << endl;
}
}
}
}
|
#include <set>
#include <iostream>
#include <utility>
#include <vector>
int main() {
std::set< std::pair<char, int > > st;
int n;
std::cin >> n;
for (int i = 0; i < n; ++i) {
char c;
int a;
std::cin >> c >> a;
st.insert(std::make_pair(c, a));
}
std::vector< char > cs({'S', 'H', 'C', 'D'});
for (const auto &c: cs) {
for (int i = 1; i <= 13; ++i) {
if (st.count(std::make_pair(c, i)) == 0) {
std::cout << c << " " << i << std::endl;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int card[4][13] = {};
for(int i=0;i<n;i++){
string suit;
int num;
cin>>suit>>num;
if(suit == "S") card[0][num-1] = 1;
if(suit == "H") card[1][num-1] = 1;
if(suit == "C") card[2][num-1] = 1;
if(suit == "D") card[3][num-1] = 1;
}
string str[4] = {"S", "H", "C", "D"};
for(int i=0;i<4;i++){
for(int j=0;j<13;j++){
if(card[i][j] == 1) continue;
cout<<str[i]<<" "<<j+1<<endl;
}
}
}
|
#include<iostream>
using namespace std;
int main()
{
const int TYPENUM = 4;
const int RANKNUM = 13;
bool card[TYPENUM][RANKNUM] = { false };
char type[] = { "SHCD" };
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
char c;
int r;
int idx;
cin >> c >> r;
if (c == 'S')
idx = 0;
else if (c == 'H')
idx = 1;
else if (c == 'C')
idx = 2;
else if (c == 'D')
idx = 3;
card[idx][r-1] = true;
}
for (int i = 0; i < 4; i++)
for (int j = 0; j <13; j++)
if (card[i][j] == false)
cout << type[i] << " " << j+1 << endl;
}
|
#include <iostream>
using namespace std;
int cards[4*13];
int main(void){
int suitID[127];
int n;
suitID['S']=0; suitID['H']=1;
suitID['C']=2; suitID['D']=3;
cin >> n;
for (int i=0; i<n; i++){
char s;
int r;
cin >> s >> r;
cards[suitID[s]*13+r-1]=1;
}
for (int i=0; i<52; i++){
int s,r;
if (cards[i]) continue;
s = i/13; r = i%13+1;
cout << "SHCD"[s] << " " << r << endl;
}
return 0;
}
|
#include <cstdio>
int main(){
int n,m;
char suit,suits[4]={'S','H','C','D'};
int cards[4][13] = {0};
scanf("%d\n",&n);
// printf("n:%d\n",n);
for(int i = 0;i<n;i++){
scanf("%c %d\n",&suit,&m);
// printf("read:%c %d\n",suit,m);
for(int j = 0; j< 4; j++){
if(suit == suits[j])cards[j][m-1] = 1;
}
}
for(int i = 0;i<4;i++){
for(int j = 0;j<13;j++){
if(!cards[i][j])printf("%c %d\n",suits[i],j+1);
}
}
return 0;
}
|
#include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
#include <set>
using namespace std;
int n;
bool c[5][20];
char suit[4]={'S','H','C','D'};
int main(){
cin>>n;
for(int i=0;i<n;i++){
char s;cin>>s;
int num;cin>>num;
for(int j=0;j<4;j++){
for(int k=1;k<=13;k++){
if(s==suit[j]&&k==num)c[j][k]=true;
}
}
}
for(int i=0;i<4;i++){
for(int j=1;j<=13;j++){
if(!c[i][j])cout<<suit[i]<<" "<<j<<endl;
}
}
return 0;
}
|
#include<cstdio>
#include<functional>
#include<algorithm>
using namespace std;
int main(void)
{
int i,a[52],suu,n,e,j;
char b[5]="SHCD",c;
for(i=0;i<52;i++) a[i]=0;
scanf("%d",&n);
for(i=0;i<n;i++) {
scanf(" %c %d",&c,&suu);
for(j=0;j<4;j++) if(b[j]==c) e=j;
a[e*13+suu-1]=1;
}
for(i=0;i<52;i++) {
if(a[i]==0) {
e=i/13;
suu=i%13;
printf("%c %d\n",b[e],suu+1);
}
}
return 0;
}
|
#include<iostream>
using namespace std;
static char MARK[4]={'S','H','C','D'};
int n,num;
char mark;
bool existCard[4][14]={false};
int main(){
cin>>n;
for(int i=0;i<n;++i){
cin>>mark>>num;
for(int j=0;j<4;++j){
if(mark==MARK[j]){
existCard[j][num]=true;
}
}
}
for(int i=0;i<4;++i){
for(int j=1;j<=13;++j){
if(existCard[i][j]==false)
cout<<MARK[i]<<" "<<j<<endl;
}
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int a=0;cin>>a;
int c[4][14]={0};
for(int i=0;i<a;i++){
char z;
cin>>z;
int n;
cin>>n;
if(z=='S')
c[0][n]=1;
else if(z=='H')
c[1][n]=1;
else if(z=='C')
c[2][n]=1;
else if(z=='D')
c[3][n]=1;
}
for(int i=0;i<4;i++){
for(int j=1;j<14;j++){
if(c[i][j]==0){
char z;
if(i==0)
z='S';
else if(i==1)
z='H';
else if(i==2)
z='C';
else if(i==3)
z='D';
cout<<z<<' '<<j<<'\n';
}
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n,a[4][13]={},b;
string c;
cin>>n;
for(int i=0;i<n;i++){
cin>>c>>b;
if(c=="S") a[0][b-1]=true;
else if(c=="H") a[1][b-1]=true;
else if(c=="C") a[2][b-1]=true;
else if(c=="D") a[3][b-1]=true;
}
for(int i=0;i<4;i++){
for(int j=0;j<13;j++){
if(a[i][j]==false){
if(i==0) cout<<'S'<<" "<<j+1<<endl;
else if(i==1) cout<<'H'<<" "<<j+1<<endl;
else if(i==2) cout<<'C'<<" "<<j+1<<endl;
else if(i==3) cout<<'D'<<" "<<j+1<<endl;
}
}
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int k[4][24]={0},a,b;
string s;
cin>>a;
for(int i=0;i<a;i++){
cin>>s>>b;
if(s=="S")k[0][b]=1;
else if(s=="H")k[1][b]=1;
else if(s=="C")k[2][b]=1;
else if(s=="D")k[3][b]=1;
}
for(int i=0;i<4;i++){
for(int j=1;j<=13;j++){
if(k[i][j]==0){
if(i==0)cout<<"S "<<j<<endl;
if(i==1)cout<<"H "<<j<<endl;
if(i==2)cout<<"C "<<j<<endl;
if(i==3)cout<<"D "<<j<<endl;
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int card[4][13]={};
cin>>n;
for(int i=0;i<n;i++){
string suit;
int num;
cin>>suit>>num;
if(suit == "S")card[0][num-1]=1;
if(suit == "H")card[1][num-1]=1;
if(suit == "C")card[2][num-1]=1;
if(suit == "D")card[3][num-1]=1;
}
string str[4]={"S","H","C","D"};
for(int i=0;i<4;i++){
for(int j=0;j<13;j++){
if(card[i][j]==1)continue;
cout<<str[i]<<" "<<j+1<<endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n, num, card[4][13] = {0};
char c;
cin>>n;
for(int i=0;i<n;i++){
cin>>c>>num;
if(c == 'S') card[0][num-1]++;
else if(c == 'H') card[1][num-1]++;
else if(c == 'C') card[2][num-1]++;
else if(c == 'D') card[3][num-1]++;
}
for(int i=0;i<4;i++){
if(i == 0) c = 'S';
else if(i == 1) c = 'H';
else if(i == 2) c = 'C';
else if(i == 3) c = 'D';
for(int j=0;j<13;j++){
if(card[i][j] == 0){
cout<<c<<" "<<j+1<<endl;
}
}
}
return 0;
}
|
#include<cstdio>
#include<iostream>
using namespace std;
int main(void){
int card[1000][20]={0};
int n,l;
char m;
cin>>n;
for(int i=0;i<n;i++){
cin>>m>>l;
card[(int)m][l]=1;
}
for(int i=1;i<=13;i++){
if(card[(int)'S'][i]==0) cout<<"S "<<i<<endl;
}
for(int i=1;i<=13;i++){
if(card[(int)'H'][i]==0) cout<<"H "<<i<<endl;
}
for(int i=1;i<=13;i++){
if(card[(int)'C'][i]==0) cout<<"C "<<i<<endl;
}
for(int i=1;i<=13;i++){
if(card[(int)'D'][i]==0) cout<<"D "<<i<<endl;
}
return 0;
}
|
#include <iostream>
#include <map>
using namespace std;
int main() {
int n;
const char mark[4] = {'S', 'H', 'C', 'D'};
map<pair<char,int>, int> playingCard;
cin >> n;
for(int i = 0; i < n; i++) {
char c;
int x;
cin >> c >> x;
playingCard[make_pair(c,x)]++;
}
for(int i = 0; i < 4; i++) {
for(int j = 1; j <= 13; j++) {
if(playingCard[make_pair(mark[i], j)] == 0) cout << mark[i] << ' ' << j << endl;
}
}
return 0;
}
|
#include <cstdio>
int n;
int card[52];
char c;
int a;
int main(){
scanf("%d", &n);
for(int i=0; i<n; ++i){
scanf(" %c%d", &c, &a);
if(c=='S'){
card[a-1]=1;
}else if(c=='H'){
card[a-1+13]=1;
}else if(c=='C'){
card[a-1+26]=1;
}else if(c=='D'){
card[a-1+39]=1;
}
}
for(int i=0; i<52; ++i){
if(card[i]==0){
if(i<13){
printf("S ");
}else if(i<26){
printf("H ");
}else if(i<39){
printf("C ");
}else if(i<52){
printf("D ");
}
printf("%d\n", i%13+1);
}
}
}
|
#include <iostream>
using namespace std;
enum Suit {
S, H, C, D
};
int main() {
int n, m, o, cards[4] = {};
char c;
cin >> n;
while (n --> 0) {
cin >> c >> m;
switch (c) {
case 'S': cards[S] |= 1 << m; break;
case 'H': cards[H] |= 1 << m; break;
case 'C': cards[C] |= 1 << m; break;
case 'D': cards[D] |= 1 << m; break;
}
}
for (n = 0; n < 4; n++) {
for (m = 1; m <= 13; m++) {
if (!(cards[n] & (1 << m))) {
cout << "SHCD"[n] << ' ' << m << endl;
}
}
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
char c;
int k;
int a[53]={0};
cin>>a[0];
for(int i=1;i<=a[0];i++){
cin>>c>>k;
if(c=='S')a[k]=1;
if(c=='H')a[13+k]=1;
if(c=='C')a[26+k]=1;
if(c=='D')a[39+k]=1;
}
for(int i=1;i<53;i++){
if(a[i]==0){
if(i<14)cout<<"S "<<i<<endl;
if(13<i&&i<27)cout<<"H "<<i-13<<endl;
if(26<i&&i<40)cout<<"C "<<i-26<<endl;
if(39<i)cout<<"D "<<i-39<<endl;
}
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.