text
stringlengths 49
983k
|
|---|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#include <cmath>
using namespace std;
typedef long long i64;
typedef long double ld;
typedef pair<i64,i64> P;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
int n;
vector<int> a(1010);
int main(){
cin >> n;
for(int i = 0;i < n;i++){
cin >> a[i];
}
rep(i,0,n - 1) rep(j,0,n - 1){
if(i == j) continue;
if(abs(a[i] - a[j]) % (n - 1) == 0){
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
signed main(){
int N;cin >> N;
vector<int> vec;
for(int i = 0;i < N;i++){
int b;cin >> b;
vec.push_back(b);
}
for(int i = 0;i < N-1;i++){
for(int j = i + 1;j < N;j++){
if(abs(vec.at(i) - vec.at(j)) % (N-1) == 0){
cout<<vec.at(i)<<" "<<vec.at(j)<<endl;
return 0;
}
}
}
}
|
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }
int N;
int a[2100];
void solve() {
for (int i = 0; i < N; ++i) {
for (int j = i+1; j < N; ++j) {
if (abs(a[i] - a[j]) % (N-1) == 0) {
cout << a[i] << " " << a[j] << endl;
return;
}
}
}
}
int main() {
while (cin >> N) {
for (int i = 0; i < N; ++i) cin >> a[i];
solve();
}
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define enld '\n'
#define rep(i,n) for(int i=0; i<(n); i++)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
constexpr ll mod = 1000000007;
constexpr ll mod2 = 998244353;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[6] = {1, 0, -1, 0,1,1};
const int dy[6] = {0, 1, 0, -1,1,-1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
// ---------------------------------------------------------------------------
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<int> A(N);
rep(i,N) cin >> A[i];
for(int i=0; i<N; i++){
for(int j=i+1; j<N; j++){
if(abs(A[i]-A[j])%(N-1) == 0){
cout << A[i] << " " << A[j] << "\n";
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
/*{{{*/ //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14;
constexpr double eps = 1e-10;
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/
int main(){
int N;
cin >> N;
vi a(N);
rep(i,N) cin >> a[i];
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
int d = abs(a[i] - a[j]);
if(d%(N-1) == 0){
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &i : a) cin >> i;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (abs(a[i] - a[j]) % (n - 1) == 0) {
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <limits>
#include <fstream>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin>>N;
int a[N];
FOR(i,0,N)cin>>a[i];
FOR(i,0,N){
FOR(j,i+1,N){
if(abs(a[i]-a[j])%(N-1)==0){
cout<<a[i]<<" "<<a[j]<<endl;
return 0;
}
}
}
}
|
// header {{{
#include <bits/stdc++.h>
using namespace std;
// {U}{INT,LONG,LLONG}_{MAX,MIN}
#define INF INT_MAX/3
#define LLINF LLONG_MAX/3
#define MOD (1000000007LL)
#define MODA(a, b) a=((a)+(b))%MOD
#define MODP(a, b) a=((a)*(b))%MOD
#define inc(i, l, r) for(int i=(l);i<(r);i++)
#define dec(i, l, r) for(int i=(r)-1;i>=(l);i--)
#define pb push_back
#define se second
#define fi first
#define mset(a, b) memset(a, b, sizeof(a))
using LL = long long;
using G = vector<vector<int>>;
int di[] = {0, -1, 0, 1};
int dj[] = {1, 0, -1, 0};
// }}}
int main() {
cin.tie(0);ios::sync_with_stdio(false);
int n;cin >> n;
vector<int> a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i == j) continue;
int d = abs(a[i]-a[j]);
if(d%(n-1) == 0){
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int N;
vector<int> v;
int main(){
cin >> N;
for(int i=0; i<N; ++i){
int a; cin >> a;
v.push_back(a);
}
bool flag = true;
for(int i=0; i<N; ++i){
for(int j=0; j<N; ++j){
if(!flag) break;
if((abs(v[i]-v[j]))%(N-1)==0&&i!=j){
cout << v[i] << " " << v[j] << endl;
flag = false;
}
}
}
return 0;
}
|
#include<cstdio>
#include<functional>
#include<algorithm>
using namespace std;
int main(void)
{
int n,i,j,x,a[1000],x1,y1;
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
for(i=0;i<n-1;i++) {
for(j=i+1;j<n;j++) {
x=a[i]-a[j];
if(x<0) x=-x;
if(x%(n-1)==0) {
x1=a[i]; y1=a[j];
j=n; i=n-1;
}
}
}
printf("%d %d\n",x1,y1);
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int n;
int a[1000];
int main() {
int i, j;
cin >> n;
for (i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
if ((a[j] - a[i]) % (n - 1) == 0) {
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <typename T> constexpr T inf;
template <> constexpr int inf<int> = 1e9;
template <> constexpr ll inf<ll> = 1e18;
template <> constexpr double inf<double> = 1e18;
int main() {
int N;
cin >> N;
vector<int> a(N);
for(int i = 0; i < N; ++i) {
cin >> a[i];
}
for(int i = 0; i < N; ++i) {
for(int j = i + 1; j < N; ++j) {
if(abs(a[i] - a[j]) % (N - 1) == 0) {
cout << a[i] << ' ' << a[j] << endl;
return 0;
}
}
}
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#define LP(i,n) for(int i=0;i<n;i++)
#define Mset(x,v) memset(x,v,sizeof(x))
#define INF INT_MAX
using namespace std;
using LL=long long;
int I[1005];
int main(){
int n;
cin>>n;
LP(i,n) cin>>I[i];
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
if(abs(I[i]-I[j])%(n-1)==0){
cout<<I[i]<<" "<<I[j]<<endl;
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[1005];
cin >> n;
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(abs(a[i]-a[j])%(n-1)==0){
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
// macro
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
// code starts
int main()
{
int n;cin>>n;
vector<int> a(n);
int i,j;
rep(i,n)cin>>a[i];
bool fin=false;
rep(i,n)
{
rep(j,n)
{
if(i==j)continue;
if(abs(a[i]-a[j])%(n-1)==0)
{
cout<<a[i]<<' '<<a[j]<<endl;
fin=true;
break;
}
}
if(fin)break;
}
}
|
#include "bits/stdc++.h"
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++)cin>>a[i];
sort(a.begin(),a.end());
int ans=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i!=j){
if(abs(a[i]-a[j])%(n-1)==0){
cout<<a[i]<<" "<<a[j]<<endl;
return 0;
}
}
}
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cassert>
#include <exception>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<P> vp;
#define rep(i,a,n) for(ll i = (a);i < (n);i++)
#define per(i,a,n) for(ll i = (a);i > (n);i--)
#define lep(i,a,n) for(ll i = (a);i <= (n);i++)
#define pel(i,a,n) for(ll i = (a);i >= (n);i--)
#define clr(a,b) memset((a),(b),sizeof(a))
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define sz size()
#define print(X) cout << (X) << endl
const ll INF = 1e+9+7;
ll n,m,l;
string s,t;
ll d[200010],dp[550][550];
int main(){
cin >> n;
vi vec;
rep(i,0,n){
cin >> m;
vec.pb(m);
}
sort(all(vec));
rep(i,0,vec.sz){
rep(j,i+1,vec.sz){
if(abs(vec[i]-vec[j]) % (n-1) == 0){
cout << vec[i] << " " << vec[j] << endl;
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k[1005];
cin>>n;
for(int i=0;i<n;++i){cin>>k[i];}
for(int i=0;i<n;++i){
for(int j=i+1;j<n;++j){
if(abs(k[i]-k[j])%(n-1)==0){
cout<<k[i]<<" "<<k[j]<<endl;
return 0;
}
}
}
}
|
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
vector<int> a(N); rep(i, 0, N) {
cin >> a[i];
}
sort(all(a));
rep(i, 0, N) {
rep(j, i + 1, N) {
if ((a[j] - a[i]) % (N - 1) == 0) {
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define REP(i, n) for(int i = 0; i < n; i++)
int main(){
int n, a[1000];
cin >> n;
REP(i, n){
cin >> a[i];
}
for(int i = 0; i < n - 1; i++){
for(int j = i + 1; j < n; j++){
if((max(a[i], a[j]) - min(a[i], a[j])) % (n - 1) == 0){
cout << max(a[i], a[j]) << ' ' << min(a[i], a[j]) << endl;
return 0;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<ll,ll> pint;
pint a[1001];
int main(){
int n,ai;
cin>>n;
rep(i,n){
cin>>ai;
a[i]={ai%(n-1),ai};
}
sort(a,a+n);
FOR(i,1,n){
if(a[i].first==a[i-1].first){
cout<<a[i].second<<" "<<a[i-1].second<<endl;
return 0;
}
}
return 0;
}
|
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <limits>
#include <sstream>
using namespace std;
int main (void)
{
long n,a[10000];
cin >> n;
for (long i = 0; i < n; i++)
{
cin >> a[i];
}
int p = 0;
sort(a,a + n);
for (long i = 0; i < n; i++)
{
for (long j = 0; j < n; j++)
{
if (i < j && (a[j] - a[i]) % (n - 1) == 0)
{
cout << a[i] << " " << a[j] << endl;
p += 1;
break;
}
}
if (p != 0)
{
break;
}
}
}
|
#include <stdio.h>
int main(void) {
int n, i, j, x = 0, y;
scanf("%d", &n);
int a[n];
for(i = 0; i < n; ++i) scanf("%d", &a[i]);
for(i = 0; i < n; ++i) {
for(j = i + 1; j < n; ++j) if(!((a[i] - a[j]) % (n - 1))) {
x = a[i], y = a[j];
break;
}
if(x) break;
}
printf("%d %d\n", x, y);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
int main() {
ll n; cin >> n;
vector<ll> a(n);
REP(i, n) cin >> a[i];
vector<ll> dp(n-1, -1);
for (ll ai : a) {
if (dp[ai % (n-1)] == -1) {
dp[ai % (n-1)] = ai;
} else {
cout << ai << " ";
cout << dp[ai % (n-1)] << endl;
return 0;
}
}
}
|
#include <iostream>
#include <vector>
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int &x : a) cin >> x;
rep(i, n - 1) loop(j, i + 1, n) {
if ((a[i] - a[j]) % (n - 1)) continue;
cout << a[i] << ' ' << a[j] << endl;
return 0;
}
}
|
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template<class T>bool chmax(T &a, const T &b) { return (a < b) ? (a = b, 1) : 0;}
template<class T>bool chmin(T &a, const T &b) { return (b < a) ? (a = b, 1) : 0;}
using ll = long long;
using R = long double;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r) {return (r > EPS) - (r < -EPS);}
inline R sq(R x) {return sqrt(max(x, 0.0L));}
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
// Problem Specific Parameter:
int main(void) {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(j, n)rep(i, j) {
const int val = abs(a[i] - a[j]);
if (val % (n - 1) == 0) {
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
return 0;
}
|
#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<bitset>
#include<random>
#include<time.h>
#define INF 1000000000ll
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<(ll)m; i++)
#define FOR(i,n,m) for(long long i=n; i<(ll)m; i++)
#define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=(ll)a.size()-1) cout<<" "; else cout<<endl; }
#define ALL(v) v.begin(),v.end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin>>n;
vector<ll> a(n);
REP(i,n) cin>>a[i];
REP(i,n) {
REP(j,n) {
if(i==j) continue;
if(abs(a[i]-a[j])%(n-1)==0) {
cout<<a[i]<<" "<<a[j]<<endl;
return 0;
}
}
}
}
|
#include <vector>
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
for(int i = 0; i < N; ++i) cin >> A[i];
for(int i = 0; i < N; ++i){
for(int j = 0; j < i; ++j){
if(abs(A[i]-A[j])%(N-1)) continue;
cout << A[j] << " " << A[i] << endl;
return 0;
}
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N;
vector<int> vec_a;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
vec_a.push_back(a);
}
sort(vec_a.begin(), vec_a.end());
bool isPigeon = false;
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
int diff = vec_a.at(j) - vec_a.at(i);
if (!((vec_a.at(j) - vec_a.at(i)) % (N - 1))) {
cout << vec_a.at(i) << " " << vec_a.at(j) << endl;
isPigeon = true;
break;
}
}
if (isPigeon) {
break;
}
}
}
|
#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define PB push_back
const ll LLINF = (1LL<<60);
const int INF = (1LL<<30);
const int MOD = 1000000007;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
out<<'('<<a.first<<','<<a.second<<')';
return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
out<<'[';
REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}
out<<']';
return out;
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
VI a(n);
REP(i, n) cin >> a[i];
REP(i, n) FOR(j, i+1, n) {
if(abs(a[i]-a[j])%(n-1) == 0) {
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;
int gcd(int a, int b){
if(b==0) return a;
return gcd(b,a%b);
}
int lcm(int a, int b){
return a*b/gcd(a,b);
}
signed main(void) {
int n;
cin >> n;
vi a(n);
rep(i,n) cin >> a[i];
rep(i,n)rep(j,i){
int t = abs(a[i]-a[j]);
if(t%(n-1)==0){
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
const int INF = 1<<30;
const int MOD = 1e9 + 7;
const int dy[] = {1, 0, -1, 0};
const int dx[] = {0, 1, 0, -1};
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<int> v(n);
for(int i = 0; i < n; i++) cin >> v[i];
for(int i = 0; i < n; i++)
{
for(int j = i + 1; j < n; j++)
{
if(abs(v[i] - v[j]) % (n - 1) == 0)
{
cout << v[i] << " " << v[j] << endl;
return 0;
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using int64 = long long;
const int INF = 1 << 30;
int main() {
// な
// な た
// めて
// よこまるた
// るる
// た た
int N, A[1000];
cin >> N;
for(int i = 0; i < N; i++) {
cin >> A[i];
}
for(int i = 0; i < N; i++) {
for(int j = i + 1; j < N; j++) {
if(abs(A[i] - A[j]) % (N - 1) == 0) {
cout << A[i] << " " << A[j] << endl;
return (0);
}
}
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){
if(abs(a[i] -a[j]) % (n-1) == 0){
cout << a[i] << " " << a[j] << endl;
i = n;
break;
}
}
}
return 0;
}
|
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#include<stack>
#include<queue>
#include<list>
#include<bitset>
#include<functional>
#define FOR(i, a, b) for(long long int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(long long int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000000 //2000000000
#define LLINF 1000000000000000000 //9000000000000000000
#define PI 3.14159265358979
using namespace std;
typedef long long int ll;
typedef pair< long long int, long long int> P;
int main(void) {
int n;
int a[1001];
bool flag = false;
cin >> n;
FOR(i, 1, n) {
cin >> a[i];
}
FOR(i, 1, n) {
FOR(t, i + 1, n) {
if (abs(a[i] - a[t]) % (n - 1) == 0) {
cout << a[i] << " " << a[t] << endl;
flag = true;
}
if (flag) {
break;
}
}
if (flag) {
break;
}
}
return 0;
}
|
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
#include <set>
#include <map>
#include <time.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int N;
scanf("%d",&N);
int table[N];
for(int i = 0; i < N; i++)scanf("%d",&table[i]);
for(int i = 0; i < N-1; i++){
for(int k = i+1; k < N; k++){
if(abs(table[i]-table[k])%(N-1) == 0){
printf("%d %d\n",table[i],table[k]);
return 0;
}
}
}
return 0;
}
|
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, i, j;
cin >> N;
vector<int> a(N);
for (int& k : a) cin >> k;
for (i = 0; i < N - 1; ++i) {
for (j = 1 + i; j < N; ++j) {
if (0 == abs(a[i] - a[j]) % (N - 1)) break;
}
if (N != j) break;
}
cout << a[i] << ' ' << a[j] << endl;
}
|
#include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i ++) cin >> a[i];
for (int i = 0; i < n; i ++) {
for (int j = 0; j < n; j ++) {
if (i == j) continue;
if (abs(a[i] - a[j])%(n-1) == 0) {
cout << a[i] << " " << a[j] << endl;
return 0;
}
}
}
}
|
#include<iostream>
using namespace std;
int abs( int a )
{
return a > 0 ? a : -a;
}
int main()
{
int n;
cin >> n;
int a[n];
for( int i = 0; i < n; i++ )
cin >> a[i];
for( int i = 0; i < n - 1; i++ )
for( int j = i + 1; j < n; j++ )
if( abs( a[i] - a[j] ) % ( n - 1 ) == 0 )
{
cout << a[i] << " " << a[j] << endl;
return 0;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
vector<int> G[1000000];
vector<pair<int, int> > bridge;
vector<int> articulation;
int ord[1000000], low[1000000];
bool vis[1000000];
int W[111111];
int al=0;
int sum[111111];
int ans[111111];
void dfs(int v, int p, int &k)
{
vis[v] = true;
sum[v]=W[v];
ord[v] = k++;
low[v] = ord[v];
bool isArticulation = false;
int ct = 0;
vint g;
for (int i = 0; i < G[v].size(); i++){
if (!vis[G[v][i]]){
ct++;
g.pb(G[v][i]);
dfs(G[v][i], v, k);
sum[v]+=sum[G[v][i]];
low[v] = min(low[v], low[G[v][i]]);
if (~p && ord[v] <= low[G[v][i]]) isArticulation = true;
}
else if (G[v][i] != p){
low[v] = min(low[v], ord[G[v][i]]);
}
}
if (p == -1 && ct > 1) isArticulation = true;
if(isArticulation){
int s=0;
for(auto u:g){
if(low[u]>=ord[v])chmax(ans[v],sum[u]);
else s+=sum[u];
}
chmax(ans[v],al-sum[v]+s);
}
else{
ans[v]=al-W[v];
}
}
signed main(){
int N,M;scanf("%lld%lld",&N,&M);
rep(i,N)scanf("%lld",&W[i]);
rep(i,M){
int a,b;
scanf("%lld%lld",&a,&b);
a--;b--;
G[a].pb(b);G[b].pb(a);
}
al=accumulate(W,W+N,0ll);
int k=0;
dfs(0,-1,k);
rep(i,N)printf("%lld\n",ans[i]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int64;
int N, M, W[100000];
vector< int > g[100000];
bool v[100000];
int order[100000], low[100000], ptr;
int64 sum[100000], ans[100000];
vector< int > tree[100000];
void dfs(int idx, int par)
{
v[idx] = true;
order[idx] = ptr++;
low[idx] = order[idx];
sum[idx] = W[idx];
for(auto &to : g[idx]) {
if(!v[to]) {
dfs(to, idx);
low[idx] = min(low[idx], low[to]);
sum[idx] += sum[to];
tree[idx].emplace_back(to);
} else if(to != par) {
low[idx] = min(low[idx], order[to]);
}
}
}
void dfs2(int idx, int64 parcost)
{
bool art = false;
int64 all = parcost;
if(idx == 0) {
if(tree[idx].size() > 1) art = true;
else art = false;
} else {
for(auto &to : tree[idx]) art |= order[idx] <= low[to];
}
for(auto &to : tree[idx]) all += sum[to];
if(art) {
int64 latte = parcost, malta = 0;
for(auto &to : tree[idx]) {
if(order[idx] <= low[to]) malta = max(malta, sum[to]);
else latte += sum[to];
}
ans[idx] = max(latte, malta);
} else {
ans[idx] = sum[0] - W[idx];
}
for(auto &to : tree[idx]) dfs2(to, all + W[idx] - sum[to]);
}
int main()
{
cin >> N >> M;
for(int i = 0; i < N; i++) {
cin >> W[i];
}
for(int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
--a, --b;
g[a].emplace_back(b);
g[b].emplace_back(a);
}
dfs(0, -1);
dfs2(0, 0);
for(int i = 0; i < N; i++) {
cout << ans[i] << endl;
}
}
|
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 100005
vector<int> G[SIZE],children[SIZE];
int N;
bool visited[SIZE],is_art_point[SIZE];
int visited_order[SIZE],parent[SIZE],lowest[SIZE],number;
ll sum_W;
ll W[SIZE],dp[SIZE];
void dfs(int current_node,int pre_node){
visited_order[current_node] = lowest[current_node] = number; //訪問順を記録
number++;
visited[current_node] = true;
dp[current_node] = W[current_node];
int next;
for(int i = 0; i < G[current_node].size(); i++){
next = G[current_node][i];
if(!visited[next]){
parent[next] = current_node;
children[current_node].push_back(next);
dfs(next,current_node);
dp[current_node] += dp[next];
lowest[current_node] = min(lowest[current_node],lowest[next]); //ボトムアップ的に、lowestが求まる
}else if(visited[next] == true && next != pre_node){ //dfsTreeを遡る場合
lowest[current_node] = min(lowest[current_node],visited_order[next]);
}
}
}
void func(){
for(int i = 0; i < N; i++){
visited[i] = false;
is_art_point[i] = false;
dp[i] = 0;
}
number = 1;
dfs(0,-1);
int tmp_parent,root_num = 0;
vector<int> V;
for(int i = 1; i < N; i++){
tmp_parent = parent[i];
if(tmp_parent == 0){
root_num++;
}else if(visited_order[tmp_parent] <= lowest[i]){
V.push_back(tmp_parent);
}
}
if(root_num >= 2){
V.push_back(0);
}
sort(V.begin(),V.end());
V.erase(unique(V.begin(),V.end()),V.end());
for(int i = 0; i < V.size(); i++){
is_art_point[V[i]] = true;
}
for(int i = 0; i < N; i++){
if(!is_art_point[i]){
printf("%lld\n",sum_W-W[i]);
continue;
}
ll ans = 0;
int child;
if(i == 0){
for(int k = 0; k < children[i].size(); k++){
child = children[i][k];
ans = max(ans,dp[child]);
}
}else{
ll parent_sum = sum_W-dp[i];
for(int k = 0; k < children[i].size(); k++){
child = children[i][k];
ans = max(ans,dp[child]);
if(lowest[child] < visited_order[i]){ //親の成分と連結している子成分
parent_sum += dp[child];
}
}
ans = max(ans,parent_sum);
}
printf("%lld\n",ans);
}
}
int main(){
int E;
scanf("%d %d",&N,&E);
sum_W = 0;
for(int i = 0; i < N; i++){
scanf("%lld",&W[i]);
sum_W += W[i];
}
int from,to;
for(int i = 0; i < E; i++){
scanf("%d %d",&from,&to);
from--;
to--;
G[from].push_back(to);
G[to].push_back(from);
}
func();
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long i64;
typedef long double ld;
typedef pair<i64, i64> P;
#define rep(i, s, e) for (int i = (s); i <= (e); i++)
int n, m;
vector<pair<int, bool>> edges[101010];
i64 w[101010];
int ord[101010];
int low[101010];
int main() {
cin >> n >> m;
rep(i, 1, n) cin >> w[i];
rep(i, 1, m) {
int a, b;
cin >> a >> b;
edges[a].emplace_back(b, false);
edges[b].emplace_back(a, false);
}
int cou;
vector<i64> dp(n + 1,0);
function<void(int)> dfs = [&](int v){
ord[v] = cou++;
low[v] = ord[v];
dp[v] = w[v];
for(auto & to : edges[v])
{
if(ord[to.first] == 0)
{
to.second = true;
dfs(to.first);
low[v] = min(low[to.first],low[v]);
dp[v] += dp[to.first];
}
else if(!to.second)
{
low[v] = min(low[v],ord[to.first]);
}
}
};
for(int i = 1;i <= n;i++)
{
if(ord[i] == 0)
{
cou = 1;
dfs(i);
}
}
i64 sum = 0;
for(int i = 1;i <= n;i++) sum += w[i];
for(int i = 1;i <= n;i++)
{
i64 ans = 0;
if(ord[i] == 1)
{
for(auto & to : edges[i])
{
ans = max(ans,dp[to.first]);
}
}
else
{
i64 MAX = 0;
ans = sum - dp[i];
for(auto& to : edges[i])
{
if(!to.second) continue;
if(ord[i] <= low[to.first])
{
MAX = max(MAX,dp[to.first]);
}
else
{
ans += dp[to.first];
}
}
ans = max(ans,MAX);
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int const MAX_V = 100001;
int const MAX_E = 200001;
int const INF = 1<<29;
vector<int> G[MAX_V];
int ord[MAX_V], low[MAX_V];
vector<int> tree[MAX_V];
ll size[MAX_V];
ll A[MAX_V];
void dfs(int pos){
size[pos]=A[pos];
for(int i=0;i<(int)tree[pos].size();i++){
int to=tree[pos][i];
dfs(to);
size[pos]+=size[to];
}
}
int V,E;
void init();
vector<int> ans;
void rec(int pos,int prev,int& k){
low[pos]=ord[pos]=k++;
int flg=0,child=0;
for(int i=0;i<(int)G[pos].size();i++){
int to=G[pos][i];
if(to==prev)continue;
if(ord[to]==-1){
tree[pos].push_back(to);
child++;
rec(to,pos,k);
low[pos]=min(low[pos],low[to]);
if(low[to]>=ord[pos]&&prev!=-1)flg=true;
}
low[pos]=min(low[pos],ord[to]);
}
if(prev==-1&&child>=2)flg=true;
if(flg)ans.push_back(pos);
}
void init() {
ans.clear();
for(int i=0;i<V;i++){
low[i]=INF;
ord[i]=-1;
G[i].clear();
}
}
ll total=0;
int vd[MAX_V];
ll mem[MAX_V];
ll solve(int x){
if(vd[x])return mem[x];
vd[x]=1;
if(x==0){
ll res=0;
for(int i=0;i<(int)tree[x].size();i++){
int to=tree[x][i];
res=max(res, size[to]);
}
return mem[x]=res;
}
if(!binary_search(ans.begin(),ans.end(),x)){
mem[x]=total-A[x];
return mem[x];
}
ll res=0;
ll ps=total-size[x];
for(int i=0;i<(int)tree[x].size();i++){
int to=tree[x][i];
if(low[to]>=ord[x]){
res=max(res,size[to]);
}else{
ps+=size[to];
}
}
res=max(res,ps);
return mem[x]=res;
}
int main(){
scanf("%d %d",&V,&E);
init();
for(int i=0;i<V;i++){
scanf("%lld",&A[i]);
total+=A[i];
}
for(int i=0;i<E;i++){
int u, v;
scanf("%d %d",&u,&v);
u--,v--;
G[u].push_back(v);
G[v].push_back(u);
}
int k=0;
for(int i=0;i<V;i++)
if(ord[i]==-1)
rec(i,-1,k);
dfs(0);
sort(ans.begin(),ans.end());
for(int i=0;i<V;i++) {
printf("%lld\n",solve(i));
}
//for(int i=0;i<V;i++)cout<<low[i]<<' '<<ord[i]<<' '<<i<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void)
{
int n, an[100], cnt = 0;
cin >> n;
for(int i = 0; i < n; i++)
cin >> an[i];
for(int i = 0; i < n; i++) {
int mini = i;
int tmp = an[i];
for(int j = i; j < n; j++) {
if(an[j] < an[mini]) {
mini = j;
}
}
if(i != mini) {
an[i] = an[mini];
an[mini] = tmp;
cnt++;
}
}
for(int i = 0; i < n; i++)
cout << an[i] << (i == n - 1 ? "\n" : " ");
cout << cnt << endl;
return 0;
}
|
#include<stdio.h>
int main(){
int minj,i,j,a=0,count=0;
int N,A[100];
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;
}
}
if(minj!=i){
a=A[i];
A[i]=A[minj];
A[minj]=a;
count++;
}
}
for(i=0;i<N-1;i++){
printf("%d ",A[i]);
}
printf("%d\n",A[N-1]);
printf("%d\n",count);
return 0;
}
|
//???????????????
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> A(N);
for(int i=0; i<N; ++i){
cin>>A[i];
}
int kaisuu=0;
for(int i=0;i<N;++i){
int minj = i;//????°??????????????????¨?????????index
for(int j=i; j<N; ++j){
if(A[j]<A[minj]){
minj=j;
}
}
if(minj != i){
swap(A[i],A[minj]);
kaisuu++;
}
}
for(int i=0; i<N-1;++i){
cout<<A[i]<<" ";
}
cout<<A[N-1]<<endl;
cout<<kaisuu<<endl;
}
|
#include <iostream>
using namespace std;
int main(void){
int n,a[100],min,ans=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(i!=min)
ans++;
swap(a[i],a[min]);
}
for(int i=0;i<n-1;i++)
cout<<a[i]<<" ";
cout<<a[n-1]<<endl;
cout<<ans<<endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,a[100],cnt=0,j;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
int minj=i;
for(j=i;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;i++){
cout<<a[i];
i==n-1?cout<<endl:cout<<" ";
}
cout<<cnt<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int selectionSort(int A[],int N)
{
int sw=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;
}
}
swap(A[i],A[minj]);
if(i!=minj)sw++;
}
return sw;
}
int main()
{
int N;cin>>N;
int A[100];for(int i=0;i<N;i++)cin>>A[i];
int sw=selectionSort(A,N);
for (int i = 0; i < N; i++)
{
if(i)cout<<" ";
cout<<A[i];
}
cout<<endl;
cout<<sw<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
int n, a[100], i, j, count = 0, v;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a[i];
}
int min;
for (i = 0; i < n; i++)
{
min = i;
for (j = i + 1 ; j < n; j++)
{
if (a[j] < a[min])min = j;
}
if (i != min)
{
v = a[i];
a[i] = a[min];
a[min] = v;
count++;
}
}
for (i = 0; i < n; i++)
{
if (i)cout << " ";
cout << a[i];
}
cout << endl << count << endl;
return 0;
}
|
#include<stdio.h>
/*选择排序法（0起点）*/
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 <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, a[100];
cin >> 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] << (i == n - 1 ? '\n' : ' ');
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int cnt;
void selectionSort(int a[],int n){
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(min!=i){
swap(a[i],a[min]);
cnt++;
}
}
}
int main(){
int n,a[101];
cin>>n;
for(int i=0;i<n;++i) cin>>a[i];
selectionSort(a,n);
for(int i=0;i<n;++i) cout<<a[i]<<(i==n-1?"\n":" ");
cout<<cnt<<endl;
return 0;
}
|
#include<bits/stdc++.h>
const int MAXN=110;
int main()
{
int n,A[MAXN],cnt=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&A[i]);
for(int i=0;i<n;i++)
{
int mi=i;
for(int j=i+1;j<n;j++)
if(A[j]<A[mi]) mi=j;
if(mi!=i)
{
std::swap(A[mi],A[i]);
cnt++;
}
}
for(int i=0;i<n;i++)
printf("%d%c",A[i],i+1==n?'\n':' ');
printf("%d\n",cnt);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,count=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;j<n;j++){
if(a[minj]>a[j])minj=j;
}
swap(a[i],a[minj]);
if(i!=minj)count++;
}
for(int i=0;i<n;i++){
cout <<a[i];
if(i!=n-1)cout<<' ';
}
cout<<endl<<count<<endl;
return 0;
}
|
#include<stdio.h>
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(void)
{
int i, N, A[100], 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<bits/stdc++.h>
using namespace std;
int main(){
int n,mn,ans=0;
int num[100];
cin>>n;
for(int i=0;i<n;i++){
cin>>num[i];
}
for(int i=0;i<n;i++){
mn=i;
for(int j=i;j<n;j++){
if(num[j]<num[mn]) mn=j;
}
swap(num[i],num[mn]);
if(mn!=i) ans++;
}
for(int i=0;i<n;i++){
if(i!=n-1) cout<<num[i]<<" ";
else cout<<num[i];
}
cout<<endl;
cout<<ans<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
int i,j,a[200]={0},n,count=0;
cin>>n;
for(i=0;i<n;i++) cin>>a[i];
for(i=0;i<n;i++)
{
int min=i;
for(j=i;j<n;j++)
{
if(a[j]<a[min])
min=j;
}
if(min!=i)
{
int p=a[min];
a[min]=a[i];
a[i]=p;
count++;
}
}
for(i=0;i<n-1;i++) cout<<a[i]<<" ";
cout<<a[n-1]<<endl;
cout<<count<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int n, v, ans = 0;
cin >> n;
vector<int> num(n);
for (int i = 0; i < n; i++) {
cin >> num.at(i);
}
for (int i = 0; i < n; i++) {
v = i;
for (int j = i + 1; j < n; j++) {
if (num[j] < num[v]) {
v = j;
}
}
if (i != v) {
swap(num[i], num[v]);
ans++;
}
}
for (int k = 0; k < n; k++) {
printf("%d", num.at(k));
if (k != n - 1)cout << ' ';
else cout << endl;
}
cout << ans << endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int selectionSort(int a[],int n){
int i,j,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;
swap(a[i],a[minj]);
if(i!=minj) ++sw;
}
return sw;
}
int main(){
int n,a[100],i,sw;
cin>>n;
for(i=0;i<n;++i) cin>>a[i];
sw=selectionSort(a,n);
for(i=0;i<n;++i){
if(i>0) cout<<" ";
cout<<a[i];
}
cout<<endl<<sw<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
int a[200];
int swap = 0;
cin >> n;
for(int i=0; i<n; i++){
cin >> a[i];
}
for(int i=0; i<n; i++){
int mini = i;
for(int j=i; j<n; j++){
if(a[j] < a[mini]){
mini = j;
}
}
int temp = a[mini];
a[mini] = a[i];
a[i] = temp;
if(i!=mini)swap++;
}
for(int i=0; i<n; i++){
if(i!=n-1)printf("%d ", a[i]);
else printf("%d\n", a[i]);
}
printf("%d\n", swap);
return 0;
}
|
#include <iostream>
// #include<algorithm>
using namespace std;
int main(){
int n,minj,N[100],swapnumber=0;
cin>>n;
for(int i=0;i<n;i++)cin>>N[i];
for(int i=0;i<n;i++){
minj=i;
for(int j=i;j<n;j++)if(N[j]<N[minj])minj=j;
if(i!=minj){
swap(N[i],N[minj]);
swapnumber++;
}
}
for(int i=0;i<n;i++){
if(i!=n-1)cout<<N[i]<<" ";
else cout<<N[i]<<endl;
}
cout<<swapnumber<<endl;
return 0;
}
|
#include <stdio.h>
int main(){
int i,j,min,n,a[100],cnt=0,array;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&a[i]);
for(i=0;i<n;i++){
min=i;
for(j=i;j<n;j++){
if(a[j]<a[min]){
min=j;
}
}
if(min!=i){
cnt++;
array=a[i];
a[i]=a[min];
a[min]=array;
}
}
for(i=0;i<n;i++){
printf("%d",a[i]);
if(i!=n-1)printf(" ");
}
printf("\n%d\n",cnt);
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n,minj,count=0;
int a[101]={};
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;j<n;j++)if(a[j]<a[minj])minj=j;
if(i!=minj){
swap(a[i],a[minj]);// 関数をかく。
count++;
}
}
for(int i=0;i<n-1;i++)cout<<a[i]<<' ';
cout<<a[n-1]<<endl<<count<<endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n,a[101],c,minv;
cin >> n;
for(int i = 0;i < n;i++){
cin >> a[i];
}
for(int i = 0;i < n-1;i++){
minv = i;
for(int j = i;j < n;j++){
if(a[j] < a[minv])
minv = j;
}
swap(a[i],a[minv]);
if(minv != i )
c++;
}
for(int i = 0;i < n;i++){
cout << a[i];
if(i != n-1)
cout << " ";
}cout << endl << c << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n,a[100],t,num,sum=0;
cin >> n;
for(int i=0;i<n;i++)cin >> a[i];
for(int i=0;i<n;++i){
int min = 100;
for(int j=i;j<n;++j){
if(a[j]<min){
min = a[j];
num = j;
}
}
if(num != i){
t = a[i];
a[i] = a[num];
a[num] = t;
sum++;
}
if(i<n-1)cout << a[i] << " ";
}
cout << a[n-1] << "\n" << sum << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
int cnt = 0;
for(int i = 0; i < n-1; i++){
int p = i;
for(int j = i; j < n; j++){
if(a[j] < a[p]){
p = j;
}
}
if(p != i){
swap(a[p], a[i]);
cnt++;
}
}
for(int k = 0; k < n; k++){
if(k)cout << ' ';
cout << a[k];
}
cout << endl;
cout << cnt << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(void)
{
bool flag;
int n,a,k=0,b;
cin >> n;
vector<int> v(n);
for(int i=0;i<n;i++) cin >> v[i];
for(int i=0;i<n;i++){
b=i;
flag=false;
for(int j=i;j<n;j++){
if(v[j]<v[b]){
b=j;
flag=true;
}
}
if(flag==true) k+=1;
a=v[i];
v[i]=v[b];
v[b]=a;
}
cout << v[0];
for(int i=1;i<n;i++) cout << " " << v[i];
cout << endl << k << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N; cin>>N;
vector<int> a(N);
for(int i=0;i<N;i++) cin>>a[i];
int cnt=0;
for(int i=0;i<=N-2;i++){
int mn=a[i],idx=i;
for(int j=i+1;j<N;j++) if(a[j]<mn){
mn=a[j]; idx=j;
}
if(idx!=i) swap(a[i],a[idx]),cnt++;
}
for(int i=0;i<N;i++) cout<<a[i]<<(i==N-1? '\n':' ');
cout<<cnt<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int a[105];
int minj;
int co=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;j<n;j++){
if(a[j]<a[minj])
minj=j;
}
if(i!=minj){
swap(a[i],a[minj]);
co++;
}
}
for(int i=0;i<n;i++){
cout << a[i];
if(i+1!=n)cout << " ";
}
cout << endl;
cout << co << endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int a[110];
int main()
{
int n,c=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
for(int i=0;i<n;i++)
{int g=i;
for(int j=i;j<n;j++)
if(a[j]<a[g])
g=j;
swap(a[i],a[g]);
if(i!=g)c++;
}
for(int i=0;i<n;i++)
{
if(i>0)printf(" ");;
printf("%d",a[i]);
}
printf("\n%d\n",c);
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
int arr[100],n,cnt=0,min_i;
cin >> n;
for (int i = 0; i < n; i++)cin >> arr[i];
for (int i = 0; i < n; i++)
{
min_i = i;
for (int j = i + 1; j < n; j++)
{
if (arr[min_i] > arr[j])min_i = j;
}
if (min_i != i)
{
swap(arr[min_i], arr[i]);
cnt++;
}
}
for (int i = 0; i < n; i++)
{
cout << arr[i];
if (i != n - 1)cout << " ";
}
cout << endl << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >>N;
int A[N];
int count=0;
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(A[i]!=A[minj]){swap(A[i],A[minj]);count++;}
}
for(int i=0;i<N-1;i++){
cout << A[i]<<' ';
}
cout <<A[N-1]<<endl;
cout <<count<<endl;
}
|
#include<iostream>
using namespace std;
int main(){
int a[1000], n, i, j, t, c=0, min; cin >> 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;
}
if(i != min){
t = a[min];
a[min] = a[i];
a[i] = t;
c++;
}
}
for(i = 0;i < n;i++){
if(i) cout << " ";
cout << a[i];
}
cout << endl << c << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
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-1;i++){
int minj = i;
for(int j=i;j<n;j++) if(a[j] < a[minj]) minj = j;
int tmp = a[i];
a[i] = a[minj];
a[minj] = tmp;
if(i != minj) count++;
}
for(int i=0;i<n-1;i++) cout << a[i] << " ";
cout << a[n-1] << endl;
cout << count << endl;
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
int n;
int a[105];
int main(void){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
int cnt=0;
bool flag=true;
for(int i=0;i<n-1;i++){
int mini=i;
for(int j=i;j<n;j++){
if(a[j]<a[mini]){
mini=j;
}
}
if(i!=mini){
swap(a[i],a[mini]);
cnt++;
}
}
for(int i=0;i<n;i++){
printf("%d%c",a[i],i==n-1?'\n':' ');
}
printf("%d\n",cnt);
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int N,minv,*Ap,sw=0;
cin >> N;
Ap = new int[N];
for(int i=0;i<N;i++) cin >> Ap[i];
for(int i=0;i<N-1;i++){
minv = i;
for(int j=i;j<N;j++){
if(Ap[j] < Ap[minv]){
minv = j;
}
}
if(minv != i){
swap(Ap[i],Ap[minv]);
sw++;
}
}
for(int i=0;i<N;i++){
if(i>0) cout << ' ';
cout << Ap[i];
}
cout << endl;
cout << sw << endl;
}
|
#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
int N;
int a[100];
int b, c, d;
int main()
{
cin >> N;
for(int i=0; i<N; i++)
{
cin >> a[i];
}
d=0;
for(int k=0; k<N-1; k++)
{
b=k;
for(int i=k; i<N; i++)
{
if(a[i]<a[b])
{
b=i;
}
}
if(k!=b)
{
c=a[b];
a[b]=a[k];
a[k]=c;
d+=1;
}
}
cout << a[0];
for(int i=1; i<N; i++)
{
cout << " " << a[i];
}
cout << endl << d << endl;
return 0;
}
|
#include <iostream>
using namespace std;
void swap(int* x,int* y){
int tmp;
tmp =*x; *x =*y; *y =tmp;
}
int main(){
int n,sum=0;
cin >>n;
int x[n],minj;
for(int i=0;i<n;i++) cin>>x[i];
for(int i=0;i<n;i++){
minj =i;
for(int j=i;j<n;j++){
if(x[j]<x[minj]) minj =j;
}
if(i != minj){
swap(&x[i],&x[minj]); sum++;
}
}
for(int i=0;i<n;i++){
if(i==0) cout<<x[i];
else cout<<" "<<x[i];
}
cout <<"\n"<<sum<<"\n";
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
int a[101]={0};
int i,j,minj;
int cut=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(minj!=i){
swap(a[i],a[minj]);
cut++;
}
}
for(i=0;i<n;i++){
if(i!=0)cout<<" ";
cout<<a[i];
}
cout<<endl<<cut<<endl;
return 0;
}
|
#include<stdio.h>
int main(){
int n,A[100],mini,cnt=0,x;
int i,j;
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;
}
}
if(mini!=i){
x = A[i];
A[i] = A[mini];
A[mini] = x;
cnt++;
}
}
for(i=0;i<n-1;i++){
printf("%d ",A[i]);
}
printf("%d\n%d\n",A[n-1],cnt);
}
|
#include<iostream>
using namespace std;
int main() {
int n; cin >> n;
int a[100];
for (int i = 0; i < n; i++)cin >> a[i];
int cnt = 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;
}
}
swap(a[i], a[minj]); if(i!=minj)cnt++;
}
for (int i = 0; i < n; i++) {
if (i > 0)cout << " ";
cout << a[i];
}
cout << endl << 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 counter=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 ){
counter++;
swap(a[i],a[minj]);
}
}
for( int i=0 ; i<n ; i++ ){
cout << a[i] ;
if( i!=n-1 )
cout <<" ";
}
cout << endl;
cout << counter << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n,tmp,minj,c=0;
cin>>n;
int A[n];
for(int i=0;i<n;i++){
cin>>A[i];
}
for(int i=0;i<n;i++){
minj=i;
for(int j=i;j<n;j++){
if(A[j]<A[minj]){
minj=j;
}
}
tmp=A[i];
A[i]=A[minj];
A[minj]=tmp;
if(i!=minj)c++;
}
for(int i=0;i<n-1;i++){
cout<<A[i]<<" ";
}
cout<<A[n-1]<<endl<<c<<endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int i,j,A[100],N,minJ,cnt=0;
cin >> N;
for(i=0;i<N;i++) cin >> A[i];
for(i=0;i<N;i++){
minJ=i;
for(j=i+1;j<N;j++){
if(A[j]<A[minJ]) minJ=j;
}
swap(A[i],A[minJ]);
if(minJ!=i) cnt++;
}
for(i=0;i<N;i++) cout << (i!=0?" ":"") << A[i];
cout << endl << cnt << endl;
}
|
#include<stdio.h>
int selectionsort(int a[],int n){
int i,j,minj,s,c=0;
for(i=0;i<=n-1;i++){
minj=i;
for(j=i;j<=n-1;j++){
if(a[j]<a[minj]){
minj=j;
}
}
s=a[i];
a[i]=a[minj];
a[minj]=s;
if(i!=minj) c++;
}
return c;
}
int main()
{
int i,n,a[100],c;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
c=selectionsort(a,n);
for(i=0;i<n;i++){
if(i>0) printf(" ");
printf("%d",a[i]);
}
printf("\n%d\n",c);
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int N, i, A[100], j, mini, s, k, count = 0;
cin >> N;
for (i = 0; i<N; i++)
cin >> A[i];
for (i = 0; i<N; i++) {
mini = i;
for (j = i; j<N; j++){
if (A[j] < A[mini]) {
mini = j;
}
}
if (mini != i) {
s = A[i];
A[i] = A[mini];
A[mini] = s;
count++;
}
}
for (k = 0; k<N; k++) {
if (k<N - 1) cout << A[k] << " ";
else cout << A[k] << endl;
}
cout << count << endl;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int a[100], n, min,temp=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 (i != min) {
swap(a[i], a[min]);
temp++;
}
}
for (int i = 0; i < n; i++) {
cout << a[i];
if (i != n - 1)cout << " ";
}
cout <<endl << temp << endl;
}
|
#include<cstdio>
int main(){
int n=0,a[125],count=0,mini=0;
scanf("%d", &n);
for(int i=0;i<n;i++){
scanf("%d", &a[i]);
}
for(int i=0;i<n-1;i++){
mini=i ;
for(int j=i;j<n;j++)
if(a[j]<a[mini])mini=j;
if(i!=mini){
int b=a[i];
a[i]=a[mini];
a[mini]=b;
count++;
}
}
for(int i=0;i<n;i++){
if(i)printf(" ");
printf("%d",a[i]);
}
printf("\n%d\n",count);
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int num;
cin >> num;
int* T = new int[num];
for (int i = 0; i < num; i++)
{
cin >> T[i];
}
int num1=0;
for(int i=0;i<num;i++)
{
int mini = i;
for(int j=i+1;j<num;j++)
{
if(T[j]<T[mini])
mini = j;
}
if(mini!=i)
{
swap(T[i], T[mini]);
num1++;
}
}
for (int j = 0; j < num; j++)
{
cout << T[j] << (j == num - 1 ? '\n' : ' ');
}
cout << num1 << endl;
}
|
#include<iostream>
using namespace std;
int main(){
int n,a[100],c=0;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n-1;i++){
int mini=i;
for(int j=i;j<n;j++){
if(a[j]<a[mini])mini=j;
}
int tmp=a[i];
if(mini!=i)c++,a[i]=a[mini],a[mini]=tmp;
}
for(int i=0;i<n-1;i++)cout<<a[i]<<" ";
cout<<a[n-1]<<endl;
cout<<c<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n;
int a[100];
cin>>n;
for (int i=0; i<n; i++) cin>>a[i];
int counter=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 (a[i]!=a[minj]){
swap(a[i],a[minj]);
counter++;
}
}
for (int i=0; i<n; i++){
if (i) cout<<" ";
cout<<a[i];
}
cout<<endl;
cout<<counter<<endl;
}
|
#include<iostream>
using namespace std;
int main()
{ int A[100],n,i=0,j,key,change=0,change_2;
cin>>n;
while(i<n)
cin>>A[i++];
for(i=0;i<n;i++)
{ key=i;
for(j=i;j<n;j++)
{ if(A[j]<A[key])
key=j;
}
if(i!=key)
{ change_2=A[i],A[i]=A[key];
A[key]=change_2,change++;
}
}
for(i=0;i<n;i++)
{ cout<<A[i];
if(i!=n-1)
cout<<" ";
}
cout<<endl;
cout<<change<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
int a[101];
int main(){
int n;
cin>>n;
rep(i,n) cin>>a[i];
int cnt=0;
rep(i,n){
int t=min_element(a+i,a+n)-a;
if(i!=t) swap(a[i],a[t]),++cnt;
}
rep(i,n)cout<<a[i]<<(i==n-1?"":" ");
cout<<endl;
cout<<cnt<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >>N;
int A[N];
for(int i=0 ; i<N ;i++){
cin >>A[i];
}
int k=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]);
k++;
}
}
cout <<A[0];
for(int i=1;i<N;i++){
cout <<" "<<A[i];
}
cout <<endl<<k<<endl;
}
|
#include <iostream>
#include <cstdlib>
using namespace std;
int main(){
int n, count = 0;
cin >> n;
int A[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;
int tmp = A[min];
A[min] = A[i];
A[i] = tmp;
if(min != i) count ++;
}
for(int i = 0; i < n; i++){
cout << A[i];
if(i != n - 1) cout << ' ';
}
cout << '\n' << count << endl;
}
|
#include <iostream>
using namespace std;
#include <algorithm>
int main(void){
int n;
int a[100];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int mini;
int count = 0;
for (int i = 0; i < n - 1; i++){
mini = i;
for (int j = i; j < n; j++){
if (a[j] < a[mini])
mini = j;
}
if (i != mini){
swap(a[i], a[mini]);
count++;
}
}
for (int i = 0; i < n - 1; i++)
cout << a[i] << ' ';
cout << a[n - 1] << endl << count << endl;
}
|
#include<stdio.h>
int selectionSort(int A[],int N){
int i,j,t,sw=0,minj;
for(i=0;i<N;i++){
minj=i;
for(j=i;j<N;j++){
if(A[minj]>A[j]) minj = j;
}
if(minj != i){
t = A[i];A[i]=A[minj];A[minj]=t;
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) printf(" ");
printf("%d",A[i]);
}
printf("\n%d\n",sw);
return 0;
}
|
#include <iostream>
#include <cstring>
using namespace std;
int main()
{
int i,j,k,n,m;
int a[105];
while(cin>>n)
{
for(i=0;i<n;i++)
cin>>a[i];
m=0;
for(i=0;i<n-1;i++)
{
k=i;
for(j=i+1;j<n;j++)
if(a[j]<a[k])
k=j;
if(k!=i)
{
swap(a[k],a[i]);
m++;
}
}
for(i=0;i<n-1;i++)
cout<<a[i]<<" ";
cout<<a[n-1]<<endl<<m<<endl;
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.