A:A題地址
題意:對於給定的n,找到最大的k使得10^k<=2^n.
題解:等式兩邊同時取log(10)變成k<=log(10)2^n.
代碼:
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
#include<math.h>
#define NI freopen("in.txt","r",stdin);
#define NO freopen("out.txt","w",stdout);
using namespace std;
typedef long long int ll;
typedef pair<int,int>pa;
const int N=1e5+10;
const int MOD=1e9+7;
const ll INF=1e18;
int read()
{
int x=0;
char ch = getchar();
while('0'>ch||ch>'9')ch=getchar();
while('0'<=ch&&ch<='9')
{
x=(x<<3)+(x<<1)+ch-'0';
ch=getchar();
}
return x;
}
/************************************************************/
int n;
int main()
{
int cas=1;
while(cin>>n)
{
int ans=(int)(log10(2)*n);
printf("Case #%d: %d\n",cas++,ans);
}
}
K:K題地址
題意:一個人有編號1-n雙襪子。每天早上,他從襪子堆中選出編號最小的穿,晚上就丟在洗衣機中,當洗衣機內的襪子數==n-1時,洗衣機工作,明天晚上襪子重新放到襪子堆中,問第k天他會穿哪雙襪子?
題解:
隨便寫一下就會看出規律。例如當n==5時
1234
5123
4123
5123
4123
5123
4123。
注意n==2.
代碼:
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
#define NI freopen("in.txt","r",stdin);
#define NO freopen("out.txt","w",stdout);
using namespace std;
typedef long long int ll;
typedef pair<int,int>pa;
const int N=1e5+10;
const int MOD=1e9+7;
const ll INF=1e18;
int read()
{
int x=0;
char ch = getchar();
while('0'>ch||ch>'9')ch=getchar();
while('0'<=ch&&ch<='9')
{
x=(x<<3)+(x<<1)+ch-'0';
ch=getchar();
}
return x;
}
/************************************************************/
ll n,k;
int main()
{
int cas=1;
while(cin>>n>>k)
{
ll ans;
if(k<=n-1) ans=k;
else if(n==2) ans=k%2==1?1:2;
else
{
k-=(n-1);
ans=k%(n-1);
if(ans==1)
{
if((k/(n-1))%2==1)
ans=n-1;
else
ans=n;
}
else if(ans==0)
ans=n-2;
else
ans--;
}
printf("Case #%d: %I64d\n",cas++,ans);
}
}