磨刀不误砍材工
输入:
预先不输入数据的组数-读到文件的结尾
C语言
while(scanf("%d%d",&a,&b)!=EOF){ preint("%d\n",a+b); }
C++
while(cin>>a>>b){ cout<<a+b<<endl; }
Java
Scanner scanner=new Scanner(System.in); while(scanner.hasNextInt()){ int a=scanner.nextInt(); int b=scanner.nextInt(); System.out.println(a+b); }
预先知道数据组数-读数据组数后循环
C语言
scanf("%d",&n); for(int i=0;i<n;i++){ int a,b; scanf("%d%d",&a,&b); printf("%d\n",a+b); }
C++
cin>>n; for(int i=0;i<n;i++){ int a,b; cin>>a>>b; cout<<a+b<<endl; }
Java
Scanner scanner=new Scanner(System.in); int n=scanner.nextInt(); for(int i=0;i<n;i++){ int a=scanner.nextInt(); int b=scanner.nextInt(); System.out.println(a+b); }
输出
不要输出case数
C语言
scanf("%d",&n); for(int i=0;i<n;i++){ int a,b; scanf("%d%d",&a,&b); printf("%d\n",a+b); }
C++
cin>>n; for(int i=0;i<n;i++){ int a,b; cin>>a>>b; cout<<a+b<<endl; }
Java
Scanner scanner=new Scanner(System.in); int n=scanner.nextInt(); for(int i=0;i<n;i++){ int a=scanner.nextInt(); int b=scanner.nextInt(); System.out.println(a+b); }
要输出Case数
C语言
scanf("%d",&n); for(int i=0;i<n;i++){ int a,b; scanf("%d%d",&a,&b); printf("Case %d %d\n",i+1,a+b) }
C++
cin>>n; for(int i=0;i<n;i++){ int a,b; cin>>a>>b; cout<<"Case "<<i+1<<a+b<<endl; }
Java
Scanner scanner=new Scanner(System.in); int n=scanner.nextInt(); for(int i=0;i<n;i++){ int a=scanner.nextInt(); int b=scanner.nextInt(); System.out.println("Case"+(i+1)+""+(a+b)); }
#include <iostream> using namespace std; class Solution { public: void replaceSpace(char *str, int length) { } }; int main() { Solution s; char str[100] = "we are happy."; s.replaceSpace(str, 100); cout << str << endl << "len" << strlen(str) << endl; system("PAUSE"); return 0; }
编辑:孙小北
本文地址: https://www.xiaowangyun.com/wyblog/detail/?id=165
版权归属: www.xiaowangyun.com 转载时请以链接形式注明出处
0 条评论