Yandexでの夏のインターンシップのテスト割り当てに合格した方法

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Locale; import java.util.StringTokenizer; public class Main { public static void main(String[] args)throws IOException { Locale.setDefault(Locale.US);//     (0.3333,  0,333) String line; BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); //Buffered Reader     Scanner,      ,      StringTokenizer tk;//       int n = Integer.parseInt(br.readLine()); int arr[] = new int[n]; int total = 0; for(int i = 0; i< n;++i) { line = br.readLine(); tk = new StringTokenizer(line); int a = Integer.parseInt(tk.nextToken()); int b = Integer.parseInt(tk.nextToken()); arr[i] = (a*b); total += arr[i]; } for(int i = 0; i< n;++i) { System.out.printf("%.12f\n", (double)arr[i]/ total); } } }
      
      

        
        
        
      

    
        
        
        
      
      

        
        
        
      

    
     

 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class p2 { public static void main(String[] args) throws IOException { String line; BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer tk; long unixTime = System.currentTimeMillis() / 1000L; System.out.println(unixTime); int n = Integer.parseInt(br.readLine()); for (int i = 0; i < n; ++i) { line = br.readLine(); tk = new StringTokenizer(line, " :"); String cmd = tk.nextToken(); if (cmd.compareTo("APPOINT") == 0) { int day = Integer.parseInt(tk.nextToken()); int hour = Integer.parseInt(tk.nextToken()); int minute = Integer.parseInt(tk.nextToken()); int duration = Integer.parseInt(tk.nextToken()); int peopleN = Integer.parseInt(tk.nextToken()); String people[] = new String[peopleN]; for (int j = 0; j < peopleN; ++j) { people[j] = tk.nextToken(); } int start = (hour * 60) + minute; int end = start + duration; } } } }
      
      

        
        
        
      

    
        
        
        
      
      

        
        
        
      

    
     

• 卒業証書-最初の文字を入力すると、システムは卒業証書の修了を受け入れますが、適合しません。
• 仕事-最初と2番目の文字を入力した後、システムは何も提供しません。 テキストには現在のプレフィックスで始まる2つの異なる単語がありますが、3番目の文字を入力した後は1つの単語のみが残ります（提案されたオートコンプリートを受け入れる必要があります）。
• 違い-オートコンプリートを使用したオプションは、3番目の文字を入力した後にのみ表示されますが、今回は提案されたオプションは受け入れられません。

 #include <iostream> #include <set> using namespace std; int main() { set<string> myset; string in; int n; cin >> n; int count = 0; for(int i = 0;i<n;++i) { cin>>in; if(myset.empty()) { count += in.length(); myset.insert(in); } else if(myset.find(in) != myset.end()) { //if a word is in set //check if other words in set contain similar chars //count += the greatest common subsequence int max = 0; for(auto e: myset) { int temp = 0; //case when entered sequence is less than element in set if(e == in) { ++count; } if(e.length() > in.length()) { for(int j = 0; j< in.length(); ++j) { if(e[j] == in[j]) { ++temp; } else { break; } } if(temp > max) { max = temp; } } else if(e.length() <= in.length() && e != in) { for(int j = 0; j< e.length(); ++j) { if(e[j] == in[j]) { ++temp; } else { break; } } if(temp > max) { max = temp; } } } count += max; } else if(myset.find(in) == myset.end()) { //case when entered word is not in the set count += in.length(); myset.insert(in); } } cout << count<<endl; return 0; }
      
      

        
        
        
      

    
        
        
        
      
      

        
        
        
      

    
     

 #include<iostream> #include<set> using namespace std; int main() { int people; cin >>people; int pairs; cin >> pairs; set<int> initial; set<int> teamA; set<int> teamB; int a; int b; if(pairs == 0) { cout<<"-1"<<endl; } else { //fill set with people for(int i = 1;i<=people;++i) { initial.insert(i); } for(int i = 0;i<pairs;++i) { cin >> a; cin >> b; // case when a and b aren't in teamB if(initial.find(a) != initial.end() && initial.find(a) != initial.end() && !teamA.empty()) { teamB.insert(a); teamB.insert(b); initial.erase(a); initial.erase(b); } else if(teamB.find(a) == teamB.end() && teamB.find(b) == teamB.end()) { teamA.insert(a); teamA.insert(b); initial.erase(a); initial.erase(b); } else if ((teamA.find(a) != teamA.end() && teamB.find(b) != teamB.end()) or (teamA.find(b) != teamA.end() && teamB.find(a) != teamB.end())) { for(auto e: teamB) { teamA.insert(e); teamB.erase(e); } } } } cout <<"teamA"<< endl; for( auto e: teamA) { cout << e<<" "; } cout <<endl<<"teamB"<< endl; for( auto e: teamB) { cout << e<<" "; } cout << endl; return 0; }
      
      

        
        
        
      

    
        
        
        
      
      

        
        
        
      

    
     

 #include<iostream> using namespace std; int main() { int bks; cin >> bks; int lib; cin >> lib; int day; cin >> day; int total = bks + lib; int count = 0; int read = 0; while(true) { ++count; ++read; if(day>=1 && day <= 5) { total -= read; if(total == 0) { break; } else { total += bks; } } else if(day == 6) { total -= read; if(total == 0) { break; } } else if(day == 7) { total -= read; if(total == 0) { break; } day = 0; } ++day; } cout << count; return 0; }
      
      

        
        
        
      

    
        
        
        
      
      

        
        
        
      

    
     

 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class p6 { public static void main(String[] args)throws IOException { String line; BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer tk; int n = Integer.parseInt(br.readLine()); int a[] = new int[n]; int b[] = new int[n]; tk = new StringTokenizer(br.readLine()); int aSum = 0; for(int i = 0;i<n;++i) { a[i] = Integer.parseInt(tk.nextToken()); aSum += a[i]; } int bSum = 0; for(int i = 0;i<n;++i) { b[i] = Integer.parseInt(tk.nextToken()); bSum += b[i]; } } }