Submission #1197343


Source Code Expand

#include<bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define PP pop_back()
#define set(x,y) memset(x,y,sizeof(x))
#define MIN3(x,y,z) min(min(x,y),z)
#define MAX3(x,y,z) max(max(x,y),z)
#define ALL(x) x.begin(),x.end()
#define sz(x) (int) x.size()
#define sag node*2+1
#define sol node*2
#define FOR(i,j,k) for(int i=j;i<=k;i++)
#define ROF(i,j,k) for(int i=j;i>=k;i--)
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define ii pair<int,int>
#define pll pair<ll,ll>
#define st first
#define nd second
#define ll long long
#define llu long long unsigned
#define lf double
#define orta (bas+son)/2
#define MOD 1000000007
#define inf 200000000000001
#define N 100005
using namespace std;

int ans,n,a[N],b[N];

int main() {

  scanf("%d",&n);
  FOR(i,1,n) {
    scanf("%d",&a[i]);
  }
  FOR(i,1,n) {
    ans+=(a[a[i]]==i);
  }
  printf("%d",ans/2);

}

Submission Info

Submission Time
Task B - Friendly Rabbits
User hamzqq9
Language C++14 (GCC 5.4.1)
Score 200
Code Size 959 Byte
Status AC
Exec Time 11 ms
Memory 640 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:33:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
                 ^
./Main.cpp:35:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&a[i]);
                      ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 15
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 11 ms 640 KB
1_02.txt AC 11 ms 640 KB
1_03.txt AC 11 ms 640 KB
1_04.txt AC 11 ms 640 KB
1_05.txt AC 11 ms 640 KB
1_06.txt AC 11 ms 640 KB
1_07.txt AC 11 ms 640 KB
1_08.txt AC 5 ms 384 KB
1_09.txt AC 9 ms 512 KB
1_10.txt AC 8 ms 512 KB
1_11.txt AC 3 ms 256 KB