标签:
| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 27268 | Accepted: 16933 |
Description
Input
Output
Sample Input
2 5 100
Sample Output
2 10
Source
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
bool a[105];
int T,n;
//freopen("data/1218.txt","r",stdin);
cin>>T;
while(T--)
{
cin>>n;
memset(a,true,sizeof(a));
for(int i=2;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(j%i==0)
a[j]=!a[j];
}
}
int ans=0;
for(int i=1;i<=n;i++)
if(a[i])
ans++;
cout<<ans<<endl;
}
return 0;
}
#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
int main()
{
int T,n;
//freopen("data/1218.txt","r",stdin);
cin>>T;
while(T--)
{
cin>>n;
int ans=0;
for(int i=1;i*i<=n;i++)
ans++;
cout<<ans<<endl;
}
return 0;
}
#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
int main()
{
int T,n;
//freopen("data/1218.txt","r",stdin);
cin>>T;
while(T--)
{
cin>>n;
int ans=(int)sqrt(n*1.0);
cout<<ans<<endl;
}
return 0;
}
HDU 1218 THE DRUNK JAILER【类开灯问题】
标签:
原文地址:http://blog.csdn.net/hurmishine/article/details/52204676