text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int n, a[100];
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
while (1) {
cin >> n;
if (n == 0) break;
int ans = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n-1; i++) {
for (int j = 0; j < n-1-i; j++) {
if (a[j] > a[j+1]) {
swap(a[j], a[j+1]);
ans++;
}
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MAX 100
int array[MAX];
int bubble_sort(int n, int array[])
{
int tmp, cnt = 0;
for (int i = n - 1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (array[j+1] < array[j]) {
tmp = array[j];
array[j] = array[j+1];
array[j+1] = tmp;
cnt++;
}
}
}
return cnt;
}
int main()
{
int n, array[MAX];
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
cin >> array[i];
}
int ans = 0;
ans = bubble_sort(n, array);
cout << ans << endl;
}
return 0;
}
|
#include <stdio.h>
const int N=1e3+10;
void swap(int &a,int &b){
int temp=a;
a=b;
b=temp;
return ;
}
int main(){
int n,t,a[N];
while(true){
scanf("%d",&n);
if(n==0)return 0;
t=0;
for(int i=0;i<n;i++)scanf("%d",&a[i]);
for(int i=0;i<n;i++)for(int j=0;j<n-1;j++){
if(a[j]>a[j+1]){
swap(a[j],a[j+1]);
t++;
}
}
printf("%d\n",t);
}
}
|
#include<iostream>
using namespace std;
int bubbleSort( int* a, int n )
{
int cnt = 0;
for( int i = 0; i < n; i++ )
for( int j = 0; j < n - 1; j++ )
{
if( a[j] > a[j+1] )
{
int temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
cnt++;
}
}
return cnt;
}
int main()
{
int n, a[100];
while( cin >> n )
{
if( n == 0 )
break;
for( int i = 0; i < 100; i++ )
a[i] = 0;
for( int i = 0; i < n; i++ )
cin >> a[i];
cout << bubbleSort( a, n ) << endl;
}
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
while(true){
int n;
int a[200];
cin >> n;
if(n == 0){
break;
}
int ans = 0;
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(a[i] > a[j]){
ans++;
}
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1000001];
void bubble(int *a,int n,int count){
int ans = count;
for(int i = 1; i < n; i++){
if(a[i] < a[i-1]){
swap(a[i],a[i-1]); count++;
}
}
if(ans != count) bubble(a,n,count);
else if (ans == count){
cout << ans << endl;
return;
}
}
int main(){
while(1){
int n;
cin >> n; if(n == 0)break;
for(int i = 0; i < n; i++){
cin >> a[i];
}
int count = 0;
bubble(a,n,count);
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int n,a[100];
int main(){
while(cin>>n){
if(!n)return 0;
int ans=0;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n-1;i++){
for(int j=0;j<n-1-i;j++){
if(a[j]>a[j+1]){
ans++;
swap(a[j],a[j+1]);
}
}
}
cout<<ans<<endl;
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define N (111)
int seg[N+1];
void add(int x,int v){
for(int i = x ; i < N ; i+=i&-i){
seg[i] += v;
}
}
int get(int x){
int ans = 0;
for(int i = x ; i > 0 ; i -= i & -i){
ans += seg[i];
}
return ans;
}
int a[101];
int main(){
int n;
while(cin >> n && n){
vector<int> u;
for(int i = 0 ; i < 101 ; i++) seg[i] = 0;
for(int i = 0 ; i < n ; i++) cin >> a[i] , u.push_back(a[i]);
sort(u.begin(),u.end());
u.erase(unique(u.begin(),u.end()),u.end());
for(int i = 0 ; i < n ; i++)
a[i] = lower_bound(u.begin(),u.end(),a[i]) - u.begin() + 1;
int ans = 0;
for(int i = 0 ; i < n ; i++){
add(a[i],1);
ans += (i+1) - get(a[i]); //a[i]より大きな値
}
cout << ans << endl;
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main()
{
int n;
while(cin >> n && n)
{
vector<int> a;
int temp,count = 0;
rep(i,n)
{
cin >> temp;
a.push_back(temp);
}
rep(i,n-1)
{
for(int j=n-1;j>i;j--)
{
if(a[j] < a[j-1])
{
count++;
swap(a[j],a[j-1]);
}
}
}
cout << count << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,cnt;
int a[101] = {};
while(1){
cin >> n;
if(n == 0)break;
cnt = 0;
for(int i=0;i<n;i++){
cin >>a[i];
}
for(int j=0;j<n;j++)
for(int i=0;i<n-1;i++){
if(a[i] > a[i+1]){swap(a[i],a[i+1]);
cnt++;}
}
cout << cnt << endl;
}
}
|
#include <stdio.h>
void swap(int &a,int &b){
int temp=a;
a=b;
b=temp;
return ;
}
const int N=1e5+10;
int main(){
int n,a[N];
while(true){
scanf("%d",&n);
if(n==0)return 0;
for(int i=0;i<n;i++)scanf("%d",&a[i]);
int ans=0;
for(int i=0;i<n;i++)for(int j=0;j<n-1;j++)if(a[j]>a[j+1]){
swap(a[j],a[j+1]);
ans++;
}
printf("%d\n",ans);
}
}
|
#include <iostream>
#define reep(i,n,m) for(int i=(n);i<(m);i++)
#define rep(i,n) reep(i,0,n)
using namespace std;
int main(){
int n;
while(cin>>n,n){
int a[101]={0};
rep(i,n){
cin >> a[i];
}
int ans=0;
rep(i,n){
rep(i,n-1){
if(a[i]>a[i+1]){
swap(a[i],a[i+1]);
ans++;
}
}
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n,i,a[100],j,m,tmp,count;
while(cin >> n && n){
count = 0;
for(i = 0;i < n;i++){
cin >> m;
a[i] = m;
}
for(i = 0;i < n-1;i++){
for(j = i+1;j < n;j++){
if(a[i] > a[j]){
tmp = a[j];
a[j] = a[i];
a[j] = tmp;
count++;
}
}
}
cout << count << endl;
}
return 0;
}
|
#include<iostream>
#define MAX 10000
using namespace std;
int b_sort(int x[], int n){
int count=0, temp;
for(int i=0; i<n-1; i++){
for(int j=n-1; j>i; j--){
if(x[j-1] > x[j]){
temp = x[j];
x[j] = x[j-1];
x[j-1] = temp;
count++;
}
}
}
return count;
}
int main(){
int x[MAX], n, p;
while(1){
cin >> n;
if(n == 0) return 0;
for(int i=0; i<n; i++) x[i]=0;
for(int i=0; i<n; i++){
cin >> p;
x[i] = p;
}
cout << b_sort(x,n) << endl;
}
}
|
#include<iostream>
#include<utility>
using namespace std;
int main(){
int n,sort[1111111],cou,tmp;
while(1){
cou=0;
cin >> n;
if(n == 0) break;
for(int i=0;i<n;i++){
cin >> sort[i];
}
for(int i=0;i<n;i++){
for(int j=0;j<n-i-1;j++){
if(sort[j] > sort[j+1]){
swap(sort[j],sort[j+1]);
cou++;
}
}
}
cout << cou << endl;
}
}
|
#include <iostream>
using namespace std;
int n,a[100],ans=0;
void solve() {
int fin = n-1;
while(fin != 0) {
for(int i=0;i<fin;i++) {
if(a[i] > a[i+1]) {
swap(a[i],a[i+1]);
ans++;
}
}
fin--;
}
return;
}
int main() {
while(cin >> n) {
if(n==0) break;
for(int i=0;i<n;i++) {
cin >> a[i];
}
solve();
cout << ans << endl;
ans = 0;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define shosu(n) setprecision(n)
#define INF 1000000000;
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int d[n], ans = 0;
rep(i, n) cin >> d[i];
for (int i = 1; i < n; i++)
for (int j = 0; j < n - i; j++)
if (d[j] > d[j + 1]) {
swap(d[j], d[j + 1]);
ans++;
}
cout << ans << endl;
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
int main(){
int n;
while(cin >> n,n){
int array[120] = {0};
for(int i = 0; i < n; i++){
cin >> array[i];
}
int cnt = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j < n-1; j++){
if(array[j] > array[j+1]){
array[j] ^= array[j+1];
array[j+1] ^= array[j];
array[j] ^= array[j+1];
cnt++;
}
}
}
cout << cnt << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n;
while(cin >> n , n){
int ans = 0;
vector<int> data(n);
rep(i,n) cin >> data[i];
rep(i,n){
rep(j,n-1){
if(data[j] > data[j+1]){
swap(data[j],data[j+1]);
ans++;
}
}
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
vector<int> ans;
void solve(int n) {
vector<int> a(n);
rep(i, n) cin >> a[i];
int res = 0;
for (int i = n-1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (a[j] > a[j+1]) {
swap(a[j], a[j+1]);
res++;
}
}
}
ans.push_back(res);
return ;
}
int main() {
while (true) {
int n;
cin >> n;
if (n == 0) break;
solve(n);
}
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << endl;
}
return 0;
}
|
#include <stdio.h>
#include <iostream>
#include <vector>
#include <list>
#include <cmath>
#include <fstream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <iterator>
#include <cstdlib>
#include <cstring>
#include <sstream>
using namespace std;
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) (EQ((a).real(),(b).real()) && EQ((a).imag(),(b).imag()))
typedef complex<double> P;
typedef long long ll;
const int MAX_SIZE = 10000;
int main(){
int n;
while(cin>>n&&n!=0){
int a[101];
for(int i = 0; i < n; i++){
cin>>a[i];
}
int cnt=0;
for(int j = n-1; j >= 1; j--){
for(int i = 0; i < j; i++){
if(a[i]>a[i+1]){
swap(a[i],a[i+1]);
cnt++;
}
}
}
cout<<cnt<<endl;
}
return 0;
}
|
#include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<cstdio>
#include <string>
#include <complex>
#include <functional>
using namespace std;
typedef pair<int,int> P;
int main()
{
int n;
while(cin >> n,n)
{
vector<int> vec;
vec.resize(n);
for(int i=0;i<n;i++)
cin >> vec[i];
int ans = 0;
for(int i= vec.size()-1;i>0;i--)
for(int j=0;j<i;j++)
if(vec[j+1] < vec[j])
ans++,swap(vec[j+1],vec[j]);
cout << ans << endl;
}
return 0;
}
|
#include<stdio.h>
int table[100];
int main(){
int a;
while(scanf("%d",&a),a){
for(int i=0;i<a;i++)scanf("%d",table+i);
int ret=0;
for(int i=0;i<a;i++){
for(int j=0;j<a-1;j++){
if(table[j]>table[j+1]){
ret++;
int val=table[j];
table[j]=table[j+1];
table[j+1]=val;
}
}
}
printf("%d\n",ret);
}
}
|
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
/** Problem0167 : Bubble Sort **/
int main()
{
int d[100], n, ans;
while (cin >> n, n!= 0) {
ans=0;
for (int i=0; i<n; i++)
cin >> d[i];
for (int i=0; i<n; i++) {
for (int j=n-1; i<j; j--) {
if (d[j-1] > d[j]) {
swap(d[j-1], d[j]);
ans++;
}
}
}
cout << ans << endl;
}
}
|
#include<iostream>
#include<algorithm>
#include<map>
const int MAX_N = 100;
int bit[MAX_N+1], n;
int sum(int i){
int s = 0;
while(i > 0){
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x){
while(i <= n){
bit[i] += x;
i += i & -i;
}
}
int main(){
int a[MAX_N], b[MAX_N];
while(std::cin >> n, n){
for(int i=0;i<MAX_N+1;i++){
bit[i] = 0;
}
for(int i=0;i<n;i++){
std::cin >> a[i];
}
for(int i=0;i<n;i++){
b[i] = a[i];
}
std::sort(b, b+n);
std::map<int, int> m;
for(int i=0;i<n;i++){
m[b[i]] = i+1;
}
int t = 0;
for(int i=0;i<n;i++){
t += i - sum(m[a[i]]);
add(m[a[i]], 1);
}
std::cout << t << std::endl;
}
}
|
#define _USE_MATH_DEFINES
#define MAX_N 1000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
static const double eps = 1e-8;
int main(){
int n;
while(~scanf("%d",&n)){
if(n==0) break;
int* a = new int[n];
for(int i=0;i<n;i++){
scanf("%d",a+i);
}
int res=0;
for(int i=0;i<n;i++){
for(int j=0;j+1<n;j++){
if(a[j]>a[j+1]){
swap(a[j],a[j+1]);
res++;
}
}
}
printf("%d\n",res);
delete[] a;
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
void temp(int *x, int *y)
{
int temp;
temp = *x;
*x = *y;
*y = temp;
}
int main(void)
{
int n;
while(cin >> n && n != 0)
{
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
int counter = 0;
for (int i = n; i > 0; --i)
{
for(int k = 0;k < i-1;k++)
{
if(a[k] > a[k+1])
{
temp(&a[k], &a[k+1]);
counter++;
}
}
}
cout << counter << endl;
}
return 0;
}
|
#include <stdio.h>
int main(void)
{
int n;
int in[100];
int i, j;
int ans;
while (1){
scanf("%d", &n);
if (n == 0)break;
for (i = 0; i < n; i++){
scanf("%d", &in[i]);
}
ans = 0;
for (i = 0; i < n - 1; i++){
for (j = 0; j < n - i - 1; j++){
if (in[j] > in[j + 1]){
in[j] += in[j + 1];
in[j + 1] = in[j] - in[j + 1];
in[j] -= in[j + 1];
ans++;
}
}
}
printf("%d\n", ans);
}
return (0);
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double ESP=1e-10;
using namespace std;
int main(){
int n;
while(cin>>n,n){
vector<int>in(n);
int co=0;
rep(i,n)cin>>in[i];
rep(i,n){
rep(j,n-i-1){
if(in[j]>in[j+1]){
co++;
swap(in[j],in[j+1]);
}
}
}
cout<<co<<endl;
}
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int a[100],n,i,j,wk,cnt;
while(1) {
scanf("%d",&n);
if(n==0) break;
for(i=0;i<n;i++) scanf("%d",&a[i]);
cnt=0;
for(i=n-2;i>=0;i--) {
for(j=0;j<=i;j++) {
if(a[j]>a[j+1]) {
swap(a[j],a[j+1]);
cnt++;
}
}
}
printf("%d\n",cnt);
}
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
for(int n;cin>>n,n;){
int a[100];
for(int i=0;i<n;i++) cin>>a[i];
int cnt=0;
for(int i=0;i<n;i++){
for(int j=0;j<n-i-1;j++)
if(a[j]>a[j+1]) swap(a[j],a[j+1]),cnt++;
}
cout<<cnt<<endl;
}
return 0;
}
|
#include <iostream>
#include <cstdlib>
using namespace std;
const static int SEQ_LEN_MAX = 100;
int main() {
while( 1 ) {
int n, seq[ SEQ_LEN_MAX ];
cin >> n;
if( !n ) { return EXIT_SUCCESS; }
for( int i = 0; i < n; i++ ) {
cin >> seq[ i ];
}
int counter = 0;
for( int i = 0; i < n; i++ ) {
for( int j = 0; j < n - i - 1; j++ ) {
if( seq[ j ] > seq[ j + 1 ] ) {
int k = seq[ j + 1 ];
seq[ j + 1 ] = seq[ j ];
seq[ j ] = k;
counter++;
}
}
}
cout << counter << endl;
}
}
|
#include <iostream>
using namespace std;
int main()
{
int n;
while( cin >> n && n ){
int a[ 100 ] = {0};
for( int i = 0; i < n; ++i ){
cin >> a[ i ];
}
int ans = 0;
for( int i = 0; i < n - 1; ++i ){
for( int j = 0; j < n - 1 - i; ++j ){
if( a[ j ] > a[ j + 1 ] ){
int t = a[ j + 1 ];
a[ j + 1 ] = a[ j ];
a[ j ] = t;
++ans;
}
}
}
cout << ans << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int n,a[100];
int main()
{
while(cin>>n,n)
{
for(int i=0;i<n;i++)cin>>a[i];
int cnt=0;
for(int i=0;i<n;i++)
{
for(int j=i;j<n;j++)cnt+=a[i]>a[j];
}
cout<<cnt<<endl;
}
}
|
#define _CRT_SECURE_NO_WARNINGS
#include<fstream>
#include<iostream>
#include<string>
#include<iomanip>
#include<list>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
int main(int argc, char **argv){
int n;
while (cin >> n && n != 0){
vector<int> v;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
v.push_back(tmp);
}
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - i - 1; j++) {
if (v[j] > v[j + 1]) {
swap(v[j], v[j + 1]);
cnt++;
}
}
}
cout << cnt << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n;
while (cin >> n, n) {
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
ans += a[j] > a[i];
}
}
cout << ans << endl;
}
return 0;
}
|
#include <stdio.h>
#include<math.h>
#include <algorithm>
using namespace std;
int main(){
int n,table[100],count;
while(true){
scanf("%d",&n);
if(n == 0)break;
for(int i=0; i < n; i++){
scanf("%d",&table[i]);
}
count = 0;
for(int i=n-2; i >= 0; i--){
for(int k=0; k <= i; k++){
if(table[k] > table[k+1]){
swap(table[k],table[k+1]);
count++;
}
}
}
printf("%d\n",count);
}
}
|
#include<iostream>
#include<cstdio>
#include<time.h>
using namespace std;
#define N 314159
int a[N],t[N];
long long ans=0;
void marge_count(int s,int g){
if(s+1==g)return;
int m= (s+g)/2;
marge_count(s,m);
marge_count(m,g);
int p=s,q=m,r=s;
while(p<m&&q<g){
if(a[p]<=a[q]){
t[r++]=a[p++];
}else{
t[r++]=a[q++];
ans+=m-p;
}
}
if(p<m){
while(p<m)t[r++]=a[p++];
}else{
while(q<g){
t[r++]=a[q++];
}
}
for(int i=s;i<g;i++){
a[i]=t[i];
}
}
int n;
int main(){
while(cin>>n&&n){ans=0;
for(int i=0;i<n;i++)cin>>a[i];
marge_count(0,n);
cout<<ans<<endl;}
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <list>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#define N_MAX 1000
using namespace std;
int cnt = 0;
/* aとbの値を入れ替える */
void swap(int *a, int *b)
{
int tmp;
tmp = *a;
*a = *b;
*b = tmp;
}
/* バブルソート */
void bubble_sort(int a[], int n)
{
int i, j;
for (i = 0; i < n - 1; i++) {
for (j = 0; j < n - 1 - i; j++) {
if (a[j] > a[j + 1]) {
swap(&a[j], &a[j + 1]);
cnt++;
}
}
}
}
int main()
{
int n;
int a[105];
while (1) {
cin >> n;
if (n == 0) break;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cnt = 0;
bubble_sort(a, n);
cout << cnt << endl;
}
return (0);
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
while (cin >> n) {
if (n == 0)
break;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
int ans = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n-i-1; ++j) {
if (a[j] > a[j+1]) {
++ans;
swap(a[j], a[j+1]);
}
}
}
cout << ans << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define rp(a) while(a--)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(){
int n;
while(cin>>n,n){
vector<int>in(n);
rep(i,n)cin>>in[i];
int co=0;
rep(i,n)rep(j,n-i-1)if(in[j]>in[j+1]){
co++;
swap(in[j],in[j+1]);
}
cout<<co<<endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
//#define int long long
using namespace std;
int n;
int a[100];
signed main()
{
while (true)
{
cin >> n;
if (n == 0) break;
rep(i,n) cin >> a[i];
int ans = 0;
for (int i=n-1; 1<=i; i--)
{
for (int j=0; j<=i-1; j++)
{
if (a[j] > a[j+1])
{
swap(a[j], a[j+1]);
ans++;
}
}
}
cout << ans << endl;
}
}
|
#include <iostream>
#include <vector>
using namespace std;
int bubblesort(vector<int> a){
int cnt = 0;
for(int i=0; i<a.size()-1; i++){
for(int j=a.size()-1; j>i; j--){
if(a[j]<a[j-1]){
int tmp = a[j];
a[j] = a[j-1];
a[j-1] = tmp;
cnt++;
}
}
}
return cnt;
}
int main(){
int n;
while(cin >> n, n != 0){
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
int result = bubblesort(a);
cout << result << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n,a[100],cnt;
while (cin >> n, n) {
cnt = 0;
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 (a[i] > a[j]) cnt++;
}
}
cout << cnt << endl;
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int n;
int a[100];
int step;
int temp;
int i,j;
while(1) {
scanf("%d",&n);
if(n==0) break;
step=0;
for(i=0;i<n;i++) {
scanf("%d",&a[i]);
}
for(i=0;i<n-1;i++) {
for(j=0;j<n-i-1;j++) {
if(a[j]>a[j+1]) {
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
step++;
}
}
}
printf("%d\n",step);
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
void solve()
{
int n;
while(cin >>n, n)
{
vector<int> Vec(n);
for(int i = 0; i < n; ++i)
{
cin >> Vec[i];
}
int count = 0;
for(int i = 0; i < n - 1; ++i)
{
for(int j = n - 1; j > i; --j)
{
if(Vec[j - 1] > Vec[j])
{
int temp = Vec[j];
Vec[j] = Vec[j - 1];
Vec[j - 1] = temp;
count++;
}
}
}
cout << count << endl;
}
}
int main()
{
solve();
return(0);
}
|
#include <iostream>
#include <algorithm>
#include <utility>
using namespace std;
int bubbleSort(int A[], int N) {
int c = 0;
bool flag = true;
for (int i = 0; flag; i++) {
flag = false;
for (int j = 1; j < N-i; j++) {
if (A[j] < A[j-1]) {
swap(A[j], A[j-1]);
flag = true;
c++;
}
}
}
return c;
}
int main()
{
int A[101];
int N;
while (cin >> N) {
if (N == 0)
break;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
cout << bubbleSort(A, N) << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)
#define all(n) n.begin(),n.end()
const int MAXN = 101;
int a[MAXN];
int main()
{
int n;
while(cin >> n && n)
{
REP(n) cin >> a[i];
int ans = 0;
for(int j = n - 1; j > 0;j--)REP(j)
{
if(a[i] > a[i+1]){ swap(a[i], a[i+1]);ans++; }
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
#define rep2(x,from,to) for(int x=(from);x<(to);++(x))
#define rep(x,to) rep2(x,0,to)
int main(){
int n;
while(cin >> n, n) {
int a[110] = {}, cnt = 0;
rep(i,n) {
cin >> a[i];
}
rep(i,n-1) {
rep(j,n-i-1) {
if(a[j] > a[j+1]) {
swap(a[j],a[j+1]);
cnt++;
}
}
}
cout << cnt << endl;
}
return 0;
}
|
#include<vector>
#include<list>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int h,i;
int a[100],n,c;
for(;;){
cin>>n;
if(n==0)
break;
for(i=0;i<n;i++)
cin>>a[i];
c=0;
do{
h=0;
for(i=1;i<n;i++){
if(a[i-1]>a[i]){
swap(a[i-1],a[i]);
h=1;
c++;
}
}
}while(h);
cout<<c<<endl;
}
return 0;
}
|
#include<stdio.h>
#include<iostream>
#include<string>
#include<cstdlib>
#include <vector>
#include <algorithm>
#include <functional>
#include <utility>
using namespace std;
int main()
{
while (1)
{
int n, k;
k = 0;
vector<int> A;
cin >> n;
if (n==0)
{
break;
}
for (int i = 0; i < n; i++)
{
int a;
cin >> a;
A.push_back(a);
}
for (int j = 0; j < n;j++)
{
for (int i = 0; i < n-1; i++)
{
if (A[i]>A[i + 1])
{
swap(A[i], A[i + 1]);
k++;
}
}
}
cout << k << endl;
}
return 0;
}
|
#include <stdio.h>
int main() {int RB[105],N,i,j,ans;while (1) {scanf("%d",&N);if (!N) return 0;for (i=0;i<N;scanf("%d",&RB[i++]));for (i=1,ans=0;i<N;i++) for (j=N-1;j>=i;j--) if (RB[j-1]>RB[j]) ans++,RB[j]+=RB[j-1],RB[j-1]=RB[j]-RB[j-1],RB[j]-=RB[j-1];printf("%d\n",ans);}}
|
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <string>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
using namespace std;
int main(){
int n;
while(cin>>n,n!=0){
int c=0;
vector<int> s(n);
for(int i=0;i<n;i++)
cin>>s[i];
for(int i=0;i<n;i++){
for(int j=0;j<n-1;j++){
if(s[j]>s[j+1]){
swap(s[j],s[j+1]);
c++;
}
}
}
cout<<c<<endl;
}
}
|
#include<iostream>
using namespace std;
int n,ans,tmp;
int t[100];
int main(){
while(cin>>n&&n){
for(int i=0;i<n;i++)cin>>t[i];
ans=0;
for(int i=n-1;i>0;i--){
for(int j=0;j<i;j++){
if(t[j]>t[j+1]){
tmp=t[j];t[j]=t[j+1];t[j+1]=tmp;
ans++;
}
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
int bubble(int n, int bubble[], int count);
int main(void)
{
int ans, n;
while(cin >> n, n){
int num[100];
for(int i = 0; i < n; i++){
cin >> num[i];
}
ans = bubble(n, num, 0);
cout << ans << endl;
}
return 0;
}
int bubble(int n, int bubble[], int count)
{
int temp = n;
for(int ii = 0; ii < n; ii++){
for(int i = 0; i < temp-1; i++){
if(bubble[i] > bubble[i+1]){
count++;
int temp;
temp = bubble[i];
bubble[i] = bubble[i+1];
bubble[i+1] = temp;
}
}
temp--;
}
return count;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int a[1000005];
int main(){
int n;
while(cin>>n,n){
for(int i = 0;i < n;i++)cin>>a[i];
int cnt = 0;
for(int i = 0;i < n;i++){
for(int j = 0;j < n-i-1;j++){
if(a[j]>a[j+1]){
swap(a[j],a[j+1]);
cnt++;
}
}
}
cout<<cnt<<endl;
}
}
|
#include <cstdio>
#include <cstdio>
#include <algorithm>
using namespace std;
int arr[101];
int main() {
int sw, N;
for (; ;) {
scanf("%d", &N);
if (N == 0) break;
for (int i = 0; i < N; i++) scanf("%d", &arr[i]);
bool flag = true; sw = 0;
for (int i = 0; flag; i++) {
flag = false;
for (int j = N-1; j >= i+1; j--) {
if (arr[j] < arr[j-1]) {
swap(arr[j], arr[j-1]);
sw++;
flag = true;
}
}
}
std::printf("%d\n", sw);
}
return 0;
}
|
#include<iostream>
using namespace std;
const int INF = 2000000;
int main() {
int n;
while (cin >> n and n != 0) {
int* arr = new int[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int val = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < i; j++)
if (arr[j] > arr[i]) val++;
cout << val << endl;
}
}
|
#include<iostream>
using namespace std;
int main()
{
int n;
for(;cin>>n,n;)
{
int data[n];
long long int step=0;
for(int i=0;i<n;i++)
cin>>data[i];
for(int i=0;i<n;i++)
for(int j=0;j<n-i-1;j++)
{
if(data[j]>data[j+1])
{
swap(data[j],data[j+1]);
step++;
}
}
cout<<step<<endl;
}
}
|
#include<iostream>
using namespace std;
int main(){
int n;
while(cin >> n){
if(n == 0) break;
int data[n];
int sum = 0;
for(int i = 0; i < n; i++){
cin >> data[i];
}
int tmp;
for(int j = 0; j < n; j++){
for(int i = 0; i < n-1-j; i++){
if(data[i] > data[i+1]){
tmp = data[i];
data[i] = data[i+1];
data[i+1] = tmp;
sum++;
}
}
}
cout << sum << endl;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include <cassert>
using namespace std;
int N, k, sum, A[100];
int bubble_sort_count(int r){
sum = 0;
for (int i = 0; i < r - 1;i++){
for (int j = 0; j < r - i - 1;j++){
if (A[j] > A[j + 1]){
k = A[j + 1];
A[j + 1] = A[j];
A[j] = k;
sum += 1;
}
}
}
return sum;
}
int main()
{
cin >> N;
while (N != 0){
for (int n = 0; n < N; n++){
cin >> A[n];
}
cout << bubble_sort_count(N) << endl;
cin >> N;
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main (int argc, char const* argv[])
{
int n;
cin >> n;
while(n)
{
vector<int> ary = vector<int>(n);
for (unsigned int i = 0; i < n; i += 1)
{
cin >> ary[i];
}
int s = 0;
for(int i = 0;i < n;i++)
{
for(int j = 1;j < (n-i);j++)
{
if(ary[j-1] > ary[j])
{
int tmp = ary[j-1];
ary[j-1] = ary[j];
ary[j] = tmp;
s++;
}
}
}
cout << s << endl;
cin >> n;
}
return 0;
}
|
#include <iostream>
using namespace std;
void swap( int* a, int* b )
{
int tmp;
tmp = *a;
*a = *b;
*b = tmp;
}
int BubbleSort( int* lst, int length )
{
int count = 0;
for (int i=1; i<length; i++)
{
for (int j=0; j<length-i; j++)
{
if ( lst[j] > lst[j+1] )
{
swap( &lst[j], &lst[j+1] );
count++;
}
}
}
return count;
}
int main()
{
while(true)
{
int n;
cin >> n;
if ( n == 0 ) break;
int* arr = new int[n];
for (int i=0; i<n; i++)
{
cin >> arr[i];
}
int count = BubbleSort( arr, n );
cout << count << endl;
delete[] arr;
}
}
|
#include<iostream>
#include<vector>
using namespace std;
void BubbleSort(vector<int>);
void swap(int&, int&);
int main(){
int i, n, x;
vector<int> data;
while(1){
cin >> n;
if(n == 0) break;
for(i=0; i<n; i++){
cin >> x;
data.push_back(x);
}
BubbleSort(data);
data.clear();
}
return 0;
}
void BubbleSort(vector<int> data){
int i, j, count=0;
for(i=0; i<data.size(); ++i){
for(j=0; j<data.size()-i-1; ++j){
if(data[j] > data[j+1]){
swap(data[j], data[j+1]);
++count;
}
}
}
cout << count << endl;
}
void swap(int& x, int& y){
int copy;
copy = x;
x = y;
y = copy;
}
|
#include<stdio.h>
int main(void)
{
int n;
int a[101];
int cnt;
int i,j,temp;
scanf("%d",&n);
while(n!=0){
cnt=0;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
for(j=0;j<n-1;j++){
if(a[j]>a[j+1]){
cnt++;
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
printf("%d\n",cnt);
scanf("%d",&n);
}
return 0;
}
|
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{
for(;;){
int n;
cin >> n;
if(n == 0)
return 0;
vector<int> a(n);
for(int i=0; i<n; ++i)
cin >> a[i];
int ret = 0;
for(int i=0; i<n; ++i){
for(int j=i+1; j<n; ++j){
if(a[i] > a[j])
++ ret;
}
}
cout << ret << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ELEM(array) (sizeof (array)/sizeof *(array))
#define MAX_N 100
#define SAFE_FREE(ptr) if( ptr != NULL ){ free(ptr); ptr = NULL; }
typedef unsigned int UINT;
typedef long long ll;
typedef queue<pair<int, int> > que;
int main()
{
int n, a[1005];
while (1)
{
cin >> n; if (n == 0)return 0;
REP(i, n)cin >> a[i];
int cnt = 0;
REP(i, n - 1)REP(j, n - 1)
{
if (a[j] > a[j + 1])
{
swap(a[j], a[j + 1]);
cnt++;
}
}
cout << cnt << endl;
}return 0;
}
|
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define INF 1<<30
int main() {
int n;
while(cin >> n,n) {
int v[n];
REP(i,n)
cin >> v[i];
int res = 0;
REP(i,n) {
REP(j,n-i-1) {
if (v[j] > v[j+1]) {
// printf("%d,%d, %d,%d\n",i,j,v[j],v[j+1]);
swap(v[j],v[j+1]);
res++;
}
}
}
cout << res << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(cin >> n && n)
{
int data[100000]={};
int count=0;
for(int i=0;i<n;i++)
{
cin >> data[i];
}
for(int i=0;i<n;i++)
{
for(int j=0;j<n-i-1;j++)
{
if(data[j]>data[j+1])
{
swap(data[j],data[j+1]);
count++;
}
}
}
cout << count << endl;
}
return 0;
}
|
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <complex>
#include <map>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second
static const double PI=6*asin(0.5);
typedef pair<double,double> P;
typedef complex<double> CP;
typedef long long ll;
int a[110];
int main(){
int n;
while(cin>>n,n){
rep(i,110) a[i]=0;
rep(i,n){
cin>>a[i];
}
ll res=0;
for(int i=n;i>1;i--){
for(int j=0;j<i-1;j++){
if(a[j]>a[j+1]){
int t;
t=a[j+1];
a[j+1]=a[j];
a[j]=t;
res++;
}
}
}
cout<<res<<endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(void){
while(1){
int n; cin >> n;
if(n == 0)return 0;
vector<int> v;
for (int i = 0; i < n; ++i){
int t; cin >> t;
v.push_back(t);
}
int cnt = 0;
for (int i = 0; i < n; ++i){
for (int j = 0; j < n - i - 1; ++j){
if(v[j] > v[j + 1]){
swap(v[j], v[j + 1]);
cnt++;
}
}
}
cout << cnt << endl;
}
}
|
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <cstring>
#include <deque>
#include <cstdio>
#include <cmath>
#include <complex>
#include <iostream>
#include <iterator>
using namespace std;
#define reep(i,f,t) for(int i=f ; i<int(t) ; ++i)
#define rep(i,n) reep(i, 0, n)
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
const double EPS = 1e-8;
int main()
{
int n;
while(scanf("%d", &n), n){
vi data(n);
rep(i, n)
scanf("%d", &data[i]);
int cnt = 0;
rep(i, n-1){
rep(j, n-i-1){
if(data[j] > data[j+1]){
swap(data[j], data[j+1]);
++cnt;
}
}
}
printf("%d\n", cnt);
}
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int a[100],n,i,j,t,c;
for(;;){
cin >> n;
if(n==0)break;
for(i=0;i<n;i++){
cin >> a[i];
}
c = 0;
for(i=n-1;i>0;i--){
for(j=0;j<i;j++){
if(a[j] > a[j+1]){
t = a[j];
a[j] = a[j+1];
a[j+1] = t;
c++;
}
}
}
cout << c << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n;
while(cin >> n, n) {
int cnt = 0, a, num[101];
for(int i = 0 ; i < n ; i++) cin >> num[i];
for(int i = 0 ; i < n-1 ; i++) {
for(int j = n-1 ; j > i ; j--) {
if(num[j-1] > num[j]) {
a = num[j-1];
num[j-1] = num[j];
num[j] = a;
cnt++;
}
}
}
cout << cnt << endl;
}
}
|
#include <cstdio>
#include <algorithm>
#define MAX 100
using namespace std;
int bubbleCount(int* array, int n);
int main(){
int n;
while(scanf("%d", &n)){
if(n == 0) break;
int array[MAX];
fill(array, array + MAX, 0);
for(int i = 0; i < n; i++) scanf("%d", &array[i]);
printf("%d\n", bubbleCount(array, n));
}
return 0;
}
int bubbleCount(int* array, int n){
bool flag = true;
int temp, count = 0;
while(flag){
flag = false;
for(int i = n - 1; i > 0; i--)
if(array[i] < array[i - 1]){
temp = array[i];
array[i] = array[i - 1];
array[i - 1] = temp;
flag = true;
count++;
}
}
return count;
}
|
#include<iostream>
using namespace std;
long long int a[500],n;
int main(void){
while(1){
scanf("%d",&n);
if(n==0)break;
long long int ans=0;
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
for(int j=0;j<n-i-1;j++){
if(a[j]>a[j+1]){
swap(a[j],a[j+1]);
ans++;
}
}
}
printf("%d\n",ans);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int a[100];
int main() {
int b;
while (cin >> b, b) {
for (int c = 0; c<b; c++)scanf("%d", &a[c]);
int sum = 0;
for (int d = 0; d < b - 1; d++) {
for (int e = d + 1; e < b; e++) {
if (a[d] > a[e])sum++;
}
}
cout << sum << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int calc(vector<int>&a){
int n=a.size();
if(n<=1)return 0;
vector<int>b(a.begin(),a.begin()+n/2);
vector<int>c(a.begin()+n/2,a.end());
int ret=calc(b)+calc(c);
int bi=0,ci=0;
for(int i=0;i<a.size();i++){
if(bi<b.size()&&(ci==c.size()||b[bi]<=c[ci])){
a[i]=b[bi++];
}
else{
ret+=n/2-bi;
a[i]=c[ci++];
}
}
return ret;
}
int main(){
int N;
while(cin>>N,N){
vector<int>a(N);
for(int i=0;i<N;i++)cin>>a[i];
cout<<calc(a)<<endl;
}
return 0;
}
|
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\b.txt"
int main() {
while (1) {
int N;
cin >> N;
if (!N)break;
vector<int>as(N);
for (int i = 0; i < N; ++i) {
cin >> as[i];
}
int sum = 0;
for (int i = 0; i < N; ++i) {
sum += count_if(as.begin() + i + 1, as.end(), [=](const int n) {return n < as[i]; });
}
cout << sum << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n;
int array[100];
while (cin >> n, n){
int cnt = 0;
for (int i = 0; i < n; i++){
cin >> array[i];
}
for (int i = 0; i < n - 1; i++){
for (int j = n - 1; j > i; j--){
if (array[j] < array[j - 1]){
swap(array[j], array[j - 1]);
cnt++;
}
}
}
cout << cnt << endl;
}
return (0);
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n;
while (cin >> n){
if (n == 0)return 0;
int l[101];
int sum = 0;
for (int i = 0; i < n; i++){
int a; cin >> a;
l[i] = a;
}
for (int i = n; i > 0; i--){
for (int j = 0; j < n - 1; j++) {
if (l[j] > l[j + 1]){
swap(l[j], l[j + 1]);
sum++;
}
}
}
cout << sum << endl;
}
}
|
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int num[10000]={0},cnt=0;
num[n]=11000000;
for(int i=0;i<n;i++)cin>>num[i];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(num[j]>num[j+1]){
swap(num[j],num[j+1]);
cnt++;
}
}
}
cout<<cnt<<endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){int n,i;while(cin>>n&&n){int a[n];int r=0;for(i=0;i<n;)cin>>a[i++];for(i=n-1;i>0;i--){for(int j=1;j<=i;j++){if(a[j-1]>a[j]){swap(a[j-1],a[j]);r++;}}}cout<<r<<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)
int main() {
int n;
while (cin >> n, n) {
vector<int> a(n);
REP(i, n) scanf("%d", &a[i]);
int ans = 0;
REP(i, n) FOR(j, 1, n - i) {
if (a[j] < a[j - 1]) {
swap(a[j], a[j - 1]);
ans++;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n,a;
int count=0;
std::deque<int> deq;
while (cin>>n) {
if (n==0) {
break;
} else {
for (int i=0;i<n;i++) {
cin>>a;
deq.emplace_back(a);
}
for (int j=0;j<n;j++) {
for (int k=0;k<n-1;k++) {
if (deq[k]>deq[k+1]) {
swap(deq[k],deq[k+1]);
count++;
}
}
}
cout<<count<<endl;
count=0;
deq.clear();
}
}
}
|
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <functional>
#include <algorithm>
using namespace std;
int main()
{
int n, a[100];
while(cin >> n && n) {
for(int i = 0; i < n; i++) {
cin >> a[i];
}
int ret = 0;
for(int i = 0; i < n - 1; i++) {
for(int j = 0; j < n - 1 - i; j++) {
if(a[j] > a[j + 1]) {
swap(a[j], a[j + 1]);
ret++;
}
}
}
cout << ret << endl;
}
}
|
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <iostream>
#include <sstream>
#include <climits>
#include <cfloat>
#include <complex>
using namespace std;
int main()
{
int n;
while (scanf("%d", &n), n)
{
int arr[100];
for (int i = 0; i < n; ++i)
scanf("%d", arr+i);
int ans = 0;
for (int i = n-1; i > 0; --i)
{
for (int j = 0; j < i; ++j)
{
if (arr[j] > arr[j+1])
{
swap(arr[j], arr[j+1]);
++ans;
}
}
}
printf("%d\n", ans);
}
return 0;
}
|
#include <stdio.h>
int swap(int *x, int *y)
{
int tmp = *x;
*x = *y;
*y = tmp;
return (0);
}
int bsort(int *data, int last)
{
int count = 0;
for (int i = 0; i < last; i++){
if (data[i] > data[i + 1]){
swap(data + i, data + i + 1);
count++;
}
}
return (count);
}
int main()
{
int array[128];
int n, i;
while (scanf("%d", &n), n){
for (i = 0; i < n; i++){
scanf("%d", array + i);
}
int sum = 0;
for (i = 1; i < n; i++){
sum += bsort(array, n - i);
}
printf("%d\n", sum);
}
return (0);
}
|
#include<iostream>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n == 0) break;
int A[n];
for(int i = 0; i < n; i++) cin >> A[i];
int cnt = 0;
for(int i = n-1; i > 0; i--){
for(int j = 0; j < i; j++){
if(A[j] > A[j+1]){
swap(A[j], A[j+1]);
cnt++;
}
}
}
cout << cnt << endl;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int size, A[100], k;
while( cin >> size ) {
if( size == 0)
break;
k = 0;
for(int i=0;i<size;i++)
cin >> A[i];
for(int j = size-1; j > 0; j--)
for(int i = 0; i < j; i++)
if(A[i] > A[i + 1]) {
swap(A[i], A[i + 1]);
k++;
}
cout << k << "\n";
}
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int i,n,num[1000001];
while(1){
cin >> n;
if(n==0)break;
for(i = 0; i < 1000001; i++){
num[i]=0;
}
for(i = 0;i < n; i++){
cin >> num[i];
}
int cnt=0;
for(i = 0; i < n; i++){
for(int j = 0; j < n-1; j++){
if(num[j] > num[j+1]){
cnt++;
swap(num[j],num[j+1]);
}
}
}
cout << cnt << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
long n,a[100],t,i,j,k;
while(cin>>n){
if(n==0)break;
for(i=0;i<n;i++)cin>>a[i];
for(k=0,j=n-1;j>0;j--)
for(i=0;i<j;i++){
if(a[i]>a[i+1]){t=a[i];a[i]=a[i+1];a[i+1]=t;k++;}
}
cout<<k<<endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int bubble(vector<int> &vec,int to,int changes){
if(to==0) return changes;
for(int i=0;i<to;i++){
if(vec[i] > vec[i+1]){
int tmp = vec[i];
vec[i] = vec[i+1];
vec[i+1] = tmp;
changes++;
}
}
return bubble(vec,to-1,changes);
}
int main(){
int n = 0;
while(cin >> n && n != 0){
vector<int> vec;
for(int i=0;i<n;i++){
int x;
cin >> x;
vec.push_back(x);
}
cout << bubble(vec,vec.size()-1,0) << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
while(cin >> n, n) {
vector<int> v(n);
for(int i = 0; i < n; i++) cin >> v[i];
int ans = 0;
for(int i = n-1; i >= 0; i--) {
for(int j = 0; j < i; j++) {
if(v[j] > v[j+1]) {
swap(v[j], v[j+1]);
ans++;
}
}
}
cout << ans << endl;
}
}
|
#include<iostream>
#define MAX 100
using namespace std;
int ans;
void BubbleSort(int *a, int n){
if(n==1)return;
for(int i=0;i<n;i++){
for(int j=0;j<n-i-1;j++){
if(a[j]>a[j+1]){
swap(a[j], a[j+1]);
++ans;
}
}
}
}
int main(){
while(true){
int n;
int a[MAX];
scanf("%d", &n);
if( n==0 ) break;
for(int i=0;i<n;++i){
int t;
scanf("%d", &t);
a[i]=t;
}
ans=0;
BubbleSort(a,n);
printf("%d\n", ans);
}
return 0;
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n,i,j,k,d[100];
while(cin >> n) {
if (n==0) break;
for (i=0;i<n;i++) cin >> d[i];
k=0;
for (i=1;i<n;i++) for (j=0;j<n-i;j++) if (d[j]>d[j+1]) { swap(d[j],d[j+1]); k++;}
cout << k << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){int n,t,i;while(cin >> n && n){int a[n];int r=0;for(i=0;i<n;i++)cin >> a[i];for(i=n-1;i>0;i--){for(int j=1;j<=i;j++){if(a[j-1]>a[j]){swap(a[j-1],a[j]);r++;}}}cout<<r<<endl;}}
|
#include<iostream>
using namespace std;
int main()
{
int n,i,j,ans,array[1000];
for(;;)
{
cin >> n;
if(n==0)
break;
ans=0;
for(i=0;i<n;i++)
cin >> array[i];
for(;n>1;)
{
for(i=0;i<n-1;i++)
{
if(array[i]>array[i+1])
{
int a;
a=array[i];
array[i]=array[i+1];
array[i+1]=a;
ans++;
}
}
n--;
}
cout << ans << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int data[114];
for(int i=0;i<n;i++)cin>>data[i];
int ans=0;
while(1){
int flg=1;
for(int i=0;i<n-1;i++){
if(data[i]>data[i+1])flg=0;
}
if(flg)break;
for(int i=0;i<n-1;i++){
if(data[i]>data[i+1]){
swap(data[i],data[i+1]);
ans++;
}
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
while(cin >> n, n) {
int a[128];
bool flag = true;
int ans = 0;
for(int i = 0; i < n; i++)
cin >> a[i];
while(flag) {
flag = false;
for(int i = 0; i < n - 1; i++) {
if(a[i] > a[i + 1]) {
int tmp = a[i];
a[i] = a[i + 1];
a[i + 1] = tmp;
ans++;
flag = true;
}
}
}
cout << ans << endl;
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.