##B-数数
#include<bits/stdc++.h>
using namespace std;
int num(int n){
int count=2;
for(int i=2;i<=sqrt(n);i++)
if(n%i==0)
if(i==sqrt(n) && n/i==i) count++;
else count+=2;
return count;
}
int main(){
int n,t;cin>>t;
while(t--){
cin>>n;int cnt=0;
if(n==1){
cout<<"1"<<endl;
continue;
}
for(int i=1;i<=n;i++){
int z=num(i);
if(z%2==1) cnt++;
}
cout<<cnt+1<<endl;
}
}
C-操作数组
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[1000001],b[1000001];
int main()
{
ll n;cin>>n;
for(ll i=1;i<=n;i++) cin>>a[i];
for(ll i=1;i<=n;i++) cin>>b[i];
ll x=0,y=0;
for(ll i=1;i<=n;i++)
{
if(a[i]-b[i]<0) x+=a[i]-b[i];
else y+=a[i]-b[i];
}
if(y==abs(x)) cout<<y;
else cout<<-1;
return 0;
}