1 solutions
-
0
C :
#include<stdio.h> int main() { int n,k,a,sn; scanf("%d%d%d",&n,&k,&a); sn=a+(n-1)*k; printf("%d\n",sn); return 0; }C++ :
#include <stdio.h> int n, k, a; int age(int num) { if (num == 1) return a; return k + age(num - 1); } int main() { scanf("%d%d%d", &n, &k, &a); printf("%d\n", age(n)); return 0; }Pascal :
var n,k,a:longint; begin readln(n,k,a); a:=a+(n-1)*k; writeln(a); end.Java :
import java.util.Scanner; public class Main{ private static Scanner s = new Scanner(System.in) ; public static void main(String[] args) { int n = s.nextInt() ; int k = s.nextInt() ; int a = s.nextInt() ; if(n<=100&&k<=100&&a<=100){ System.out.println(a+(n-1)*k); } } }Python :
n, k, a = [int(i) for i in raw_input().split()] print a + (n - 1) * k
- 1
Information
- ID
- 17264
- Time
- 1000ms
- Memory
- 32MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By