text
stringlengths 49
983k
|
|---|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
while(1){
cin >>n;
if(n == 0) break;
int dx[101] = {0};
for(int i = 0; i < n; i++){
cin >>dx[i];
}
int comp = n, cnt = 0;
while(comp != 1){
for(int i = 0; i < (comp - 1); i++){
if(dx[i] > dx[i + 1]){
swap(dx[i], dx[i + 1]);
cnt++;
}
}
comp--;
}
cout <<cnt <<endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
#define rep(i, n) for(int i = 0; i < int(n); i++)
int BIT[1000001];
int sum(int idx)
{
int ret = 0;
while (idx > 0)
{
ret += BIT[idx];
idx -= idx & -idx;
}
return ret;
}
const int N = 1000000;
void add(int idx, int num)
{
while (idx <= N)
{
BIT[idx] += num;
idx += idx & -idx;
}
}
signed main()
{
int n;
while (cin >> n && n)
{
memset(BIT, 0, sizeof(BIT));
int ans = 0;
vector<int> arr(n);
rep(i, n) cin >> arr[i];
rep(i, n)
{
ans += i - sum(arr[i]);
add(arr[i], 1);
}
cout << ans << endl;
}
return 0;
}
|
#include<stdio.h>
#include<string.h>
int ele[1000000],i,j,n,c,t;
int main(){
while(0<=scanf("%d",&n)){
if(n==0)break;
c=0;
for(i=0;i<n;i++){
scanf("%d",&ele[i]);
}
for(i=0;i<n;i++){
for(j=0;j<n-1;j++){
if(ele[j]>ele[j+1]){
++c;
t=ele[j];
ele[j]=ele[j+1];
ele[j+1]=t;
}
}
}
printf("%d\n",c);
}
return 0;
}
|
#include <iostream>
#include <math.h>
#include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
#include <queue>
using namespace std;
int main()
{
int n;
int a[100];
while (cin >> n)
{
if (n == 0)
{
return 0;
}
int cnt = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int i = 0 ; i < n ; i++)
{
for (int j = 0; j < n - 1 - i; j++)
{
if (a[j] > a[j + 1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
cnt++;
}
}
}
cout << cnt << endl;
}
sort(a, a + n);
for (int i = 0; i < n; i++)
{
cout << a[i];
if ( i != n - 1)
{
cout << " ";
}
}
cout << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
static const double eps = 1e-8;
int n;
int cnt;
int main(){
while(cin>>n&&n){
int A[n];
for (int i = 0; i < n; ++i) {
cin>>A[i];
}
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;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while(cin >> N && N) {
vector<int> vec(N);
for(int i=0; i<N; i++) cin >> vec[i];
int cnt = 0;
for(int i=0; i<N; i++) {
for(int j=0; j<N-i-1; j++) {
if(vec[j] > vec[j+1]) {
cnt ++;
swap(vec[j], vec[j+1]);
}
}
}
cout << cnt << endl;
}
return 0;
}
|
#include <stdio.h>
int main (void){
int a,c,i,j,n;
for(;;){
scanf("%d",&n);
if(n==0)break;
int b[101]={},ans=0;
for(i=0;i<n;i++){
scanf("%d",&a);
b[i]=a;
}
for(i=1;i<n;i++){
for(j=1;j<n;j++){
if(b[j-1]>=b[j]){
if(b[j-1]>b[j]){
ans++;
}
c=b[j-1];
b[j-1]=b[j];
b[j]=c;
}
}
}
printf("%d\n",ans);
}
return 0;
}
|
#include <iostream>
using namespace std;
int bubble_sort(int date[], int n){
int count = 0;
for(int i=0;i<n-1;i++){
for(int j=n-1;j>i;j--){
if(date[j]<date[j-1]){
int tmp = date[j];
date[j] = date[j-1];
date[j-1] = tmp;
count++;
}
}
}
return(count);
}
int main(void)
{
int n;
int date[100];
while(cin>>n){
if(!n) break;
for(int i = 0; i < n; i++){
cin >> date[i];
}
cout << bubble_sort(date,n) << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int a[100];
int main() {
int n;
while (cin >> n, n) {
rep(i, n)scanf("%d", &a[i]);
int cnt = 0;
bool flag = true;
for (int i = 0; flag; i++) {
flag = false;
for (int j = n - 1; j >= i + 1; j--) {
if (a[j] < a[j - 1]) {
swap(a[j], a[j - 1]);
flag = true;
cnt++;
}
}
}
cout << cnt << endl;
}
}
|
#include <iostream>
int bubblesort(int* a, int n)
{
int res = 0;
for (int i=n-1; i>=0; i--) {
for (int j=0; j<i; j++) {
if (a[j] > a[j+1]) {
std::swap(a[j], a[j+1]); res++;
}
}
}
return res;
}
int main()
{
int n;
while (true) {
std::cin >> n;
if (n==0) break;
int* a = new int[n];
for (int i=0; i<n; i++) std::cin >> a[i];
std::cout << bubblesort(a, n) << std::endl;
delete[] a;
}
return 0;
}
|
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define PB push_back
#define INF INT_MAX/3
#define ALL(a) (a).begin(),(a).end()
#define CLR(a) memset(a,0,sizeof(a))
typedef long long int ll;
using namespace std;
int ans;
void bubblesort(vector<int>& a){
REP(i,a.size()){
for(int j=0;j<a.size()-1;j++){
if(a[j] > a[j+1]){
swap(a[j],a[j+1]);
ans++;
}
}
}
}
int main(){
while(true){
int n;
vector<int> a;
ans = 0;
cin >> n;
if(n == 0) break;
REP(i,n){
int temp;
cin >> temp;
a.PB(temp);
}
bubblesort(a);
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n, a[101];
while( cin >> n , n ){
for(int i=0 ; i < n ; i++ )
cin >> a[i];
int ans = 0;
for(int j=n-1 ; j > 0 ; j-- ){
for(int i=1 ; i <= j ; i++ ){
if( a[i-1] > a[i] ){
swap( a[i-1] , a[i] );
ans++;
}
}
}
cout << ans << endl;
}
}
|
#include <iostream>
#include <vector>
using namespace std;
typedef vector <int> VI;
int main( void )
{
int n;
while ( cin >> n && n )
{
int swap_count = 0;
VI E(n);
for ( int i = 0; i < n; i++ ) cin >> E[i];
for ( int i = 0; i < n; i++ )
{
for ( int j = 1; j < n-i; j++ )
{
if ( E[j-1] > E[j] )
{
swap( E[j-1], E[j] );
swap_count ++;
}
}
}
cout << swap_count << endl;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
for(int n;cin>>n,n;) {
int dat[100];
for(int i=0;i<n;i++)
cin>>dat[i];
int ans = 0;
for(int i=0;i<n-1;i++)
for(int j=n-1;j>i;j--)
if(dat[j-1]>dat[j]) swap(dat[j-1],dat[j]), ans++;
cout<<ans<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
const int MAX_N=100;
int N;
int a[MAX_N];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
do{
cin>>N;
if (N){
REP(i,N){
cin>>a[i];
}
int ans=0;
REP(i,N){
REP(j,N-i-1){
if (a[j]>a[j+1]){
ans++;
swap(a[j],a[j+1]);
}
}
}
cout<<ans<<endl;
}
}while (N);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
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+1 < n-i; ++j) {
if(a[j] > a[j+1]) {
swap(a[j], a[j+1]);
++ans;
}
}
}
cout << ans << endl;
}
}
|
#include <iostream>
#define MAX 10
using namespace std;
int num[MAX];
int bubble_sort(int n){
int cnt = 0;
for( int i = 0 ; i < n - 1 ; i++ ){
for( int j = n - 1 ; j > i ; j-- ){
if( num[j - 1] > num[j] ){
int temp = num[j - 1];
num[j - 1] = num[j];
num[j] = temp;
cnt++;
}
}
}
return cnt;
}
int main(void){
int n;
while( cin >> n , n ){
for( int i = 0 ; i < MAX ; i++ ) num[i] = 0;
for( int i = 0 ; i < n ; i++ ){
cin >> num[i];
}
cout << bubble_sort(n) << endl;
}
return 0;
}
|
#define _USE_MATH_DEFINES
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<list>
#include<stack>
#include<queue>
#include<cctype>
#include<iomanip>
#include<functional>
#include<numeric>
#include<map>
#include<set>
#include<complex>
#define EPS 1e-10
using namespace std;
typedef long long llong;
int main() {
int n;
while (cin >> n, n) {
vector<int>v(n);
for (int i = 0; i < n; i++)cin >> v[i];
int cnt = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = n - 1; i < j; j--) {
if (v[j - 1] > v[j]) {
swap(v[j - 1], v[j]);
cnt++;
}
}
}
cout << cnt << endl;
}
return 0;
}
|
#include <cstdio>
using namespace std;
int bsort(int *a, int n) {
int t, c = 0;
for (int i=0; i<n-1; i++) {
for (int j=0; j<n-i-1; j++) {
if (a[j] > a[j+1]) {
t = a[j];
a[j] = a[j+1];
a[j+1] = t;
++c;
}
}
}
return c;
}
int main() {
int n, a[100];
while (1) {
scanf("%d", &n);
if (!n) break;
for (int i=0; i<n; i++) {
scanf("%d", &a[i]);
}
printf("%d\n", bsort(a, n));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, res;
while (cin >> n, n) {
vector<int> v;
v.reserve(n);
for (int i = 0, tmp; i < n; i++) {
cin >> tmp;
v.push_back(tmp);
}
bool flag = true;
res = 0;
while (flag) {
flag = false;
for (int i = 0, tmp;i < v.size() - 1;i++) {
if (v[i] > v[i + 1]) {
tmp = v[i];
v[i] = v[i + 1];
v[i + 1] = tmp;
flag = true;
res++;
}
}
}
cout << res << endl;
}
return 0;
}
|
#include<iostream>
int a[100];
int main()
{
int n;
while( std::cin >> n, n )
{
for( int i = 0; i != n; ++i )
std::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] )
std::swap( a[j], a[j+1] ), ++ans;
std::cout << ans << std::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 (int i = 0; i < (n); i++)
int main()
{
int n;
while (cin >> n, n){
int a[n], cnt = 0;
REP(i, n) cin >> a[i];
for (int i = n; i > 0; i--){
for (int j = 0; j < i - 1; j++){
if (a[j] > a[j + 1]){
swap(a[j], a[j + 1]);
cnt++;
}
}
}
cout << cnt << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,tmp;
while(cin>>n,n){
int a[100],r=n-1,cnt=0;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n-1;i++){
for(int j=0;j<r;j++){
if(a[j]>a[j+1]){
tmp=a[j];a[j]=a[j+1];a[j+1]=tmp;
cnt++;
}
}
r--;
}
cout<<cnt<<endl;
}
}
|
#include<iostream>
#include<cassert>
#include <algorithm>
using namespace std;
int a[201],w[201],n;
int merge_and_count(int l,int r){
if(l+1>=r)return 0;
if(l+2==r){
if(a[l]<=a[l+1])return 0;
else{
swap(a[l],a[l+1]);
return 1;
}
}
int m= (l+r)/2;
int cl=merge_and_count(l,m);
int cr=merge_and_count(m,r);
int ret=cl+cr;
int i=l,j=m,k=l;
while(i<m&&j<r&&k<r){
if(a[i]<=a[j])w[k++]=a[i++];
else{
w[k++]=a[j++];
ret+=m-i;
}
}
while(i<m)w[k++]=a[i++];
while(j<r)w[k++]=a[j++];
assert(k==r);
for(i=l;i<r;i++){
a[i]=w[i];
}
//cout<<"marge"<<l<<" "<<r<<" "<<ret<<endl;
return ret;
}
int main(){
while(cin>>n&&n){
for(int i=0;i<n;i++){
cin>>a[i];
}
cout<<merge_and_count(0,n)<<endl;
}
}
|
#include<iostream>
using namespace std;
int main(){
int t,n;
long long int bell[100],tmp;
while(1){
t=0;
cin >> n;
if(n==0){
break;
}
for(int i=0;i<n;i++){
cin >> bell[i];
}
for(int i=0;i<n-1;i++){
for(int j=n-1;j>i;j--){
if(bell[j]<bell[j-1]){
tmp=bell[j];
bell[j]=bell[j-1];
bell[j-1]=tmp;
t++;
}
}
}
cout << t << 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;
int main()
{
int n, a[1005];
while (1)
{
cin >> n; if (n == 0){ break; }
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;
}
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int inversion(int a[],int n){
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++;
}
}
}
return cnt;
}
int main(){
int a[100],n;
while(cin>>n&&n){
for(int i=0;i<n;i++){
cin>>a[i];
}
cout<<inversion(a,n)<<endl;
}
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
int n, a[100], ct = 0;
int main()
{
while (1){
cin >> n;
if (n == 0) break;
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]);
ct++;
}
}
cout << ct << endl;
ct = 0;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#define rep(i,l,n) for(lint i=l;i<n;i++)
#define rer(i,l,n) for(lint i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a)
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef vector<lint> vli;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
int main(){
while(1){
int n;
cin>>n;
if(n==0) break;
vi d(n);
rep(i,0,n) cin>>d[i];
int ans=0,i=0;
bool f=1;
while(f){
f=0;
for(int j=n-1;j>i;j--){
if(d[j]<d[j-1]){
swap(d[j],d[j-1]);
f=1;
ans++;
}
}
i++;
}
o(ans);
}
}
|
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
bool solve() {
int n, arr[100000];
cin >> n;
if (n == 0) { return false; }
for (int j = 0; j < n; ++j) {
cin >> arr[j];
}
int ret = 0;
for (int j = 0; j < n; ++j) {
for (int k = j+1; k < n; ++k) {
if (arr[j] > arr[k]) {
++ret;
}
}
}
cout << ret << endl;
return true;
}
int main() {
while(solve());
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
while(1){
int n;
cin>>n;
if(!n)break;
vector<int> a(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-1;++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 num[1000001];
int BubbleSort(int n)
{
int k = 0, ct = 0;
bool flag = true;
do {
flag = true;
for (int i = 0; i < n - 1 - k; i++){
if (num[i] > num[i + 1]){
flag = false;
swap(num[i], num[i + 1]);
ct++;
}
}
k++;
}while (!flag);
return (ct);
}
int main()
{
int n;
while (cin >> n, n){
for (int i = 0; i < n; i++){
cin >> num[i];
}
int ct = BubbleSort(n);
cout << ct << endl;
}
return (0);
}
|
#include <iostream>
#include <vector>
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 = 0; i < n; ++i) {
for (int j = 0; j < i; ++j) {
if (v[j] > v[i]) ++ans;
}
}
cout << ans << endl;
}
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
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<iostream>
using namespace std;
//配列の要素数
//#define MAX 1000000
#define MAX 100000
int h_input[MAX] = {0};
int main(void)
{
//入力変数
int n = 0;
while (true)
{
cin >> n;
if (n == 0) { return 0; }
for (int i = 0; i < n; i++)
{
cin >> h_input[i];
}
//カウント変数
int count = 0;
for (int i = n - 1; i >= 0; i--)
{
for (int j = 1; j <= i; j++)
{
if (h_input[j - 1] > h_input[j])
{
int tmp = h_input[j];
h_input[j] = h_input[j - 1];
h_input[j - 1] = tmp;
count++;
}
}
}
cout << count << endl;
}
return 0;
}
|
#include<iostream>
int main(){
const int MAX_N = 100;
int n, a[MAX_N];
while(std::cin >> n, n){
for(int i=0;i<n;i++){
std::cin >> a[i];
}
int t = 0;
while(true){
bool update = false;
for(int i=0;i<n-1;i++){
if(a[i] > a[i+1]){
std::swap(a[i], a[i+1]);
t++;
update = true;
}
}
if(!update){
break;
}
}
std::cout << t << std::endl;
}
}
|
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
int main() {
int n;
while(cin >> n, n){
vector<int> v(n);
for (auto &&i : v) scanf("%d", &i);
int ans = 0;
for (int i = 0; i < n; ++i) {
for (int j = i+1; j < n; ++j) {
if(v[i] > v[j]) ans++;
}
}
cout << ans << "\n";
}
return 0;
}
|
#include <iostream>
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 = N-1; j >= i+1; 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 <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
int main() {
int n;
while (cin >> n && n) {
int a[n];
REP(i, n) cin >> a[i];
int ans = 0;
REP(i, n) for (int j = i + 1; j < n; ++j) {
if (a[i] > a[j]) ans++;
}
cout << ans << endl;
}
return 0;
}
|
#include <stdio.h>
#include <iostream>
using namespace std;
int main() {
int v[100];
int n;
int kari;
int counter;
while (cin >> n) {
if (n == 0) {
break;
}
counter = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = n-1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (v[j] > v[j+1]) {
kari = v[j];
v[j] = v[j+1];
v[j+1] = kari;
counter++;
}
}
}
cout << counter << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
using namespace std;
int main(int, char**){
int x;
while(cin >> x,x){
int vec[128];
int cnt(0);
for(int i(0);i<x;++i){
cin >> vec[i];
}
for(int i(x-1);i>0;--i){
for(int j(0);j<i;++j)
if(vec[j] > vec[j+1]){ swap(vec[j],vec[j+1]); ++cnt; }
}
cout << cnt << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main (){
int n,i,a[110],temp,count=0,j;
while(1){
count=0;
cin >> n;
if(n==0)break;
for(i=0;i<n;i++){
cin >> a[i];
}
for(i=0;i<n;i++){
for(j=n-1;j>i;j--){
if(a[j-1]>a[j]){
temp=a[j];
a[j]=a[j-1];
a[j-1]=temp;
count++;
}
}
}
cout << count << endl;
}
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int bubblesort(int arr[], int n){
int cnt = 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]);
cnt++;
}
}
}
return cnt;
}
int main(void){
int n;
while(cin >> n, n != 0){
int *arr = new int[n];
for(int i = 0; i < n; i++){
cin >> arr[i];
}
int cnt = bubblesort(arr, n);
cout << cnt << endl;
}
return 0;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
#define MAX 1000000
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(1){
cin >> n;
if(n == 0) break;
for(int i = 0 ; i < n ; i++) cin >> array[i];
int ans = 0;
ans = bubble_sort(n,array);
cout << ans << endl;
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<utility>
#include<cmath>
using namespace std;
#define all(a) a.begin(),a.end()
int main()
{
int n;
while(cin>>n&&n)
{
vector<int> a;
for(int i=0;i<n;i++)
{
int x;cin>>x;
a.push_back(x);
}
int ans=0;
bool ok=true;
while(ok)
{
ok=false;
for(int i=0;i<n-1;i++)
{
if(a[i]>a[i+1])
{
ans++;ok=true;
swap(a[i],a[i+1]);
}
}
}
cout<<ans<<endl;
}
}
|
#include <cstdio>
#include <vector>
using namespace std;
int main(){
int n;
while(scanf("%d", &n), n){
vector<int> v(n);
for(int i = 0; i < n; ++i){
scanf("%d", &v[i]);
}
int ans = 0;
for(int i = 0; i < n; ++i){
for(int j = 0; j < i; ++j){
if(v[j] > v[i]){
++ans;
}
}
}
printf("%d\n", ans);
}
}
|
#include<iostream>
#include<algorithm>
using namespace std;
void sort(int A[], int C, int N){
int c=0;
for(int i=0;i<N-1;i++){
if(A[i]>A[i+1]){
swap(A[i],A[i+1]);
c++;
}
}
if(c==0) cout << C << endl;
else{
C+=c;
sort(A,C,N);
}
}
int main(){
int n;
while(cin >> n,n){
int a[n],count=0;
for(int i=0;i<n;i++) cin >> a[i];
sort(a,count,n);
}
}
|
#include <iostream>
#include <vector>
using namespace std;
int bubble(vector<int>, vector<int>&);
int main() {
do {
int n;
cin >> n;
if(n == 0) break;
vector<int> nums;
for(int i = 0; i < n; ++i) {
int buff;
cin >> buff;
nums.push_back(buff);
}
int count = 0;
for(int i = 0; i < n - 1; ++i) {
vector<int> result;
count += bubble(nums, result);
nums = result;
}
cout << count << endl;
} while(true);
return 0;
}
int bubble(vector<int> nums, vector<int> &result) {
int size = nums.size();
int buff = nums[0];
int count = 0;
for(int i = 0; i < size - 1; ++i) {
if(buff > nums[i + 1]) ++count;
result.push_back(min(buff, nums[i + 1]));
buff = max(buff, nums[i + 1]);
}
result.push_back(buff);
return count;
}
|
#include <stdio.h>
#include <iostream>
using namespace std;
int main() {
int n;
int k[100];
int kari;
int counter;
while(cin >> n) {
if (n == 0) {
break;
}
counter = 0;
for (int i = 0; i < n; i++) {
cin >> k[i];
}
for (int i = n-1; i > 0; i--) {
for (int j = 0; j< i; j++) {
if (k[j] > k[j+1]) {
kari = k[j];
k[j] = k[j+1];
k[j+1] = kari;
counter++;
}
}
}
cout << counter << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
vector<int> v(N);
for (auto& i : v) cin >> i;
int count = 0;
while (1) {
bool flag = false;
for (int i = 0; i < v.size()-1; i++) {
if (v[i] > v[i+1]) {
count++;
swap(v[i], v[i+1]);
flag = true;
}
}
if (!flag) break;
}
cout << count << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int n;
int v[10000];
int main(){
while(cin>>n, n){
for(int i=0; i<n; ++i){
cin>>v[i];
}
int step = 0;
for(int i=n; i>0; --i){
for(int j=0; j<i-1; ++j){
if(v[j] > v[j+1]){
swap(v[j], v[j+1]);
step++;
}
}
}
cout << step << endl;
}
return 0;
}
|
#include<stdio.h>
int main(){
int n,k;
int i,j;
int count;
while(scanf("%d",&n)){
if(n==0) break;
int index[n];
count = 0;
for(i=0;i<n;i++) scanf("%d",&index[i]);
for(i=n-1;i>0;i--){
for(j=0;j<i;j++){
if(index[j]>index[j+1]){
k = index[j];
index[j] = index[j+1];
index[j+1] = k;
count++;
}
}
}
printf("%d\n",count);
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0) {
break;
}
int* array = new int [n];
for (int i = 0; i < n; i++) {
cin >> array[i];
}
int count = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - 1 - i; j++) {
if (array[j + 1] < array[j]) {
int temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
count++;
}
}
}
cout << count << endl;
delete[] array;
}
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define MAX 110
int main(){
int n;
int list[MAX];
while(cin>>n,n){
int ans=0;
for(int i=0;i<n;i++){
cin>>list[i];
}
for(int i=0;i<n;i++){
for(int j=0;j<n-i-1;j++){
if(list[j]>list[j+1]){
swap(list[j],list[j+1]);
ans++;
}
}
}
cout<<ans<<endl;
}
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; ++i)
{
for(int j = 0 ; j < n - i - 1; ++j)
{
if(Vec[j] > Vec[j + 1])
{
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<string>
using namespace std;
int a[100];
int main(){
int n;
while(true){
cin>>n;
if(n==0)
break;
for(int i=0;i<n;i++)
cin>>a[i];
int ans=0;
for(int i=0;i<n-1;i++){
for(int j=n-1;j>i;j--){
if(a[j]<a[j-1]){
int tmp=a[j];
a[j]=a[j-1];
a[j-1]=tmp;
ans++;
}
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include <stdio.h>
int n, a[100];
int main() {
while(true) {
scanf("%d", &n);
if(n == 0) break;
for(int i = 0; i < n; i++) scanf("%d", &a[i]);
int ret = 0;
for(int i = 0; i < n; i++) {
for(int j = 0; j < i; j++) {
if(a[i] < a[j]) {
ret++;
}
}
}
printf("%d\n", ret);
}
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,res;
int a[100];
while(1){
cin >> n;
if(!n)break;
for(int i=0;i<n;i++)cin >> a[i];
res = 0;
for(int i=n-1;i>0;i--){
for(int j=0;j<i;j++){
if(a[j]>a[j+1]){
res++;
swap(a[j],a[j+1]);
}
}
}
cout << res << endl;
}
}
|
#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);
}
return 0;
}
|
#include <iostream>
#include <string.h>
using namespace std;
//BIT
long bit[1000001],n;
long MAX;
long sum(int i){
long s=0;
while(i>0){
s+=bit[i];
i-=i&-i;
}
return s;
}
void add(long i,long x){
while(i<=MAX){
bit[i]+=x;
i+=i&-i;
}
}
long a[100];
bool input(){
cin >> n; if(!n) return false;
for(int i=0;i<n;i++) cin >> a[i];
MAX=a[0];
for(int i=0;i<n;i++) MAX=max(MAX,a[i]);
return true;
}
int main() {
while(input()) {
long long ans=0;
for(int i=0;i<n;i++) {
ans+=i-sum(a[i]);
add(a[i],1);
}
cout << ans << '\n' ;
memset(bit,0,sizeof(bit)); memset(a,0,sizeof(a));
}
}
|
#include <iostream>
using namespace std;
int data[101];
int main()
{
int n;
while(cin >> n){
if(n==0)
break;
for(int i=0;i<n;i++){
cin >> data[i];
}
int cnt = 0;
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if(data[j] < data[j-1]){
int tmp = data[j];
data[j] = data[j-1];
data[j-1] = tmp;
cnt++;
}
}
}
cout << cnt << endl;
}
return 0;
}
|
//16
#include<iostream>
#include<algorithm>
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 ans=0;
bool up;
do{
up=false;
for(int i=0;i<n-1;i++){
if(a[i]>a[i+1]){
ans++;
up=true;
swap(a[i],a[i+1]);
}
}
}while(up);
cout<<ans<<endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
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 = 0; i < n; ++i) {
for (int j = i+1; j < n; ++j) {
if (v[j] < v[i]) ++ans;
}
}
cout << ans << endl;
}
}
|
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<cctype>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
using namespace std;
const int dx[] = {1,0,-1,0} , dy[] = {0,1,0,-1};
#define INF 999999
int main(){
int n;
while(scanf("%d",&n),n){
int so[128]={0};
for(int i = 0; i < n; i++)scanf("%d",&so[i]);
int cnt = 0;
for(int i = n-1; i > 0; i--){
for(int j = 1; j <= i; j++){
if(so[j] < so[j-1]){
swap(so[j],so[j-1]);
cnt++;
}
}
}
printf("%d\n",cnt);
}
return 0;
}
|
#include<iostream>
using namespace std;
int main() {
int n,c,s;
while(cin>>n){
if(n==0) break;
int a[n];
for(c=0;c<n;c++) cin>>a[c];
c=0;
for(int i=0; i<n; i++)
for(int j=0; j<n-i-1; j++)
if(a[j] > a[j+1])s=a[j+1],a[j+1]=a[j],a[j]=s,c++;
cout<<c<<"\n";
}
}
|
#include<iostream>
using namespace std;
int main(){
int n;
while(cin >> n, n){
int a[1000],tmp,count = 0;
for(int i=0;i<n;i++) cin >> a[i];
for(int i=0;i<n-1;i++){
for(int j=n-1;j>i;j--){
if(a[j] < a[j-1]){
tmp = a[j];
a[j] = a[j-1];
a[j-1] = tmp;
count++;
}
}
}
cout << count << endl;
}
}
|
#include <iostream>
#include <algorithm>
using namespace std;
#define MAX_N 101
int a[MAX_N];
int main() {
int n;
while (cin >> n) {
if (n == 0) break;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int count = 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]);
count++;
}
}
}
cout << count << endl;
}
return 0;
}
|
#include<stdio.h>
int main()
{
int n,a[100],i,j,c;
while(scanf("%d",&n),n)
{
for(i=0; i<n; ++i) scanf("%d",&a[i]);
for(c=i=0; i<n; ++i) for(j=1; j<n; ++j) if(a[j-1]>a[j]) a[j-1]^=a[j],a[j]^=a[j-1],a[j-1]^=a[j],++c;
printf("%d\n",c);
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n;
int sort[1000000];
while (cin >> n, n) {
int cnt = 0;
for (int i = 0; i < n; i++)
cin >> sort[i];
for (int i = n - 1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (sort[j] > sort[j + 1]) {
swap(sort[j], sort[j + 1]);
cnt++;
}
}
}
cout << cnt << endl;
}
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main(){
int a[100];
int n;
while(scanf("%d",&n) && n != 0){
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
int swap = 0;
for(int i=n-1;i>0;i--){
for(int j=0;j<i;j++){
if(a[j]>a[j+1]){
int temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
swap++;
}
}
}
cout<<swap<<endl;
}
return 0;
}
|
#include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
int n;
while(cin>>n){
if(n==0)break;
int dt[n];
rep(i,n){
cin>>dt[i];
}
int cnt=0;
while(1){
if(n==1)break;
rep(i,n-1){
if(dt[i]>dt[i+1]){
int alt=dt[i];
dt[i]=dt[i+1];
dt[i+1]=alt;
cnt++;
}
}
n--;
}
cout<<cnt<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int BubbleData[100];
void judge(const int n) {
int cnt,tmp;
cnt = 0;
for (int i = n; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (BubbleData[j] > BubbleData[j + 1]) {
cnt++;
tmp = BubbleData[j];
BubbleData[j] = BubbleData[j + 1];
BubbleData[j + 1] = tmp;
}
}
}
cout << cnt << endl;
}
int main(void) {
int n;
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
cin >> BubbleData[i];
}
judge(n-1);
}
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int n, m[100], i, j, c;
while (cin >> n && n)
{
c = 0;
for (i = 0; i < n; i++)
cin >> m[i];
for (i = 0; i < n; i++)
{
for (j = 0; j < n-1; j++)
{
if (m[j] > m[j+1])
{
swap(m[j], m[j+1]);
c++;
}
}
}
cout << c << endl;
}
}
|
#include<iostream>
using namespace std;
int n, cnt;
int a[100000];
void _swap(int p, int q, int v, int w) {
int c, d;
c = p;
d = q;
p = d;
q = c;
a[v] = p;
a[w] = q;
}
int main() {
while (true){
cnt = 0;
cin >> n;
if (n == 0) { break; }
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 1; i >= 0; i--){
for (int j = 0; j < i; j++) {
if (a[j] > a[j + 1]) {
cnt++;
_swap(a[j], a[j + 1], j, j + 1);
}
}
}
cout << cnt << endl;
}
}
|
#include<stdio.h>
#include<algorithm>
#include<string.h>
#define rep(i,j) for(int i=0;i<(j);i++)
#define reps(i,j,k) for(int i=j;i<=k;i++)
using namespace std;
int main(){
int n,v[100],cnt;
for(;;){
scanf("%d",&n);
if(n==0)break;
rep(i,n)scanf("%d",v+i);
cnt=0;
for(int i=n-1;i>0;i--)reps(j,1,i)if(v[j]<v[j-1]){
swap(v[j],v[j-1]);
cnt++;
}
printf("%d\n",cnt);
}
return 0;
}
|
#include <iostream>
using namespace std;
int a[100];
int main(){
int n;
while(cin>>n && n){
int ans=0;
for(int i=0;i<n;i++){
cin>>a[i];
for(int j=0;j<i;j++){
if(a[j]>a[i])ans++;
}
}
cout << ans << endl;
}
}
|
#include <iostream>
using namespace std;
int main(void){
int n;
while(cin>>n,n){
int t[n];
for(int i=0;i<n;i++){
cin>>t[i];
}
if(n == 1){
cout<<0<<endl;
continue;
}
int ans = 0;
for(int i=0;i<n;i++){
for(int j=0;j<n-1;j++){
if(t[j] > t[j+1]){
ans++;
swap(t[j],t[j+1]);
}
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
int count = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (v[i] > v[j]) {
count++;
}
}
}
cout << count << endl;
}
}
|
#include<stdio.h>
int main(){
int num[100];
int i,j,k;
int ch;
int cnt = 0;
int n;
while(scanf("%d",&n),n){
for(i = 0; i < n; i++)
scanf("%d",&num[i]);
for(j = 0; j < n-1; j++){
for(k = 0; k < n-1-j; k++){
if(num[k] > num[k+1]){
ch = num[k];
num[k] = num[k+1];
num[k+1] = ch;
cnt++;
}
}
}
printf("%d\n",cnt);
cnt = 0;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n, cnt, tmp, v[100];
while(cin >> n){
if(n == 0) break;
cnt = 0;
for(int i=0; i<n; i++){
cin >> v[i];
}
for(int i=n-1; i>0; i--){
for(int j=0; j<i; j++){
if(v[j] > v[j+1]){
tmp = v[j];
v[j] = v[j+1];
v[j+1] = tmp;
cnt++;
}
}
}
cout << cnt << endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i = 0 ; i < a ; i ++)
int main(void){
int n;
while(cin>>n,n){
vector<int> v(n);
rep(i,n)cin>>v[i];
int cnt = 0;
rep(i,n){
for(int j = 0; j+1 < n-i; j++){
if(v[j] > v[j+1]){
swap(v[j],v[j+1]);
cnt++;
}
}
}
cout<<cnt<<endl;
}
return 0;
}
|
#include<iostream>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(void){
int n;
while(cin>>n,n){
int a[n],sum=0;
r(i,n)cin>>a[i];
r(i,n)for(int j=1;j<n;j++){
if(a[j-1]>a[j]){
swap(a[j-1],a[j]);
sum++;
}
}
cout<<sum<<endl;
}
}
|
#include <iostream>
using namespace std;
int main(){
int n;
int a[1000];
while( cin >> n,n){
for(int i = 0 ; i < n ; i++ )cin >> a[i];
int ans = 0;
for(int i = n-1 ; i >= 0 ; i-- ){
for(int j = 0 ; j < n - 1 ; j++ ){
if(a[j] > a[j + 1]){
swap(a[j],a[j + 1]);
ans++;
}
}
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <functional>
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 ll long long
//#define scanf scanf_s
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 <algorithm>
#include <array>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define INT_MAX 2000000000
#define INF 1000000000
#define MOD 1000000007
#define ll long long
#define rep(i,a,b) for(i = (a); i < (b); i++)
#define bitget(a,b) (((a) >> (b)) & 1)
using namespace std;
int i, j, k;
int main() {
int n;
int a[100000], b[100000];
cin >> n;
rep(i, 0, n)
cin >> a[i] >> b[i];
int c[100000] = {};
int d[100000] = {};
rep(i, 0, n)
d[i] = a[i] + b[i];
sort(d, d + n);
rep(i, 0, n) {
c[d[i] / 31] += (1 << (d[i] % 31));
if (c[d[i]/31] < 0) {
c[d[i]/31] = c[d[i]/31] & 2147483647;
c[d[i]/31+ 1] += 1;
}
}
rep(i, 0, 1000000) {
if (bitget(c[i / 31], i % 31) == 1) {
cout << i << " " << "0" << endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int cnt[1000000];
int main() {
int n; scanf("%d", &n);
rep(i, n) {
int a, b; scanf("%d%d", &a, &b);
cnt[a + b]++;
}
rep(i, 1000000 - 1) {
cnt[i + 1] += cnt[i] / 2;
if (cnt[i] & 1)printf("%d 0\n", i);
}
}
|
#include <stdio.h>
#include <set>
using namespace std;
int main(){
int n,a,b;
set<int> s;
scanf("%d",&n);
while(n--){
scanf("%d%d",&a,&b);
a+=b;
while(s.find(a)!=s.end()){
s.erase(a);
a++;
}
s.insert(a);
}
for(int i:s){
printf("%d %d\n",i,0);
}
}
|
#include <stdio.h>
#include <stdbool.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
bool flag[4000000];
int main(void) {
int i, j, k, n;
scanf("%d", &n);
rep(i, 4000000) flag[i] = false;
rep(i, n) {
int a, b;
scanf("%d%d", &a, &b);
a += b;
if(!flag[a]) flag[a] = true;
else {
for(j = a; i < 4000000; ++j) {
if(flag[j]) flag[j] = false;
else {
flag[j] = true;
break;
}
}
}
/*rep(j, 9) printf("%d ", flag[j] ? 1 : 0);
printf("\n");*/
}
rep(i, 4000000) if(flag[i]) printf("%d 0\n", i);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a, b, x[200099];
int main() {
cin >> n;
while(n--) {
cin >> a >> b;
x[a + b]++;
}
for(int i = 0; i <= 200029; i++) {
x[i + 1] += x[i] / 2; x[i] %= 2;
if(x[i] == 1) cout << i << ' ' << 0 << endl;
}
}
|
#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
constexpr int MAX = 300000;
int main()
{
int N,a,b;
vector<int> v(MAX, 0);
cin >> N;
while (N--) {
scanf("%d %d", &a, &b);
v[a + b]++;
}
for (int i = 0; i < (int)v.size(); i++) {
if (v[i] > 1) {
v[i + 1] += v[i] / 2;
v[i] = v[i] & 1;
}
if (v[i] == 1) {
printf("%d %d\n", i, 0);
}
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,a,b,i;
vector <int> amo;
cin>>n;
for(i=0;i<n;i++){
cin>>a>>b;
a+=b;
amo.push_back(a);
}
int test,from;
while(1){
test=0;
from=0;
sort(amo.begin(),amo.end());
for(i=0;amo[i]==-1;i++) from++;
for(i=from;i<amo.size()-1;i++){
if(amo[i]==amo[i+1]){
amo[i]=-1;
amo[i+1]++;
test++;
}
}
if(test==0) break;
}
for(i=from;i<amo.size();i++) cout<<amo[i]<<" 0"<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
const int M = 300000;
int dp[M] = {};
for(int i = 0; i < N; ++i) {
int a, b;
cin >> a >> b;
++dp[a + b];
}
for(int i = 0; i < M - 1; ++i) {
if(dp[i] & 1) cout << i << " " << 0 << endl;
dp[i + 1] += dp[i] / 2;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
priority_queue<int,vector<int>,greater<int> > a;
for(int i=0;i<n;i++){
int x,y;
cin >> x >> y;
a.push(x+y);
}
//sort(a.begin(),a.end());
int p1;
while(!a.empty()){
p1=a.top();a.pop();
if(a.empty()){
cout << p1 << " 0" << endl;
break;
}
else if(p1==a.top()){
a.pop();
a.push(p1+1);
}
else{
cout << p1 << " 0" << endl;
}
}
return 0;
}
|
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, a, b;
vector<int> v;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a >> b;
v.push_back(a + b);
}
sort(v.begin(), v.end());
while (1) {
int cnt = 1;
bool check = true;
vector<int> t;
for (int i = 0; i < v.size(); ++i) {
if (i != v.size() - 1 && v[i] == v[i + 1]) {
cnt++;
}
else {
if (cnt >= 2)
check = false;
if (cnt % 2 == 1)
t.push_back(v[i]);
for (int j = 0; j < cnt / 2; ++j) {
t.push_back(v[i] + 1);
}
cnt = 1;
}
}
if (check)
break;
v = t;
}
for (auto elem: v) {
cout << elem << " " << 0 << endl;
}
return 0;
}
|
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;
using namespace std;
int main(){
int N,table[200030],a,b,S,tmp;
for(int i = 0; i < 200030; i++)table[i] = 0;
scanf("%d",&N);
for(int loop = 0; loop < N; loop++){
scanf("%d %d",&a,&b);
table[a+b]++;
}
for(int i = 0; i < 200030; i++){
if(table[i] != 0){ //?????°???????§£??????
tmp = table[i];
table[i] = 0;
S = 2;
for(int k = 0; tmp != 0;k++,tmp /= S){
if(tmp%S == 1){
table[i+k]++;
}
}
}
}
for(int i = 0; i < 200030; i++){
if(table[i] != 0){
printf("%d 0\n",i); //0??§????????????1??????2????????§???0
}
}
return 0;
}
|
#include <iostream>
#include <set>
#include <map>
#include <queue>
using namespace std;
using llong = long long;
int n;
int a[100005];
int b[100005];
map<llong, llong> mp;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
mp[a[i] + b[i]]++;
}
llong x = -100;
while (mp.upper_bound(x) != mp.end()) {
x = mp.upper_bound(x)->first;
if (mp[x] >= 2) {
mp[x + 1] += mp[x] / 2;
mp[x] %= 2;
}
if (mp[x] == 0) {
mp.erase(x);
}
}
for (auto p:mp) {
cout << p.first << ' ' << 0 << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n;
int s[200020];
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
int x,y;
scanf("%d %d",&x,&y);
int z=x+y;
while(s[z]){
s[z]=0;
z++;
}
s[z]=1;
}
for(int z=0;z<200020;z++)
if(s[z])printf("%d 0\n",z);
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> V;
typedef pair<ll,ll> P;
typedef map<ll,ll> M;
#define REP(i,n) for(ll (i) = 0; (i) < (n); ++(i))
signed main(){
ll n;
cin >> n;
V a(n);
V b(n);
queue<ll> que;
V v(400000, 0);
REP(i,n){
cin >> a[i] >> b[i];
++v[a[i] + b[i]];
}
REP(i,400000){
REP(j, 30){
if(!j)continue;
if(v[i] <= 1)break;
if(v[i] & (1<<j))
que.emplace(i + j);
}
v[i] %= 2;
}
while(!que.empty()){
ll i = que.front();
que.pop();
v[i]++;
REP(j, 30){
if(!j)continue;
if(v[i] <= 1)break;
if(v[i] & (1<<j))
que.emplace(i + j);
}
v[i] %= 2;
}
REP(i,400000){
if(v[i])
cout << i << " " << 0 << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int a[200100];
int main(){
int n,x,y;
cin>>n;
for(int i=0;i<n;i++){
cin>>x>>y;
a[x+y]++;
}
for(int i=0;i<200100;i++)
if(a[i]>1){
a[i+1]+=a[i]/2;
a[i]=a[i]%2?1:0;
}
for(int i=0;i<200100;i++)
if(a[i])cout<<i<<' '<<0<<endl;
}
|
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>
#include<iomanip>
#include<iterator>
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define rep(i,n) for(int i=0; i<n; i++)
#define FOR(i,a,n) for(int i=a; i<n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, char> plc;
int N;
priority_queue<int,vector<int>,greater<int> > pq;
int main()
{
cin >> N;
rep(i, N) {
int a, b;
cin >> a >> b;
pq.push(a + b);
}
while (!pq.empty()) {
if (pq.size() <= 1) {
cout << pq.top() << " " << 0 << endl;
break;
}
int a = pq.top(); pq.pop();
int b = pq.top(); pq.pop();
if (a == b)pq.push(a + 1);
else {
cout << a << " " << 0 << endl;
pq.push(b);
}
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.