#include<cstdio>#include<iostream>#include<cstring>#define CLR(a,v) memset(a,v,sizeof a)usingnamespacestd;
int biao[39]={0};
void init(){
biao[1] = biao[2] = 9;
for(int i = 3; i<= 38; i++){
biao[i] = biao[i-2]*10;
}
}
int ans[40];
void fuck(int n){
int k = n, len = 0;
while(k>biao[len+1]){
k-=biao[++len];
}
len++;
int temp=1;
for(int i = 1; i < (len+1)/2 ; i++)temp*=10;
temp += k-1;
int count = 0;
while(temp){
int a = temp %10;
ans[len/2 + count] = ans[(len-1)/2-count] = a;
temp/=10;
count++;
}
for(int i = 0; i < len; i++)
cout << ans[i];
cout << endl;
}
int main(){
init();
int n;
while(cin >> n && n)fuck(n);
return0;
}
#include<cstdio>#include<iostream>#include<cstring>#define CLR(a,v) memset(a,v,sizeof a)usingnamespacestd;
int biao[39]={0};
void init(){
biao[1] = biao[2] = 9;
for(int i = 3; i<= 38; i++){
biao[i] = biao[i-2]*10;
}
}
int ans[40];
void fuck(int n){
int k = n, len = 0;
while(k>biao[len+1]){
k-=biao[++len];
}
len++;
int temp=1;
for(int i = 1; i < (len+1)/2 ; i++)temp*=10;
temp += k-1;
int count = 0;
while(temp){
int a = temp %10;
ans[len/2 + count] = ans[(len-1)/2-count] = a;
temp/=10;
count++;
}
for(int i = 0; i < len; i++)
cout << ans[i];
cout << endl;
}
int main(){
init();
int n;
while(cin >> n && n)fuck(n);
return0;
}
10791
#include<iostream>#include<cstring>#include<cstdio>#include<cmath>usingnamespacestd;
int main(){
longlong T,t=0;
while(cin >> T && T){
longlong ans = 0;
int flag = 0 ;
for(longlong i = 2 ; i <= sqrt(T)+1; i++){
if(T%i!=0)continue;
flag ++;
int temp = 1;
while(T%i == 0){
temp*=i;
T/=i;
}
ans+=temp;
}
if(flag==0)ans+=T+1;
elseif(flag==1)ans+=T;
elseif(T>1)ans+=T;
printf("Case %lld: %lld\n",++t,ans);
}
return0;
}
UVA
#include<cstdio>#include<iostream>#include<cstring>#include<cmath>usingnamespacestd;
int biao[400000]={0,0,1,1};
int main(){
int n;
cin >> n;
while(n--){
int t;
cin >> t;
int m = (t-1)>>1;
int h = m*(m+1);
if(t&1) h -= m;
cout << h << endl;
}
}