1 solutions
-
0
C++ :
#include<iostream> #include<cstdio> using namespace std; int main() { int a[10010]; int n,temp,ans=0; cin>>n; for(int i=1;i<=n;++i) cin>>a[i]; for(int i=1;i<=n;++i) for(int j=1;j<=n-i;++j) if(a[j]>a[j+1]) { temp=a[j]; a[j]=a[j+1]; a[j+1]=temp; ans++; } cout<<ans; return 0; }Pascal :
var n,ans,i,j,t:longint; a:array[0..100000]of longint; begin read(n); ans:=0; for i:=1 to n do read(a[i]); for i:=1 to n-1 do for j:=i+1 to n do if a[i]>a[j]then begin t:=a[i];a[i]:=a[j];a[j]:=t;inc(ans);end; writeln(ans); end.
- 1
Information
- ID
- 16741
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By