1 条题解
-
0
C :
#include <stdio.h> #include <string.h> int main() { int k,n,i,m; char a[300],b[300],ch; scanf("%d",&n); scanf("%c",&ch); if(ch==13) printf("\n"); gets(a); scanf("%d",&m); for(k=0,i=m-1;i<n;i++) b[k++]=a[i]; b[k]='\0'; puts(b); return 0; }C++ :
#include <stdio.h> #include <string.h> #define N 80 void fun(char a[N],int m) {char *p1,b[N];int i,l; p1=a;i=1;l=0; while(i<m){i++;p1++;} while(*p1!='\0') {b[l]=*p1; p1++; l++; } b[l]='\0'; puts(b); } int main() {char a[N];int m,n; scanf("%d\n",&n); gets(a); scanf("%d",&m); fun(a,m); return 0; }Java :
import java.util.Scanner; public class Main { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub Scanner input = new Scanner(System.in); int n = input.nextInt(); String s = input.next(); int m = input.nextInt(); for(int i = m-1; i < n; i ++){ System.out.print(s.charAt(i)); } } }Python :
n = input() stri = raw_input() m = input() arr = list(stri) cot = "" for i in range(m-1,n): cot += arr[i] print cot
- 1
信息
- ID
- 2032
- 时间
- 1000ms
- 内存
- 128MiB
- 难度
- (无)
- 标签
- (无)
- 递交数
- 0
- 已通过
- 0
- 上传者