text stringlengths 49 983k |
|---|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5+5;
int a[N];
int main(){
//freopen("in.txt","r",stdin);
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
int res = 0;
for(int i=1;i<=n;i++){
if(a[i]==i){
swap(a[i],a[i+1]);
res++;
}
}
cout<<res;
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
bool swapped= false;
int ans = 0;
for (int i = 1; i <= N; i++) {
int tmp;
cin >> tmp;
if (tmp == i && !swapped)
{
ans++;
swapped = true;
}
else swapped = false;
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int main(){
int n,ans=0;
cin>>n;
vector<int> a(n+1);
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++){
if(a[i]==i){
swap(a[i],a[i+1]);
ans++;
}
}
cout<<ans<<endl;
return 0;
}
|
#include<iostream>
#include<vector>
int main(){
int N; std::cin >> N;
std::vector<int> v(N);
for(auto i=0; i<N; ++i){
std::cin >> v[i];
}
auto r = 0;
for(auto i=0; i<N-1; ++i){
if(v[i] == i+1){
std::swap(v[i], v[i+1]);
++r;
}
}
if(v[N-1] == N)
++r;
std::cout << r << '\n';
}
|
#include <iostream>
using namespace std;
int a[100001],n,m=0,tot=0,i;
void search(int j)
{
if(a[j]==j)
{
m++;
search(j+1);
}
else
{
i=j;
}
}
int main()
{
cin>>n;
for(i=1;i<=n;i++) cin>>a[i];
for(i=1;i<=n;i++)
{
int ans;
search(i);
if(m%2==1) tot+=(m+1)/2;
else tot+=m/2;
m=0;
}
cout<<tot;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int count = 0;
int after,point;
for(int i=1;i<=n;i++){
cin >> point;
if(point==i){
count++;
if(i<n){
cin >> point;
i++;
}
}
}
cout << count << endl;
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
int a[1000000];
ll ans = 0;
cin >> a[0];
for (int i = 0;i < n - 1;i++) {
cin >> a[i + 1];
if (a[i] == i + 1) {
swap(a[i + 1], a[i]);
ans++;
}
}
if (a[n - 1] == n) ans++;
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[100010] = {};
for(int i = 1; i <= N; i++){
int j;
cin >> j;
if(i == j){
A[i] = A[i-1] + 1;
}
}
int ans = 0;
for(int i = 1; i <= N; i++){
if(A[i+1] == 0){
ans += (A[i]+1)/2;
}
}
cout << ans << endl;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int n,i,p[100010],ans=0;
cin >> n;
for (i=0;i<n;i++) cin >> p[i];
for (i=0;i<n-1;i++) if (p[i]==i+1){
swap(p[i],p[i+1]);
ans++;
}
if (p[n-1]==n) ans++;
cout << ans << endl;
return 0;
} |
#include<stdio.h>
int a[100002];
int main(){
int n,ans=0,t;
scanf("%d",&n);
for(int i = 1;i <= n;i++)
scanf("%d",&a[i]);
for(int i = 1;i <= n;i++){
if(a[i]==i){
t=a[i];a[i]=a[i+1];a[i+1]=t;
ans++;
}
}
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int arr[100005];
int n;
int main()
{
cin >> n;
for(int i=0;i<n;i++)
{
cin >> arr[i];
}
int ans=0;
for(int i=0;i<n-1;i++)
{
if(arr[i]==i+1)
{
ans++;
swap(arr[i],arr[i+1]);
}
}
if(arr[n-1]==n)
ans++;
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans=0;
cin >> n;
int p[n];
for(int i=0; i<n; i++)
cin >> p[i];
for(int i=0; i<n; i++)
if(p[i]==i+1){
ans++;
i++;
}
cout << ans;
return 0;
} |
#include <iostream>
using namespace std;
int main() {
int n,p,c=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>p;
if(p==i){
c++;
i++;
cin>>p;
}
}
cout<<c<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, ans = 0, a = 0;
cin >> N;
int p[N];
for(int i=0; i<N; i++){
cin >> p[i];
if(p[i] == i+1){
a++;
}else{
ans += (a+1)/2;
a = 0;
}
}
ans += (a+1)/2;
cout << ans << endl;
return 0;
} |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
int count = 0;
cin >> n;
vector<int> v(n);
for(int i=0; i<n; i++){
cin >> v[i];
}
for(int i=0; i<n; i++){
if(v[i] == i + 1) {
if(i != n-1) {
swap(v[i], v[i+1]);
}
count++;
}
}
cout << count;
}
|
#include <bits/stdc++.h>
int main() {
int64_t n;
std::cin >> n;
std::vector<int64_t> p(n);
for (auto &i : p) {
std::cin >> i;
}
int64_t count = 0;
for (int64_t i = 0; i < n; i++) {
if (p[i] == i + 1) {
count++;
i++;
}
}
std::cout << count << std::endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int num, i, a, ans = 0;
cin >> num;
for (i = 1; i <= num; i++) {
scanf("%d", &a);
if (a == i) {
ans++;
if (i < num) {
scanf("%d", &a);
i++;
}
}
}
printf("%d\n", ans);
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int ret = 0, trail = 0;
for (int i = 1;i <= N; i++) {
int a;
cin >> a;
if (a == i) {
trail++;
} else {
ret += ++trail / 2;
trail = 0;
}
}
ret += ++trail / 2;
cout << ret << endl;
}; |
#include<iostream>
using namespace std;
int main() {
int n, a, b[100001]{ 0 };
cin >> n;
for (int i = 0; i<n; i++) {
cin >> a;
if (a == i + 1)b[i] = 1;
}
int cnt = 0;
for (int i = 0; i < n;) {
if (b[i]) {
cnt++;
i += 2;
}
else i++;
}
cout << cnt << 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 j = 0; j < n; j++){
if(a[j] == j+1){
swap(a[j], a[j+1]);
count++;
}
}
cout << count << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int p[n];
for(int i=0;i<n;i++) cin>>p[i];
int ans=0;
for(int i=0;i<n;i++){
if(i+1==p[i] && i!=n-1) swap(p[i],p[i+1]),ans++;
if(i==n-1 &&p[i]==n) ans++;
}
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans,i;
cin >> n;
int sw;
vector<int> p(n);
for(i=0;i<n;++i){
cin >> p[i];
}
ans=0;
for(i=0;i<n;++i){
if(p[i]==(i+1)){
sw=p[i];
p[i]=p[i+1];
p[i+1]=sw;
ans++;
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;cin>>n;
vector<int> a(n);
for(int i = 0; n > i; i++){
cin>>a[i];
}
int ret = 0;
for(int i = 0; n-1 > i; i++){
if(a[i]==i+1){
swap(a[i],a[i+1]);
ret++;
}
}
if(a[n-1] == n)ret++;
cout << ret << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int N,j=0,k=0;
cin>>N;
for(int i=1;i<=N;i++){
int p;
cin>>p;
if(i==p)
k++;
else if(k>0){
j+=(k+1)/2;
k=0;
}
}
j+=(k+1)/2;
cout<<j<<endl;
} |
#include <iostream>
using namespace std;
int p[100010];
int main () {
int n;
cin >> n;
for (int i = 1; i <= n; i ++) {
cin >> p[i];
}
int br = 0;
for (int i = 1; i <= n; i ++) {
if (p[i]==i) {swap(p[i],p[i+1]); br++;}
}
cout << br;
return 0;
}
|
#include <cstdio>
int n, s, a;
int main() {
scanf("%d", &n);
for(int i=1; i<=n; i++) {
scanf("%d", &a);
if(a==i) {
s++;
scanf("%*d"), i++;
}
}
printf("%d", s);
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,a,n) for (int i = a;i < n;i++)
using namespace std;
int main() {
int n, ans=0; cin >> n;
int a[n];
rep(i,1,n+1){
cin >> a[i];
}
rep(i, 1, n+1) {
if(a[i] == i){
swap(a[i],a[i+1]);
ans++;
}
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
vector<bool> sam(N+1, 0);
for(int i = 0; i < N; i++){
int a; cin >> a;
a--;
if(i == a) sam[i] = 1;
}
int ans = 0;
for(int i = 0; i < N; i++){
if(sam[i] == 1){
ans++;
sam[i+1] = 0;
}
}
cout << ans;
} |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<map>
using namespace std;
int main() {
int n,p[100000]={},ans=0;
cin >> n;
for(int i=0; i<n; i++) {
cin >> p[i];
}
for(int i=0; i<n; i++) {
if(p[i]==i+1) {
ans++,i++;
}
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
long long x[100003];
int main()
{
long long i,n,z=0;
cin>>n;
for(i=1;i<=n;++i)
{
cin>>x[i];
}
for(i=1;i<=n;++i)
{
if(x[i]==i)
{
swap(x[i],x[i+1]);
z++;
}
}
cout<<z<<endl;
} |
#include<iostream>
using namespace std;
long int d[100000];
void swap(int a,int b)
{int t;t=d[a];d[a]=d[b];d[b]=t;}
int main()
{
long int n,ans=0,i;
cin>>n;
for(i=0;i<n;i++)cin>>d[i];
for(i=0;i<n;i++)
{
if(d[i]==i+1)
{
ans++;
if(i==n-1)swap(i,i-1);
else swap(i,i+1);
}
}
cout<<ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) cin >> p[i];
int ans = 0;
for (int i = 0; i < n - 1; i++) {
if (p[i] == i + 1) {
swap(p[i], p[i + 1]);
ans++;
}
}
if (p[n - 1] == n) ans++;
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<int> p (n);
for(int i = 0;i<n;i++)cin >> p[i];
int ans = 0;
for(int i = 0;i<n;i++)if(p[i]==i+1)
{
ans++;i++;
//cout<<p[i]<<endl;
}
cout<<ans<<endl;
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
int p,res = 0;
int prev = -2;
for (int i = 0; i < N; ++i) {
cin >> p;
if (((i+1)-p) == 0) {
if (i != prev+1) {
++res;
prev = i;
}
else {
prev = -2;
}
}
}
cout << res << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int a[100005]={0};
int main()
{
int i,n,sum=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=n;i++)
if(a[i]==i&&a[i+1]==i+1)
{
sum++;
i++;
}
else if(a[i]==i&&a[i+1]!=i+1)
sum++;
printf("%d",sum);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, k=0;
cin >> N;
int p[N];
for(int i=0;i!=N;i++)
{
cin >> p[i];
}
for(int i=0; i!=N; i++)
{
if(p[i] == i+1){swap(p[i], p[i+1]); k++;}
}
cout << k <<endl;
} |
#include <bits/stdc++.h>
#include <assert.h>
#include <numeric>
using namespace std;
int p[100000];
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> p[i];
int ans = 0;
for (int i = 0; i < n; i++)
if (p[i] == i + 1)
{
swap(p[i], p[i + 1]);
ans++;
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int p[100005];
int main(void){
int N; cin>>N;
for(int i=0;i<N;i++){
cin>>p[i];
}
int ans=0;
for(int i=0;i<N;i++){
if(p[i]==i+1){
ans++; i++;
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(){
int N;
cin >> N;
int P[N];
rep(i,N) cin >> P[i];
int count = 0;
rep(i,N){
if(P[i]==i+1){
count++;
i++;
}
}
cout << count;
return 0;
} |
#include<iostream>
using namespace std;
int n,a[100005],k=0;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n;i++)
{
if(a[i]==i)
{
swap(a[i],a[i+1]);
k++;
}
}
cout<<k;
return 0;
} |
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
int main() {
int N, cnt = 0;
cin >> N;
vector<int> p(N);
for (auto& i : p) cin >> i;
for (int i = 0; i < N; i++) {
if (p[i] == i + 1) {
swap(p[i], (i == N - 1 ? p[i - 1] : p[i + 1]));
cnt++;
}
}
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, p[100010];
cin >> n;
for (int i = 0; i < n; i++) cin >> p[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
if (p[i] == i + 1) swap(p[i], p[i + 1]), cnt++;
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;cin>>n;
int pn[n];rep(i,n)cin>>pn[i];
int cnt=0;
rep(i,n-1) {
if (pn[i]==i+1) {
cnt++;
swap(pn[i], pn[i+1]);
}
}
if (pn[n-1]==n) cnt++;
cout << cnt;
}
|
#include<iostream>
using namespace std;
int p[100001];
int main(){
int n;
cin >> n;
int ans=0;
int cont=0;
for(int i=1;i<=n;i++){
cin >> p[i];
if(p[i]==i) cont++;
if(p[i]!=i || i==n) {
ans+=cont/2+cont%2;
cont=0;
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int n,p[100000],count=0;
cin >> n;
for (int i = 0; i < n; i++)cin >> p[i];
for (int i = 0; i < n; i++) {
if (i+1 == p[i]) {
swap(p[i], p[i + 1]);
count++;
}
}
cout << count << endl;
int x;
cin >> x;
return 0;
}
|
#include <stdio.h>
int main(void) {
int i, n, ans = 0, p;
bool b = true;
scanf("%d", &n);
for(i = 0; i < n; ++i) {
scanf("%d", &p);
if(p == i + 1 && b) ans++, b = false;
else b = true;
}
printf("%d", ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,ans=0; cin>>n;
int num[n];
bool flag = true;
for(int i=0;i<n;i++){
cin>>num[i];
if(i+1==num[i]){
ans++;
if(i!=n-1){
cin>>num[i+1];
i++;
}
}
}
cout<<ans<<endl;
} |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++) cin >> P[i];
int ans = 0;
for (int i = 0; i < N; i++) {
if (P[i] == i + 1) {
ans++;
i++;
}
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int i, N, b, cnt=0; cin>>N;
vector<int> a(N);
for(i=0; i<N; i++) cin>>a[i];
for(i=0; i<N-1; i++){
if(i+1==a[i]){
b=a[i+1];
a[i+1]=a[i];
a[i]=b;
cnt++;
}
}
if(N==a[N-1])cnt++;
cout<<cnt<<endl;
return 0;
} |
#include <iostream>
using namespace std;
int main(void){
int n,a,w=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a;
if(a==i){
w++;
i++;
cin>>a;
}
}
cout<<w<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> p(N);
for (int i=0;i<N;i++){
cin >> p[i];
}
int count=0;
for (int i=0;i<N;i++){
if (p[i]==i+1){
count++;
if (i!=N-1&&p[i+1]==i+2){
i++;
}
}
}
cout << count << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >>N;
vector<int> p(N+2);
for (int i=1; i<=N; i++)
cin >>p.at(i);
int S=0;
for (int i=1; i<=N; i++) {
if (i==p.at(i)) {
S++;
swap(p.at(i), p.at(i+1));
}
}
cout <<S <<endl;
return 0;
};
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int a[100010];
int main()
{
int n;
cin >> n;
for(int i=1;i<=n;i++) cin>>a[i];
int ans = 0;
for(int i=1;i<=n;i++){
if(a[i]==i) ans++,i++;
}
cout<<ans<<'\n';
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
int main() {
int N ;
cin >> N ;
int A[N] ;
rep(i,N) cin >> A[i] ;
int ans = 0 ;
rep(i,N){
if( A[i] == i+1 ){
ans++ ;
if(A[i+1] == i + 2 ) i++ ;
}
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,ans;
ans=0;
cin>>n;
vector<int> vec(n);
for(int i=0; i<n; i++){
cin>>vec.at(i);
}
for(int i=0; i<n-1; i++){
if(i+1==vec.at(i)){
ans=ans+1;
vec.at(i+1)=vec.at(i);
}
}
if(vec.at(n-1)==n){
ans++;
}
cout<<ans;
} |
#include <bits/stdc++.h>
using namespace std;
const int len = 100010;
int n,a[len];
int main() {
ios :: sync_with_stdio(0);
cin >> n;
for (int i=1;i<=n;i++) {
cin >> a[i];
}
int sum = 0;
for (int i=1;i<=n;i++) {
if (a[i] == i) {
swap(a[i],a[i+1]);
sum++;
}
}
cout << sum << endl;
return 0;
} |
#include <iostream>
using namespace std;
int n, a[100010], ans = 0;
bool b[100010];
int main() {
cin >> n;
for(int i = 1; i <= n; ++i) {
cin >> a[i];
if(a[i] == i) b[i] = 1;
}
for(int i = 1; i <= n - 1; ++i)
if(b[i]) ++ans, b[i + 1] = 0;
cout << ans + b[n];
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main () {
int n;
cin >> n;
int a[100005];
for (int i=1;i<=n;i++) cin >> a[i];
int ans=0;
for (int i=1;i<=n;i++) {
if (a[i]==i) {
swap(a[i],a[i+1]);
ans++;
}
}
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
int n,i,f=1,ans;
int main(){
std::cin>>n;
int p[n];
for(;i<n;)std::cin>>p[i],(p[i]==++i&&f)?ans++,f=0:f=1;
std::cout<<ans;
return 0;
} |
#include<iostream>
#include<utility>
using namespace std;
int main(){
long long n, p[100000], cnt=0;
cin>>n;
for(int i=0;i<n;i++) cin>>p[i];
for(int i=0;i<n;i++){
if(i+1==p[i]){
if(i==n-1) cnt++;
else{
swap(p[i], p[i+1]);
cnt++;
}
}
}
cout<<cnt<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(void){
int num=0;
cin>>num;
int count=0;
bool before=false;
for(int i=1;i<=num;i++){
int a=0;
cin>>a;
if(a==i){
if(!before){
count++;
before=true;
}else{
before=false;
}
}else{
before=false;
}
}
cout<<count<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1LL<<62
ll n, a[100010];
int main() {
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
ll ans=0;
for(int i=1;i<100002;i++){
if(a[i]==i){
swap(a[i],a[i+1]);
ans++;
}
}
cout<<ans;
} |
#include <iostream>
using namespace std;
int main(void){
// Your code here!
int n,t=0,w=0;
cin>>n;
for(int i=0;i<n;i++){
int a;
cin>>a;
if(a==i+1){
w++;
}
if(a!=i+1 || i==n-1){
t+=(w+1)/2;
w=0;
}
}
cout<<t<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> p(N);
for(int i=0;i<N;++i){
cin>>p[i];
}
int64_t cnt=0;
int i=0;
while(i<N-1){
if(p[i]==i+1){
swap(p[i],p[i+1]);
++cnt;
}
++i;
}
if(p[N-1]==N) ++cnt;
cout<<cnt<<endl;
}
|
#include<cstdio>
int main(){
int n;
scanf("%d",&n);
int a[n];
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
int x=0;
int y=0;
for(int i=0;i<n;i++){
if(a[i]==i+1){
y++;
}
else{
x=x+(y+1)/2;
y=0;
}
}
x=x+(y+1)/2;
printf("%d",x);
return 0;
} |
#include <iostream>
using namespace std;
int main() {
int N, p[100000], ans{};
cin >> N;
cin >> p[0];
for (int i = 1; i != N; ++i) {
cin >> p[i];
if (p[i-1] == i) {
swap(p[i-1],p[i]);
++ans;
}
}
if (p[N-1] == N) ++ans;
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n, sum=0;
cin>>n;
int a[n];
for(int i=0; i<n; i++)
{
cin>>a[i];
}
for(int i=0; i<n; i++)
{
if(a[i]==i+1)
{
sum++;
i++;
}
}
cout<<sum;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,ans=0,x;
cin >> n;
long long a[n];
for(int i=0;i<n;i++){
cin >> a[i];
if(a[i]==i+1&&x!=i-1){
ans++;
x=i;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n;
cin>>n;
int p[100001]={0};
int ans=0;
for (int i=1; i<=n; i++) {
cin>>p[i];
}
for (int i=1; i<=n; i++) {
if(p[i]==i){
swap(p[i], p[i+1]);
ans++;
}
}
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 2e5 + 10;
int main()
{
int n; cin>>n;
int a[MAX]; int ans=0;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++){
if(a[i] == i+1){
swap(a[i],a[i+1]); ans++;
}
}
cout<<ans;
}
// abcab |
#include <bits/stdc++.h>
#define r(i,n) for(long long i = 0; i<n; i++)
typedef long long ll;
using namespace std;
int main() {
int n,ans=0;
cin >> n;
int a[n];
r(i,n)cin>>a[i];
r(i,n-1){
if(a[i]==i+1){
swap(a[i],a[i+1]);
ans++;
}
}
if(a[n-1]==n)ans++;
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,ans=0,cnt=0;
cin>>N;
vector<int> V(N,0);
for(int i=0;i<N;i++){
cin>>A;
if(i+1==A)
cnt++;
else
ans+=(cnt+1)/2,cnt=0;
}
ans+=(cnt+1)/2;
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main() {
int n;
cin >> n;
vector<int> p(n + 1);
for (int i = 0; i < n; i++) cin >> p[i];
int ans = 0;
for (int i = 1; i <= n; i++) {
if (i == p[i - 1]) {
if (i + 1 == p[i]) i++;
ans++;
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
a.emplace_back(0);
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] == i + 1) {
ans++;
swap(a[i], a[i + 1]);
}
}
cout << ans << endl;
return 0;
} |
#include <cstdio>
#include <algorithm>
#define MAXN (int)(1e5+105)
using namespace std;
int a[MAXN];
int main() {
int n, cnt = 0;
scanf("%d", &n);
for(int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for(int i = 1; i <= n; i++) {
if(a[i] == i) {
swap(a[i], a[i+1]);
cnt ++;
}
}
printf("%d\n", cnt);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a;
b=0;
vector<int>vec(a);
for(int i=0;i<a;i++){
cin>>vec.at(i);
}
for(int j=0;j<a-1;j++){
if(vec.at(j)==j+1){
swap(vec.at(j),vec.at(j+1));
b++;
}
}
if(vec.at(a-1)==a){
b++;
}
cout<<b<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
int p[n];
for(int i=0;i<n;i++) cin>>p[i];
int c=0;
for(int i=0;i<n-1;i++){
if(p[i]==i+1){
swap(p[i],p[i+1]);
c++;
}
}
if(p[n-1]==n)c++;
cout<<c<<endl;
} |
#include<stdio.h>
int main()
{
long n,i;
long ct = 0;
long sw =0;
long a[100000];
scanf("%ld", &n);
for (i = 1; i < n + 1; i++) {
scanf("%ld", &a[i]);
if (i == a[i] && sw == 0) {
ct++;
sw++;
}
else {
sw = 0;
}
}
printf("%ld", ct);
return 0;
} |
#include<cstdio>
int main(){
int n, a, ans = 0;
bool t = false;
scanf("%d", &n);
for(int i = 1; i <= n; i++){
scanf("%d", &a);
if(t = a == i && !t) ans++;
}
printf("%d\n", ans);
}
|
#include<iostream>
#include<vector>
#include<map>
using namespace std;
int main(){
int n;
cin >> 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++){
if(i+1==a[i]){
if(i<n-1&&a[i+1]==i+2)a[i+1]=a[i];
ans++;
}
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,cnt=0; cin>>n;
vector<int> a(n+1);
for(int i=1; i<=n; i++) cin>>a[i];
for(int i=1; i<=n; i++){
if(a[i] == i){
cnt++;
if(i != n) swap(a[i],a[i+1]);
}
}
cout<<cnt<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,y=0;
cin>>n;
int a[n],b[n+1];
for(int i=0;i<n;i++){
cin>>a[i];
(i+1==a[i]) ? (b[i]=1):(b[i]=0);
}
b[n]=0;
for(int i=0;i<n;i++){
if(b[i]){
y++;
b[i]=0;
b[i+1]=0;
}
}
cout<<y;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> arr(n);
for(int i=0;i<n;i++){
int x;
cin>>x;
arr[i] = x-1;
}
int ans = 0;
for(int i=0;i<n;i++){
if(arr[i]==i && (i+1)<n && arr[i+1] == i+1){
ans++;
i++;
}
else if(arr[i] == i) ans++;
}
cout<<ans;
} |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> p(N);
for (auto & _p : p)
cin >> _p;
int cnt = 0;
for (int i = 0; i < N; ++i)
{
if (p[i] - 1 == i)
{
++cnt;
++i;
}
}
cout << cnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> p(100009);
for(int i=1;i<=N;i++)cin >> p[i];
int count=0;
for(int i=1;i<=N;i++){
if(p[i]==i){
count++;
if(i<=N-1 && p[i+1]==i+1){i++;}
}
}
cout << count << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p;
for (int i=0; i<n; i++) {
int tmp;
cin >> tmp;
p.push_back(tmp);
}
int cnt=0;
for (int i=0; i<n; i++) {
if(i+1==p[i]) {
cnt++;
i++;
}
}
cout << cnt << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int p[100000];
int main(){
int n;
int cnt=0;
int buf;
cin>>n;
for(int i=0;i<n;i++)
cin>>p[i];
for(int i=0;i<n;i++){
if(p[i]==i+1){
cnt++;
buf=p[i];p[i]=p[i+1];p[i+1]=buf;
}
}
cout<<cnt<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> p(n);
for(int i=0;i<n;i++){
cin >> p[i];
}
int cnt=0;
for(int i=0;i<n-1;i++){
if(p[i]==i+1){
swap(p[i],p[i+1]);
cnt++;
}
}
if(p[n-1]==n){
cnt++;
}
cout << cnt << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main ()
{
int a[100000], n, i, count = 0;
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++)
{
if (a[i] == i)
{
count++;
if (i == n)
swap(a[i], a[i-1]);
else
swap(a[i], a[i+1]);
}
}
cout << count;
} |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main() {
long long N,counter=0;
cin>>N;
long long a[100000];
for (long long i=1; i<=N; i++){
cin>>a[i];}
for (long long i=1; i<=N; i++){
if(a[i]==i){
counter++;
a[i+1]=i;}}
cout<<counter<<endl;}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
ll mod= 1e9 + 7;
int main() {
int n;
cin >>n;
int a[n+1];
int ans=0;
rep(i,n)cin >> a[i];
a[n]=-1;
for(int i=0;i<n;i++){
if(a[i]==i+1){swap(a[i],a[i+1]);ans++;}
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int p[n];
for(int i = 0; i < n; i++){
cin >> p[i];
}
int ans = 0;
for(int i = 0; i < n; i++){
if(p[i] - 1 == i){
swap(p[i], p[i + 1]);
ans++;
}
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
long long n,a[1000000];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
int dem=0;
for(int i=1;i<=n;i++)
{
while (a[i]==i)
{
swap(a[i],a[i+1]);
i=i+1;
dem++;
}
}
cout<<dem;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < n;i++)
using ll = long long;
int main(){
int n; cin >>n;
vector<int> p(n);
rep(i,n) cin >>p[i];
int cnt = 0;
rep(i,n){
if(p[i]==i+1) {
cnt++;
i++;
}
}
cout << cnt << endl;
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n+1, -1);
for(int i=1; i<=n; i++) cin >> a[i];
int ans=0, succ=0;
for(int i=n; i>=0; i--){
if(a[i]==i){
succ++;
}else{
ans += (succ+1)/2;
succ = 0;
}
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<int>p(n);
for(int i=0;i<n;i++) cin>>p[i];
int ans=0;
int posi=0;
while(posi<n){
if(p[posi]==posi+1){
ans++;
posi+=2;
}
else posi++;
}
cout<<ans<<endl;
}
|
#include <iostream>
using namespace std;
int main() {
int N, p, ans = 0, tmp = 0;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> p;
if (p == i + 1) ++tmp;
else {
ans += (tmp + 1) / 2;
tmp = 0;
}
}
ans += (tmp + 1) / 2;
cout << ans;
} |
#include<iostream>
#include<vector>
using namespace std;
int main() {
int n; cin >> n;
vector<int> v(n);
for(int i = 0; i < n; i++) {
cin >> v[i];
v[i]--;
}
v.push_back(n);
int ans = 0;
for(int i = 0; i < n; i++) {
if(v[i]==i) {
swap(v[i],v[i+1]);
ans++;
}
}
cout << ans << endl;
} |
#include<iostream>
#include<vector>
#include<utility>
using namespace std;
int main() {
int n; cin >> n;
vector<int>a(n+5);
for (int i = 0; i < n; i++) {
int tmp; cin >> tmp;
a[i] = tmp;
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] == i + 1)ans++,swap(a[i], a[i + 1]);
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (p[i] == i + 1) {
i++;
ans++;
}
}
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.