| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
测试数据了没错啊,为什么OJ老是WA??? 1207#include<iostream>
#include<vector>
#include<utility>
#include<algorithm>
using namespace std;
int cycle(int N)
{
int n=N,cyl=1;
while(n>1)
{
if(n%2==0)
n=n/2;
else
n=3*n+1;
cyl++;
}
return cyl;
}
int MaxOne(pair<int,int> tmp)
{
int max=0;
for(int i=tmp.first;i<tmp.second;i++)
{
if(cycle(i)>max)
max=cycle(i);
}
return max;
}
int main()
{
int a,b;
vector< pair<int,int> > pairs;
while(cin>>a>>b)
{
pairs.push_back(make_pair(a,b));
cout<<endl;
}
vector<int> each(pairs.size(),0);
for(int i=0;i<pairs.size();i++)
{
each[i]=MaxOne(pairs[i]);
}
for(int i=0;i<pairs.size();i++)
{
cout<<pairs[i].first<<" "<<pairs[i].second<<" "
<<each[i]<<endl;
}
return 0;
}
是输入输出有问题吗?
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator