We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Project Euler #8: Largest product in a series
Project Euler #8: Largest product in a series
Contest ends in
Sort by
recency
|
205 Discussions
|
Please Login in order to post a comment
import java.io.; import java.util.; import java.text.; import java.math.; import java.util.regex.*;
public class Solution {
}
fuct m lừa bố mày
include
include
using namespace std ; long long arr_anser[1001] ; long long answer(string s, int k){ for(int i = 0 ; i max){ max = product ; } } return max ; } int main(){ int t ; cin >> t ; for(int i = 0 ; i> n>> k ; cin >> s ; arr_anser[i] = answer(s, k) ; } for(int i = 0 ; i
using System; using System.Collections.Generic; using System.IO; using System.Linq;
using System;
class Solution { static void Main(String[] args) { int t = Convert.ToInt32(Console.ReadLine());
}